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, Luc Muyldermans, Dirk G. Cattrysse, Dirk D. L. van Oudheusden
Publication date: 19 May 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (44)
Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition ⋮ The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem ⋮ Approximation algorithms for solving the constrained arc routing problem in mixed graphs ⋮ An efficiency-based path-scanning heuristic for the capacitated arc routing problem ⋮ A guided local search metaheuristic for the team orienteering problem ⋮ 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 ⋮ Location-arc routing problem: heuristic approaches and test instances ⋮ An improved multi-objective framework for the rich arc routing problem ⋮ Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ Effects of update frequencies in a dynamic capacitated arc routing problem ⋮ Two phased hybrid local search for the periodic capacitated arc routing problem ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ Instance-specific multi-objective parameter tuning based on fuzzy logic ⋮ An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances ⋮ Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ Crossover iterated local search for SDCARP ⋮ A deterministic tabu search algorithm for the capacitated arc routing problem ⋮ A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem ⋮ A Decade of Capacitated Arc Routing ⋮ A variable neighborhood search for the capacitated arc routing problem with intermediate facilities ⋮ Combinatorial optimization and green logistics ⋮ Iterated local search and column generation to solve arc-routing as a permutation set-covering problem ⋮ Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm ⋮ Combinatorial optimization and green logistics ⋮ Evolutionary algorithms for periodic arc routing problems ⋮ A guided local search procedure for the multi-compartment capacitated arc routing problem ⋮ 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 ⋮ The open capacitated arc routing problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ A variable neighborhood descent algorithm for a real waste collection problem with mobile depots ⋮ Tour splitting algorithms for vehicle routing problems ⋮ A survey of models and algorithms for winter road maintenance. I: System design for spreading and plowing ⋮ Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration ⋮ 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
This page was built for publication: A guided local search heuristic for the capacitated arc routing problem
