A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem

DOI10.1287/TRSC.35.4.425.10431zbMath1069.90517OpenAlexW2082593294MaRDI QIDQ4411206

Alain Hertz, Michel Mittaz

Publication date: 2001

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.35.4.425.10431

zbMATH Keywords

heuristicsmaintenancerouting problemdescent algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Traffic problems in operations research (90B20)

Related Items (30)

A hybrid metaheuristic approach for the capacitated arc routing problem ⋮ GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ 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 ⋮ Model and methods to address urban road network problems with disruptions ⋮ Two phased hybrid local search for the periodic capacitated arc routing problem ⋮ 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 ⋮ Methods for solving road network problems with disruptions ⋮ 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 ⋮ Variable neighbourhood search: methods and applications ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ The undirected capacitated arc routing problem with profits ⋮ 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 ⋮ 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 ⋮ Variable neighbourhood search: Methods and applications ⋮ A variable neighborhood descent algorithm for a real waste collection problem with mobile depots ⋮ Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration

This page was built for publication: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem