Moving horizon capacitated arc routing problem

DOI10.1007/S10878-025-01344-WMaRDI QIDQ6912366zbMATH OpenFDO

Authors Somnath Buriuly, Leena Vachhani, Arpita Sinha, Sivapragasam Ravitharan, Sunita S. Chauhan

Publication date 22 October 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-025-01344-W

zbMATH Keywords

capacitated arc routing problemcolumn generationdynamicmoving horizonmulti trip

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35)

Cites work

• An efficient transformation of the generalized vehicle routing problem
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• Barrier function based model predictive control
• Constrained model predictive control: Stability and optimality
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Exact solution of the generalized routing problem through graph transformations
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• Vehicle Routing
• Vehicle routing problems with multiple trips

This page was built for publication: Moving horizon capacitated arc routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912366)