The team orienteering problem

被引：404

作者：

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(94)00289-4

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In the team orienteering problem, start and end points are specified along with other locations which have associated scores. Given a fixed amount of time for each of the M members of the team, the goal is to determine M paths from the start point to the end point through a subset of locations in order to maximize the total score. In this paper, a fast and effective heuristic is presented and tested on 353 problems ranging in size from 21 to 102 points. The computational results are presented in detail.

引用

页码：464 / 474

页数：11

共 9 条

[1]

[Anonymous], THESIS U MARYLAND CO

[2]

BUTT SE, 1992, HEURISTIC MULTIPLE T

[3] A fast and effective heuristic for the orienteering problem [J].

Chao, IM ;

Golden, BL ;

Wasil, EA .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (03) :475-489

[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] COMPUTER SOLUTIONS OF TRAVELING SALESMAN PROBLEM [J].

LIN, S .

BELL SYSTEM TECHNICAL JOURNAL, 1965, 44 (10) :2245-+

[9] HEURISTIC METHODS APPLIED TO ORIENTEERING [J].

TSILIGIRIDES, T .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1984, 35 (09) :797-809

← 1 →