Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/100734
題名: | The First K Minimum Cost Paths in a Time-Schedule Network | 作者: | 唐揆 Chen, Y. L.;Rinks, D.;Tang, Kwei |
貢獻者: | 企管系 | 關鍵詞: | shortest path; road transport; networks and graphs | 日期: | Jan-2001 | 上傳時間: | 25-Aug-2016 | 摘要: | The time-constrained shortest path problem is an important generalisation of the classical shortest path problem and in recent years has attracted much research interest. We consider a time-schedule network, where every node in the network has a list of pre-specified departure times and departure from a node may take place only at one of these departure times. The objective of this paper is to find the first K minimum cost simple paths subject to a total time constraint. An efficient polynomial time algorithm is developed. It is also demonstrated that the algorithm can be modified for finding the first K paths for all possible values of total time. | 關聯: | Journal of Operational Research Society, 52(1), 102-108 | 資料類型: | article | DOI: | http://dx.doi.org/10.1057/palgrave.jors.2601028 |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
102-108.pdf | 183.97 kB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.