New heuristic algorithms for the windy rural postman problem

被引：13

作者：

Benavent, E

Corberán, A

Piñana, E

Plana, I

Sanchis, JM

机构：

[1] Univ Valencia, Dept Estadist & Invest Operat, E-46100 Valencia, Spain

[2] Univ Politecn Valencia, Dept Matemat Aplicada, E-46071 Valencia, Spain

来源：

COMPUTERS & OPERATIONS RESEARCH | 2005年 / 32卷 / 12期

关键词：

heuristics; metaheuristics; arc routing; rural postman problem; windy rural postman problem;

D O I：

10.1016/j.cor.2004.04.007

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：3111 / 3128

页数：18

共 21 条

[1]

[Anonymous], 2003, Scatter Search: Methodology and Implementations in C

[2]

BENAVENT E, 2003, TR032003 DEIO

[3]

BRUCKER P., 1981, LNCS, V100, P354

[4]

CHRISTOFIDES N, 1986, MATH PROGRAM STUD, V26, P155, DOI 10.1007/BFb0121091