IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v264y2018i2p607-622.html
   My bibliography  Save this article

A branch-and-price approach to the feeder network design problem

Author

Listed:
  • Santini, Alberto
  • Plum, Christian E.M.
  • Ropke, Stefan

Abstract

In this paper we consider the problem of designing a container liner shipping feeder network. The designer has to choose which port to serve during many rotations that start and end at a central hub. Many operational characteristics are considered, such as variable leg-by-leg speeds and cargo transit times. Realistic instances are generated from the LinerLib benchmark suite. The problem is solved with a branch-and-price algorithm, which can solve most instances to optimality within one hour. The results also provide insights on the cost structure and desirable features of optimal routes. These insights were obtained by means of an analysis where scenarios are generated varying internal and external conditions, such as fuel costs and port demands.

Suggested Citation

  • Santini, Alberto & Plum, Christian E.M. & Ropke, Stefan, 2018. "A branch-and-price approach to the feeder network design problem," European Journal of Operational Research, Elsevier, vol. 264(2), pages 607-622.
    • Handle: RePEc:eee:ejores:v:264:y:2018:i:2:p:607-622
    DOI: 10.1016/j.ejor.2017.06.063
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717306045
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.06.063?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. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    2. Liu, Zhiyuan & Meng, Qiang & Wang, Shuaian & Sun, Zhuo, 2014. "Global intermodal liner shipping network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 28-39.
    3. Richa Agarwal & Özlem Ergun, 2008. "Ship Scheduling and Network Design for Cargo Routing in Liner Shipping," Transportation Science, INFORMS, vol. 42(2), pages 175-196, May.
    4. Guy Desaulniers & François Lessard & Ahmed Hadjar, 2008. "Tabu Search, Partial Elementarity, and Generalized k -Path Inequalities for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 42(3), pages 387-404, August.
    5. C Archetti & D Feillet & A Hertz & M G Speranza, 2009. "The capacitated team orienteering and profitable tour problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(6), pages 831-842, June.
    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. Villeneuve, Daniel & Desaulniers, Guy, 2005. "The shortest path problem with forbidden paths," European Journal of Operational Research, Elsevier, vol. 165(1), pages 97-107, August.
    8. Mulder, Judith & Dekker, Rommert, 2014. "Methods for strategic liner shipping network design," European Journal of Operational Research, Elsevier, vol. 235(2), pages 367-377.
    9. 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.
    10. Plum, Christian E.M. & Pisinger, David & Sigurd, Mikkel M., 2014. "A service flow model for the liner shipping network design problem," European Journal of Operational Research, Elsevier, vol. 235(2), pages 378-386.
    11. Stefan Irnich & Guy Desaulniers, 2005. "Shortest Path Problems with Resource Constraints," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 33-65, Springer.
    12. Martin Savelsbergh & Marc Sol, 1998. "Drive: Dynamic Routing of Independent Vehicles," Operations Research, INFORMS, vol. 46(4), pages 474-490, August.
    13. Battarra, Maria & Pessoa, Artur Alves & Subramanian, Anand & Uchoa, Eduardo, 2014. "Exact algorithms for the traveling salesman problem with draft limits," European Journal of Operational Research, Elsevier, vol. 235(1), pages 115-128.
    14. Mauro Dell’Amico & Giovanni Righini & Matteo Salani, 2006. "A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection," Transportation Science, INFORMS, vol. 40(2), pages 235-247, May.
    15. Wang, Shuaian & Meng, Qiang, 2012. "Sailing speed optimization for container ships in a liner shipping network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 701-714.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jin, Jian Gang & Meng, Qiang & Wang, Hai, 2021. "Feeder vessel routing and transshipment coordination at a congested hub port," Transportation Research Part B: Methodological, Elsevier, vol. 151(C), pages 1-21.
    2. Hellsten, Erik Orm & Sacramento, David & Pisinger, David, 2022. "A branch-and-price algorithm for solving the single-hub feeder network design problem," European Journal of Operational Research, Elsevier, vol. 300(3), pages 902-916.
    3. Yuan Shiyi & Fu Jianwen & Cui Feng & Zhang Xin, 2020. "Truck and Trailer Routing Problem Solving by a Backtracking Search Algorithm," Journal of Systems Science and Information, De Gruyter, vol. 8(3), pages 253-272, June.
    4. Debabrata Das & Sameer Kumar & Nirmal Baran Hui & Vipul Jain & Charu Chandra, 2023. "Pricing and revenue-based outsourcing strategies in a multi-echelon lot-sizing model under insufficient production capacity," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 22(6), pages 514-530, December.
    5. Markus Leitner & Ivana Ljubić & Martin Riedler & Mario Ruthmair, 2019. "Exact Approaches for Network Design Problems with Relays," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 171-192, February.
    6. Qinxiao Yu & Chun Cheng & Ning Zhu, 2022. "Robust Team Orienteering Problem with Decreasing Profits," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3215-3233, November.
    7. Kristian Thun & Henrik Andersson & Magnus Stålhane, 2020. "A Branch-and-Price Algorithm for the Liner Shipping Network Design Problem," SN Operations Research Forum, Springer, vol. 1(4), pages 1-21, December.
    8. Jeong, Yoonjea & Saha, Subrata & Chatterjee, Debajyoti & Moon, Ilkyeong, 2018. "Direct shipping service routes with an empty container management strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 123-142.
    9. Di Wu & Xuejun Ji & Fang Xiao & Shijie Sheng, 2022. "A Location Inventory Routing Optimisation Model and Algorithm for a Remote Island Shipping Network considering Emergency Inventory," Sustainability, MDPI, vol. 14(10), pages 1-22, May.
    10. Msakni, Mohamed Kais & Fagerholt, Kjetil & Meisel, Frank & Lindstad, Elizabeth, 2020. "Analyzing different designs of liner shipping feeder networks: A case study," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).

    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. Karsten, Christian Vad & Pisinger, David & Ropke, Stefan & Brouer, Berit Dangaard, 2015. "The time constrained multi-commodity network flow problem and its application to liner shipping network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 76(C), pages 122-138.
    2. 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.
    3. David F. Koza & Guy Desaulniers & Stefan Ropke, 2020. "Integrated Liner Shipping Network Design and Scheduling," Transportation Science, INFORMS, vol. 54(2), pages 512-533, March.
    4. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    5. Nguyen Khoi Tran & Hans-Dietrich Haasis & Tobias Buer, 2017. "Container shipping route design incorporating the costs of shipping, inland/feeder transport, inventory and CO2 emission," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 19(4), pages 667-694, December.
    6. Chen, Jingxu & Jia, Shuai & Wang, Shuaian & Liu, Zhiyuan, 2018. "Subloop-based reversal of port rotation directions for container liner shipping network alteration," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 336-361.
    7. Akyüz, M. Hakan & Lee, Chung-Yee, 2016. "Service type assignment and container routing with transit time constraints and empty container repositioning for liner shipping service networks," Transportation Research Part B: Methodological, Elsevier, vol. 88(C), pages 46-71.
    8. Balakrishnan, Anantaram & Karsten, Christian Vad, 2017. "Container shipping service selection and cargo routing with transshipment limits," European Journal of Operational Research, Elsevier, vol. 263(2), pages 652-663.
    9. Christiansen, Marielle & Hellsten, Erik & Pisinger, David & Sacramento, David & Vilhelmsen, Charlotte, 2020. "Liner shipping network design," European Journal of Operational Research, Elsevier, vol. 286(1), pages 1-20.
    10. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2014. "Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design," European Journal of Operational Research, Elsevier, vol. 234(3), pages 874-884.
    11. Mulder, J. & Dekker, R., 2016. "Optimization in container liner shipping," Econometric Institute Research Papers EI2016-05, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    12. Zhen, Lu & Wu, Yiwei & Wang, Shuaian & Laporte, Gilbert, 2020. "Green technology adoption for fleet deployment in a shipping network," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 388-410.
    13. Wang, Shuaian, 2014. "A novel hybrid-link-based container routing model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 165-175.
    14. Yang, Dong & Pan, Kai & Wang, Shuaian, 2018. "On service network improvement for shipping lines under the one belt one road initiative of China," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 117(C), pages 82-95.
    15. Wang, Shuaian, 2016. "Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization," European Journal of Operational Research, Elsevier, vol. 250(1), pages 46-55.
    16. Brouer, Berit Dangaard & Desaulniers, Guy & Pisinger, David, 2014. "A matheuristic for the liner shipping network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 42-59.
    17. Karsten, Christian Vad & Brouer, Berit Dangaard & Desaulniers, Guy & Pisinger, David, 2017. "Time constrained liner shipping network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 152-162.
    18. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
    19. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    20. 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.

    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:eee:ejores:v:264:y:2018:i:2:p:607-622. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.