政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/73713
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113318/144297 (79%)
造訪人次 : 50956671      線上人數 : 967
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 商學院 > 企業管理學系 > 期刊論文 >  Item 140.119/73713


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/73713


    題名: Minimum time paths in a network with mixed time constraints
    作者: Tang, Kwei;Chen, Yen-Liang
    唐揆
    貢獻者: 企管系
    關鍵詞: 無
    日期: 1998-10
    上傳時間: 2015-03-09 16:18:56 (UTC+8)
    摘要: The time-constrained shortest path problems are generalized from and more realistic than the classical shortest path problem. These problems are most important subproblems in many large-scale real-world problems in the field of transportation. The problem considered in this paper is to find the shortest path in a new kind of time-constrained network, called a mixed time-schedule network, in which departures from some nodes are only allowed at some discrete points. This problem arises in many practical situations. For example, a shipping or transportation from one place to another may be through different kinds of vehicles such as (1) scheduled flights, ocean liners, trains, or buses and (2) rental cars, own cars or own trucks, where the vehicles in (1) have to follow predetermined departure-time schedules and the vehicles in (2) do not have time constraints.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 time-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 time 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.
    關聯: Computers & Operations Research, 25(10), 793-805
    資料類型: article
    DOI 連結: http://dx.doi.org/10.1016/S0305-0548(98)00020-3
    DOI: 10.1016/S0305-0548(98)00020-3
    顯示於類別:[企業管理學系] 期刊論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    S0305054898000203.pdf304KbAdobe PDF2770檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