期刊文献+

基于整数线性规划的合乘出租车调度模型 被引量:4

Scheduling Model of Taxi Pooling Based on Integer Linear Programming
下载PDF
导出
摘要 为降低城市交通中出租车的空驶率,提高出租车运载效率,充分利用城市道路资源,缓解交通拥堵,在已有研究的基础上,将智能交通中多位乘客合乘出租车的路线规划及车辆调度问题分解为合乘乘客分组、行驶路线规划、指派车辆3个步骤,将乘客间的"顺路"关系转化为有向图中的有向边,通过筛选连通子集构造合乘分组。分别对每一步骤建立整数线性规划模型,使得所需车辆尽量少,乘客等车时间尽可能短,乘客乘车绕行里程尽量少。使用分层序列法求解该多目标规划问题,并提出一种简化问题规模的策略,以提高求解效率。使用纽约实际出租车乘车数据构造模拟数据集测试算法的性能。测试结果表明,该方案具有"零绕行"、合乘率高的特点,能够大大提高出租车运载效率。 With the purpose of reducing the vacancy rate of taxis in urban transport,increasing the carrying efficiency of taxis,making full use of urban road resources and easing traffic congestion,the route planning and vehicle scheduling problems of taxi pooling in intelligent transport were divided into three steps: passenger grouping,driving route planning and vehicle assignment.Passengers’“direct route”relationship was transformed into a directed edge,and the passenger grouping was constructed by filtering the connected subsets.Then integer linear programming models were established for each step to minimize the vehicle requirements and make passengers waiting time for the vehicles as short as possible,passengers trav?eling mileage by taxis as little as possible.The hierarchical sequence method was used to solve the multi-objective programming problem,and a strategy to simplify the problem scale was proposed to improve the solving efficiency.New York taxi data was used to construct a simulation data set to test the performance of the algorithm.The test results show that the program has the characteristics of“zero passing round”and high taxi pooling rate,which can greatly improve carrying efficiency of taxi.
作者 李辉春 李哲民 毛紫阳 LI Hui-chun;LI Zhe-min;MAO Zi-yang(2. Faculty of Mathematics,College of Liberal Arts and Science,National University of Defense Technology,Changsha 410073,China)
出处 《交通运输研究》 2018年第5期35-42,共8页 Transport Research
关键词 智能交通 整数线性规划 分层序列法 出租车合乘 车辆调度 intelligent transport integer linear programming hierarchical sequence method taxi pooling vehicle scheduling
  • 相关文献

参考文献5

二级参考文献36

  • 1刘洪丽,冯伯林.基于最优化思想的城市交通流分配[J].武汉理工大学学报(交通科学与工程版),2005,29(6):913-916. 被引量:4
  • 2覃运梅,石琴.出租车合乘模式的探讨[J].合肥工业大学学报(自然科学版),2006,29(1):77-79. 被引量:30
  • 3康立山 谢云 等.非数值并行算法(第1册)[M].北京:科学出版社,1997..
  • 4Bulent catay.A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Picknp and Delivery[J].Expert Sys- tems with Applications,2010,37:6809-6817.
  • 5I Gabor Nagy,Said Salhi.Heuristie algorithms for single and muhiple depot vehicle routing problems with pickups and deliveries[J].Euro- pean Journal of Operational Research,2005,162:126-141.
  • 6Zhi-hai Xiang,Cheng-bin Chu,etc.A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints[J].Eu- ropean Journal of Operational Research,2006,174:1117-1139.
  • 7Cordeau J F,Laporte G.A Tabu Search Heuristic for the Static Muhi-vehicle Dial-a-ride Problem [J].Transportation Research Part B, 2001,37:579-594.
  • 8Attanasio A,Cordeau J F,etc.Parallel Tabu Search Heuristics for the Dynamic Multi-vehicle Dial-a-ride Problem[J].Parallel Computing, 2004,30:377-387.
  • 9Calvo R W,Luigi F L, etc.A Distributed Geographic Information System for the Daily Carpooling Problem [J].Computers & Operations Research,2004,31:2263-2278.
  • 10Daily D J,Loseff D,etc.Seattle Smart Traveler: Dynamic Ride matching on the WWW. Transportation Research Part C[J]. 1999(7)'17-32.

共引文献282

同被引文献31

引证文献4

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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