Metaheuristic Approaches for the Green Vehicle Routing Problem
DOI:
https://doi.org/10.2298/YJOR211120016MKeywords:
Pollution routing problem, minimization of greenhouse gasses emission, alternative fuel vehicles, recharging stations, sustainabilityAbstract
The green vehicle routing problem (GVRP) is a relatively new topic, which aims to minimize greenhouse gasses (GHG) emissions produced by a fleet of vehicles. Both internal combustion vehicles (ICV) and alternative fuel vehicles (AFV) are considered, dividing GVRP into two separate subclasses: ICV-based GVRP and AFV-based GVRP. In the ICV-based subclass, the environmental aspect comes from the objective function which aims to minimize GHG emissions or fuel usage of ICVs. On the other hand, the environmental aspect of AFV-based GVRP is implicit and comes from using AFVs in transport. Since GVRP is NP-hard, finding the exact solution in a reasonable amount of time is often impossible for larger instances, which is why metaheuristic approaches are predominantly used. The purpose of this study is to detect gaps in the literature and present suggestions for future research in the field. For that purpose, we review recent papers in which GVRP was tackled by some metaheuristic methods and describe algorithm specifics, VRP attributes, and objectives used in them.References
E. E. Agency, “Annual european union greenhouse gas inventory 1990-2018 and inventory report 2020,” 2020. [Online]. Available: https://www.eea.europa.eu/publications/european-union-greenhouse-gas-inventory-2020
IEA, “Global energy & co2 status report 2019,” 2019. [Online]. Available: https://www.iea.org/reports/global-energy-co2-status-report-2019
G. B. Dantzig and J. H. Ramser, “The truck dispatching problem,” Management science, vol. 6, no. 1, pp. 80-91, 1959.
G. Clarke and J. W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,” Operations research, vol. 12, no. 4, pp. 568-581, 1964.
J. K. Lenstra and A. R. Kan, “Complexity of vehicle routing and scheduling problems,” Networks, vol. 11, no. 2, pp. 221-227, 1981.
C. Bazgan, R. Hassin, and J. Monnot, “Approximation algorithms for some vehicle routing problems,” Discrete applied mathematics, vol. 146, no. 1, pp. 27-42, 2005.
S. O. Krumke, S. Saliba, T. Vredeveld, and S. Westphal, “Approximation algorithms for a vehicle routing problem,” Mathematical methods of operations research, vol. 68, no. 2, pp. 333-359, 2008.
C. Lin, K. L. Choy, G. T. Ho, S. H. Chung, and H. Lam, “Survey of green vehicle routing problem: past and future trends,” Expert systems with applications, vol. 41, no. 4, pp. 1118-1138, 2014.
T. Bektaş and G. Laporte, “The pollution-routing problem,” Transportation Research Part B: Methodological, vol. 45, no. 8, pp. 1232-1250, 2011.
S. Erdoğan and E. Miller-Hooks, “A green vehicle routing problem,” Transportation research part E: logistics and transportation review, vol. 48, no. 1, pp. 100-114, 2012.
Y. Park and J. Chae, “A review of the solution approaches used in recent g-vrp (green vehicle routing problem),” International Journal of Advanced Logistics, vol. 3, no. 1-2, pp. 27-37, 2014.
R. Eglese and T. Bektaş, “Chapter 15: Green vehicle routing,” in Vehicle Routing: Problems, Methods, and Applications, Second Edition. SIAM, 2014, pp. 437-458.
S. Zhang, C. K. Lee, H. K. Chan, K. L. Choy, and Z. Wu, “Swarm intelligence applied in green logistics: A literature review,” Engineering Applications of Artificial Intelligence, vol. 37, pp. 154-169, 2015.
E. Marrekchi, W. Besbes, and D. Dhouib, “An overview of the recent solution approaches in the green vehicle routing problem,” Solving Transport Problems: Towards Green Logistics, pp. 115-133, 2019.
T. Erdelić and T. Carić, “A survey on the electric vehicle routing problem: variants and solution approaches,” Journal of Advanced Transportation, vol. 2019, 2019.
G. D. Konstantakopoulos, S. P. Gayialis, and E. P. Kechagias, “Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification,” Operational research, pp. 1-30, 2020.
R. Moghdani, K. Salimifard, E. Demir, and A. Benyettou, “The green vehicle routing problem: A systematic literature review,” Journal of Cleaner Production, vol. 279, p. 123691, 2021.
J. C. Ferreira, M. T. A. Steiner, and O. Canciglieri Junior, “Multi-objective optimization for the green vehicle routing problem: A systematic literature review and future directions,” Cogent Engineering, vol. 7, no. 1, p. 1807082, 2020.
M. Asghari, S. M. J. M. Al-e et al., “Green vehicle routing problem: A state-of-the-art review,” International Journal of Production Economics, vol. 231, p. 107899, 2021.
M. Birattari, L. Paquete, T. Sttüzle, and K. Varrentrapp, “Classification of metaheuristics and design of experiments for the analysis of components,” Teknik Rapor, AIDA-01-05, 2001.
H. Stegherr, M. Heider, and J. Hähner, “Classifying metaheuristics: Towards a unified multi-level classification system,” Natural Computing, pp. 1-17, 2020.
S. Kirkpatrick, C. D. Gelatt Jr, and M. P. Vecchi, “Optimization by simulated annealing,” science, vol. 220, no. 4598, pp. 671-680, 1983.
N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equation of state calculations by fast computing machines,” The journal of chemical physics, vol. 21, no. 6, pp. 1087-1092, 1953.
B. Suman and P. Kumar, “A survey of simulated annealing as a tool for single and multiobjective optimization,” Journal of the operational research society, vol. 57, no. 10, pp. 1143-1160, 2006.
I. H. Osman, “Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem,” Annals of operations research, vol. 41, no. 4, pp. 421-451, 1993.
W.-C. Chiang and R. A. Russell, “Simulated annealing metaheuristics for the vehicle routing problem with time windows,” Annals of Operations Research, vol. 63, no. 1, pp. 3-27, 1996.
K. A. Dowsland and J. Thompson, “Simulated annealing,” Handbook of natural computing, pp. 1623-1655, 2012.
Á. Felipe, M. T. Ortuño, G. Righini, and G. Tirado, “A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges,” Transportation Research Part E: Logistics and Transportation Review, vol. 71, pp. 111-128, 2014.
İ. Küçükoğlu, S. Ene, A. Aksoy, and N. Öztürk, “A memory structure adapted simulated annealing algorithm for a green vehicle routing problem,” Environmental Science and Pollution Research, vol. 22, no. 5, pp. 3279-3297, 2015.
M. M. Solomon, “Algorithms for the vehicle routing and scheduling problems with time window constraints,” Operations research, vol. 35, no. 2, pp. 254-265, 1987.
Y. Xiao and A. Konak, “A simulating annealing algorithm to solve the green vehicle routing & scheduling problem with hierarchical objectives and weighted tardiness,” Applied Soft Computing, vol. 34, pp. 372-388, 2015.
F. Y. Vincent, A. P. Redi, Y. A. Hidayat, and O. J. Wibowo, “A simulated annealing heuristic for the hybrid vehicle routing problem,” Applied Soft Computing, vol. 53, pp. 119-132, 2017.
K. Karagul, Y. Sahin, E. Aydemir, and A. Oral, “A simulated annealing algorithm based solution method for a green vehicle routing problem with fuel consumption,” in Lean and green supply chain management. Springer, 2019, pp. 161-187.
Ç. Koç and I. Karaoglan, “The green vehicle routing problem: A heuristic based exact solution approach,” Applied Soft Computing, vol. 39, pp. 154-164, 2016.
Y. Xiao, Q. Zhao, I. Kaku, and Y. Xu, “Development of a fuel consumption optimization model for the capacitated vehicle routing problem,” Computers & operations research, vol. 39, no. 7, pp. 1419-1431, 2012.
A. Elbouzekri, M. Elhassania, and A. E. H. Alaoui, “A hybrid ant colony system for green capacitated vehicle routing problem in sustainable transport,” J. Theor. Appl. Inf. Technol, vol. 54, no. 2, 2013.
P. Augerat, “Vrp problem instances set a-b-p,” 1995, last accessed 27 July 2017. [Online]. Available: http://vrp.atd-lab.inf.puc-rio.br/index.php/en/
N. Christofides, A. Mingozzi, and P. Toth, “The vehicle routing problem.” Combinatorial Optimization, pp. 315-338, 1979.
N. M. E. Normasari, V. F. Yu, C. Bachtiyar et al., “A simulated annealing heuristic for the capacitated green vehicle routing problem,” Mathematical Problems in Engineering, vol. 2019, 2019.
F. Glover, “Future paths for integer programming and links to artificial intelligence,” Computers & operations research, vol. 13, no. 5, pp. 533-549, 1986.
L. Piniganti, “A survey of tabu search in combinatorial optimization,” 2014.
Y.-J. Kwon, Y.-J. Choi, and D.-H. Lee, “Heterogeneous fixed fleet vehicle routing considering carbon emission,” Transportation Research Part D: Transport and Environment, vol. 23, pp. 81-89, 2013.
S. Lin and B. W. Kernighan, “An effective heuristic algorithm for the traveling-salesman problem,” Operations research, vol. 21, no. 2, pp. 498-516, 1973.
F. Glover, “Tabu search,” Modern Heuristic Techniques for Combinatirial Problems, 1993.
S. Úbeda, J. Faulin, A. Serrano, and F. J. Arcelus, “Solving the green capacitated vehicle routing problem using a tabu search algorithm,” Lecture Notes in Management Science, vol. 6, no. 1, pp. 141-149, 2014.
Y. Niu, Z. Yang, P. Chen, and J. Xiao, “Optimizing the green open vehicle routing problem with time windows by minimizing comprehensive routing cost,” Journal of cleaner production, vol. 171, pp. 962-971, 2018.
M. Barth, T. Younglove, and G. Scora, “Development of a heavy-duty diesel modal emissions and fuel consumption model,” 2005.
R. Kramer, N. Maculan, A. Subramanian, and T. Vidal, “A speed and departure time optimization algorithm for the pollution-routing problem,” European Journal of Operational Research, vol. 247, no. 3, pp. 782-787, 2015.
N. Mladenović and P. Hansen, “Variable neighborhood search,” Computers & operations research, vol. 24, no. 11, pp. 1097-1100, 1997.
P. Hansen, N. Mladenović, R. Todosijević, and S. Hanafi, “Variable neighborhood search: basics and variants,” EURO Journal on Computational Optimization, vol. 5, no. 3, pp. 423-454, 2017.
M. Bruglieri, F. Pezzella, O. Pisacane, and S. Suraci, “A variable neighborhood search branching for the electric vehicle routing problem with time windows,” Electronic Notes in Discrete Mathematics, vol. 47, pp. 221-228, 2015.
P. Hansen, N. Mladenović, and D. Urošević, “Variable neighborhood search and local branching,” Computers & Operations Research, vol. 33, no. 10, pp. 3034-3045, 2006.
M. Yavuz and I. Çapar, “Alternative-fuel vehicle adoption in service fleets: Impact evaluation through optimization modeling,” Transportation Science, vol. 51, no. 2, pp. 480-493, 2017.
A. Imran, S. Salhi, and N. A. Wassan, “A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem,” European Journal of Operational Research, vol. 197, no. 2, pp. 509-518, 2009.
C. D. Tarantilis, C. T. Kiranoudis, and V. S. Vassiliadis, “A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem,” European Journal of Operational Research, vol. 152, no. 1, pp. 148-158, 2004.
M. Affi, H. Derbel, and B. Jarboui, “Variable neighborhood search algorithm for the green vehicle routing problem,” International Journal of Industrial Engineering Computations, vol. 9, no. 2, pp. 195-204, 2018.
A. Montoya, C. Guéret, J. E. Mendoza, and J. G. Villegas, “A multi-space sampling heuristic for the green vehicle routing problem,” Transportation Research Part C: Emerging Technologies, vol. 70, pp. 113-128, 2016.
M. Schneider, A. Stenger, and D. Goeke, “The electric vehicle-routing problem with time windows and recharging stations,” Transportation science, vol. 48, no. 4, pp. 500-520, 2014.
M. Schneider, A. Stenger, and J. Hof, “An adaptive vns algorithm for vehicle routing problems with intermediate stops,” Or Spectrum, vol. 37, no. 2, pp. 353-387, 2015.
X. Ren, H. Huang, S. Feng, and G. Liang, “An improved variable neighborhood search for bi-objective mixed-energy fleet vehicle routing problem,” Journal of Cleaner Production, vol. 275, p. 124155, 2020.
S. Ropke and D. Pisinger, “An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows,” Transportation science, vol. 40, no. 4, pp. 455- 472, 2006.
P. Shaw, “Using constraint programming and local search methods to solve vehicle routing problems,” in International conference on principles and practice of constraint programming. Springer, 1998, pp. 417-431.
D. Pisinger and S. Ropke, “Large neighborhood search,” in Handbook of metaheuristics. Springer, 2010, pp. 399-419.
D. Goeke and M. Schneider, “Routing a mixed fleet of electric and conventional vehicles,” European Journal of Operational Research, vol. 245, no. 1, pp. 81-99, 2015.
M. Keskin and B. Çatay, “Partial recharge strategies for the electric vehicle routing problem with time windows,” Transportation research part C: emerging technologies, vol. 65, pp. 111-127, 2016.
G. Hiermann, J. Puchinger, S. Ropke, and R. F. Hartl, “The electric fleet size and mix vehicle routing problem with time windows and recharging stations,” European Journal of Operational Research, vol. 252, no. 3, pp. 995-1018, 2016.
G. Macrina, G. Laporte, F. Guerriero, and L. D. P. Pugliese, “An energy-efficient greenvehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows,” European Journal of Operational Research, vol. 276, no. 3, pp. 971-982, 2019.
Z. Yu, P. Zhang, Y. Yu, W. Sun, and M. Huang, “An adaptive large neighborhood search for the larger-scale instances of green vehicle routing problem with time windows,” Complexity, vol. 2020, 2020.
M. Dorigo, “Optimization, learning and natural algorithms,” Ph.D. dissertation, Politecnico di Milano, 1992.
M. Dorigo, V. Maniezzo, and A. Colorni, “Positive feedback as a search strategy,” 1991.
--, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 26, no. 1, pp. 29-41, 1996.
M. Dorigo and T. Stützle, Ant colony optimization. Cambridge, MA: MIT Press., 2004.
M. Mavrovouniotis, G. Ellinas, and M. Polycarpou, “Ant colony optimization for the electric vehicle routing problem,” in 2018 IEEE Symposium series on computational intelligence (SSCI). IEEE, 2018, pp. 1234-1241.
T. Stützle and H. H. Hoos, “Max-min ant system,” Future generation computer systems, vol. 16, no. 8, pp. 889-914, 2000.
M. Mavrovouniotis, C. Li, G. Ellinas, and M. Polycarpou, “Parallel ant colony optimization for the electric vehicle routing problem,” in 2019 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, 2019, pp. 1660-1667.
S. Zhang, Y. Gajpal, and S. Appadoo, “A meta-heuristic for capacitated green vehicle routing problem,” Annals of Operations Research, vol. 269, no. 1, pp. 753-771, 2018.
Y. Li, H. Soleimani, and M. Zohal, “An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives,” Journal of cleaner production, vol. 227, pp. 1161-1172, 2019.
V. V. Panicker, R. Vanga, and R. Sridharan, “Ant colony optimisation algorithm for distribution-allocation problem in a two-stage supply chain with a fixed transportation charge,” International journal of production research, vol. 51, no. 3, pp. 698-717, 2013.
S. Zhang, W. Zhang, Y. Gajpal, and S. Appadoo, “Ant colony algorithm for routing alternate fuel vehicles in multi-depot vehicle routing problem,” in Decision science in action. Springer, 2019, pp. 251-260.
W. Zhang, Y. Gajpal, S. Appadoo, Q. Wei et al., “Multi-depot green vehicle routing problem to minimize carbon emissions,” Sustainability, vol. 12, no. 8, p. 3500, 2020.
P. Bhattacharjee, N. Ahmed, M. S. Akbar, and M. S. Habib, “An efficient ant colony algorithm for multi-depot heterogeneous fleet green vehicle routing problem,” in 5th NA International Conference on Industrial Engineering and Operations Management, Detroit, Michigan, USA. IEOM Society International, 2020, pp. 1337-1348.
Y. Li, B. Qian, R. Hu, L.-P. Wu, and B. Liu, “Two-stage algorithm for solving multidepot green vehicle routing problem with time window,” in International Conference on Intelligent Computing. Springer, 2019, pp. 665-675.
Y. Li, M. K. Lim, Y. Tan, Y. Lee, and M.-L. Tseng, “Sharing economy to improve routing for urban logistics distribution using electric vehicles,” Resources, Conservation and Recycling, vol. 153, p. 104585, 2020.
O. Kramer, “Genetic algorithms,” in Genetic algorithm essentials. Springer, 2017, pp. 11-19.
S. Mirjalili, “Evolutionary algorithms and neural networks,” Studies in computational intelligence, vol. 780, 2019.
R. Ayadi, A. E. ElIdrissi, Y. Benadada, and A. E. H. Alaoui, “Evolutionary algorithm for a green vehicle routing problem with multiple trips,” in 2014 International Conference on Logistics Operations Management. IEEE, 2014, pp. 148-154.
E. E. Adiba, E. A. Aahmed, and B. Youssef, “The green capacitated vehicle routing problem: Optimizing of emissions of greenhouse gas,” in 2014 International Conference on Logistics Operations Management. IEEE, 2014, pp. 161-167.
J. Hickman, D. Hassel, R. Joumard, Z. Samaras, and S. Sorenson, “Methodology for calculating transport emissions and energy consumption,” 1999, european Commission, DG VII. Technical report. [Online]. Available: https://trimis.ec.europa.eu/sites/default/files/project/documents/meet.pdf
C.-F. Hsueh, “The green vehicle routing problem with stochastic travel speeds,” in CICTP 2016, 2016, pp. 1-12.
H. Tunga, A. Bhaumik, and S. Kar, “A method for solving bi-objective green vehicle routing problem (g-vrp) through genetic algorithm,” Journal of the Association of Engineers, vol. 1, no. 2, pp. 33-48, 2017.
H. Ismkhan and K. Zamanifar, “Study of some recent crossovers effects on speed and accuracy of genetic algorithm, using symmetric travelling salesman problem,” International Journal of Computer Applications, vol. 80, no. 6, pp. 1-6, 2015.
P. Cooray and T. D. Rupasinghe, “Machine learning-based parameter tuned genetic algorithm for energy minimizing vehicle routing problem,” Journal of Industrial Engineering, vol. 2017, 2017.
P. R. d. O. da Costa, S. Mauceri, P. Carroll, and F. Pallonetto, “A genetic algorithm for a green vehicle routing problem,” Electronic notes in discrete mathematics, vol. 64, pp. 65-74, 2018.
B.-S. Cheung, A. Langevin, and B. Villeneuve, “High performing evolutionary techniques for solving complex location problems in industrial system design,” Journal of Intelligent Manufacturing, vol. 12, no. 5, pp. 455-466, 2001.
G. Hiermann, R. F. Hartl, J. Puchinger, and T. Vidal, “Routing a mix of conventional, plug-in hybrid, and electric vehicles,” European Journal of Operational Research, vol. 272, no. 1, pp. 235-248, 2019.
T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, “A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with timewindows,” Computers & operations research, vol. 40, no. 1, pp. 475-489, 2013.
T. Vidal, T. G. Crainic, M. Gendreau, N. Lahrichi, and W. Rei, “A hybrid genetic algorithm for multidepot and periodic vehicle routing problems,” Operations Research, vol. 60, no. 3, pp. 611-624, 2012.
J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of ICNN’95- international conference on neural networks, vol. 4. IEEE, 1995, pp. 1942-1948.
M. Clerc, Particle swarm optimization. John Wiley & Sons, 2010, vol. 93.
Y. Zhang, S. Wang, and G. Ji, “A comprehensive survey on particle swarm optimization algorithm and its applications,” Mathematical problems in engineering, vol. 2015, 2015.
R. S. Kumar, K. Kondapaneni, V. Dixit, A. Goswami, L. S. Thakur, and M. Tiwari, “Multiobjective modeling of production and pollution routing problem with time window: A selflearning particle swarm optimization approach,” Computers & Industrial Engineering, vol. 99, pp. 29-40, 2016.
C. Li, S. Yang, and T. T. Nguyen, “A self-learning particle swarm optimizer for global optimization problems,” IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 42, no. 3, pp. 627-646, 2011.
K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan, “A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii,” in International conference on parallel problem solving from nature. Springer, 2000, pp. 849-858.
N. Norouzi, M. Sadegh-Amalnick, and R. Tavakkoli-Moghaddam, “Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption,” Optimization Letters, vol. 11, no. 1, pp. 121-134, 2017.
G. Poonthalir and R. Nadarajan, “A fuel efficient green vehicle routing problem with varying speed constraint (f-gvrp),” Expert Systems with Applications, vol. 100, pp. 131- 144, 2018.
G. Poonthalir, R. Nadarajan, and S. Geetha, “Vehicle routing problem with limited refueling halts using particle swarm optimization with greedy mutation operator,” RAIROOperations Research, vol. 49, no. 4, pp. 689-716, 2015.
Y. Wang, K. Assogba, J. Fan, M. Xu, Y. Liu, and H. Wang, “Multi-depot green vehicle routing problem with shared transportation resource: Integration of time-dependent speed and piecewise penalty cost,” Journal of Cleaner Production, vol. 232, pp. 12-29, 2019.
R. Micale, G. Marannano, A. Giallanza, P. Miglietta, G. Agnusdei, and G. La Scalia, “Sustainable vehicle routing based on firefly algorithm and topsis methodology,” Sustainable Futures, vol. 1, p. 100001, 2019.
X.-S. Yang, “Firefly algorithms for multimodal optimization,” in International symposium on stochastic algorithms. Springer, 2009, pp. 169-178.
--, Nature-inspired metaheuristic algorithms. Luniver press, 2010.
Y.-J. Lai, T.-Y. Liu, and C.-L. Hwang, “Topsis for modm,” European journal of operational research, vol. 76, no. 3, pp. 486-500, 1994.
G. Macrina, L. D. P. Pugliese, F. Guerriero, and G. Laporte, “The green mixed fleet vehicle routing problem with partial battery recharging and time windows,” Computers & Operations Research, vol. 101, pp. 183-199, 2019.
J. Andelmin and E. Bartolini, “A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation,” Computers & Operations Research, vol. 109, pp. 43-63, 2019.
--, “An exact algorithm for the green vehicle routing problem,” Transportation Science, vol. 51, no. 4, pp. 1288-1303, 2017.
B. Peng, Y. Zhang, Y. Gajpal, and X. Chen, “A memetic algorithm for the green vehicle routing problem,” Sustainability, vol. 11, no. 21, p. 6055, 2019.
T. C. E. Cheng, B. Peng, and Z. Lü, “A hybrid evolutionary algorithm to solve the job shop scheduling problem,” Annals of Operations Research, vol. 242, no. 2, pp. 223-237, 2016.
A. Giallanza and G. L. Puma, “Fuzzy green vehicle routing problem for designing a three echelons supply chain,” Journal of Cleaner Production, vol. 259, p. 120774, 2020.
F. E. Zulvia, R. Kuo, and D. Y. Nugroho, “A many-objective gradient evolution algorithm for solving a green vehicle routing problem with time windows and time dependency for perishable products,” Journal of Cleaner Production, vol. 242, p. 118428, 2020.
D. M. Utama, D. S. Widodo, M. F. Ibrahim, and S. K. Dewi, “A new hybrid butterfly optimization algorithm for green vehicle routing problem,” Journal of Advanced Transportation, vol. 2020, 2020.
S. Arora and S. Singh, “Butterfly optimization algorithm: a novel approach for global optimization,” Soft Computing, vol. 23, no. 3, pp. 715-734, 2019.
S. K. Dewi and D. M. Utama, “A new hybrid whale optimization algorithm for green vehicle routing problem,” Systems Science & Control Engineering, vol. 9, no. 1, pp. 61-72, 2021.
S. Mirjalili and A. Lewis, “The whale optimization algorithm,” Advances in engineering software, vol. 95, pp. 51-67, 2016.
D. M. Utama, T. A. Fitria, and A. K. Garside, “Artificial bee colony algorithm for solving green vehicle routing problems with time windows,” in Journal of Physics: Conference Series, vol. 1933, no. 1. IOP Publishing, 2021, p. 012043.
D. Karaboga and B. Basturk, “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm,” Journal of global optimization, vol. 39, no. 3, pp. 459-471, 2007.
D. Karaboga et al., “An idea based on honey bee swarm for numerical optimization,” Technical report-tr06, Erciyes university, engineering faculty, computer . . . , Tech. Rep., 2005.
J. C. Ferreira and M. T. A. Steiner, “A bi-objective green vehicle routing problem: a new hybrid optimization algorithm applied to a newspaper distribution,” Journal of Geographic Information System, vol. 13, no. 4, pp. 410-433, 2021.
J. H. Holland, “Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence.” 1975.
Y. Niu, Y. Zhang, Z. Cao, K. Gao, J. Xiao, W. Song, and F. Zhang, “Mimoa: a membraneinspired multi-objective algorithm for green vehicle routing problem with stochastic demands,” Swarm and Evolutionary Computation, vol. 60, p. 100767, 2021.
X. Zhang, J. Li, and L. Zhang, “A multi-objective membrane algorithm guided by the skin membrane,” Natural Computing, vol. 15, no. 4, pp. 597-610, 2016.
L. Wang and J. Lu, “A memetic algorithm with competition for the capacitated green vehicle routing problem,” IEEE/CAA Journal of Automatica Sinica, vol. 6, no. 2, pp. 516-526, 2019.
P. M. Thompson, J. B. Orlin et al., “The theory of cyclic transfers,” 1989.
E. Jabir, V. V. Panicker, and R. Sridharan, “Multi-objective optimization model for a green vehicle routing problem,” Procedia-Social and Behavioral Sciences, vol. 189, pp. 33-39, 2015.
S. Ene, İ. Küçükoğlu, A. Aksoy, and N. Öztürk, “A hybrid metaheuristic algorithm for the green vehicle routing problem with a heterogeneous fleet,” International Journal of Vehicle Design, vol. 71, no. 1-4, pp. 75-102, 2016.
Y. Suzuki, “A dual-objective metaheuristic approach to solve practical pollution routing problem,” International Journal of Production Economics, vol. 176, pp. 143-153, 2016.
E. Jabir, V. V. Panicker, and R. Sridharan, “Design and development of a hybrid ant colony-variable neighbourhood search algorithm for a multi-depot green vehicle routing problem,” Transportation Research Part D: Transport and Environment, vol. 57, pp. 422- 457, 2017.
Y. Xiao and A. Konak, “A genetic algorithm with exact dynamic programming for the green vehicle routing & scheduling problem,” Journal of Cleaner Production, vol. 167, pp. 1450-1463, 2017.
S. Zhang, Y. Gajpal, S. Appadoo, and M. Abdulkader, “Electric vehicle routing problem with recharging stations for minimizing energy consumption,” International Journal of Production Economics, vol. 203, pp. 404-413, 2018.
H. R. Lourenço, O. C. Martin, and T. Stützle, “Iterated local search,” in Handbook of metaheuristics. Springer, 2003, pp. 320-353.
Y. Li, M. K. Lim, and M.-L. Tseng, “A green vehicle routing model based on modified particle swarm optimization for cold chain logistics,” Industrial Management & Data Systems, 2019.
P. Moscato, C. Cotta, and A. Mendes, “Memetic algorithms,” in New optimization techniques in engineering. Springer, 2004, pp. 53-85.
L. Zhen, Z. Xu, C. Ma, and L. Xiao, “Hybrid electric vehicle routing problem with mode selection,” International Journal of Production Research, vol. 58, no. 2, pp. 562-576, 2020.
B. Peng, L. Wu, Y. Yi, and X. Chen, “Solving the multi-depot green vehicle routing problem by a hybrid evolutionary algorithm,” Sustainability, vol. 12, no. 5, p. 2127, 2020.
B. Olgun, Ç. Koç, and F. Altıparmak, “A hyper heuristic for the green vehicle routing problem with simultaneous pickup and delivery,” Computers & Industrial Engineering, vol. 153, p. 107010, 2021.
D. Teodorović, P. Lučić, G. Marković, and M. Dell’Orco, “Bee colony optimization: principles and applications,” in 2006 8th Seminar on Neural Network Applications in Electrical Engineering. IEEE, 2006, pp. 151-156.
S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey wolf optimizer,” Advances in engineering software, vol. 69, pp. 46-61, 2014.
K. M. Passino, “Biomimicry of bacterial foraging for distributed optimization and control,” IEEE control systems magazine, vol. 22, no. 3, pp. 52-67, 2002.
H. S. Hosseini, “Problem solving by intelligent water drops,” in 2007 IEEE congress on evolutionary computation. IEEE, 2007, pp. 3226-3231.
--, “Intelligent water drops algorithm: A new optimization method for solving the multiple knapsack problem,” International Journal of Intelligent Computing and Cybernetics, 2008.
L. Korayem, M. Khorsid, and S. Kassem, “Using grey wolf algorithm to solve the capacitated vehicle routing problem,” in IOP conference series: materials science and engineering, vol. 83, no. 1. IOP Publishing, 2015, p. 012014.
Z. Li, F. Zhao, and H. Liu, “Intelligent water drops algorithm for vehicle routing problem with time windows,” in 2014 11th International Conference on Service Systems and Service Management (ICSSSM). IEEE, 2014, pp. 1-6.
M. Nikolić, D. Teodorović, and M. Šelmić, “Solving the vehicle routing problem with time windows by bee colony optimization metaheuristic,” in In Proceedings of the 1st Logistics International Conference, 2013, pp. 44-48.
B. Niu, H. Wang, L.-J. Tan, L. Li, and J.-W. Wang, “Vehicle routing problem with time windows based on adaptive bacterial foraging optimization,” in International Conference on Intelligent Computing. Springer, 2012, pp. 672-679.
T.-t. WANG, Y.-d. NI, and W.-l. HE, “Bee colony optimization algorithm for split delivery vehicle routing problem,” Journal of Hefei University of Technology (Natural Science), 2014.
Downloads
Published
Issue
Section
License
Copyright (c) YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
