A novel dual-stage algorithm for capacitated arc routing problems with time-dependent service costs
Qingya Li, Shengcai Liu, Juan Zou, Ke Tang

TL;DR
This paper introduces a dual-stage algorithm, MAENS-GN, for solving large-scale capacitated arc routing problems with time-dependent costs, effectively addressing previous limitations of existing methods.
Contribution
The paper presents a novel dual-stage algorithm that exploits the relationship between route cost and departure time, improving solution quality for CARPTDSC.
Findings
High-quality solutions on small and large instances
Effective utilization of route cost and departure time relationship
Improved initialization strategy enhances performance
Abstract
This paper focuses on solving the capacitated arc routing problem with time-dependent service costs (CARPTDSC), which is motivated by winter gritting applications. In the current literature, exact algorithms designed for CARPTDSC can only handle small-scale instances, while heuristic algorithms fail to obtain high-quality solutions. To overcome these limitations, we propose a novel dual-stage algorithm, called MAENS-GN, that consists of a routing stage and a vehicle departure time optimization stage. The former obtains the routing plan, while the the latter determines the vehicle departure time. Importantly, existing literature often ignores the characteristic information contained in the relationship between the route cost and the vehicle departure time. The most significant innovation in this paper lies in the exploitation of this characteristic information during the vehicle…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicle Routing Optimization Methods · Advanced Manufacturing and Logistics Optimization · Optimization and Packing Problems
