A parameterized lower bounding method for the open capacitated arc routing problem
Consider an undirected graph with demands scattered over the edges and a homogeneous fleet of vehicles to service the demands. In the open capacitated arc routing problem (OCARP) the objective is to find a set of routes that collectively service all demands with the minimum cost. Each vehicle has li...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2023-01-01
|
Series: | EURO Journal on Computational Optimization |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2192440623000242 |