6533b7d7fe1ef96bd1268fca

RESEARCH PRODUCT

New Heuristic Algorithms for the Windy Rural Postman Problem

José M. SanchisIsaac PlanaÁNgel CorberánEstefanía PiñanaEnrique Benavent

subject

Arc routingMathematical optimizationGeneral Computer ScienceHeuristic (computer science)MetaheuristicsManagement Science and Operations ResearchRural postman problemSearch algorithmModeling and SimulationHeuristicsHeuristicsWindy rural postman problemMATEMATICA APLICADAArc routingAlgorithmMathematics

description

[EN] 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. (c) 2004 Elsevier Ltd. All rights reserved.

yearjournalcountryeditionlanguage
2005-12-01
10.1016/j.cor.2004.04.007http://hdl.handle.net/10251/94488