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

Milan Stanojević and Bogdana Stanojević

Chapter 22 in Innovative Management and Firm Performance, 2014, pp 422-443 from Palgrave Macmillan

Abstract: 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.

Keywords: Vehicle Rout Problem; Vehicle Type; Approximate Algorithm; Steiner Tree Problem; Constructive Heuristic (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:palchp:978-1-137-40222-6_22

Ordering information: This item can be ordered from
http://www.palgrave.com/9781137402226

DOI: 10.1057/9781137402226_22

Access Statistics for this chapter

More chapters in Palgrave Macmillan Books from Palgrave Macmillan
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().