Minimum time paths in a network with mixed time constraints

NCU Institutional Repository > 管理學院 > 資訊管理研究所 > 期刊論文 > Item 987654321/29678

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29678

題名:	Minimum time paths in a network with mixed time constraints
作者:	Chen,YL;Tang,KW
貢獻者:	資訊管理研究所
關鍵詞:	ALGORITHMS
日期:	1998
上傳時間:	2010-06-29 20:38:02 (UTC+8)
出版者:	中央大學
摘要:	The time-constrained shortest path problem is an important generalization of the shortest path problem and has attracted much research interest in recent years. In a recent paper, a new time constraint, namely lime-schedule constraint, is introduced. This time constraint assumes that every node in the network has a list of pre-specified departure times and requires that departure from a node take place only at one of these departure times. Therefore, when a time-schedule constraint is considered, the total time in a network includes traveling lime and waiting time. In this paper, we.consider a network consisting of two types of nodes in terms of their time constraints. The first type of nodes are subject to time-schedule constraints, but the second type is not. For such a network, a set of minimum time (shortest) path problems is studied, including minimization of total time, minimization of total time subject to a total traveling time constraint, minimization of total traveling time subject to a total time constraint and minimization of a weighted sum of total time and total traveling time. (C) 1998 Elsevier Science Ltd. All rights reserved.
關聯:	COMPUTERS & OPERATIONS RESEARCH
顯示於類別:	[資訊管理研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	408	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing