IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v2y2021i3d10.1007_s43069-021-00093-w.html
   My bibliography  Save this article

Ship Routing Using Genetic Algorithms

Author

Listed:
  • Nikolaos Charalambopoulos

    (University of Patras)

  • Andreas C. Nearchou

    (University of Patras)

Abstract

Consideration is given to a ship routing problem (SRP) where a container-ship fleet performs pickups and deliveries of containers between a hub and a set of spoke ports. SRPs are a type of vehicle routing problem (VRP) in maritime environments where vehicles are vessels or ships and the customers to be served are ports. Given the inherent complexity of this class of problems, heuristic methods seem to offer the most promise for practical size problem instances. After describing SRP as a capacitated VRP on a graph with pickups, deliveries, and time window constraints, we present a new population heuristic for its solution. Computational experiments for a variety of operating environments show the effectiveness of the developed approach. The results demonstrate very satisfactory performance in terms of both solution time and quality.

Suggested Citation

  • Nikolaos Charalambopoulos & Andreas C. Nearchou, 2021. "Ship Routing Using Genetic Algorithms," SN Operations Research Forum, Springer, vol. 2(3), pages 1-26, September.
    • Handle: RePEc:spr:snopef:v:2:y:2021:i:3:d:10.1007_s43069-021-00093-w
    DOI: 10.1007/s43069-021-00093-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-021-00093-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-021-00093-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sambracos, E. & Paravantis, J. A. & Tarantilis, C. D. & Kiranoudis, C. T., 2004. "Dispatching of small containers via coastal freight liners: The case of the Aegean Sea," European Journal of Operational Research, Elsevier, vol. 152(2), pages 365-381, January.
    2. Krishan Rana & R. G. Vickson, 1991. "Routing Container Ships Using Lagrangean Relaxation and Decomposition," Transportation Science, INFORMS, vol. 25(3), pages 201-214, August.
    3. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    4. Shintani, Koichi & Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2007. "The container shipping network design problem with empty container repositioning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(1), pages 39-59, January.
    5. Karlaftis, Matthew G. & Kepaptsoglou, Konstantinos & Sambracos, Evangelos, 2009. "Containership routing with time deadlines and simultaneous deliveries and pick-ups," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 210-221, January.
    6. Marielle Christiansen & Kjetil Fagerholt & David Ronen, 2004. "Ship Routing and Scheduling: Status and Perspectives," Transportation Science, INFORMS, vol. 38(1), pages 1-18, February.
    7. Wang, Shuaian & Meng, Qiang, 2012. "Liner ship route schedule design with sea contingency time and port time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 615-633.
    8. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    9. Fagerholt, Kjetil, 2001. "Ship scheduling with soft time windows: An optimisation based approach," European Journal of Operational Research, Elsevier, vol. 131(3), pages 559-571, June.
    10. Nearchou, A.C.Andreas C., 2004. "The effect of various operators on the genetic search for large scheduling problems," International Journal of Production Economics, Elsevier, vol. 88(2), pages 191-203, March.
    11. Christiansen, Marielle & Fagerholt, Kjetil & Nygreen, Bjørn & Ronen, David, 2013. "Ship routing and scheduling in the new millennium," European Journal of Operational Research, Elsevier, vol. 228(3), pages 467-483.
    12. Shuaian Wang & Abdurahim Alharbi & Pam Davy, 2015. "Ship Route Schedule Based Interactions Between Container Shipping Lines and Port Operators," International Series in Operations Research & Management Science, in: Chung-Yee Lee & Qiang Meng (ed.), Handbook of Ocean Container Transport Logistics, edition 127, chapter 10, pages 279-313, Springer.
    13. Ronen, David, 1993. "Ship scheduling: The last decade," European Journal of Operational Research, Elsevier, vol. 71(3), pages 325-333, December.
    14. Ronen, David, 1983. "Cargo ships routing and scheduling: Survey of models and problems," European Journal of Operational Research, Elsevier, vol. 12(2), pages 119-126, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Kang & Chen, Dongxu & Sun, Xueshan & Yang, Zhongzhen, 2016. "Container Ocean-transportation System Design with the factors of demand fluctuation and choice inertia of shippers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 267-281.
    2. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2015. "Liner hub-and-spoke shipping network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 32-48.
    3. Zheng, Jianfeng & Qi, Jingwen & Sun, Zhuo & Li, Feng, 2018. "Community structure based global hub location problem in liner shipping," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 1-19.
    4. Wang, Shuaian & Meng, Qiang, 2012. "Liner ship fleet deployment with container transshipment operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 470-484.
    5. Zheng, Jianfeng & Sun, Zhuo & Zhang, Fangjun, 2016. "Measuring the perceived container leasing prices in liner shipping network design with empty container repositioning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 123-140.
    6. Wang, Shuaian & Meng, Qiang & Sun, Zhuo, 2013. "Container routing in liner shipping," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 1-7.
    7. Qiang Meng & Shuaian Wang & Henrik Andersson & Kristian Thun, 2014. "Containership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions," Transportation Science, INFORMS, vol. 48(2), pages 265-280, May.
    8. Manuel Herrera & Per J. Agrell & Casiano Manrique-de-Lara-Peñate & Lourdes Trujillo, 2017. "Vessel capacity restrictions in the fleet deployment problem: an application to the Panama Canal," Annals of Operations Research, Springer, vol. 253(2), pages 845-869, June.
    9. Lee, Chung-Yee & Song, Dong-Ping, 2017. "Ocean container transport in global supply chains: Overview and research opportunities," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 442-474.
    10. Wang, Hua & Wang, Shuaian & Meng, Qiang, 2014. "Simultaneous optimization of schedule coordination and cargo allocation for liner container shipping networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 261-273.
    11. Meng, Qiang & Wang, Tingsong & Wang, Shuaian, 2012. "Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand," European Journal of Operational Research, Elsevier, vol. 223(1), pages 96-105.
    12. Harilaos N. Psaraftis, 2019. "Ship routing and scheduling: the cart before the horse conjecture," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 21(1), pages 111-124, March.
    13. Qiang Meng & Tingsong Wang, 2010. "A chance constrained programming model for short-term liner ship fleet planning problems," Maritime Policy & Management, Taylor & Francis Journals, vol. 37(4), pages 329-346, July.
    14. Lee, Chung-Yee & Lee, Hau L. & Zhang, Jiheng, 2015. "The impact of slow ocean steaming on delivery reliability and fuel consumption," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 76(C), pages 176-190.
    15. Zenker, Michael & Emde, Simon & Boysen, Nils, 2016. "Cyclic inventory routing in a line-shaped network," European Journal of Operational Research, Elsevier, vol. 250(1), pages 164-178.
    16. Berit D. Brouer & J. Fernando Alvarez & Christian E. M. Plum & David Pisinger & Mikkel M. Sigurd, 2014. "A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design," Transportation Science, INFORMS, vol. 48(2), pages 281-312, May.
    17. Chen, Kang & Yang, Zhongzhen & Notteboom, Theo, 2014. "The design of coastal shipping services subject to carbon emission reduction targets and state subsidy levels," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 192-211.
    18. Christiansen, Marielle & Fagerholt, Kjetil & Nygreen, Bjørn & Ronen, David, 2013. "Ship routing and scheduling in the new millennium," European Journal of Operational Research, Elsevier, vol. 228(3), pages 467-483.
    19. Sun, Qinghe & Meng, Qiang & Chou, Mabel C., 2021. "Optimizing voyage charterparty (VCP) arrangement: Laytime negotiation and operations coordination," European Journal of Operational Research, Elsevier, vol. 291(1), pages 263-270.
    20. Wang, Tingsong & Meng, Qiang & Wang, Shuaian & Tan, Zhijia, 2013. "Risk management in liner ship fleet deployment: A joint chance constrained programming model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 1-12.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:snopef:v:2:y:2021:i:3:d:10.1007_s43069-021-00093-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.