Abstract
The traffic in a particular city is controlled by seven groups of technicians in seven major junctions of the city. These seven junctions are labeled A, B, C, D, E, F, and G, and their interconnections along the road network in the city are schematically depicted by the network in Figure 1.1. The numbers next to the connections in the network depict the time in minutes required to go from one end of the connection to the other end. The stations communicate with each other using sophisticated communication equipments. GTC holds a contract for the maintenance of this equipment. If there is a malfunction in the equipment at any of the junctions, GTC dispatches maintenance crew from its base station at junction A to the junction at which the equipment malfunctions.
One major consideration for GTC is to minimize downtime, i.e., the time taken by GTC crew to reach the malfunctioning unit after they are informed of the malfunction. Therefore, the crew at location A need to know the quickest route through which they can reach any of the other six junctions if the need arises.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Sierksma, G., Ghosh, D. (2010). Shortest Paths. In: Networks in Action. International Series in Operations Research & Management Science, vol 140. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5513-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5513-5_4
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5512-8
Online ISBN: 978-1-4419-5513-5
eBook Packages: Business and EconomicsBusiness and Management (R0)