Artificial bee colony algorithm with scanning strategy for the periodic vehicle routing problem

The periodic vehicle routing problem (PVRP) is an extension of the vehicle routing problem (VRP). Because it extends the single delivery period to a T-day period (T > 1), PVRP has strong theoretical and practical significance. Since PVRP is an embedded VRP, it is more complex and difficult compared with the general VRP. In this paper, the bee colony algorithm is used to solve the PVRP. To improve the performance of this algorithm, multidimensional heuristic information and a local optimization based on a scanning strategy are used. At the end of this paper, the algorithm is tested by some well-known examples. The results show that the proposed improved bee colony algorithm is a powerful tool for solving the PVRP. It also shows that these two kinds of strategies can significantly improve the performance of the algorithm.

[1]  Giuseppe Paletta,et al.  A multiperiod traveling salesman problem: Heuristic algorithms , 1992, Comput. Oper. Res..

[2]  R. Tavakkoli-Moghaddam,et al.  A simple and effective heuristic for periodic vehicle routing problem , 2008, 2008 IEEE International Conference on Industrial Engineering and Engineering Management.

[3]  B. Yu,et al.  A parallel improved ant colony optimization for multi-depot vehicle routing problem , 2011, J. Oper. Res. Soc..

[4]  Tracy Warbrick,et al.  Scanning strategies for simultaneous EEG-fMRI evoked potential studies at 3 T. , 2008, International journal of psychophysiology : official journal of the International Organization of Psychophysiology.

[5]  Bin Yu,et al.  Transit route network design-maximizing direct and transfer demand density , 2012 .

[6]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[7]  Buyang Cao,et al.  Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: Optimizing Periodic Maintenance Operations for Schindler Elevator Corporation , 2003, Interfaces.

[8]  Alok Singh,et al.  An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem , 2009, Appl. Soft Comput..

[9]  Giuseppe Paletta,et al.  The period traveling salesman problem: a new heuristic algorithm , 2002, Comput. Oper. Res..

[10]  Shan Li,et al.  Real-time partway deadheading strategy based on transit service reliability assessment , 2012 .

[11]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[12]  Robert A. Russell,et al.  A multiphase approach to the period routing problem , 1991, Networks.

[13]  Chia-Ho Chen,et al.  AN IMPROVED ANT COLONY SYSTEM ALGORITHM FOR THE VEHICLE ROUTING PROBLEM , 2006 .

[14]  Bin Yu,et al.  An ant colony optimization model: The period vehicle routing problem with time windows , 2011 .

[15]  S. Mohan,et al.  TRANSIT ROUTE NETWORK DESIGN USING FREQUENCY CODED GENETIC ALGORITHM , 2003 .

[16]  Michal Tzur,et al.  The Period Vehicle Routing Problem with Service Choice , 2006, Transp. Sci..

[17]  Roberto Baldacci,et al.  A multi-depot period vehicle routing problem arising in the utilities sector , 1998, J. Oper. Res. Soc..

[18]  Mouloud Koudil,et al.  Using artificial bees to solve partitioning and scheduling problems in codesign , 2007, Appl. Math. Comput..

[19]  Lale Özbakir,et al.  Bees algorithm for generalized assignment problem , 2010, Appl. Math. Comput..

[20]  Susana Baptista,et al.  A period vehicle routing case study , 2002, Eur. J. Oper. Res..

[21]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[22]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[23]  T. Seeley.  The Wisdom of the Hive , 1995 .

[24]  Dalessandro Soares Vianna,et al.  An asynchronous parallel metaheuristic for the period vehicle routing problem , 2001, Future Gener. Comput. Syst..

[25]  Rui Carvalho Oliveira,et al.  An Experimental Study of the Ant Colony System for the Period Vehicle Routing Problem , 2004, ANTS Workshop.

[26]  Bruce L. Golden,et al.  An improved heuristic for the period vehicle routing problem , 1995, Networks.

[27]  Luca Bertazzi,et al.  An improved heuristic for the period traveling salesman problem , 2004, Computers & Operations Research.