Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/100743
題名: | Time Analysis for Planning a Path in a Time-Window Network | 作者: | 唐揆 Chen, Y.L.;Shaio, L.J.;Tang, Kwei |
貢獻者: | 企管系 | 關鍵詞: | network; time-window constraint; time analysis | 日期: | Aug-2003 | 上傳時間: | 25-Aug-2016 | 摘要: | A systematic method is proposed to generate time information on the paths and nodes on a time-window network for planning and selecting a path under a constraint on the latest entering time at the destination node. Specifically, three algorithms are proposed to generate six basic time characteristics of the nodes, including the earliest and latest times of arriving at, entering, and departing from each node on the network. Using the basic time characteristics, we identify inaccessible nodes that cannot be included in a feasible path and evaluate the accessible nodes’ flexibilities in the waiting time and staying time. We also propose a method for measuring adverse effects of including an arc. Finally, based on the time characteristics and the proposed analyses, we develop an algorithm that can find the most flexible path in a time-window network. | 關聯: | Journal of Operational Research Society, 54(8), 860-870 | 資料類型: | article | DOI: | http://dx.doi.org/10.1057/palgrave.jors.2601583 |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
860-870.pdf | 264.91 kB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.