Routing for Balanced 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 3 in Models for Practical Routing Problems in Logistics, 2014, pp 43-68 from Springer

Abstract: Abstract The multiple travelling salesman problem (mTSP) is an extension of TSP with more than one salesman all of them starting from one city (depot), visiting different cities and coming back to the starting city. mTSP consists of finding tours for all m salesmen, who all start and end at the depot, such that each intermediate city is visited exactly once and the total cost of visiting all cities is minimised (Bektas 2006). It can also be measured in terms of distance, time, etc.

Keywords: Travelling Salesman Problem; Cluster Approach; Distribution Centre; Relative Percentage Deviation; Complete Enumeration (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_3

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

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

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 ().