GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem

Authors:
Julián Aráoz;Elena Fernández;Carles Franquesa
Affiliations:
Statistics and Operations Research Department, Technical University of Catalonia, Barcelona, Spain 08034;Statistics and Operations Research Department, Technical University of Catalonia, Barcelona, Spain 08034;Statistics and Operations Research Department, Technical University of Catalonia, Barcelona, Spain 08034
Venue:
Journal of Heuristics
Year:
2013

Citing 10
Cited 0

Approximation Algorithms for Some Postman Problems

Journal of the ACM (JACM)
Tabu Search

Tabu Search
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation

Operations Research
Privatized rural postman problems

Computers and Operations Research
The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm

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

Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
The Clustered Prize-Collecting Arc Routing Problem

Transportation Science
GRASP and path relinking for the max-min diversity problem

Computers and Operations Research
The undirected capacitated arc routing problem with profits

Computers and Operations Research
The Windy Clustered Prize-Collecting Arc-Routing Problem

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Clustered Prize-collecting Arc Routing Problem is an arc routing problem where each demand edge is associated with a profit which is collected once if the edge is serviced, independently of the number of times it is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced.This paper presents GRASP and Path Relinking heuristics for the Clustered Prize-collecting Arc Routing Problem. For the constructive phase of the GRASP two different strategies are considered. One of them follows a bottom-up style whereas the other one is a top-down procedure. The best solutions obtained with both strategies are used as elite solutions for the Path Relinking. The results of extensive computational experiments are presented and analyzed.