IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v5y2009i5p617-636.html
   My bibliography  Save this article

COG: a composite genetic algorithm with local search methods to solve a mixed vehicle routing problem with backhauls

Author

Listed:
  • S.P. Anbuudayasankar
  • K. Ganesh
  • Tzong-Ru Lee
  • K. Mohandas

Abstract

This paper considers a variant of the Vehicle Routing Problem (VRP) called Mixed Vehicle Routing Problem with Backhauls (MVRPB), an extension of the Vehicle Routing Problem with Backhauls (VRPB). This problem involves two sets of customers, called line-haul and backhaul customers. The demand of each line-haul customer is served by a single depot with a set of homogeneous capacitated vehicles. Apart from this, some amount of load needs to be picked up from the backhaul customers and should be taken back to the depot. The visit sequence of vehicles for line-haul and backhaul customers is mixed. The application of the MVRPB for the public healthcare system is explained. The MVRPB is a well-known, proven Non-deterministic Polynomial (NP)-hard problem. Various heuristic algorithms are proposed to solve the MVRPB to obtain approximate solutions. In this paper, we propose a composite Genetic Algorithm (GA) combined with different local search methods to solve the MVRPB. This is the first research paper for the application of metaheuristics with local search methods to solve the MVRPB. Extensive computational investigation for the MVRPB instances shows the efficacy of the proposed algorithm.

Suggested Citation

  • S.P. Anbuudayasankar & K. Ganesh & Tzong-Ru Lee & K. Mohandas, 2009. "COG: a composite genetic algorithm with local search methods to solve a mixed vehicle routing problem with backhauls," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 5(5), pages 617-636.
    • Handle: RePEc:ids:ijsoma:v:5:y:2009:i:5:p:617-636
    as

    Download full text from publisher

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

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ijsoma:v:5:y:2009:i:5:p:617-636. 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=150 .

    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.