A guided local search heuristic for the capacitated arc routing problem
From MaRDI portal
Publication:1873009
DOI10.1016/S0377-2217(02)00334-XzbMath1026.90015MaRDI QIDQ1873009
Patrick Beullens, Dirk G. Cattrysse, Dirk D. L. van Oudheusden, Luc Muyldermans
Publication date: 19 May 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
A variable neighborhood descent algorithm for a real waste collection problem with mobile depots, Combinatorial optimization and green logistics, A deterministic tabu search algorithm for the capacitated arc routing problem, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, Evolutionary algorithms for periodic arc routing problems, A guided local search metaheuristic for the team orienteering problem, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, Lower and upper bounds for the mixed capacitated arc routing problem, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, A genetic algorithm for a bi-objective capacitated arc routing problem, A survey of models and algorithms for winter road maintenance. I: System design for spreading and plowing, A scatter search for the periodic capacitated arc routing problem, Automatic production planning of press brakes for sheet metal bending
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Routeing winter gritting vehicles
- The capacitated arc routing problem: Valid inequalities and facets
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- Guided local search and its application to the traveling salesman problem
- A cutting plane algorithm for the capacitated arc routing problem
- Capacitated arc routing problems
- The Capacitated Arc Routing Problem: Lower bounds
- Fast Algorithms for Geometric Traveling Salesman Problems
- Improvement Procedures for the Undirected Rural Postman Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- District design for arc-routing applications
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
- A Method for Solving Traveling-Salesman Problems
- Computer Solutions of the Traveling Salesman Problem
