Skip to main content
SpringerLink
Log in

Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches

  • Conference paper
Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 14))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Preston, P., Kozan, E.: Genetic algorithms to schedule container transfers at multimodal terminals. International Transactions in Operational Research (1999)

    Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  5. Pham Dinh, T.: Algorithms for solving a class of nonconvex optimization problems.Methods of subgradients. Mathematics for Optimization. Math. Studies, 65–76 (1986)

    Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  10. CPLEX Optimization ILOG, IncUsing the CPLEXR Callable Library and CPLEX Barrier and Mixed Integer Solver Options, Version 11.0 (2007)

    Google Scholar 

  11. Le Thi, H.A., Pham Dinh, T.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optimisation 8, 476–505 (1998)

    Article  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  16. Padberg, M.: Classical cuts for mixed-integer programming and branch-and-cut. Mathematical Methods of Operations Research (2), 173–203 (2001)

    Google Scholar 

  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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of LMDAN, FASEG, University of Cheikh Anta Diop, Dakar, BP 5683, Dakar-Fann, Senegal, Senegal

    Babacar Mbaye Ndiaye

  2. Laboratory of Modelling, Optimization & Operations Research, National Institute for Applied Sciences - Rouen, BP 08, Place Emile Blondel, 76131, Mont Saint Aignan Cedex, France

    Pham Dinh Tao

  3. Laboratory of Theoretical and Applied Computer Science UFR MIM, University of Paul Verlaine, Metz, Ile du Saulcy, 57045, Metz, France

    Hoai An Le Thi

Authors
  1. Babacar Mbaye Ndiaye
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pham Dinh Tao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hoai An Le Thi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Theoretical and Applied Computer Science, UFR MIM,, Paul Verlaine University of Metz, Metz, France

    Hoai An Le Thi

  2. Faculty of Sciences, Technology and Communications, University of Luxembourg, Luxembourg

    Pascal Bouvry

  3. Laboratory of Mathematics, National Institute for Applied Sciences, Rouen Mont, Saint Aignan, France

    Tao Pham Dinh

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation