A classification scheme for vehicle routing and scheduling problems

A classification scheme is proposed for a class of models that arise in the area of vehicle routing and scheduling and illustrated on a number of problems that have been considered in the literature. The classification scheme may serve as a first step towards the development of a model and algorithm management system in this area.

[1]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[2]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[3]  G. Laporte,et al.  Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach , 1983 .

[4]  Pitu B. Mirchandani,et al.  Location on networks : theory and algorithms , 1979 .

[5]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[6]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[7]  Louis M. Dalberto,et al.  Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .

[8]  Charlotte Diane Jacobs.  The vehicle routing problem with backhauls , 1987 .

[9]  Jan Karel Lenstra,et al.  Functional description of CAR : an interactive system for computer aided routing , 1987 .

[10]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[11]  B. J. Lageweg,et al.  Computer aided complexity classification of deterministic scheduling problems , 1981 .

[12]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[13]  B. J. Lageweg,et al.  Computer-Aided complexity classification of combinational problems , 1982, CACM.

[14]  Gerald G. Brown,et al.  Real-Time Dispatch of Petroleum Tank Trucks , 1981 .

[15]  Harilaos N. Psaraftis.  Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem , 1983 .

[16]  David Ronen,et al.  Perspectives on practical aspects of truck routing and scheduling , 1988 .

[17]  Moshe Dror,et al.  Routing electric meter readers , 1979, Comput. Oper. Res..

[18]  Gilbert Laporte,et al.  Generalized travelling salesman problem through n sets of nodes: the asymmetrical case , 1987, Discret. Appl. Math..

[19]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.