Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
From MaRDI portal
Publication:2123554
Abstract: The capacitated arc routing problem is a very important problem with many practical applications. This paper focuses on the large scale capacitated arc routing problem. Traditional solution optimization approaches usually fail because of their poor scalability. The divide-and-conquer strategy has achieved great success in solving large scale optimization problems by decomposing the original large problem into smaller sub-problems and solving them separately. For arc routing, a commonly used divide-and-conquer strategy is to divide the tasks into subsets, and then solve the sub-problems induced by the task subsets separately. However, the success of a divide-and-conquer strategy relies on a proper task division, which is non-trivial due to the complex interactions between the tasks. This paper proposes a novel problem decomposition operator, named the route cutting off operator, which considers the interactions between the tasks in a sophisticated way. To examine the effectiveness of the route cutting off operator, we integrate it with two state-of-the-art divide-and-conquer algorithms, and compared with the original counterparts on a wide range of benchmark instances. The results show that the route cutting off operator can improve the effectiveness of the decomposition, and lead to significantly better results especially when the problem size is very large and the time budget is very tight.
Recommendations
- A cutting plane algorithm for the capacitated arc routing problem
- An approximation algorithm for the capacitated arc routing problem
- The commodity-split multi-compartment capacitated arc routing problem
- The capacitated arc routing problem: exact algorithms
- Approximate solutions for the capacitated arc routing problem
- Cut-first branch-and-price-second for the capacitated arc-routing problem
- The Capacitated Arc Routing Problem: Lower bounds
Cites work
- scientific article; zbMATH DE number 1054960 (Why is no real title available?)
- A cutting plane algorithm for the capacitated arc routing problem
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- A note on two problems in connexion with graphs
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Arc Routing Problems, Part II: The Rural Postman Problem
- Capacitated arc routing problems
- Competitive memetic algorithms for arc routing problems
- Cut-first branch-and-price-second for the capacitated arc-routing problem
- Exact methods based on node-routing formulations for undirected arc-routing problems
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Improved bounds for large scale capacitated arc routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Large scale evolutionary optimization using cooperative coevolution
- New large-scale data instances for CARP and new variations of CARP
- Node, edge, arc routing and turn penalties: multiple problems -- one neighborhood extension
- POPMUSIC for a real-world large-scale vehicle routing problem with time windows
- Solving capacitated arc routing problems using a transformation to the CVRP
- The Capacitated Arc Routing Problem: Lower bounds
- The fleet size and mix problem for capacitated arc routing
Cited in
(1)
This page was built for publication: Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2123554)
