A PARALLEL ROUTE BUILDING ALGORITHM FOR THE VEHICLE-ROUTING AND SCHEDULING PROBLEM WITH TIME WINDOWS

被引：266

作者：

POTVIN, JY

ROUSSEAU, JM

机构：

[1] Univ de Montreal, Montreal, Canada

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1993年 / 66卷 / 03期

关键词：

TRANSPORTATION; VEHICLE ROUTING AND SCHEDULING; TIME WINDOWS; HEURISTICS;

D O I：

10.1016/0377-2217(93)90221-8

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper describes an insertion algorithm for the Vehicle Routing and Scheduling Problem with Time Windows (VRSPTW). This algorithm builds routes in parallel and uses a generalized regret measure over all unrouted customers in order to select the next candidate for insertion. Numerical results on the standard set of problems of Solomon are reported as well as comparisons with his sequential algorithm (Solomon, 1987).

引用

页码：331 / 340

页数：10

共 15 条

[1] BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8
[2] Christofides N., 1979, COMBINATORIAL OPTIMI
[3] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS
CLARKE, G
WRIGHT, JW
[J]. OPERATIONS RESEARCH, 1964, 12 (04) : 568 - &
[4] DESROCHERS M, 1990, GERAD G9008 U MONTR
[5] Desrochers M., 1988, VEHICLE ROUTING METH, V16, P65
[6] Martello S., 1981, Operational Research '81. Proceedings of the Ninth IFORS International Conference, P589
[7] SEQUENTIAL ROUTE-BUILDING ALGORITHM EMPLOYING A GENERALIZED SAVINGS CRITERION
MOLE, RH
JAMESON, SR
[J]. OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (02) : 503 - 511
[8] Or I., 1976, THESIS NW U
[9] POTVIN JY, 1990, 729 U MONTR CTR RECH
[10] AN EFFICIENT IMPLEMENTATION OF LOCAL SEARCH ALGORITHMS FOR CONSTRAINED ROUTING-PROBLEMS
SAVELSBERGH, MWP
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 47 (01) : 75 - 85

← 1 2 →