IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v50y2025i2d10.1007_s10878-025-01344-w.html
   My bibliography  Save this article

Moving horizon capacitated arc routing problem

Author

Listed:
  • Somnath Buriuly

    (IITB-Monash Research Academy
    IIT Bombay
    Monash University)

  • Leena Vachhani

    (IIT Bombay)

  • Arpita Sinha

    (IIT Bombay)

  • Sivapragasam Ravitharan

    (Monash University
    Monash University)

  • Sunita Chauhan

    (Monash University)

Abstract

In transportation networks, routing problems are cursed with arbitrary changes occurring in the dataset due to unpredictable events like agent breakdown (sensor or vehicle failure), network connectivity changes, resource/demand fluctuations, etc. Moreover, capacity restriction on the agents may require multi-trip solutions for meeting large demands over networks. For example, a battery-powered inspection wagon can only service a limited number of track sections in a single trip. We investigate a moving horizon approach for the multi-trip dynamic capacitated arc routing problem with limited duration to mitigate the limitations of CARP variants in the literature. The proposed approach addresses arbitrary changes in the underlying network, agent unavailability scenarios, and simultaneously satisfies the time limit on meeting all demands. The moving horizon approach subdivides the planning horizon to determine the current trip (single-trip) for all agents, hence coined as Moving Horizon Capacitated Arc Routing Problem (MH-CARP). The proposed MH-CARP is formulated as a set covering problem that considers both partial and full trips (trips may not start at the depot), making it suitable for tackling arbitrary events by re-planning. Theoretical results for the computation of dual variables are derived and then implemented in the column generation algorithm to obtain lower bounds. The algorithm is validated on a widely available dataset for CARP, having instances of up to 147 tasks that require servicing by up to 20 agents. Using this benchmark data, the partial-trip based re-planning strategy is also validated. Lastly, a simulation study is presented to demonstrate the re-planning strategy and compare an MH-CARP solution to two CARP based solutions - one with no arbitrary events and the other with known arbitrary events. The results also convey that greedy solutions are avoided to satisfy the limited duration restriction, and automatic re-ordering of the trips is achieved to compensate for arbitrary events.

