article

A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy

Authors:

Enrique Onieva,

Antonio D. Masegosa,

Asier PerallosAuthors Info & Claims

Soft Computing - A Fusion of Foundations, Methodologies and Applications, Volume 21, Issue 18

Pages 5295 - 5308

https://doi.org/10.1007/s00500-016-2114-1

Published: 01 September 2017 Publication History

Abstract

A real-world newspaper distribution problem with recycling policy is tackled in this work. 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 the 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.

References

[1]

Amorim P, Parragh SN, Sperandio F, Almada-Lobo B (2014) A rich vehicle routing problem dealingwith perishable food: a case study. Top 22(2):489-508.

[2]

Archetti C, Doerner KF, Tricoire F (2013) A heuristic algorithm for the free newspaper delivery problem. Eur J Oper Res 230(2):245-257.

[3]

Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE congress on evolutionary computation, pp 4661-4667.

[4]

Battarra M, Erdogan G, Vigo D (2014) Exact algorithms for the clustered vehicle routing problem. Oper Res 62(1):58-71.

Digital Library

[5]

Boonkleaw A, Suthikarnnarunai N, Srinon R (2009) Strategic planning and vehicle routing algorithm for newspaper delivery problem: case study of morning newspaper, Bangkok, Thailand. In: Proceedings of the world congress on engineering and computer science, 2:1067-1071.

[6]

Bortfeldt A, Hahn T, Männel D, Mönch L (2015) Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3d loading constraints. Eur J Oper Res 243(1):82-96.

[7]

Caceres-Cruz J, Arias P, Guimarans D, Riera D, Juan AA (2014) Rich vehicle routing problem: survey. ACM Comput Surv (CSUR) 47(2):32.

[8]

Campbell A, Clarke L, Kleywegt A, Savelsbergh M (1998) The inventory routing problem. In: Fleet management and logistics. Springer, New York, pp 95-113.

[9]

Cao B, Glover F, Rego C (2015) A tabu search algorithm for cohesive clustering problems. J Heurist 21(4):457-477.

Digital Library

[10]

Chisman JA (1975) The clustered traveling salesman problem. Comput Oper Res 2(2):115-119.

[11]

de Armas J, Melián-Batista B, Moreno-Pérez JA, Brito J (2015) Gvns for a real-world rich vehicle routing problem with time windows. Eng Appl Artif Intell 42:45-56.

Digital Library

[12]

De Jong K (1975) Analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Michigan.

[13]

Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3-18.

[14]

Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344(2):243-278.

Digital Library

[15]

Fister I, Fister I Jr, Yang XS, Brest J (2013) A comprehensive review of firefly algorithms. Swarm Evolut Comput 13:34-46.

[16]

Fister I, Yang XS, Fister D, Fister Jr. I (2014) Firefly algorithm: a brief review of the expanding literature. In: Cuckoo search and firefly algorithm. Springer, New York, pp 347-360.

[17]

