Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A biased random-key genetic algorithm with variable mutants to solve a vehicle routing problem (2405.00268v1)

Published 1 May 2024 in cs.NE and math.OC

Abstract: The paper explores the Biased Random-Key Genetic Algorithm (BRKGA) in the domain of logistics and vehicle routing. Specifically, the application of the algorithm is contextualized within the framework of the Vehicle Routing Problem with Occasional Drivers and Time Window (VRPODTW) that represents a critical challenge in contemporary delivery systems. Within this context, BRKGA emerges as an innovative solution approach to optimize routing plans, balancing cost-efficiency with operational constraints. This research introduces a new BRKGA, characterized by a variable mutant population which can vary from generation to generation, named BRKGA-VM. This novel variant was tested to solve a VRPODTW. For this purpose, an innovative specific decoder procedure was proposed and implemented. Furthermore, a hybridization of the algorithm with a Variable Neighborhood Descent (VND) algorithm has also been considered, showing an improvement of problem-solving capabilities. Computational results show a better performances in term of effectiveness over a previous version of BRKGA, denoted as MP. The improved performance of BRKGA-VM is evident from its ability to optimize solutions across a wide range of scenarios, with significant improvements observed for each type of instance considered. The analysis also reveals that VM achieves preset goals more quickly compared to MP, thanks to the increased variability induced in the mutant population which facilitates the exploration of new regions of the solution space. Furthermore, the integration of VND has shown an additional positive impact on the quality of the solutions found.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. Evolutionary algorithm for the k𝑘kitalic_k-interconnected multi-depot multi-traveling salesmen problem. In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, GECCO ’13, page 463–470, New York, NY, USA, 2013. Association for Computing Machinery. URL https://doi:10.1145/2463372.2463434.
  2. The vehicle routing problem with occasional drivers. European Journal of Operational Research, 254(2):472–480, 2016.
  3. The online vehicle routing problem with occasional drivers. Computers & Operations Research, 127:105144, 2021. URL https://doi.org/10.1016/j.cor.2020.105144.
  4. The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications. European Journal of Operational Research, 289(1):17–30, 2021.
  5. GRASP with path relinking for the orienteering problem. Journal of the Operational Research Society, 65(12):1800–1813, 2014.
  6. An adaptive and near parameter-free BRKGA using Q-learning method. In 2021 IEEE Congress on Evolutionary Computation (CEC), pages 2331–2338, 2021. doi: 10.1109/CEC45853.2021.9504766.
  7. Adaptive biased random-key genetic algorithm with local search for the capacitated centered clustering problem. Computers & Industrial Engineering, 124:331–346, 2018. ISSN 0360-8352. doi: https://doi.org/10.1016/j.cie.2018.07.031. URL https://www.sciencedirect.com/science/article/pii/S0360835218303541.
  8. I. Dayarian and M. Savelsbergh. Crowdshipping and same-day delivery: Employing in-store customers to deliver online orders. Production and Operations Management, 29(9):2153–2174, 2020.
  9. Crowd-Shipping and Occasional Depots in the Last Mile Delivery, pages 213–225. Springer International Publishing, Cham, 2021. URL https://doi.org/10.1007/978-3-030-86841-3$\_$18.
  10. Solution approaches for the vehicle routing problem with occasional drivers and time windows. Optimization Methods and Software, 37(4):1384–1414, 2022.
  11. Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping. Optimization Letters, 17:1981–2003, 2023a.
  12. The crowd-shipping with penalty cost function and uncertain travel times. Omega, 115:102776, 2023b.
  13. A BRKGA with implicit path-relinking for the vehicle routing problem with occasional drivers and time windows. In L. Di Gaspero, P. Festa, A. Nakib, and M. Pavone, editors, Metaheuristics, pages 17–29, Cham, 2023. Springer International Publishing. ISBN 978-3-031-26504-4.
  14. D. B. M. M. Fontes and J. F. Gonçalves. A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks. Optimization Letters, 7(6):1303–1324, 2013.
  15. D. B. M. M. Fontes and S. M. Homayouni. A bi-objective multi-population biased random key genetic algorithm for joint scheduling quay cranes and speed adjustable vehicles in container terminals. Flexible Services and Manufacturing Journal, 35:241–268, 2023. URL https://doi.org/10.1007/s10696-022-09467-6.
  16. Biased random-key genetic algorithms for combinatorial optimization. Journal of Heuristics, 17(5):487–525, 2011.
  17. A parallel multi-population biased random-key genetic algorithm for a container loading problem. Computers & Operations Research, 39(2):179–190, 2012.
  18. A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. Journal of Heuristics, 17:467–486, 2011. URL https://doi.org/10.1007/s10732-010-9142-2.
  19. Biased random-key genetic algorithm applied to the vehicle routing problem with private fleet and common carrier. In 2018 IEEE Congress on Evolutionary Computation (CEC), pages 1–8. IEEE, 2018.
  20. A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation. International Transactions in Operational Research, 30:688–716, 2023. URL https://doi.org/10.1111/itor.12878.
  21. Biased random-key genetic algorithms: A review. European Journal of Operational Research, 2024. ISSN 0377-2217. doi: https://doi.org/10.1016/j.ejor.2024.03.030. URL https://www.sciencedirect.com/science/article/pii/S0377221724002303.
  22. Heuristics for a hub location-routing problem. Networks, 68(1):54–90, 2016. URL https://doi:10.1002/net.21685.
  23. Some extensions of biased random-key genetic algorithms. In Proceedings of the Forty-Sixth Brazilian Symposium of Operational Research, page 2469–2480, 07 2014.
  24. The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives, 3:43–58, 2016. URL https://doi.org/10.1016/j.orp.2016.09.002.
  25. G. Macrina and F. Guerriero. The green vehicle routing problem with occasional drivers. In New Trends in Emerging Complex Real Life Problems: ODS, Taormina, Italy, September 10–13, 2018, volume 1, pages 357–366, Cham, 2018. Springer International Publishing. URL https://doi.org/10.1007/978-3-030-00473-6\_38.
  26. The vehicle routing problem with occasional drivers and time windows. In Optimization and Decision Science: Methodologies and Applications, volume 217, pages 577–587, Cham, 11 2017. Springer. URL https://doi.org/10.1007/978-3-319-67308-0$\_$58.
  27. Crowd-shipping: a new efficient and eco-friendly delivery strategy. Procedia Manufacturing, 42:483–487, 2020a. doi: https://doi.org/10.1016/j.promfg.2020.02.048. International Conference on Industry 4.0 and Smart Manufacturing (ISM 2019).
  28. A variable neighborhood search for the vehicle routing problem with occasional drivers and time windows. In Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, volume 1, pages 270–277, 1 2020b.
  29. Crowd-shipping with time windows and transshipment nodes. Computers & Operations Research, 113:104806, 2020c. URL https://doi.org/10.1016/j.cor.2019.104806.
  30. Biased random key genetic algorithm design with multiple populations to solve capacitated vehicle routing problem with time windows. In AIP Conference Proceedings, volume 1977, page 020052, 06 2018. doi: 10.1063/1.5042908.
  31. Grasp and path relinking for the max–min diversity problem. Computers & Operations Research, 37(3):498–508, 2010.
  32. A biased random-key genetic algorithm for the Steiner triple covering problem. Optimization Letters, 6:605–619, 04 2011.
  33. Restart strategy for biased random-key genetic algorithms. Technical report, AT& Labs Research, Florham Park, NJ, 2013.
  34. A. Reyes and C. C. Ribeiro. Extending time-to-target plots to multiple instances. International Transactions in Operational Research, 25:1515–1536, 2 2018. doi: 10.1111/itor.12507.
  35. C. C. Ribeiro and I. Rosseti. tttplots-compare: A perl program to compare time-to-target plots or general runtime distributions of randomized algorithms. Optimization Letters, 9:601–614, 2015.
  36. Delivery systems with crowd-sourced drivers: A pickup and delivery problem with transfers. Networks, 76(2):232–255, 2020.
  37. L. Z. A. R. Vilela. Strategies for parameter control in the biased random-key genetic algorithm. Technical report, Pontifícia Universidade Católica do Rio de Janeiro, Rio de Janeiro, Brazil, 2022. Master’s thesis, https://doi.org/10.17771/PUCRio.acad.61145.
  38. Multi-objective multi-population biased random-key genetic algorithm for the 3-d container loading problem. Computers & Industrial Engineering, 89:80–87, 2015.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets