Single straddle carrier routing problem in port container terminals: Mathematical model and solving approaches

Communications in Computer and Information Science

Volumn 14, Issue , 2008, Pages 21-31

  Ndiaye, Babacar Mbaye ^a   Tao, Pham Dinh ^b   Le Thi, Hoai An ^c  

^a UNIVERSITÉ CHEIKH ANTA DIOP   (Senegal)

^b UNIVERSITÉ ET INSA DE ROUEN   (France)

^c UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Container port; Cutting plane techniques; DC (Difference of Convex Functions) Programming; DCA (DC Algorithm); Nonconvex optimization Global optimization; Straddle carrier; Vehicle Routing

Indexed keywords

CONTAINER PORTS; CUTTING PLANE TECHNIQUES; DC ALGORITHM; DC PROGRAMMING; NONCONVEX OPTIMIZATION-GLOBAL OPTIMIZATION; STRADDLE CARRIERS;

ALGORITHMS; FUNCTIONS; GLOBAL OPTIMIZATION; INFORMATION SYSTEMS; MANAGEMENT SCIENCE; MATHEMATICAL MODELS; OPTIMIZATION; PORTS AND HARBORS; VEHICLE ROUTING;

CONTAINERS;

EID: 70449384775     PISSN: 18650929     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-87477-5_3     Document Type: Conference Paper

References (17)

1. Preston, P., Kozan, E.: Genetic algorithms to schedule container transfers at multimodal terminals. International Transactions in Operational Research (1999)
2. Kim, K.H., Kim, K.Y.: Routing straddle carriers for the loading operation of containers using a beam search algorithm. Computers and Industrial Engineering 36, 109-136 (1999)
3. Kim, K.Y., Kim, K.H.: A routing algorithm for a single straddle carrier to load export containers onto a containership. International Journal of Production Economics (1999)
4. Kim, K.H., Park, Y.M., Ryu, K.R.: Deriving decision rules to locate export containers in container yards. European Journal of Operational Research (2000)
5. Pham Dinh, T.: Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients, Mathematics for Optimization. Math. Studies, 65-76 (1986)
6. Le Thi, H.A., Pham Dinh, T., Le Dung, M.: Exact penalty in dc programming. Vietnam Journal of Mathematics 27(2), 169-178 (1999)
7. Le Thi, H.A., Pham Dinh, T.: Convex analysis approach to d.c. programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica, 22(1), 289-355 (1997)
8. Marchand, H., Martin, A., Weismantel, R., Wolsey, L.: Cutting Planes in integer and mixed integer programming. Core discussion paper-9953, pp. 1-50 (1999)
9. Le Thi, H.A., Pham Dinh, T.: The DC Programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals of Operations Research 133, 23-46 (2005)
10. CPLEX Optimization ILOG, IncUsing the CPLEXR Callable Library and CPLEX Barrier and Mixed Integer Solver Options, Version 11.0 (2007)
11. Le Thi, H.A., Pham Dinh, T.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optimisation 8, 476-505 (1998)
12. Le Thi, H.A., Pham Dinh, T.: A Continuous Approach for Globally Solving Linearly Constrained Quadratic Zero-One Programming Problems. Optimization 50, 93-120 (2001)
13. Le Thi, H.A., Pham Dinh, T.: Large Scale Molecular Optimization from exact distance matrices by a dc optimization approach. SIAM Journal on Optimization 14(1), 77-116 (2003)
14. Le Thi, H.A.: Contribution à l'optimisation non convexe et l'optimisation globale: Théorie, Algorithmes et Applications. Habilitation à diriger des recherches, Université de Rouen (Juin 1997)
15. Nguyen, V.V.: Contribution à l'optimisation non convexe et à l'optimisation globale en transport logistique. Thèse de doctorat, Institut National des Sciences Appliquées (INSA), Rouen (Juillet 2006)
16. Padberg, M.: Classical cuts for mixed-integer programming and branch-and-cut. Mathematical Methods of Operations Research (2), 173-203 (2001)
17. Ndiaye, B.M.: Simulation et Optimisation DC dans les réseaux de transport combiné. Code à usage industriel. Thèse de doctorat, Institut National des Sciences Appliquées (INSA), Rouen (Mai 2007)