期刊文献+

解决动态出租车“拼车”问题的模拟退火算法 被引量:17

Solving Dynamic Taxipooling Problem with Simulated Annealing Algorithm
下载PDF
导出
摘要 "拼出租车"(Taxipooling)是基于人们到达同一目的地需求从而共享车辆的现象,它在一定程度上解决了"上班族"在上下班高峰期打车难的问题,而且费用经济(一般由顾客根据旅途长短来共同分担),同时很大程度上缓解了交通拥挤,减少道路车流出行量,节省能源.而且当今智能化交通系统为出租车"拼车"问题的优化,提供了良好的平台.应用了智能算法中的模拟退火算法来解决出租车"拼车"中"一对多"模型,以达到最优的顾客匹配及线路设计,并通过算例进行比较验证,证明算法的合理性和有效性. "Taxipooling" is the phenomenon that people to reach the same destination sharing of vehicles, which has solved the difficult problem of the "office workers" to take a taxi during the coming back and going to work high peak period in some extent,and it costs less(generally shared according to the travel distance by customer). Meanwhile, it has alleviated the traffic congestion greatly, reduced the quantity of the vehicle flow and saved the energy. Moreover, ITS has provided the good platform for the texipooling opti- mization today. In the paper, the problem of the "one to many" taxipooling model is presented by using simulated annealing algorithms of intelligent algorithms in order to attain the optimum customer matching and route designing. By comparison of an example, the algorithm proves its rationality and effectiveness.
作者 张瑾 何瑞春
出处 《兰州交通大学学报》 CAS 2008年第3期85-88,共4页 Journal of Lanzhou Jiaotong University
关键词 拼出租车 智能算法 模拟退火算法 “一对多”模型 taxipooling intelligent algorithm simulated annealing algorithm the "one to many" model
  • 相关文献

参考文献5

二级参考文献24

  • 1杨瑞臣,周永付,云庆夏.寻找车辆最优路径的混合算法[J].交通运输工程学报,2005,5(1):102-105. 被引量:23
  • 2刑文训 谢金星.现代优化计算方法[M].北京:清华大学出版社,2003..
  • 3Sung-Chul Hong,Yang-Byung Park.A heuristic for bi-objective vehicle routing with time window constraints[J].Int.J.Production Economics,1999,62:249 ~ 258.
  • 4Xiong Chen,Weishui Wan,Xinhe Xu.Modeling rolling batch planning as vehicle routing problem with time windows[J].Computers OpsRes.,1998,25(12):1127 ~ 1136.
  • 5K.C.Tan,L.H.lee,Q.L.Zhu,K.Ou.Heuristics methods for vehicle routing problem with time windows[J].Artificial Intelligence in Engineering,2001,15:281 ~ 295.
  • 6Hoong Chuin Lau,Melvyn Sim,Kuong Meng Teo.Vehicle routing problem with time windows and a limited number of vehicles[J].European Journal of Operation Research,2003,148:559 ~ 569.
  • 7Osman I.H..Metastrategy simulated annealing and tabu search algorithms for the vehicle routing prroblem.Ann[J].Operations Research,1993,41:421 ~ 451.
  • 8Alex Van Breedam.Improvement Heuristics for the vehicle routing prroblem based on simulated Annealing[J].European Journal of Operational Research,1995,86:480 ~ 490.
  • 9Teodorovic D.,Pavkovic G..A simulated annealing technique approach to the vehicle routing in the case of stochastic demand[J].Transportation Planning and Technology,1992,16:273 ~ 291.
  • 10PAOLO T,DANIELE V.The Vehicle Routing Problem[M].Philadephia:Society for Industrial and Applied Mathematics,2002.

共引文献74

同被引文献128

引证文献17

二级引证文献74

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部