Heuristic Algorithms or Dynamic Taxipooling.pdf

Heuristic Algorithms or Dynamic Taxipooling.pdf

  1. 1、本文档共6页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Heuristic Algorithms or Dynamic Taxipooling

Heuristic Algorithms for the Dynamic Taxipooling Problem Based on Intelligent Transportation System Technologies Chi-Chung Tao Chun-Ying Chen Tamkang University National Central University cctao@.tw .tw Abstract having the same travel destination and sharing vehicles. The convergence of the Intelligent Transportation The carpooling problem has been modeled as a System (ITS) technologies has given rise to new vehicle routing problem with pickup and deliveries and opportunities for creative and incentive taxi services time windows, and solved with heuristic concepts. Due such as taxipooling. Taxipooling is similar to to lack of an efficient information and communication carpooling which is based on the idea that sets of users support, the problem of automatically creating having the same travel destination and sharing dynamic ride match lists upon carpooling or vehicles. This paper presents two heuristic algorithms taxipooling demand has been researched for many based on greedy method and the time-space network years. Healy [2], Cordeau [3], Fu [4,5], Attanasio [6], fo

文档评论(0)

yaobanwd + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档