IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v26y2020i4d10.1007_s10732-020-09437-x.html
   My bibliography  Save this article

MIP neighborhood search heuristics for a service network design problem with design-balanced requirements

Author

Listed:
  • Naoto Katayama

    (Distribution and Logistics Systems, Ryutsu Keizai University)

Abstract

Service network design problems are used to address a variety of services in transportation and logistics planning. In the present paper, we consider the service network design problem with design-balanced requirements. This problem is particularly relevant to operations for consolidation transportation systems and determines the transportation network configuration and the characteristics of the corresponding services. We present a solution approach that combines a capacity scaling procedure for finding an initial feasible solution and a MIP neighborhood search for improving the solutions. Computational experiments on benchmark instances show that the proposed heuristic finds high-quality solutions in a short computation time.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joheur:v:26:y:2020:i:4:d:10.1007_s10732-020-09437-x
    DOI: 10.1007/s10732-020-09437-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-020-09437-x
    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/s10732-020-09437-x?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. 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.
    2. Mervat Chouman & Teodor Gabriel Crainic, 2015. "Cutting-Plane Matheuristic for Service Network Design with Design-Balanced Requirements," Transportation Science, INFORMS, vol. 49(1), pages 99-113, February.
    3. Teodor Gabriel Crainic & Mike Hewitt & Michel Toulouse & Duc Minh Vu, 2018. "Scheduled service network design with resource acquisition and management," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 277-309, September.
    4. 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.
    5. Naoto Katayama, 2019. "A combined fast greedy heuristic for the capacitated multicommodity network design problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(11), pages 1983-1996, November.
    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. 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.
    9. Bai, Ruibin & Wallace, Stein W. & Li, Jingpeng & Chong, Alain Yee-Loong, 2014. "Stochastic service network design with rerouting," Transportation Research Part B: Methodological, Elsevier, vol. 60(C), pages 50-65.
    10. Yves Pochet & Mathieu Van Vyve, 2004. "A General Heuristic for Production Planning Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 316-327, 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. 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.

    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. 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.
    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. 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).
    5. 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.
    6. 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.
    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. Li, Xiangyong & Wei, Kai & Guo, Zhaoxia & Wang, Wei & Aneja, Y.P., 2021. "An exact approach for the service network design problem with heterogeneous resource constraints," Omega, Elsevier, vol. 102(C).
    9. 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.
    10. 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.
    11. Hewitt, Mike & Crainic, Teodor Gabriel & Nowak, Maciek & Rei, Walter, 2019. "Scheduled service network design with resource acquisition and management under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 324-343.
    12. Juliette Medina & Mike Hewitt & Fabien Lehuédé & Olivier Péton, 2019. "Integrating long-haul and local transportation planning: the Service Network Design and Routing Problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 119-145, June.
    13. Xin Wang & Teodor Gabriel Crainic & Stein W. Wallace, 2019. "Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 153-170, February.
    14. Satici, Ozgur & Dayarian, Iman, 2024. "Tactical and operational planning of express intra-city package services," Omega, Elsevier, vol. 122(C).
    15. Xin Wang & Stein W. Wallace, 2016. "Stochastic scheduled service network design in the presence of a spot market for excess capacity," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(4), pages 393-413, December.
    16. Crainic, Teodor Gabriel & Gendron, Bernard & Akhavan Kazemzadeh, Mohammad Rahim, 2022. "A taxonomy of multilayer network design and a survey of transportation and telecommunication applications," European Journal of Operational Research, Elsevier, vol. 303(1), pages 1-13.
    17. Hewitt, Mike & Lehuédé, Fabien, 2023. "New formulations for the Scheduled Service Network Design Problem," Transportation Research Part B: Methodological, Elsevier, vol. 172(C), pages 117-133.
    18. Dayarian, Iman & Rocco, Adolfo & Erera, Alan & Savelsbergh, Martin, 2022. "Operations design for high-velocity intra-city package service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 150-168.
    19. 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.
    20. Belieres, Simon & Hewitt, Mike, 2024. "Hedging against uncertainty in transportation network design through flexible scheduling," Omega, Elsevier, vol. 126(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:spr:joheur:v:26:y:2020:i:4:d:10.1007_s10732-020-09437-x. 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.