Bee Algorithm for the vehicle routing problems with time windows

The natural honeybee’s behavior has been modelled by researchers to solve optimization problems. This paper introduces the Bee algorithm based on honeybee behavior for the vehicle routing problem with time windows (VRPTW). The algorithm has been tested on Solomon instances. The encoding of the problem and the operations needed to implement algorithm are outlined. Experiments show that on the considered instances, using BA performs almost as well as planning for long-term, while using much less computation time. Overall, computational investigations show that the proposed algorithm is good and promising approach for the VRPTW. Keywords—Foraging behaviour; bee algorithm; vehicle routing problem with time windows.

[1]  Nasser R. Sabar,et al.  A Hybrid Meta-Heuristic Algorithm for Vehicle Routing Problem with Time Windows , 2015, Int. J. Artif. Intell. Tools.

[2]  Salwani Abdullah,et al.  Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows , 2015, PloS one.

[3]  Guo-Jiang Shen,et al.  A Modified Artificial Bee Colony Algorithm for Vehicle Routing Problems with Time Windows , 2012 .

[4]  Ramasamy Panneerselvam,et al.  A Survey on the Vehicle Routing Problem and Its Variants , 2012 .

[5]  Ashita S. Bhagade,et al.  Artificial Bee Colony ( ABC ) Algorithm for Vehicle Routing Optimization Problem , 2012 .

[6]  Duc Truong Pham,et al.  The Bees Algorithm: Modelling foraging behaviour to solve continuous optimization problems , 2009 .

[7]  Zhangcan Huang,et al.  A Hybrid Algorithm for Vehicle Routing Problem with Time Windows , 2008, ISICA.

[8]  Lale Özbakır,et al.  Artificial Bee Colony Algorithm and Its Application to Generalized Assignment Problem , 2007 .

[9]  D.T. Pham,et al.  Application of the Bees Algorithm to the Training of Learning Vector Quantisation Networks for Control Chart Pattern Recognition , 2006, 2006 2nd International Conference on Information & Communication Technologies.

[10]  D.T. Pham,et al.  Optimising Neural Networks for Identification of Wood Defects Using the Bees Algorithm , 2006, 2006 4th IEEE International Conference on Industrial Informatics.

[11]  D. Pham,et al.  THE BEES ALGORITHM, A NOVEL TOOL FOR COMPLEX OPTIMISATION PROBLEMS , 2006 .

[12]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[13]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[14]  Hoong Chuin Lau,et al.  Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..

[15]  Vladimir Vacic,et al.  VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 2014 .

[16]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

[17]  Jürgen Schulze,et al.  A parallel algorithm for the vehicle routing problem with time window constraints , 1999, Ann. Oper. Res..

[18]  C. Moorehead.  All rights reserved , 1997 .

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

[20]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[21]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[22]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .