Title: Solving the vehicle routing problem with search algorithms: a comparative analysis

Authors: Oladimeji Samuel Sowole

Addresses: African Institute for Mathematical Sciences, BP 1418 Mbour-Thies, Senegal

Abstract: The vehicle routing problem (VRP) is a well-known optimisation problem in operations research, with applications in logistics, transportation, and supply chain management. This paper offers a comparative analysis of search algorithms used to solve the VRP, focusing on their strengths and weaknesses. It introduces the VRP and its variants, highlighting the challenges and constraints involved. Various search algorithms, such as genetic algorithms, simulated annealing, and ant colony optimisation, are examined, discussing their principles, advantages, and limitations. Real-world case studies in package delivery, waste collection, and emergency response demonstrate the application of these algorithms. Factors influencing algorithm performance, including problem size, complexity, and parameters, are discussed. Recommendations for selecting appropriate search algorithms for different VRP instances are provided. The paper aims to provide readers with a comprehensive understanding of using search algorithms to solve the VRP, aiding decision-making in similar optimisation problems.

Keywords: vehicle routing problem; VRP; search algorithms; metaheuristics; ant colony optimisation; ACO; particle swarm optimisation; PSO; genetic algorithms; GAs; Tabu search; simulated annealing; heuristics; routing strategies.

DOI: 10.1504/IJMOR.2025.146360

International Journal of Mathematics in Operational Research, 2025 Vol.31 No.1, pp.110 - 141

Received: 06 Jun 2023
Accepted: 11 Jun 2023
Published online: 27 May 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article