淡江大學機構典藏:Item 987654321/22214
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62830/95882 (66%)
造訪人次 : 4032245      線上人數 : 958
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/22214


    題名: Heuristic Algorithms for the Dynamic Taxipooling Problem Based on Intelligent Transportation System Technologies
    作者: 陶治中;Tao, Chi-chung;陳俊穎;Chen, Chun-ying
    貢獻者: 淡江大學運輸管理學系
    日期: 2007-08-24
    上傳時間: 2009-11-30 13:57:49 (UTC+8)
    出版者: IEEE Computer Society
    摘要: The convergence of the intelligent transportation system (ITS) technologies has given rise to new opportunities for creative and incentive taxi services such as taxipooling. Taxipooling is similar to carpooling which is based on the idea that sets of users having the same travel destination and sharing vehicles. This paper presents two heuristic algorithms based on greedy method and the time-space network for the case of one origin to many destinations ("one- to-many") and many origins to one destination ("many-to-one"). These algorithms are used to support a field trial at Taipei Nei-Hu Science and Technology Park in Taiwan. The results of numerical tests have demonstrated that the outcomes of these heuristic algorithms are fairly plausible.
    關聯: Fuzzy Systems and Knowledge Discovery, 2007. FSKD 2007. Fourth International Conference on Vol.3, pp.590-595
    DOI: 10.1109/FSKD.2007.346
    顯示於類別:[運輸管理學系暨研究所] 會議論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    Heuristic Algorithms for the Dynamic Taxipooling Problem.pdf505KbAdobe PDF781檢視/開啟
    index.html0KbHTML306檢視/開啟

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

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