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

Authors:
Alain Hertz;Michel Mittaz
Affiliations:
-;-
Venue:
Transportation Science
Year:
2001

Citing 0
Cited 21

A tabu search algorithm for the min-max k-Chinese postman problem

Computers and Operations Research
A genetic algorithm for a bi-objective capacitated arc routing problem

Computers and Operations Research
A deterministic tabu search algorithm for the capacitated arc routing problem

Computers and Operations Research
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

Journal of Heuristics
Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration

Computers and Operations Research
A global repair operator for capacitated arc routing problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Improved memetic algorithm for capacitated arc routing problem

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Memetic algorithm with extended neighborhood search for capacitated arc routing problems

IEEE Transactions on Evolutionary Computation
An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

Transportation Science
A guided local search procedure for the multi-compartment capacitated arc routing problem

Computers and Operations Research
Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions

Journal of Heuristics
The undirected capacitated arc routing problem with profits

Computers and Operations Research
An evolutionary approach to the multidepot capacitated arc routing problem

IEEE Transactions on Evolutionary Computation
A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs

Computers and Industrial Engineering
The open capacitated arc routing problem

Computers and Operations Research
BRKGA Algorithm for the Capacitated Arc Routing Problem

Electronic Notes in Theoretical Computer Science (ENTCS)
An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem

Computers and Operations Research
An approximate ε-constraint method for the multi-objective undirected capacitated arc routing problem

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints

Transportation Science
The double layer optimization problem to express logistics systems and its heuristic algorithm

Expert Systems with Applications: An International Journal
GRASP with evolutionary path-relinking for the capacitated arc routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The undirected capacitated arc routing problem (CARP) arises naturally in several applications where streets require maintenance, or customers located along road must be serviced. Basic algorithmic procedures have recently been developed for the design of heuristics in an arc routing context. This article reports on the use of these basic tools in a variable neighborhood descent algorithm for the solution of the undirected CARP.