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

CLOSE: a heuristic to solve a precedence-constrained travelling salesman problem with delivery and pickup

Author

Listed:
  • K. Ganesh
  • T.T. Narendran

Abstract

Logistics Management sometimes involves pickup as well as delivery along the route. Courier service is a typical example. The imposition of precedence constraints among the places to be visited constitutes a variant of the classical Travelling Salesman Problem (TSP). This well-known np-hard problem is often solved by heuristics. The Precedence-Constrained TSP that incorporates Delivery and Pickup (PCTDP) is a much harder problem to solve. This paper addresses the PCTDP and presents a three-stage heuristic using clustering and shrink-wrap algorithms for finding an initial path as well as genetic algorithms for the final search to obtain the best solution. The proposed heuristic is tested over a range of trial datasets and is found to give encouraging results. With its ability to provide solutions of good quality at low computing times, the proposed heuristic has ample scope for application as an automated scheduler when implemented at the site of a logistics-planning cell.

Suggested Citation

  • K. Ganesh & T.T. Narendran, 2005. "CLOSE: a heuristic to solve a precedence-constrained travelling salesman problem with delivery and pickup," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 1(4), pages 320-343.
    • Handle: RePEc:ids:ijsoma:v:1:y:2005:i:4:p:320-343
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=7496
    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:1:y:2005:i:4:p:320-343. 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.