An intelligent zone-based delivery scheduling approach

This paper introduces a zone-based delivery scheduling approach developed using artificial intelligence techniques. In this approach, delivery scheduling is conducted at three different levels: (1) classification of past delivery demand patterns and prediction of future delivery demand using a multi-level pattern clustering and matching method, (2) creation of delivery zones, including their center locations, delivery frequencies, and delivery cost rates, for each of these delivery demand patterns, and (3) identification of the optimal delivery methods, sequence, and timing parameters of delivery tasks. The system was implemented using Smalltalk, an object oriented programming language.

[1]  Geoffrey Zweig An Effective Tour Construction and Improvement Procedure for the Traveling Salesman Problem , 1995, Oper. Res..

[2]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[3]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[4]  James C. Bean,et al.  A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem , 1991, Oper. Res..

[5]  Bezalel Gavish,et al.  An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems , 1986, Oper. Res..

[6]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[7]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[8]  H. Wang,et al.  A fuzzy mathematics based optimal delivery scheduling approach , 2001, Comput. Ind..

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  Bezalel Gavish,et al.  Parallel Savings Based Heuristics for the Delivery Problem , 1991, Oper. Res..

[11]  T. Liebling,et al.  Probabilistic exchange algorithms and Euclidean traveling salesman problems , 1986 .

[12]  V. Cerný Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[13]  Gilbert Laporte,et al.  A tabu search heuristic for the multi-depot vehicle routing problem , 1996, Comput. Oper. Res..

[14]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[15]  M. Fischetti,et al.  A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs , 1994, Oper. Res..

[16]  Bernard Horan,et al.  Smalltalk: an introduction to application development using VisualWorks , 1995 .

[17]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

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

[19]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..