IDEAS home Printed from https://ideas.repec.org/h/pal/palchp/978-1-137-40222-6_22.html
   My bibliography  Save this book chapter

Set-Covering-Based Approximate Algorithm Using Enhanced Savings for Solving Vehicle Routing Problem

In: Innovative Management and Firm Performance

Author

Listed:
  • Milan Stanojević
  • Bogdana Stanojević

Abstract

Transportation is widely present in human activities and supports many economic activities. Using phones, reading mails, traveling, and flying involve the routing of messages, people, and goods. One of the present aims of research is to fill the gap between academic research and practical applications. Our aim is to present a simple and flexible heuristic for solving the capacitated vehicle routing problem and heterogeneous fleet vehicle routing problems, and discuss its advantages compared to other well-known heuristics. The flexibility of our approach comes from the simplicity of the solution procedure and is especially important when the algorithm is going to be applied to solving real-life problems.

Suggested Citation

  • Milan Stanojević & Bogdana Stanojević, 2014. "Set-Covering-Based Approximate Algorithm Using Enhanced Savings for Solving Vehicle Routing Problem," Palgrave Macmillan Books, in: Maja Levi Jakšić & Slađana Barjaktarović Rakočević & Milan Martić (ed.), Innovative Management and Firm Performance, chapter 22, pages 422-443, Palgrave Macmillan.
    • Handle: RePEc:pal:palchp:978-1-137-40222-6_22
    DOI: 10.1057/9781137402226_22
    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:pal:palchp:978-1-137-40222-6_22. 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.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.