Suggested Citation

  • Somnath Buriuly & Leena Vachhani & Arpita Sinha & Sivapragasam Ravitharan & Sunita Chauhan, 2025. "Moving horizon capacitated arc routing problem," Journal of Combinatorial Optimization, Springer, vol. 50(2), pages 1-35, September.
    • Handle: RePEc:spr:jcomop:v:50:y:2025:i:2:d:10.1007_s10878-025-01344-w
    DOI: 10.1007/s10878-025-01344-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01344-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/s10878-025-01344-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

    for a different version of it.

    References listed on IDEAS

    as
    1. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2018. "Vehicle routing problems with multiple trips," Annals of Operations Research, Springer, vol. 271(1), pages 127-159, December.
    2. Halvorsen-Weare, Elin E. & Fagerholt, Kjetil & Nonås, Lars Magne & Asbjørnslett, Bjørn Egil, 2012. "Optimal fleet composition and periodic routing of offshore supply vessels," European Journal of Operational Research, Elsevier, vol. 223(2), pages 508-517.
    3. Diego Pecin & Eduardo Uchoa, 2019. "Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm," Transportation Science, INFORMS, vol. 53(6), pages 1673-1694, November.
    4. Li, Shukai & Zhou, Xuesong & Yang, Lixing & Gao, Ziyou, 2018. "Automatic train regulation of complex metro networks with transfer coordination constraints: A distributed optimal control framework," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 228-253.
    5. Erfan Babaee Tirkolaee & Ali Asghar Rahmani Hosseinabadi & Mehdi Soltani & Arun Kumar Sangaiah & Jin Wang, 2018. "A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services," Sustainability, MDPI, vol. 10(5), pages 1-21, April.
    6. Ghiani, Gianpaolo & Improta, Gennaro, 2000. "An efficient transformation of the generalized vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 11-17, April.
    7. Ulrike Ritzinger & Jakob Puchinger & Richard F. Hartl, 2016. "A survey on dynamic and stochastic vehicle routing problems," International Journal of Production Research, Taylor & Francis Journals, vol. 54(1), pages 215-231, January.
    8. Kulkarni, Sarang & Krishnamoorthy, Mohan & Ranade, Abhiram & Ernst, Andreas T. & Patil, Rahul, 2018. "A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 457-487.
    9. M Blais & G Laporte, 2003. "Exact solution of the generalized routing problem through graph transformations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(8), pages 906-910, August.
    10. Aristide Mingozzi & Roberto Roberti & Paolo Toth, 2013. "An Exact Algorithm for the Multitrip Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 193-207, May.
    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. Côté, Jean-François & Alves de Queiroz, Thiago & Gallesi, Francesco & Iori, Manuel, 2023. "A branch-and-regret algorithm for the same-day delivery problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    2. Jie Zhang & Yifan Zhu & Tao Wang & Weiping Wang & Rui Wang & Xiaobo Li, 2022. "An Improved Intelligent Auction Mechanism for Emergency Material Delivery," Mathematics, MDPI, vol. 10(13), pages 1-30, June.
    3. Emna Marrekchi & Walid Besbes & Diala Dhouib & Emrah Demir, 2021. "A review of recent advances in the operations research literature on the green routing problem and its variants," Annals of Operations Research, Springer, vol. 304(1), pages 529-574, September.
    4. Yi-Kuei Lin & Cheng-Fu Huang & Yi-Chieh Liao, 2019. "Reliability of a stochastic intermodal logistics network under spoilage and time considerations," Annals of Operations Research, Springer, vol. 277(1), pages 95-118, June.
    5. Jumbo, Olga & Moghaddass, Ramin, 2022. "Resource optimization and image processing for vegetation management programs in power distribution networks," Applied Energy, Elsevier, vol. 319(C).
    6. Wu, Lingxiao & Pan, Kai & Wang, Shuaian & Yang, Dong, 2018. "Bulk ship scheduling in industrial shipping with stochastic backhaul canvassing demand," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 117-136.
    7. Zhang, Li & Meng, Qiang & Wang, Hua & Yu, Bin, 2025. "Joint bus dispatching and bus bridging timetabling for mass rapid transit disruption management," Transportation Research Part B: Methodological, Elsevier, vol. 196(C).
    8. Cheng, Chun & Adulyasak, Yossiri & Rousseau, Louis-Martin, 2020. "Drone routing with energy function: Formulation and exact algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 364-387.
    9. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    10. He, Dongdong & Guan, Wei, 2023. "Promoting service quality with incentive contracts in rural bus integrated passenger-freight service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 175(C).
    11. Perumal, Shyam S.G. & Lusby, Richard M. & Larsen, Jesper, 2022. "Electric bus planning & scheduling: A review of related problems and methodologies," European Journal of Operational Research, Elsevier, vol. 301(2), pages 395-413.
    12. Bingtao Quan & Sujian Li & Kuo-Jui Wu, 2022. "Optimizing the Vehicle Scheduling Problem for Just-in-Time Delivery Considering Carbon Emissions and Atmospheric Particulate Matter," Sustainability, MDPI, vol. 14(10), pages 1-19, May.
    13. D Soler & E Martínez & J C Micó, 2008. "A transformation for the mixed general routing problem with turn penalties," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(4), pages 540-547, April.
    14. Byung Kwon Lee & Seyyed Amir Babak Rasmi & Jakkarin Sae-Tiew, 2024. "Scheduling offshore cargo handling with operational dynamics including cost composites, downtime periods, and cargo attributes," Flexible Services and Manufacturing Journal, Springer, vol. 36(1), pages 279-314, March.
    15. Pop, Petrică C., 2020. "The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances," European Journal of Operational Research, Elsevier, vol. 283(1), pages 1-15.
    16. Santos, A.M.P. & Fagerholt, Kjetil & Laporte, Gilbert & Guedes Soares, C., 2022. "A stochastic optimization approach for the supply vessel planning problem under uncertain demand," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 209-228.
    17. Wang, Shaojun & Sarker, Bhaba R. & Mann, Lawrence & Triantaphyllou, Evangelos, 2004. "Resource planning and a depot location model for electric power restoration," European Journal of Operational Research, Elsevier, vol. 155(1), pages 22-43, May.
    18. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
    19. Frómeta Moya, Jorge Israel & Pérez Campos, Javier de Jesús, 2021. "Modelo heurístico híbrido para el ruteo vehicular y manejo de inventario en una entidad comercializadora de combustibles. || Hybrid heuristic model for inventory routing management in a fuel comercial," Revista de Métodos Cuantitativos para la Economía y la Empresa = Journal of Quantitative Methods for Economics and Business Administration, Universidad Pablo de Olavide, Department of Quantitative Methods for Economics and Business Administration, vol. 31(1), pages 363-383, June.
    20. Timo Gschwind & Stefan Irnich & Christian Tilk & Simon Emde, 2020. "Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network," Journal of Scheduling, Springer, vol. 23(3), pages 363-377, June.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:jcomop:v:50:y:2025:i:2:d:10.1007_s10878-025-01344-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.