Routing for Reverse Logistics

S. P. Anbuudayasankar, K. Ganesh and Sanjay Mohapatra
Additional contact information
S. P. Anbuudayasankar: Amrita School of Engineering
K. Ganesh: McKinsey Knowledge Center India
Sanjay Mohapatra: Xavier Institute of Management

Chapter Chapter 4 in Models for Practical Routing Problems in Logistics, 2014, pp 69-93 from Springer

Abstract: Abstract Given a collection of cities and the cost/time of travel between the cities, TSP, is to find the cheapest/shortest way of visiting all the cities and returning to the starting city. In TSP if the vehicle is considered only for either delivery (or) pickup, it is in its simple form. Subsequently further developments relating to the practical applications of TSP emerged and one among them is TSPSDP. Here delivery and pickup takes place simultaneously while serving a node.

Keywords: Current Node; Reverse Logistics; Solution String; Relative Percentage Deviation; Live Node (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:spr:sprchp:978-3-319-05035-5_4

Ordering information: This item can be ordered from
http://www.springer.com/9783319050355

DOI: 10.1007/978-3-319-05035-5_4

Access Statistics for this chapter

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