Geem ZW, Kim JH, Loganathan G (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60-68.

[18]

Glover F (1989) Tabu search, part i. ORSA J Comput 1(3):190-206.

[19]

Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Professional, Boston.

[20]

Golden BL, Wasil EA (1987) Or practice computerized vehicle routing in the soft drink industry. Oper Res 35(1):6-17.

Digital Library

[21]

Haghani A, Jung S (2005) A dynamic vehicle routing problem with time-dependent travel times. Comput Oper Res 32(11):2959-2986.

Digital Library

[22]

Herrero R, Rodríguez A, Cáceres-Cruz J, Juan AA (2014) Solving vehicle routing problems with asymmetric costs and heterogeneous fleets. Int J Adv Oper Manag 6(1):58-80.

[23]

Hurter AP, Van Buer MG (1996) The newspaper production/distribution problem. J Bus Log 17:85-107.

[24]

Inkaya T, Kayaligil S, Özdemirel NE (2015) Ant colony optimization based clustering methodology. Appl Soft Comput 28:301-311.

Digital Library

[25]

Jati GK et al (2011) Evolutionary discrete firefly algorithm for travelling salesman problem, Volume 6943. Springer, New York.

[26]

Kallehauge B, Larsen J, Madsen OB, Solomon MM (2005) Vehicle routing problem with time windows. Springer, New York.

[27]

Kennedy J, Eberhart R et al (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks. Volume 4, Perth, pp 1942-1948.

[28]

Kirkpatrick S, Gellat C, Vecchi M (1983) Optimization by simmulated annealing. Science 220 (4598): 671-680.

[29]

Lahyani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: from a taxonomy to a definition. Eur J Oper Res 241(1):1-14.

[30]

Lahyani R, Coelho LC, Khemakhem M, Laporte G, Semet F (2015) A multi-compartment vehicle routing problem arising in the collection of olive oil in tunisia. Omega 51:1-10.

[31]

Laporte G, Mercure H, Nobert Y (1986) An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16(1):33-46.

[32]

Li J, Pardalos PM, Sun H, Pei J, Zhang Y (2015) Iterated local search embedded adaptive neighborhood selection approach for the multidepot vehicle routing problem with simultaneous deliveries and pickups. Exp Syst Appl 42(7):3551-3561.

Digital Library

[33]

Liang RH, Wang JC, Chen YT, Tseng WT (2015) An enhanced firefly algorithm to multi-objective optimal active/reactive power dispatch with uncertainties consideration. Int J Electr Power Energy Syst 64:1088-1097.

[34]

Marinakis Y, Marinaki M, Spanou P (2015) A memetic differential evolution algorithm for the vehicle routing problem with stochastic demands. In: Adaptation and hybridization in computational intelligence. Springer, New York, pp 185-204.

[35]

Ma Y, Zhao Y, Wu L, He Y, Yang XS (2015) Navigability analysis of magnetic map with projecting pursuit-based selection method by using firefly algorithm. Neurocomputing 159:288-297.

Digital Library

[36]

Montané FAT, Galvao RD (2006) A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput Oper Res 33(3):595-619.

Digital Library

[37]

Moscato P, Cotta C (2003) A gentle introduction tomemetic algorithms. In: Handbook of metaheuristics. Springer, New York, pp 105-144.

[38]

Nagata Y, Bräysy O, Dullaert W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 37(4):724-737.

Digital Library

[39]

Nalepa J, Blocho M (2015a) Co-operation in the parallel memetic algorithm. Int J Parall Progr 43(5):812-839.

Digital Library

[40]

Nalepa J, Blocho M (2015b) Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput.

[41]

Qi Y, Hou Z, Li H, Huang J, Li X (2015) A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows. Compute Oper Res 62:61-77.

Digital Library

[42]

Ree S, Yoon BS (1996) A two-stage heuristic approach for the newspaper delivery problem. Comput Ind Eng 30(3):501-509.

Digital Library

[43]

Rodriguez A, Gutierrez A, Rivera L, Ramirez L (2015) Rwa: comparison of genetic algorithms and simulated annealing in dynamic traffic. In: Advanced computer and communication engineering technology. Springer, New York, pp 3-14.

[44]

Toth P, Vigo D (1999) A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. Eur J Oper Res 113(3):528-543.

[45]

Toth P, Vigo D (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia.

[46]

Van Buer MG, Woodruff DL, Olson RT (1999) Solving the medium newspaper production/distribution problem. Eur J Oper Res 115(2):237-253.

[47]

Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm formultidepot and periodic vehicle routing problems. Oper Res 60(3):611-624.

Digital Library

[48]

Vidal T, Crainic TG, Gendreau M, Prins C (2013) Heuristics for multiattribute vehicle routing problems: a survey and synthesis. Eur J Oper Res 231(1):1-21.

[49]

Vidal T, Crainic TG, Gendreau M, Prins C (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput Oper Res 40(1):475-489.

Digital Library

[50]

Vidal T, Battarra M, Subramanian A, Erdogan G (2014) Hybrid metaheuristics for the clustered vehicle routing problem. Comput Oper Res 58(1):87-99.

[51]

Villeneuve D, Desaulniers G (2005) The shortest path problem with forbidden paths. Eur J Oper Res 165(1):97-107.

[52]

Wang C, Mu D, Zhao F, Sutherland JW (2015) A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows. Comput Ind Eng 83:111-122.

Digital Library

[53]

Yang XS (2009) Firefly algorithms for multimodal optimization. In: Stochastic algorithms: foundations and applications. Springer, New York, pp 169-178.

[54]

Yang XS (2010) A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization. Springer, New York, pp 65-74.

[55]

Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver press, London.

[56]

Yip PP, Pao YH (1995) Combinatorial optimization with use of guided evolutionary simulated annealing. IEEE Trans Neural Netw 6(2):290-295.

Digital Library

[57]

Zhang Z, Che O, Cheang B, Lim A, Qin H (2013) A memetic algorithm for the multiperiod vehicle routing problem with profit. Eur J Oper Res 229(3):573-584.

[58]

Zhou L, Ding L, Qiang X (2014) A multi-population discrete firefly algorithm to solve tsp. In: Bio-inspired computing-theories and applications. Springer, New York, pp 648-653.

[59]

Zouache D, Nouioua F, Moussaoui A (2015) Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems. Soft Comput.

Cited By

Joy GHuyck CYang X(2024)Parameter Tuning of the Firefly Algorithm by Standard Monte Carlo and Quasi-Monte Carlo MethodsComputational Science – ICCS 202410.1007/978-3-031-63775-9_17(242-253)Online publication date: 2-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-63775-9_17
Le TYang X(2023)Generalized Firefly Algorithm for Optimal Transmit BeamformingIEEE Transactions on Wireless Communications10.1109/TWC.2023.332871323:6(5863-5877)Online publication date: 7-Nov-2023
https://dl.acm.org/doi/10.1109/TWC.2023.3328713
Ayyıldız ETaşkın AYıldız AÖzkan C(2022)Artificial neural networks integrated mixed integer mathematical model for multi-fleet heterogeneous time-dependent cash in transit problem with time windowsNeural Computing and Applications10.1007/s00521-022-07659-734:24(21891-21909)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1007/s00521-022-07659-7
Show More Cited By

Index Terms

A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
      1. Heuristic function construction
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Index terms have been assigned to the content through auto-classification.

Recommendations

An improved hybrid firefly algorithm for capacitated vehicle routing problem
Abstract
Firefly algorithm (FA) is a new meta-heuristic which is successfully applied to solve several optimization problems. However, it suffers from a drawback of easily getting stuck at local optima. This paper proposes a new hybrid FA, called CVRP-FA, ...
Highlights
- Hybridized firefly algorithm was introduced for capacitated vehicle routing problem.
- The hybridization enhances the solution quality and speeds up the convergence of FA.
- Better balance between intensification and diversification ...
An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems

Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we ...
Penguins Search Optimization Algorithm to Solve Quadratic Assignment Problem
BDCA'17: Proceedings of the 2nd international Conference on Big Data, Cloud and Applications

This paper presents an application of new metaheuristics, based on the penguins hunting strategy, Penguins search optimization algorithm (PeSOA) for solving one of the most difficult NP-hard combinatorial optimization problems in discret case the ...

Comments

Information & Contributors

Information

Published In

cover image Soft Computing - A Fusion of Foundations, Methodologies and Applications

Soft Computing - A Fusion of Foundations, Methodologies and Applications Volume 21, Issue 18

September 2017

334 pages

ISSN:1432-7643

EISSN:1433-7479

Issue’s Table of Contents

Copyright © Copyright © 2017 Springer-Verlag GmbH Germany.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 September 2017

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Joy GHuyck CYang X(2024)Parameter Tuning of the Firefly Algorithm by Standard Monte Carlo and Quasi-Monte Carlo MethodsComputational Science – ICCS 202410.1007/978-3-031-63775-9_17(242-253)Online publication date: 2-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-63775-9_17
Le TYang X(2023)Generalized Firefly Algorithm for Optimal Transmit BeamformingIEEE Transactions on Wireless Communications10.1109/TWC.2023.332871323:6(5863-5877)Online publication date: 7-Nov-2023
https://dl.acm.org/doi/10.1109/TWC.2023.3328713
Ayyıldız ETaşkın AYıldız AÖzkan C(2022)Artificial neural networks integrated mixed integer mathematical model for multi-fleet heterogeneous time-dependent cash in transit problem with time windowsNeural Computing and Applications10.1007/s00521-022-07659-734:24(21891-21909)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1007/s00521-022-07659-7
RamachandranPillai RArock M(2021)Spiking neural firefly optimization scheme for the capacitated dynamic vehicle routing problem with time windowsNeural Computing and Applications10.1007/s00521-020-04983-833:1(409-432)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1007/s00521-020-04983-8
Soeanu ARay SBerger JBoukhtouta ADebbabi M(2020)Multi-depot vehicle routing problem with risk mitigationExpert Systems with Applications: An International Journal10.1016/j.eswa.2019.113099145:COnline publication date: 1-May-2020
https://dl.acm.org/doi/10.1016/j.eswa.2019.113099
Li QLiu SYang X(2020)Neighborhood information-based probabilistic algorithm for network disintegrationExpert Systems with Applications: An International Journal10.1016/j.eswa.2019.112853139:COnline publication date: 1-Jan-2020
https://dl.acm.org/doi/10.1016/j.eswa.2019.112853
Masegosa AOsaba EAngarita-Zapata JLaña ISer JAuger AStützle T(2019)Nature-inspired metaheuristics for optimizing information dissemination in vehicular networksProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3319619.3326847(1312-1320)Online publication date: 13-Jul-2019
https://dl.acm.org/doi/10.1145/3319619.3326847
Osaba ESer JPanizo ACamacho DGalvez AIglesias AAuger AStützle T(2019)Combining bio-inspired meta-heuristics and novelty search for community detection over evolving graph streamsProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3319619.3326831(1329-1335)Online publication date: 13-Jul-2019
https://dl.acm.org/doi/10.1145/3319619.3326831
Zhao XLiu JCai BLu DWang J(2019)Research on Optimized Pseudolite Constellation Design under Constrained GNSS Environment in Railway Stations2019 IEEE Intelligent Transportation Systems Conference (ITSC)10.1109/ITSC.2019.8917070(3475-3481)Online publication date: 27-Oct-2019
https://dl.acm.org/doi/10.1109/ITSC.2019.8917070
Song MLi JHan YZheng Z(2019)Solving the vehicle routing problem with time window by using an improved brain strom optimization2019 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC.2019.8790285(1306-1313)Online publication date: 10-Jun-2019
https://dl.acm.org/doi/10.1109/CEC.2019.8790285
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents