Cyclic Routing on Networks
Gerard Sierksma () and
Diptesh Ghosh ()
Additional contact information
Gerard Sierksma: Fac. Economische Wetenschappen Rijksuniversiteit Groningen
Chapter 6 in Networks in Action, 2010, pp 143-180 from Springer
Abstract:
Abstract Every year, a team of executives in the corporate office of GTC visits each of the five regional offices to inspect the work at those offices. This trip is a round trip in which the officers visit each of the region offices exactly once before returning to the corporate office. The regional offices are located in cities connected to each other by air. The cost of flying between each pair of cities is given in Table 6.1. C denotes the city in which the corporate office is located, and R1 through R5 denote the cities in which the regional offices are located. The total cost of air travel would obviously depend on the route that the team of executives takes. For instance, if they travel from C to R1 to R2 to R3 to R4 to R5 and back to C, then the cost per executive would be Є4200. On the other hand, if they travel from C to R3 to R5 to R2 to R4 to R1 and back to C, then the cost per executive reduces to Є3250. The financial department at GTC wants to find out how to route the travel of executives so that the total travel costs are minimized.
Keywords: Travel Salesman Problem; Hamiltonian Cycle; Round Trip; Linear Programming Formulation; Audit Team (search for similar items in EconPapers)
Date: 2010
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:isochp:978-1-4419-5513-5_9
Ordering information: This item can be ordered from
http://www.springer.com/9781441955135
DOI: 10.1007/978-1-4419-5513-5_9
Access Statistics for this chapter
More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().