IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i9d10.1057_palgrave.jors.2601386.html
   My bibliography  Save this article

Heuristic algorithms for a multi-period multi-stop transportation planning problem

Author

Listed:
  • J-U Kim

    (Entrue Consulting Partners, LG CNS Co. Ltd., Jung-gu)

  • Y-D Kim

    (Korea Advanced Institute of Science and Technology, Yusong-gu)

  • S-O Shim

    (Korea Advanced Institute of Science and Technology, Yusong-gu)

Abstract

We consider a multi-period multi-stop transportation planning problem (MPMSTP) in a one-warehouse multi-retailer distribution system where a fleet of homogeneous vehicles delivers products from a warehouse to retailers. The objective of the MPMSTP is to minimize the total transportation distance for product delivery over the planning horizon while satisfying demands of the retailers. We suggest two heuristic algorithms based on the column generation method and the simulated annealing algorithm. Computational experiments on randomly generated test problems showed that the suggested algorithms gave better solutions than an algorithm currently used in practice and algorithms modified from existing algorithms for vehicle routing problems.

Suggested Citation

  • J-U Kim & Y-D Kim & S-O Shim, 2002. "Heuristic algorithms for a multi-period multi-stop transportation planning problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(9), pages 1027-1037, September.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:9:d:10.1057_palgrave.jors.2601386
    DOI: 10.1057/palgrave.jors.2601386
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601386
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601386?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:pal:jorsoc:v:53:y:2002:i:9:d:10.1057_palgrave.jors.2601386. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.