Publication: The k-interchange-constrained diameter of a transit network: a connectedness indicator that accounts for travel convenience
Issued Date
2020-03-15
Resource Type
ISSN
19427875
19427867
19427867
Other identifier(s)
2-s2.0-85060868641
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
Transportation Letters. Vol.12, No.3 (2020), 197-201
Suggested Citation
Nassim Dehouche The k-interchange-constrained diameter of a transit network: a connectedness indicator that accounts for travel convenience. Transportation Letters. Vol.12, No.3 (2020), 197-201. doi:10.1080/19427867.2018.1564987 Retrieved from: https://repository.li.mahidol.ac.th/handle/20.500.14594/53916
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
The k-interchange-constrained diameter of a transit network: a connectedness indicator that accounts for travel convenience
Author(s)
Other Contributor(s)
Abstract
© 2019, © 2019 Informa UK Limited, trading as Taylor & Francis Group. We study two variants of the shortest path problem. Given an integer k, the k-color-constrained and the k-interchange-constrained shortest path problems, respectively, seek a shortest path that uses no more than k colors and one that makes no more than k-1 alternations of colors. We show that the former problem is NP-hard, when the latter is tractable. The study of these problems is motivated by some limitations in the use of diameter-based metrics to evaluate the topological structure of transit networks. We notably show that indicators such as the diameter or directness of a transit network fail to adequately account for travel convenience in measuring the connectivity of a network and propose a new network indicator, based on solving the k -interchange-constrained shortest path problem, that aims at alleviating these limitations.