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

DOI10.1287/TRSC.35.4.425.10431zbMATH Open1069.90517OpenAlexW2082593294MaRDI QIDQ4411206FDOQ4411206

Authors: 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

Recommendations

• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• A variable neighborhood search algorithm for the capacitated vehicle routing problem
• An approximation algorithm for the capacitated arc routing problem
• Variants of the capacitated arc routing problem
• The capacitated arc routing problem: exact algorithms
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• Approximate solutions for the capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem

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)

Cited In (33)

• A genetic algorithm for a bi-objective capacitated arc routing problem
• A guided local search procedure for the multi-compartment capacitated arc routing problem
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• Methods for solving road network problems with disruptions
• Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
• Variable neighbourhood search: Methods and applications
• Variable neighbourhood search: methods and applications
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
• An improved multi-objective framework for the rich arc routing problem
• A decade of capacitated arc routing
• A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
• Local search for the undirected capacitated arc routing problem with profits
• Model and methods to address urban road network problems with disruptions
• Combinatorial optimization and green logistics
• The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario
• A hybrid metaheuristic approach for the capacitated arc routing problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• The open capacitated arc routing problem
• The undirected capacitated arc routing problem with profits
• Combinatorial optimization and green logistics
• Recent results on arc routing problems: an annotated bibliography
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• A guided local search heuristic for the capacitated arc routing problem
• Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
• Crossover iterated local search for SDCARP
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman 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
• Two phased hybrid local search for the periodic capacitated arc routing problem
• A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
• Evolutionary algorithms for periodic arc routing problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411206)