A Tabu Search Heuristic for the Prize-collecting Rural Postman Problem

Authors:
Guillermo Palma
Affiliations:
Departamento de Computación y Tecnología de la Información, Universidad Simón Bolívar, Caracas, Venezuela
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 13
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Approximation Algorithms for Some Postman Problems

Journal of the ACM (JACM)
Heuristics for the mixed rural postman problem

Computers and Operations Research
Tabu Search

Tabu Search
The Rural Postman Problem on mixed graphs with turn penalties

Computers and Operations Research
A Tabu Search Heuristic for the Capacitated Arc Routing Problem

Operations Research
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation

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

Computers and Operations Research
Privatized rural postman problems

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

Transportation Science
A deterministic tabu search algorithm for the capacitated arc routing problem

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

Transportation Science
The undirected capacitated arc routing problem with profits

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

I present a heuristic based in tabu search, in order to generate feasible solutions for solving the Prize-collecting Rural Postman Problem. This problem was recently defined and is a generalization of other arc routing problems. The numerical results from a series of computational experiments with various types of instances show the good behavior of the proposed algorithm in comparison with previous works.