A Bio-Inspired Discrete Firefly Algorithm to Solve a Rich Vehicle Routing Problem Modeling a Newspaper Distribution Problem with Recycling Policy

A real-world newspaper distribution problem with recycling policy is tackled in this work. In order to meet all the complex restrictions contained in such a problem, it has been modeled as a rich vehicle routing problem, which can be more specifically considered as an asymmetric and clustered vehicle routing problem with simultaneous pickup and deliveries, variable costs and forbidden paths (AC-VRP-SPDVCFP). This is the first study of such a problem in the literature. For this reason, a benchmark composed by 15 instances has been also proposed. In the design of this benchmark, real geographical positions have been used, located in the province of Bizkaia, Spain. For the proper treatment of this AC-VRP-SPDVCFP, a discrete firefly algorithm (DFA) has been developed. This application is the first application of a firefly algorithm to any rich vehicle routing problem. To prove that the proposed DFA is a promising technique, its performance has been compared with two other well-known techniques: an evolutionary algorithm and an evolutionary simulated annealing. Our results have shown that the DFA has outperformed these two classic meta-heuristics.

[1]  Jakub Nalepa,et al.  Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows , 2016, Soft Comput..

[2]  Xiaodong Li,et al.  A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows , 2015, Comput. Oper. Res..

[3]  Fred W. Glover,et al.  A tabu search algorithm for cohesive clustering problems , 2015, J. Heuristics.

[4]  Yuxin Zhao,et al.  Navigability analysis of magnetic map with projecting pursuit-based selection method by using firefly algorithm , 2015, Neurocomputing.

[5]  Jésica de Armas,et al.  GVNS for a real-world Rich Vehicle Routing Problem with Time Windows , 2015, Eng. Appl. Artif. Intell..

[6]  Thomas Hahn,et al.  Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints , 2015, Eur. J. Oper. Res..

[7]  Panos M. Pardalos,et al.  Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups , 2015, Expert Syst. Appl..

[8]  Chao Wang,et al.  A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows , 2015, Comput. Ind. Eng..

[9]  Abhishek Bhatia,et al.  Disk scheduling using a customized discrete firefly algorithm , 2015 .

[10]  Gilbert Laporte,et al.  A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia☆ , 2015 .

[11]  Nur Evin Özdemirel,et al.  Ant Colony Optimization based clustering methodology , 2015, Appl. Soft Comput..

[12]  Frédéric Semet,et al.  Rich vehicle routing problems: From a taxonomy to a definition , 2015, Eur. J. Oper. Res..

[13]  Angel A. Juan,et al.  Rich Vehicle Routing Problem , 2014, ACM Comput. Surv..

[14]  Pedro Amorim,et al.  A rich vehicle routing problem dealing with perishable food: a case study , 2014 .

[15]  Thibaut Vidal,et al.  Hybrid metaheuristics for the Clustered Vehicle Routing Problem , 2014, Comput. Oper. Res..

[16]  Angel A. Juan,et al.  Solving vehicle routing problems with asymmetric costs and heterogeneous fleets , 2014, Int. J. Adv. Oper. Manag..

[17]  Daniele Vigo,et al.  Exact Algorithms for the Clustered Vehicle Routing Problem , 2014, Oper. Res..

[18]  Janez Brest,et al.  A comprehensive review of firefly algorithms , 2013, Swarm Evol. Comput..

[19]  Michel Gendreau,et al.  Heuristics for multi-attribute vehicle routing problems: A survey and synthesis , 2013, Eur. J. Oper. Res..

[20]  Karl F. Doerner,et al.  A heuristic algorithm for the free newspaper delivery problem , 2013, Eur. J. Oper. Res..

[21]  Andrew Lim,et al.  A memetic algorithm for the multiperiod vehicle routing problem with profit , 2013, Eur. J. Oper. Res..

[22]  Michel Gendreau,et al.  A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems , 2012, Oper. Res..

[23]  Suyanto,et al.  Evolutionary Discrete Firefly Algorithm for Travelling Salesman Problem , 2011, ICAIS.

[24]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[25]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[26]  Wout Dullaert,et al.  A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows , 2010, Comput. Oper. Res..

[27]  Xin-She Yang,et al.  Firefly Algorithms for Multimodal Optimization , 2009, SAGA.

[28]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[29]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[30]  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..

[31]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[32]  Ali Haghani,et al.  A dynamic vehicle routing problem with time-dependent travel times , 2005, Comput. Oper. Res..

[33]  Guy Desaulniers,et al.  The shortest path problem with forbidden paths , 2002, Eur. J. Oper. Res..

[34]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[35]  David L. Woodruff,et al.  Solving the medium newspaper production/distribution problem , 1999, Eur. J. Oper. Res..

[36]  Paolo Toth,et al.  A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls , 1999, Eur. J. Oper. Res..

[37]  Bok Sik Yoon,et al.  A two-stage heuristic approach for the newspaper delivery problem , 1996 .

[38]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[39]  Yoh-Han Pao,et al.  Combinatorial optimization with use of guided evolutionary simulated annealing , 1995, IEEE Trans. Neural Networks.

[40]  Bruce L. Golden,et al.  OR Practice - Computerized Vehicle Routing in the Soft Drink Industry , 1987, Oper. Res..

[41]  Gilbert Laporte,et al.  An exact algorithm for the asymmetrical capacitated vehicle routing problem , 1986, Networks.

[42]  James A. Chisman,et al.  The clustered traveling salesman problem , 1975, Comput. Oper. Res..

[43]  Luis Rivera,et al.  RWA: Comparison of Genetic Algorithms and Simulated Annealing in dynamic traffic , 2015 .

[44]  Magdalene Marinaki,et al.  A Memetic Differential Evolution Algorithm for the Vehicle Routing Problem with Stochastic Demands , 2015 .

[45]  Jia-Ching Wang,et al.  An enhanced firefly algorithm to multi-objective optimal active/reactive power dispatch with uncertainties consideration , 2015 .

[46]  Lixin Ding,et al.  A Multi-population Discrete Firefly Algorithm to Solve TSP , 2014, BIC-TA.

[47]  Iztok Fister,et al.  Firefly Algorithm: A Brief Review of the Expanding Literature , 2014 .

[48]  Michel Gendreau,et al.  A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows , 2013, Comput. Oper. Res..

[49]  Philip Kilby,et al.  Vehicle Routing Problem with Time Windows , 2004 .

[50]  Pablo Moscato,et al.  A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.

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

[52]  M. Savelsbergh,et al.  The Inventory Routing Problem , 1998 .

[53]  Ann Melissa Campbell,et al.  4 THE INVENTORY ROUTING PROBLEM , 1998 .

[54]  Arthur P. Hurter,et al.  THE NEWSPAPER PRODUCTION/DISTRIBUTION PROBLEM. , 1996 .

[55]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

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

[57]  Scott Kirkpatrick,et al.  Optimization by Simmulated Annealing , 1983, Sci..

[58]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[59]  Nanthi Suthikarnnarunai,et al.  Strategic Planning and Vehicle Routing Algorithm for Newspaper Delivery Problem : Case study of Morning Newspaper , Bangkok , Thailand , 2022 .