期刊文献+

多车型条件下机场接送服务的协作调度优化 被引量:3

Cooperative Scheduling Optimization in Airport Shuttle Service Based on Multi-vehicles
下载PDF
导出
摘要 针对多车型机场接送服务,建立了以最少行驶总里程数为目标的协作调度模型.根据模型特点,提出用于模型求解的启发式优化算法.该方法在初步规划出基本路径后,寻找出需要一辆车单独服务的载客点,即孤立点.分别考虑了孤立点与基本路径的协作方式、剩余基本路径与已和孤立点协作的基本路径的协作方式,以及最终剩余路径之间的协作方式,由此获得了协作模式下的车辆调度方案.仿真实验证明,本文提出的协作调度模型及优化算法能有效降低机场接送服务的运营成本. Focusing on the airport shuttle service based on multi-vehicles, the cooperative scheduling model taking the minimum total mileages driven as the objective is built, and a heuristic optimization algorithm is proposed to solve the model. The pickup points which need a vehicle to offer individual shuttle service, namely isolated points, are determined after basic routes are planned. Then the cooperative patterns between isolated points and basic routes, between remaining routes and basic routes cooperating with isolated points, as well as between final remaining routes are taken into account respectively. The vehicle scheduling scheme based on the cooperation is obtained. Numerical experiments show that the proposed cooperative model and optimization algorithm can effectively decrease the operation cost in the airport shuttle service.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2014年第8期1093-1096,共4页 Journal of Northeastern University(Natural Science)
基金 国家自然科学基金资助项目(61203182) 教育部高等学校博士学科点专项科研基金资助项目(20120042110023) 中央高校基本科研业务费专项资金资助项目(N110404021)
关键词 机场接送服务 载客率 车辆协作 协作调度模型 优化算法 airport shuttle service passenger load factor vehicle cooperation cooperative scheduling model optimization algorithm
  • 相关文献

参考文献8

  • 1Dong G,Tang J,Lai K. An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model[J]. Journal oflntelligent Manufacturing,2011,22 ( 5 ) :789 - 799.
  • 2Lin Y. A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources [J]. Computers & Operations Research, 2011, 38 ( 11 ) : 1596 - 1609.
  • 3Duygu T,Dellaert N, Woensel T, et al. Vehicle routing problem with stochastic travel times including soft time windows and service costs [ J ]. Computers and Operations Research,2013,40 ( 1 ) :214 - 224.
  • 4Bafios R, Ortega J, Gil C, et al. A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows [J] Computers & Industrial Engineering, 2013, 65 ( 2 ) : 286 - 296.
  • 5Hong L X. An improved LNS algorithm for real-time vehicle routing problem with time windows [ J ]. Computers & Operations Research,2012,39(2) :151 - 163.
  • 6Belfiore P, Yoshizaki H. Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries [J]. Computers and Industrial Engineering, 2013,64 (2) :589 -601.
  • 7Desaulniers G. Branch-and-price-and-cut for the split- delivery vehicle routing problem with time windows [J]. Operational Research ,2010,58 ( 1 ) :179 - 192.
  • 8Pillac V, Gendreau M, Gutret C, et al. A review of dynamic vehicle routing problems [ J ]. European Journal of Operational Research ,2013,225 ( 1 ) : 1 - 11.

同被引文献19

  • 1张林广,方金云,申排伟.基于配对堆改进的Dijkstra算法[J].中国图象图形学报,2007,12(5):922-926. 被引量:16
  • 2Pillac V, Gendreau M, Gueret C,et al. A review of dynamic vehicle routing problems[J]. European Journal of Operational Research, 2013, 225(1): 1-11.
  • 3Nguyen P K, Crainic T G, Toulouse M. A tabu search for time-dependent multi-zone multi-trip vehicle rout- ing problem with time windows[J]. European Journal of Operational Research, 2013, 231(1): 43- 56.
  • 4Bianchi L, Birattari M, Chiarandini M, et al. Metaheuristics for the Vehicle Routing Problem with StochasticDemands (Lecture Notes in Computer Science V 3242)[M]. Berlin: Springer, 2004: 450-460.
  • 5Daganzo C F, Erera A L. On Planning and Design of Logistics Systems for Uncertain Environments (Lecture Notes in Economics and Mathematical Systems)[M]. Berlin: Springer, 1999.
  • 6Dong G, Tang J F, Lai K K,et al. An exact algorithm for vehicle routing and scheduling problem of free pick- up and delivery service in flight ticket sales companies based on set-partitioning model[J]. Journal of Intelligent Manufacturing, 2011, 22(5): 789-799.
  • 7Vidal T, Crainic T G, Gendreau M, et aL A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle muting problems with time windows[J]. Computers and Operations Research, 2013, 40: 475 - 489.
  • 8Baldacci R, Mingozzi A, Roberti R. Recent exact algorithms for solving the vehicle routing problem under capac- ity and time window constraints[J]. European Journal of Operational Research, 2012, 218(1): 1- 6.
  • 9温惠英,徐建闽,邹亮.基于遗传算法的离散时间动态网络最短路径求解(英文)[J].华南理工大学学报(自然科学版),2008,36(2):13-16. 被引量:5
  • 10高松,陆锋,段滢滢.一种基于双向搜索的K则最优路径算法[J].武汉大学学报(信息科学版),2008,33(4):418-421. 被引量:28

引证文献3

二级引证文献36

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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