A fast and effective heuristic for the orienteering problem

被引：227

作者：

Chao, IM

Golden, BL

Wasil, EA

机构：

[1] UNIV MARYLAND,COLL BUSINESS & MANAGEMENT,COLLEGE PK,MD 20742

[2] CHINESE MIL ACAD,DEPT MATH & MANAGEMENT SCI,FENG SHEN,TAIWAN

[3] AMERICAN UNIV,KOGOD COLL BUSINESS ADM,WASHINGTON,DC 20016

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1996年 / 88卷 / 03期

关键词：

vehicle routing problem; heuristic search;

D O I：

10.1016/0377-2217(95)00035-6

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In the orienteering problem, start and end points are specified along with other locations which have associated scores. Given a fixed amount of time, the goal is to determine a path from the start point to the end point through a subset of locations in order to maximize the total path score. In this paper, a fast and extremely effective heuristic is presented and tested on 67 problems taken from the literature and 40 new test problems. The computational results are presented in detail.

引用

页码：475 / 489

页数：15

共 22 条

[1]

[Anonymous], THESIS U MARYLAND CO

[2] THE PRIZE COLLECTING TRAVELING SALESMAN PROBLEM [J].

BALAS, E .

NETWORKS, 1989, 19 (06) :621-636

[3] The team orienteering problem [J].

Chao, IM ;

Golden, BL ;

Wasil, EA .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (03) :464-474

[4]

Dueck G., 1990, NEW OPTIMIZATION HEU

[5]

GOLDEN B, 1984, LARGE SCALE SYST, V7, P181

[6]

GOLDEN BL, 1987, NAV RES LOG, V34, P307, DOI 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO

[7]

2-D

[8]

GOLDEN BL, 1988, NAV RES LOG, V35, P359, DOI 10.1002/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO

[9]

2-H

[10]

KANTOR MG, 1992, J OPER RES SOC, V43, P629, DOI 10.1057/palgrave.jors.0430608

← 1 2 3 →