Title of article
New heuristic algorithms for the windy rural postman problem
Author/Authors
Enrique Benavent، نويسنده , , Angel Corber?n، نويسنده , , Estefan?a Pinan، نويسنده , , Isaac Plan، نويسنده , , José M. Sanchis، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2005
Pages
18
From page
3111
To page
3128
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.
Keywords
Heuristics , Metaheuristics , Arc routing , Windy rural postman problem , Rural Postman Problem
Journal title
Computers and Operations Research
Serial Year
2005
Journal title
Computers and Operations Research
Record number
928324
Link To Document