GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows

Authors:
Mohamed Reghioui;Christian Prins;Nacima Labadi
Affiliations:
ICD - OSI, University of Technology of Troyes, 12, Rue Marie Curie, BP 2060, 10010 Troyes, France;ICD - OSI, University of Technology of Troyes, 12, Rue Marie Curie, BP 2060, 10010 Troyes, France;ICD - OSI, University of Technology of Troyes, 12, Rue Marie Curie, BP 2060, 10010 Troyes, France
Venue:
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Year:
2009

Citing 2
Cited 7

Augment-insert algorithms for the capacitated arc routing problem

Computers and Operations Research
Path relinking for the vehicle routing problem

Journal of Heuristics

A Path Relinking approach for the Team Orienteering Problem

Computers and Operations Research
A GRASP with evolutionary path relinking for the truck and trailer routing problem

Computers and Operations Research
Path-relinking intensification methods for stochastic local search algorithms

Journal of Heuristics
Development and assessment of the SHARP and RandSHARP algorithms for the arc routing problem

AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem

Journal of Heuristics
The double layer optimization problem to express logistics systems and its heuristic algorithm

Expert Systems with Applications: An International Journal
Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

A greedy randomized adaptive search procedure with path relinking is presented for the capacitated arc routing problem with time windows. Contrary to the vehicle routing problem with time windows, this problem received little attention. Numerical experiments indicate that the proposed metaheuristic is competitive with the best published algorithms: on a set of 24 instances, it reaches the optimum 17 times and improves the best-known solution 5 times, including 4 new optima.