ROUTING AND LOCATION-ROUTING P-DELIVERY MEN PROBLEMS ON A PATH

被引：23

作者：

AVERBAKH, I ^{[1
]}

BERMAN, O ^{[1
]}

机构：

[1] FAC MANAGEMENT TORONTO,TORONTO M5S 1V4,ON,CANADA

来源：

TRANSPORTATION SCIENCE | 1994年 / 28卷 / 02期

关键词：

D O I：

10.1287/trsc.28.2.162

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this note, we discuss routing and location-routing delivery men problems on a path. The objective of the delivery men problem is to find service tours so as to minimize the total waiting time of all customers. We present an O(n2) time algorithm for the location-routing problem with a single server. This algorithm is further used in polynomial time algorithms that are developed for routing and location-routing problems with p servers. Also considered is the sales-delivery men problem for which in addition to the delivery men criterion, also the traveling salesman criterion (which is of primary importance) is used.

引用

页码：162 / 166

页数：5

共 9 条

[1] THE COMPLEXITY OF THE TRAVELING REPAIRMAN PROBLEM [J].