IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v106y2017icp321-344.html
   My bibliography  Save this article

A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning

Author

Listed:
  • SteadieSeifi, M.
  • Dellaert, N.P.
  • Nuijten, W.
  • Van Woensel, T.

Abstract

We study a transportation planning problem with multiple transportation modes, perishable products, and management of Reusable Transport Items (RTIs). This problem is inspired by the European horticultural chain. We present a Mixed Integer Programming (MIP) optimization model which is an extension of the Fixed-charge Capacitated Multicommodity Network Flow Problem (FCMNFP). The MIP integrates dynamic allocation, flow, and repositioning of the RTIs in order to find the trade-off between product freshness requirements, and operational circumstances and costs. We furthermore propose an Adaptive Large Neighborhood Search (ALNS) algorithm with new neighborhoods, and intensification and diversification strategies. We then provide detailed computational analysis on its properties, compare its results with a state-of-the-art MIP solver, and provide practical insights.

Suggested Citation

  • SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T., 2017. "A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 321-344.
    • Handle: RePEc:eee:transb:v:106:y:2017:i:c:p:321-344
    DOI: 10.1016/j.trb.2017.07.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261516304039
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2017.07.007?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. Grangier, Philippe & Gendreau, Michel & Lehuédé, Fabien & Rousseau, Louis-Martin, 2016. "An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization," European Journal of Operational Research, Elsevier, vol. 254(1), pages 80-91.
    2. García, Javier & Florez, José E. & Torralba, Álvaro & Borrajo, Daniel & López, Carlos Linares & García-Olaya, Ángel & Sáenz, Juan, 2013. "Combining linear programming and automated planning to solve intermodal transportation problems," European Journal of Operational Research, Elsevier, vol. 227(1), pages 216-226.
    3. Jorge E. Mendoza & Bruno Castanier & Christelle Guéret & Andrés L. Medaglia & Nubia Velasco, 2011. "Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 45(3), pages 346-363, August.
    4. Endong Zhu & Teodor Gabriel Crainic & Michel Gendreau, 2014. "Scheduled Service Network Design for Freight Rail Transportation," Operations Research, INFORMS, vol. 62(2), pages 383-400, April.
    5. Mike Hewitt & George Nemhauser & Martin W. P. Savelsbergh, 2013. "Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 302-316, May.
    6. Michael Berliner Pedersen & Teodor Gabriel Crainic & Oli B. G. Madsen, 2009. "Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements," Transportation Science, INFORMS, vol. 43(2), pages 158-177, May.
    7. Jardar Andersen & Marielle Christiansen & Teodor Gabriel Crainic & Roar Grønhaug, 2011. "Branch and Price for Service Network Design with Asset Management Constraints," Transportation Science, INFORMS, vol. 45(1), pages 33-49, February.
    8. Song, Dong-Ping & Dong, Jing-Xin, 2012. "Cargo routing and empty container repositioning in multiple shipping service routes," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1556-1575.
    9. Hemmati, Ahmad & Hvattum, Lars Magnus & Christiansen, Marielle & Laporte, Gilbert, 2016. "An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem," European Journal of Operational Research, Elsevier, vol. 252(3), pages 775-788.
    10. Paraskevopoulos, Dimitris C. & Bektaş, Tolga & Crainic, Teodor Gabriel & Potts, Chris N., 2016. "A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem," European Journal of Operational Research, Elsevier, vol. 253(2), pages 265-279.
    11. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    12. Andersen, Jardar & Crainic, Teodor Gabriel & Christiansen, Marielle, 2009. "Service network design with management and coordination of multiple fleets," European Journal of Operational Research, Elsevier, vol. 193(2), pages 377-389, March.
    13. 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.
    14. Omar Ahumada & J. Villalobos, 2011. "A tactical model for planning the production and distribution of fresh produce," Annals of Operations Research, Springer, vol. 190(1), pages 339-358, October.
    15. Meng, Qiang & Wang, Shuaian, 2011. "Liner shipping service network design with empty container repositioning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(5), pages 695-708, September.
    16. Teodor Gabriel Crainic & Mike Hewitt & Michel Toulouse & Duc Minh Vu, 2016. "Service Network Design with Resource Constraints," Transportation Science, INFORMS, vol. 50(4), pages 1380-1393, November.
    17. Erera, Alan L. & Morales, Juan C. & Savelsbergh, Martin, 2005. "Global intermodal tank container management for the chemical industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(6), pages 551-566, November.
    18. 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.
    19. Alysson Costa & Jean-François Cordeau & Bernard Gendron, 2009. "Benders, metric and cutset inequalities for multicommodity capacitated network design," Computational Optimization and Applications, Springer, vol. 42(3), pages 371-392, April.
    20. Mike Hewitt & George L. Nemhauser & Martin W. P. Savelsbergh, 2010. "Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 314-325, May.
    21. Choong, Sook Tying & Cole, Michael H. & Kutanoglu, Erhan, 2002. "Empty container management for intermodal transportation networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 38(6), pages 423-438, November.
    22. SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T. & Raoufi, R., 2014. "Multimodal freight transportation planning: A literature review," European Journal of Operational Research, Elsevier, vol. 233(1), pages 1-15.
    23. Reis, Silvia Araújo & Leal, José Eugenio, 2015. "A deterministic mathematical model to support temporal and spatial decisions of the soybean supply chain," Journal of Transport Geography, Elsevier, vol. 43(C), pages 48-58.
    24. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    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. Shan, Wenxuan & Peng, Zixuan & Liu, Jiaming & Yao, Baozhen & Yu, Bin, 2020. "An exact algorithm for inland container transportation network design," Transportation Research Part B: Methodological, Elsevier, vol. 135(C), pages 41-82.
    2. Dongping Song, 2021. "A Literature Review, Container Shipping Supply Chain: Planning Problems and Research Opportunities," Logistics, MDPI, vol. 5(2), pages 1-26, June.
    3. Liu, Guoquan & Li, Lei & Chen, Jianghang & Ma, Fei, 2020. "Inventory sharing strategy and optimization for reusable transport items," International Journal of Production Economics, Elsevier, vol. 228(C).
    4. Di Luan & Mingjing Zhao & Qianru Zhao & Nan Wang, 2021. "Modelling of integrated scheduling problem of capacitated equipment systems with a multi-lane road network," PLOS ONE, Public Library of Science, vol. 16(6), pages 1-38, June.
    5. Ghiami, Yousef & Demir, Emrah & Van Woensel, Tom & Christiansen, Marielle & Laporte, Gilbert, 2019. "A deteriorating inventory routing problem for an inland liquefied natural gas distribution network," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 45-67.

    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. SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T. & Raoufi, R., 2014. "Multimodal freight transportation planning: A literature review," European Journal of Operational Research, Elsevier, vol. 233(1), pages 1-15.
    2. Liu, Chuanju & Zhang, Junlong & Lin, Shaochong & Shen, Zuo-Jun Max, 2023. "Service network design with consistent multiple trips," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    3. Li, Xiangyong & Ding, Yi & Pan, Kai & Jiang, Dapei & Aneja, Y.P., 2020. "Single-path service network design problem with resource constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    4. Wang, Zujian & Qi, Mingyao & Cheng, Chun & Zhang, Canrong, 2019. "A hybrid algorithm for large-scale service network design considering a heterogeneous fleet," European Journal of Operational Research, Elsevier, vol. 276(2), pages 483-494.
    5. 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.
    6. Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.
    7. Greening, Lacy M. & Dahan, Mathieu & Erera, Alan L., 2023. "Lead-Time-Constrained Middle-Mile Consolidation Network Design with Fixed Origins and Destinations," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    8. 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.
    9. Xudong Diao & Ai Gao & Xin Jin & Hui Chen, 2022. "A Layer-Based Relaxation Approach for Service Network Design," Sustainability, MDPI, vol. 14(20), pages 1-13, October.
    10. Wang, Zujian & Qi, Mingyao, 2019. "Service network design considering multiple types of services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 1-14.
    11. Li, Xiangyong & Wei, Kai & Aneja, Y.P. & Tian, Peng, 2017. "Design-balanced capacitated multicommodity network design with heterogeneous assets," Omega, Elsevier, vol. 67(C), pages 145-159.
    12. Bruno Albert Neumann-Saavedra & Teodor Gabriel Crainic & Bernard Gendron & Dirk Christian Mattfeld & Michael Römer, 2020. "Integrating Resource Management in Service Network Design for Bike-Sharing Systems," Transportation Science, INFORMS, vol. 54(5), pages 1251-1271, September.
    13. Zhang, X. & Liu, X., 2022. "A two-stage robust model for express service network design with surging demand," European Journal of Operational Research, Elsevier, vol. 299(1), pages 154-167.
    14. Xing, Xinjie & Song, Dongping & Qiu, Chengfeng & Drake, Paul R. & Zhan, Yuanzhu, 2023. "Joint tank container demurrage policy and flow optimisation using a progressive hedging algorithm with expanded time-space network," European Journal of Operational Research, Elsevier, vol. 307(2), pages 663-679.
    15. Natashia Boland & Mike Hewitt & Luke Marshall & Martin Savelsbergh, 2017. "The Continuous-Time Service Network Design Problem," Operations Research, INFORMS, vol. 65(5), pages 1303-1321, October.
    16. Wang, Shuaian & Liu, Zhiyuan & Bell, Michael G.H., 2015. "Profit-based maritime container assignment models for liner shipping networks," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 59-76.
    17. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    18. Naoto Katayama, 2020. "MIP neighborhood search heuristics for a service network design problem with design-balanced requirements," Journal of Heuristics, Springer, vol. 26(4), pages 475-502, August.
    19. David Wolfinger & Fabien Tricoire & Karl F. Doerner, 2019. "A matheuristic for a multimodal long haul routing problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(4), pages 397-433, December.
    20. Liu, Chuanju & Lin, Shaochong & Shen, Zuo-Jun Max & Zhang, Junlong, 2023. "Stochastic service network design: The value of fixed routes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).

    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:transb:v:106:y:2017:i:c:p:321-344. 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/wps/find/journaldescription.cws_home/548/description#description .

    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.