AN INTELLIGENT SOLUTION SYSTEM FOR A VEHICLE ROUTING PROBLEM IN URBAN DISTRIBUTION

In this paper, we present an intelligent solution system for a vehicle routing problem (VRP) with rigid time window in urban distribution. The solution has three stages. The first stage uses Clustering Analysis in Data Mining to classify all customers by a number of attributes, such as distance, demand level, the density of customer, and city layout. The second stage introduces how to generate feasible routing schemes for each vehicle type. Specifically, a depth-first search algorithm with control rules is presented to generate feasible routing schemes. In the last stage, an integer programming model is constructed to identify the optimal routing schemes. Finally, we present a real VRP case to show that the approach and the system are efficient and provide a new way to solve the VRP problems with time-windows. Keywords: Vehicle routing problem (VRP), Artificial intelligence (AI), Routing schemes, Urban distribution

[1]  Manuel Laguna.  Implementing and testing the tabu cycle and conditional probability methods , 2006, Comput. Oper. Res..

[2]  Abdel Elah Al-Ayyoub,et al.  Heuristic search revisited , 2000, J. Syst. Softw..

[3]  Mohamed Barkaoui,et al.  A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem , 2003, GECCO.

[4]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..

[5]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[6]  Hu Xiang.  Intelligent operations research and real-time optimal control for dynamic systems , 2002 .

[7]  Jatinder N. D. Gupta,et al.  Local search heuristics for two-stage flow shop problems with secondary criterion , 2002, Comput. Oper. Res..

[8]  G. Gowrisankaran,et al.  Efficient representation of state spaces for some dynamic models , 1999 .

[9]  Jacques Renaud,et al.  A sweep-based algorithm for the fleet size and mix vehicle routing problem , 2002, Eur. J. Oper. Res..

[10]  Peter G. Harrison,et al.  A probabilistic dynamic technique for the distributed generation of very large state spaces , 2000, Perform. Evaluation.

[11]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

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

[13]  B. Gillett,et al.  Multi-terminal vehicle-dispatch algorithm , 1976 .

[14]  Rasmus Lutzhøft.  A set partitioning based heuristic for the VRPTW , 2004 .

[15]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[16]  Chuda Basnet,et al.  Heuristics for vehicle routing on tree-like networks , 1999, J. Oper. Res. Soc..

[17]  Richard W. Eglese,et al.  The grocery superstore vehicle scheduling problem , 2005, J. Oper. Res. Soc..

[18]  Fermín Alfredo Tang Montané,et al.  A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service , 2006, Comput. Oper. Res..

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Christos D. Tarantilis,et al.  Solving the vehicle routing problem with adaptive memory programming methodology , 2005, Comput. Oper. Res..

[21]  Rubén Ruiz,et al.  A decision support system for a real vehicle routing problem , 2004, Eur. J. Oper. Res..