New heuristic algorithms for the windy rural postman problem

Authors:
Enrique Benavent;Angel Corberán;Estefanía Piñana;Isaac Plana;José M. Sanchis
Affiliations:
Departmento d'Estadística i Investigació Operativa, Universitat de València, Dr. Moliner 50, Burjassot, Valencia 46100, Spain;Departmento d'Estadística i Investigació Operativa, Universitat de València, Dr. Moliner 50, Burjassot, Valencia 46100, Spain;Departmento d'Estadística i Investigació Operativa, Universitat de València, Dr. Moliner 50, Burjassot, Valencia 46100, Spain;Departmento d'Estadística i Investigació Operativa, Universitat de València, Dr. Moliner 50, Burjassot, Valencia 46100, Spain;Departmento de Matemática Aplicada, Universidad Politécnica de Valencia, Spain
Venue:
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Year:
2005

Citing 7
Cited 2

On the windy postman problem on Eulerian graphs

Mathematical Programming: Series A and B
A cutting plane algorithm for the windy postman problem

Mathematical Programming: Series A and B
Algorithms for the windy postman problem

Computers and Operations Research
Approximation Algorithms for Some Postman Problems

Journal of the ACM (JACM)
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
The Chinese Postman Problem for Mixed Graphs

WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
Improvement Procedures for the Undirected Rural Postman Problem

INFORMS Journal on Computing

A new view on rural postman based on eulerian extension and matching

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
A new view on Rural Postman based on Eulerian Extension and Matching

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented.