IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v31y2025i1p110-141.html
   My bibliography  Save this article

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

Author

Listed:
  • Oladimeji Samuel Sowole

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.

Suggested Citation

  • Oladimeji Samuel Sowole, 2025. "Solving the vehicle routing problem with search algorithms: a comparative analysis," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 31(1), pages 110-141.
  • Handle: RePEc:ids:ijmore:v:31:y:2025:i:1:p:110-141
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=146360
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmore:v:31:y:2025:i:1:p:110-141. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.