IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-05035-5_7.html
   My bibliography  Save this book chapter

Conclusions

In: Models for Practical Routing Problems in Logistics

Author

Listed:
  • S. P. Anbuudayasankar

    (Amrita School of Engineering)

  • K. Ganesh

    (McKinsey Knowledge Center India)

  • Sanjay Mohapatra

    (Xavier Institute of Management)

Abstract

This thesis has addressed a vital component in the domain of Logistics and Distribution Management, viz., the Travelling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP). As is abundantly clear by now, the TSP and VRP and its variants in real-life are not “solution-friendly”. Belonging as they do, to the class of NP-hard problems, they are not amenable to the determination of optimal solutions. While the choice of methodology inevitably falls on meta-heuristics, the inherent characteristics of the problems are analysed and polynomial algorithms are devised, at least, to find good feeder solutions to meta-heuristics. The choice of construction heuristics to find initial solutions has contributed significantly in the reduction of computational effort and for better deployment of the meta-heuristics. These are born out of the results obtained over several datasets for all the variants of TSP and VRP considered in this study. One of the key contributions of this study is the unified heuristics that are developed for selected complex variants of TSP and VRP and the enhancement of their capability to solve the simpler versions of the problem as well.

Suggested Citation

  • S. P. Anbuudayasankar & K. Ganesh & Sanjay Mohapatra, 2014. "Conclusions," Springer Books, in: Models for Practical Routing Problems in Logistics, edition 127, chapter 0, pages 143-145, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-05035-5_7
    DOI: 10.1007/978-3-319-05035-5_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:sprchp:978-3-319-05035-5_7. 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.springer.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.