English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 22610210      Online Users : 181
RC Version 7.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


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29997


    Title: Dynamic capacitated user-optimal departure time/route choice problem with time-window
    Authors: Chen,HK;Chang,MS;Wang,CY
    Contributors: 土木工程研究所
    Keywords: ALGORITHM;MODEL
    Date: 2001
    Issue Date: 2010-07-06 16:03:18 (UTC+8)
    Publisher: 中央大學
    Abstract: A discrete-time predictive dynamic user-optimal departure time/route choice problem has been formulated and solved with the nested diagonalization method by Chen, H.K., Hsueh, C.F. (1998a. A discrete-time dynamic user-optimal departure time/route choice m
    Relation: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
    Appears in Collections:[土木工程研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML297View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明