English  |  正體中文  |  简体中文  |  Items with full text/Total items : 88266/117736 (75%)
Visitors : 23393033      Online Users : 158
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 企業管理學系 > 期刊論文 >  Item 140.119/100743
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/100743


    Title: Time Analysis for Planning a Path in a Time-Window Network
    Authors: 唐揆
    Chen, Y.L.;Shaio, L.J.;Tang, Kwei
    Contributors: 企管系
    Keywords: network;time-window constraint;time analysis
    Date: 2003-08
    Issue Date: 2016-08-25 14:14:21 (UTC+8)
    Abstract: 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.
    Relation: Journal of Operational Research Society, 54(8), 860-870
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1057/palgrave.jors.2601583
    DOI: 10.1057/palgrave.jors.2601583
    Appears in Collections:[企業管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    860-870.pdf264KbAdobe PDF257View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback