A map-based decision-support system for delivery planning

This paper describes a project to develop a map-based decision-support system for delivery planning in Hong Kong. The system consists of several components, including a map-based interface, bilingual database storing the information of maps and deliveries and some decision support tools for planning the routes of the delivery vehicles in a feasible and cost-effective way. In this paper, we describe (1) the features of the system, (2) the underlying network representation used and (3) two decision-support models, a Time-varying Constrained Shortest Path (TCSP) problem and a Time-dependent Vehicle Routing Problem with Time Windows (TVRPTW) and their corresponding algorithms which have been incorporated into the system. We hope this paper will provide some insights on the techniques and challenges of developing such delivery planning systems.

[1]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[2]  Giorgio Gallo,et al.  Shortest path algorithms , 1988, Handbook of Optimization in Telecommunications.

[3]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[4]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[5]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[6]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[7]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9]  Hani S. Mahmassani,et al.  Dynamic Decision Making for Commercial Fleet Operations Using Real-Time Information , 1996 .

[10]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[11]  F. Benjamin Zhan,et al.  Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

[12]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[13]  Yee Leung,et al.  Intelligent spatial decision support systems , 1997 .

[14]  J. Desrosiers,et al.  Methods for routing with time windows , 1986 .

[15]  W. Garvin,et al.  Applications of Linear Programming in the Oil Industry , 1957 .

[16]  M. Batty,et al.  Spatial Analysis: Modelling in a GIS Environment , 1998 .

[17]  Q Lau Liu.  AN EFFICIENT NEAR-EXACT ALGORITHM FOR LARGE-SCALE VEHICLE ROUTING WITH TIME WINDOWS , 1998 .

[18]  Ronald Prescott Loui,et al.  Optimal paths in graphs with stochastic or multidimensional weights , 1983, Commun. ACM.

[19]  Vidyadhar G. Kulkarni,et al.  Shortest paths in stochastic networks with ARC lengths having discrete distributions , 1993, Networks.

[20]  Ming S. Hung,et al.  A computational study of efficient shortest path algorithms , 1988, Comput. Oper. Res..

[21]  Gilbert Laporte,et al.  Operations Research and Decision Aid Methodologies in Traffic and Transportation Management , 1998, NATO ASI Series.

[22]  Ming-Der May,et al.  On-Line Vehicle Routing with Time Windows: Optimization-Based Heuristics Approach for Freight Demands Requested in Real-Time , 1998 .

[23]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[24]  Fred W. Glover,et al.  A New Polynomially Bounded Shortest Path Algorithm , 1985, Oper. Res..

[25]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[26]  Peter B. Keenan.  Spatial decision support systems for vehicle routing , 1998, Decis. Support Syst..

[27]  Fred W. Glover,et al.  Computational study of an improved shortest path algorithm , 1984, Networks.

[28]  Warren B. Powell,et al.  Stochastic and dynamic networks and routing , 1995 .

[29]  Hani S. Mahmassani,et al.  On-Line Algorithms for Truck Fleet Assignment and Scheduling Under Real-Time Information , 1999 .

[30]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[31]  J. Desrosiers,et al.  Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows , 1988 .