Fast upper and lower bounds for a large‐scale real‐world arc routing problem
From MaRDI portal
Publication:6179706
DOI10.1002/net.22120zbMath1529.90013OpenAlexW4290028320MaRDI QIDQ6179706
Adam N. Letchford, Thu Huong Dang, Burak Boyacı
Publication date: 18 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22120
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Cites Work
- A hybrid metaheuristic approach for the capacitated arc routing problem
- Improved bounds for large scale capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Competitive memetic algorithms for arc routing problems
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- The vehicle routing problem. Latest advances and new challenges.
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Lower bounds for the mixed capacitated arc routing problem
- The fleet size and mix problem for capacitated arc routing
- Routeing winter gritting vehicles
- Visual attractiveness in routing problems: a review
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
- A cutting plane algorithm for the capacitated arc routing problem
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Lower and upper bounds for the mixed capacitated arc routing problem
- Vehicle routing on road networks: how good is Euclidean approximation?
- The capacitated arc routing problem with intermediate facilities
- Vehicle Routing
- Districting for Arc Routing
- Capacitated arc routing problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- District design for arc-routing applications
- Matching, Euler tours and the Chinese postman
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
