DCA for solving the scheduling of lifting vehicle in an automated port container terminal
- 235 Downloads
The container was introduced as a universal carrier for various goods in the 1960s and soon became a standard worldwide transportation. The competitiveness of a container seaport is marked by different success factors, particularly the time in port for ships. Operational problems of container terminals is divided into several problems, such as assignment of vessels, loading/unloading and storage of the containers, quay cranes scheduling cite, planning yard cranes cite and assignment of storage containers cite. In this work, the study will focus on piloting yard trucks. Two different types of vehicles can be used, namely automated guided vehicles (AGVs) and lifting vehicles (LVs). An AGV receives a container from a quay crane and transports containers over fixed path. LVs are capable of lifting a container from the ground by itself. The model that we consider is formulated as a mixed integer programming problem, and the difficulty arises when the number of binary variables increases. There are a lot of algorithms designed for mixed integer programming problem such as Branch and Bound method, cutting plane algorithm, . . . By using an exact penalty technique we treat this problem as a DC program in the context of continuous optimization. Further, we combine the DCA with the classical Branch and Bound method for finding global solutions.
KeywordsAutomated lifting vehicle Container port terminal Programmation DC DCA Branch and Bound
Mathematics Subject Classification (2000)90C26 90C27 90B06
Unable to display preview. Download preview PDF.
- An LTH, Tao PD (2002) DC programming: theory, algorithms and applications. In: The State of the Art (28 pages), Proceedings (containing the refereed contributed papers) of The First International Workshop on Global Constrained Optimization and Constraint Satisfaction (Cocos’ 02), Valbonne-Sophia Antipolis, France, October 2–4Google Scholar
- An LTH, Tao DP, Muu LD (1999) Exact penalty in D. C. programming. Vietnam J Math 27(2): 169–178Google Scholar
- Tao PD (1988) Duality in DC (Difference of convex functions) optimization, subgradient methods, trends in mathematical optimization. Int Ser Number Math Birkhauser 84: 277–293Google Scholar
- Tao PD, An LTH (1997) Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday 22(1):289–355Google Scholar