IDEAS home Printed from https://ideas.repec.org/a/ids/injleg/v1y2008i3-4p307-329.html
   My bibliography  Save this article

Mathematical model and genetic algorithm for distribution logistics problem with maximum route length

Author

Listed:
  • P. Sivakumar
  • K. Ganesh
  • S. Arunachalam

Abstract

Logistics is no longer seen as tactical and cost-driven – it is strategic. Considering the driver-on-time rules and with the perishable nature of the products, the travel length/time is one of the critical constraints in distribution logistics. We consider a typical logistics problem with maximum route length constraint. The variant is termed as simultaneous delivery and pick-up with maximum route length (SDPM). We developed a unified mixed-integer-linear programming (MILP) model and genetic algorithm to solve SDPM and the standard variant, vehicle routing problem with simultaneous delivery and pick-up (VRPSDP). Benchmark datasets for VRPSDP and randomly generated datasets for SDPM are solved using MILP model and genetic algorithm and the results are compared with best-known solution. The results of genetic algorithm are encouraging.

Suggested Citation

  • P. Sivakumar & K. Ganesh & S. Arunachalam, 2008. "Mathematical model and genetic algorithm for distribution logistics problem with maximum route length," International Journal of Logistics Economics and Globalisation, Inderscience Enterprises Ltd, vol. 1(3/4), pages 307-329.
    • Handle: RePEc:ids:injleg:v:1:y:2008:i:3/4:p:307-329
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=23164
    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:injleg:v:1:y:2008:i:3/4:p:307-329. 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=64 .

    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.