Two composite methods for soft drink distribution problem

In this paper, we propose two methods for solving a real-life soft drink distribution problem. The objective of this problem is to minimize the total number of vehicles used. The proposed methods are composite procedures involving the solution of bin packing problems, and the application of an assignment-based procedure or a generalized crossing procedure, respectively for improvement. We apply the proposed composite procedures to a number of real-life problem instances. The computational results show that our methods are able to obtain better solutions than the methods proposed in the literature.

[1]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[2]  P.J.M. van Laarhoven,et al.  Theoretical and Computational Aspects of Simulated Annealing. , 1990 .

[3]  Alan Mercer,et al.  A tabu search algorithm for the multi-trip vehicle routing and scheduling problem , 1997, Eur. J. Oper. Res..

[4]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[5]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[6]  H. L. Ong,et al.  A generalized crossing local search method for solving vehicle routing problems , 2007, J. Oper. Res. Soc..

[7]  Nicos Christofides,et al.  Vehicle routing with a sparse feasibility graph , 1997 .

[8]  Cheng-Fa Tsai,et al.  A new and efficient ant-based heuristic method for solving the traveling salesman problem , 2003, Expert Syst. J. Knowl. Eng..

[9]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[10]  Mária Lucká,et al.  Parallel Ant Systems for the Capacitated Vehicle Routing Problem , 2004, EvoCOP.

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

[12]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[13]  Richard F. Hartl,et al.  SavingsAnts for the Vehicle Routing Problem , 2002, EvoWorkshops.

[14]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

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

[16]  Roger L. Wainwright,et al.  Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms , 1993, ICGA.

[17]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[18]  Michel Gendreau,et al.  Vehicle Routeing with Multiple Use of Vehicles , 1996 .

[19]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

[20]  H. L. Ong,et al.  An Assignment-Based Local Search Method for Solving Vehicle Routing Problems , 2005, Asia Pac. J. Oper. Res..

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

[22]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[23]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[24]  Wen-Chyuan Chiang,et al.  A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows , 1997, INFORMS J. Comput..

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