English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 55597/89938 (62%)
造访人次 : 11050545      在线人数 : 81
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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 PDF591检视/开启
    index.html0KbHTML207检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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