ROUTING AND SCHEDULING COAST GUARD BUOY TENDERS

被引：6

作者：

CLINE, AK ^{[1
]}

KING, DH ^{[1
]}

MEYERING, JM ^{[1
]}

机构：

[1] DH KING MATKOWSKI & ASSOCIATES,W VANCOUVER V7V 1N6,BC,CANADA

来源：

INTERFACES | 1992年 / 22卷 / 03期

关键词：

D O I：

10.1287/inte.22.3.56

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We applied a best-schedule heuristic for solving a large class of real-world routing and scheduling problems to the routing and scheduling of buoy maintenance in real time by the United States Coast Guard. The best schedule method reduces a routing and scheduling problem to a traveling salesman problem with non-Euclidean distances. The service windows for the activities are used to prune potential routes without calculating a detailed schedule or evaluating the cost function.

引用

页码：56 / 72

页数：17

共 8 条

[1] TRAVELING SALESMAN PROBLEM - A SURVEY [J].

BELLMORE, M ;

NEHAUSE.GL .

OPERATIONS RESEARCH, 1968, 16 (03) :538-&

[2]

BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8

[3] A CONSTRAINED 2-DIMENSIONAL TRIANGULATION AND THE SOLUTION OF CLOSEST NODE PROBLEMS IN THE PRESENCE OF BARRIERS [J].

CLINE, AK ;

RENKA, RJ .

SIAM JOURNAL ON NUMERICAL ANALYSIS, 1990, 27 (05) :1305-1321

[4]

GOLDEN BL, 1988, VEHICLE ROUTING METH, V16

[5]

Lawler E. L., 1985, TRAVELING SALESMAN P

[6]

Reingold E. M., 1977, COMBINATORIAL ALGORI

[7]

Rosenkrantz D. H., 1977, SIAM Journal on Computing, V6, P563, DOI 10.1137/0206041

[8]

Sedgewick R., 1983, ALGORITHMS

← 1 →