DCA for solving the scheduling of lifting vehicle in an automated port container terminal

被引：13

作者：

Le H.M. ^{[1
]}

Yassine A. ^{[1
,2
]}

Moussi R. ^{[1
]}

机构：

[1] Laboratoire de Mathématique Appliquée du Havre, 76600 Le Havre

[2] Institut Supérieur d'Etudes Logistiques (ISEL), Quai Frissard, 76063 Le Havre Cedex

来源：

Computational Management Science | 2012年 / 9卷 / 2期

关键词：

Automated lifting vehicle; Branch and Bound; Container port terminal; DCA; Programmation DC;

D O I：

10.1007/s10287-012-0140-8

中图分类号：

学科分类号：

摘要：

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. © 2012 Springer-Verlag.

引用

页码：273 / 286

页数：13

共 15 条

[1] An L.H.A., Tao D.P., Solving a class of linearly constrained indefinite quadratic problems by DC algorithms, J Global Optimiz, 11, 3, pp. 253-285, (1997)
[2] An L.T.H., Tao P.D., A continuous approach for globally solving linearly constrained quadratic zero-once programming problems, Optimization, 50, pp. 93-120, (2001)
[3] An L.T.H., Tao P.D., DC programming: theory, algorithms and applications, 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), (2002)
[4] An L.T.H., Tao D.P., The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, Ann Oper Res, 133, pp. 23-46, (2005)
[5] An L.T.H., Tao D.P., Muu L.D., Exact penalty in D. C. programming, Vietnam J Math, 27, 2, pp. 169-178, (1999)
[6] Imai A., Nishimura E., Papadimitriou S., The dynamic berth allocation problem for a container port, Transport Res Part B, 35, 4, pp. 401-417, (2001)
[7] Imai A., Sasaki K., Nishimura E., Papadimitriou S., Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks, Er J Oper Res, 171, 2, pp. 373-389, (2006)
[8] Kim K.H., Jong W.B., A look-ahead dispatching method for automated guided vehicles in automated port container terminals, Transp Sci, 38, 2, pp. 224-234, (2004)
[9] Lee D.H., Cao Z., Meng Q., Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm, Int J Product Econom, 107, 1, pp. 115-124, (2007)
[10] Lee L.H., Chew E.P., Tan K.C., Han Y., An optimization model for storage yard management in transshipment hubs, OR Spectrum, 28, 4, pp. 539-556, (2006)

← 1 2 →