TIME WINDOW CONSTRAINED ROUTING AND SCHEDULING PROBLEMS

被引：343

作者：

SOLOMON, MM ^{[1
]}

DESROSIERS, J ^{[1
]}

机构：

[1] UNIV MONTREAL, HEC, MONTREAL H3C 3J7, QUEBEC, CANADA

来源：

TRANSPORTATION SCIENCE | 1988年 / 22卷 / 01期

关键词：

DATA PROCESSING - Critical Path Analysis - MATHEMATICAL PROGRAMMING - SCHEDULING - Mathematical Models;

D O I：

10.1287/trsc.22.1.1

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We have witnessed recently the development of a fast growing body of research focused on vehicle routing and scheduling problem structures with time window constraints. This paper surveys the significant advances made for the following classes of routing problems with time windows: the single and multiple traveling salesman problem, the shortest path problem, the minimum spanning tree problem, the generic vehicle routing problems, the pickup and delivery problem including the dial-a-ride problem, the multiperiod vehicle routing problem and the shoreline problem. Some perspectives on future research are presented.

引用

页码：1 / 13

页数：13

共 80 条

[1]

Baker E. K., 1986, American Journal of Mathematical and Management Sciences, V6, P261

[2] AN EXACT ALGORITHM FOR THE TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM [J].