IDEAS home Printed from https://ideas.repec.org/a/ids/ijlsma/v32y2019i1p132-146.html
   My bibliography  Save this article

Capacitated vehicle routing problem using genetic algorithm: a case of cement distribution

Author

Listed:
  • Tanzila Azad
  • M. Ahsan Akhtar Hasin

Abstract

Vehicle routing problem is a multi-objective problem. The problem involves optimising a fleet of vehicles that are to serve a number of customers from a central depot. Each vehicle has limited capacity and each customer has a certain demand. A procedure is introduced for the optimisation of a customer order service management system with a structured distribution network of a cement company of Bangladesh. The goal of the research is to find a solution of vehicle routing problem using genetic algorithm. It generates feasible clusters of resellers or distributors and determines delivery sequence and an optimal distribution network to meet demands by travelling minimum distance. The results of the study show that genetic algorithm provides a search technique used in computing to find true or approximate solution of search problems. The technique is able to determine the optimum route for the vehicles, while maintaining their constraints to get an optimal distribution network that minimises the total travelling distance.

Suggested Citation

  • Tanzila Azad & M. Ahsan Akhtar Hasin, 2019. "Capacitated vehicle routing problem using genetic algorithm: a case of cement distribution," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 32(1), pages 132-146.
    • Handle: RePEc:ids:ijlsma:v:32:y:2019:i:1:p:132-146
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=97077
    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:ijlsma:v:32:y:2019:i:1:p:132-146. 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=134 .

    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.