Advertisement

Sādhanā

, 44:149 | Cite as

Minimum cost berth allocation problem in maritime logistics: new mixed integer programming models

  • Bobin Cherian Jos
  • M Harimanikandan
  • Chandrasekharan RajendranEmail author
  • Hans Ziegler
Article

Abstract

The berth allocation problem (BAP) involves decisions on how to allocate the berth space and to sequence maritime vessels that are to be loaded and unloaded at a container terminal involved in the maritime logistics. As the berth is a critical resource in a container terminal, an effective use of it is highly essential to have efficient berthing and servicing of vessels, and to optimize the associated costs. This study focuses on the minimum cost berth allocation problem (MCBAP) at a container terminal where the maritime vessels arrive dynamically. The objective comprises the waiting time penalty, tardiness penalty, handling cost and benefit of early service completion of vessels. This paper proposes three computationally efficient mixed integer linear programming (MILP) models for the MCBAP. Through numerical experiments, the proposed MILP models are compared to an existing model in the literature to evaluate their computational performance. The computational study with problem instances of various problem characteristics demonstrates the computational efficiency of the proposed models.

Keywords

Maritime logistics discrete berth allocation problem minimum cost berth allocation problem mixed integer linear programming models 

Notes

Acknowledgement

The authors are thankful to the reviewer and the Editor for their constructive suggestions and comments to improve the initial version of our manuscript.

References

  1. 1.
    UNCTAD (United Nations Conference on Trade and Development) 2018 Review of maritime transport 2018 Google Scholar
  2. 2.
    Wang F and Lim A 2007 A stochastic beam search for the berth allocation problem. Decis. Support Syst. 42: 2186–2196CrossRefGoogle Scholar
  3. 3.
    Bierwirth C and Meisel F 2010 A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202: 615–627CrossRefGoogle Scholar
  4. 4.
    Bierwirth C and Meisel F 2015 A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 244: 675–689MathSciNetCrossRefGoogle Scholar
  5. 5.
    Hansen P, Oǧuz C and Mladenović N 2008 Variable neighborhood search for minimum cost berth allocation. Eur. J. Oper. Res. 191: 636–649CrossRefGoogle Scholar
  6. 6.
    Imai A, Nishimura E and Papadimitriou S 2001 The dynamic berth allocation problem for a container port. Transp. Res. Part B 35: 401–417CrossRefGoogle Scholar
  7. 7.
    Imai A, Nagaiwa K and Tat C W 1997 Efficient planning of berth allocation for container terminals in Asia. J. Adv. Transp. 31: 75–94CrossRefGoogle Scholar
  8. 8.
    Imai A, Nishimura E and Papadimitriou S 2003 Berth allocation with service priority. Transp. Res. Part B 37: 437–457CrossRefGoogle Scholar
  9. 9.
    Cordeau J F, Laporte G, Legato P and Moccia L 2005 Models and tabu search heuristics for the berth-allocation problem. Transp. Sci. 39: 526–538CrossRefGoogle Scholar
  10. 10.
    Liang C, Huang Y and Yang Y 2009 A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Comput. Ind. Eng. 56: 1021–1028CrossRefGoogle Scholar
  11. 11.
    Kovač N, Stanimirović Z and Davidović T 2018 Metaheuristic approaches for the minimum cost hybrid berth allocation problem. In: Konstantopoulos C and Pantziou G (Eds.) Modeling, Computing and Data Handling Methodologies for Maritime Transportation. Cham: Springer, pp. 1–47Google Scholar
  12. 12.
    Lim A 1998 The berth planning problem. Oper. Res. Lett. 22: 105–110MathSciNetCrossRefGoogle Scholar
  13. 13.
    Golias M M, Boile M and Theofanis S 2010 A lamda-optimal based heuristic for the berth scheduling problem. Transp. Res. Part C: Emerg. Technol. 18: 794–806CrossRefGoogle Scholar
  14. 14.
    Kovač N 2017 Metaheuristic approaches for the berth allocation problem. Yugosl. J. Oper. Res. 27: 265–289MathSciNetCrossRefGoogle Scholar
  15. 15.
    Park Y and Kim K H 2003 A scheduling method for berth and quay cranes. OR Spectr. 25: 1–23MathSciNetCrossRefGoogle Scholar
  16. 16.
    Imai A 2008 The simultaneous berth and quay crane allocation problem. Transp. Res. Part E 44: 900–920CrossRefGoogle Scholar
  17. 17.
    Ernst A T, Oğuz C, Singh G and Taherkhani G 2017 Mathematical models for the berth allocation problem in dry bulk terminals. J. Sched. 20: 459–473MathSciNetCrossRefGoogle Scholar
  18. 18.
    Pratap S, Nayak A, Kumar A, Cheikhrouhou N and Tiwari M K 2017 An integrated decision support system for berth and ship unloader allocation in bulk material handling port. Comput. Ind. Eng. 106: 386–399CrossRefGoogle Scholar
  19. 19.
    Anoop K P, Panicker V V, Narayanan M and Kumar C T S 2018 A mathematical model and solution methods for rail freight transportation planning in an Indian food grain supply chain. Sādhanā 43: 1–20MathSciNetCrossRefGoogle Scholar
  20. 20.
    Madankumar S and Rajendran C 2019 A mixed integer linear programming model for the vehicle routing problem with simultaneous delivery and pickup by heterogeneous vehicles, and constrained by time windows. Sādhanā 44: 1–14MathSciNetCrossRefGoogle Scholar
  21. 21.
    Hansen P and Oguz C 2003 A note on formulations of static and dynamic berth allocation problems. Les Cah du GERAD G-2003-30 HEC MontréalGoogle Scholar

Copyright information

© Indian Academy of Sciences 2019

Authors and Affiliations

  • Bobin Cherian Jos
    • 1
  • M Harimanikandan
    • 1
  • Chandrasekharan Rajendran
    • 1
    Email author
  • Hans Ziegler
    • 2
  1. 1.Department of Management StudiesIndian Institute of Technology MadrasChennaiIndia
  2. 2.School of Business, Economics and Information SystemsUniversity of PassauPassauGermany

Personalised recommendations