ON THE DISTANCE CONSTRAINED VEHICLE-ROUTING PROBLEM

被引：82

作者：

LI, CL

SIMCHILEVI, D

DESROCHERS, M

机构：

[1] GERAD,MONTREAL,QUEBEC,CANADA

[2] ECOLE POLYTECH,MONTREAL H3C 3A7,QUEBEC,CANADA

[3] COLUMBIA UNIV,IND ENGN & OPERAT RES,NEW YORK,NY 10027

来源：

OPERATIONS RESEARCH | 1992年 / 40卷 / 04期

关键词：

D O I：

10.1287/opre.40.4.790

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We analyze the vehicle routing problem with constraints on the total distance traveled by each vehicle. Two objective functions are considered: minimize the total distance traveled by vehicles and minimize the number of vehicles used. We demonstrate a close relationship between the optimal solutions for the two objective functions and perform a worst case analysis for a class of heuristics. We present a heuristic that provides a good worst case result when the number of vehicles used is relatively small.

引用

页码：790 / 799

页数：10

共 17 条

[1] HEURISTICS FOR UNEQUAL WEIGHT DELIVERY PROBLEMS WITH A FIXED ERROR GUARANTEE [J].