Abstract
It is discussed how to route straddle carriers during the loading operation of export containers. The straddle carrier (SC) travel distance will be much longer if two consecutive containers must be collected far from one another instead of from consecutive yard-bays. So, finding the minimum straddle carrier travel distance will guarantee port efficiency and allow cost savings. Our objective is to minimize this total travel distance of a straddle carrier. A SC performs a so called partial tour to pick-up containers of a same group, according to the work schedule. This problem is characterized as problem with binary variables, which are hard to solve optimally.
In this paper we reformulate the problem, thanks to exact penalty techniques in DC Programming, as a polyhedral DC Program. A combination of the local algorithm DCA and global optimization approach such as Cutting plane techniques is proposed. The performance of the algorithm is tested on a set of data and the computational results are presented.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Preston, P., Kozan, E.: Genetic algorithms to schedule container transfers at multimodal terminals. International Transactions in Operational Research (1999)
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)
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)
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)
Pham Dinh, T.: Algorithms for solving a class of nonconvex optimization problems.Methods of subgradients. Mathematics for Optimization. Math. Studies, 65–76 (1986)
Le Thi, H.A., Pham Dinh, T., Le Dung, M.: Exact penalty in dc programming. Vietnam Journal of Mathematics 27(2), 169–178 (1999)
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)
Marchand, H., Martin, A., Weismantel, R., Wolsey, L.: Cutting Planes in integer and mixed integer programming. Core discussion paper-9953, pp. 1–50 (1999)
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)
CPLEX Optimization ILOG, IncUsing the CPLEXR Callable Library and CPLEX Barrier and Mixed Integer Solver Options, Version 11.0 (2007)
Le Thi, H.A., Pham Dinh, T.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optimisation 8, 476–505 (1998)
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)
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)
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)
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)
Padberg, M.: Classical cuts for mixed-integer programming and branch-and-cut. Mathematical Methods of Operations Research (2), 173–203 (2001)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ndiaye, B.M., Tao, P.D., Le Thi, H.A. (2008). Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-87477-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87476-8
Online ISBN: 978-3-540-87477-5
eBook Packages: Computer ScienceComputer Science (R0)