东北大学学报(自然科学版) ›› 2009, Vol. 30 ›› Issue (5): 625-627+660.DOI: -

• 论著 • 上一篇    下一篇

基于集划分求解接送旅客到机场问题的启发式算法

孔媛;唐加福;潘震东;董纲;   

  1. 东北大学流程工业综合自动化教育部重点实验室;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2009-05-15 发布日期:2013-06-22
  • 通讯作者: Kong, Y.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(70721001,70625001);;

Set-partition based heuristic algorithm to solve the problem of pick-up and delivery of air-passengers

Kong, Yuan (1); Tang, Jia-Fu (1); Pan, Zhen-Dong (1); Dong, Gang (1)   

  1. (1) Key Laboratory of Integrated Automation of Process Industry, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2009-05-15 Published:2013-06-22
  • Contact: Kong, Y.
  • About author:-
  • Supported by:
    -

摘要: 考虑旅客对抵达机场的时间要求严格和绕行给旅客带来的不便,将满意度量化为一段旅客到达机场的时间,建立在一定的满意度下运行时间和绕行时间的权和最小的单目标数学模型.根据问题和模型的特点,设计了一种基于Set-Partition的启发式算法.该算法首先枚举出有效车次集,然后开发启发式算法PNAC(per-node average-cost),从有效的车次集中选择一组路段访问全部旅客,并结合后优化过程,制定高满意度的调度计划.最后通过仿真实验,验证了算法和模型的有效性.

关键词: 接送服务, 车辆调度问题, 集划分, 满意度, 机场

Abstract: Considering the strict time requirements for air-passengers who have to get to airport punctually and the detour that brings inconvenience to them, the time they require is quantified to their satisfaction to a certain degree so as to develop a mathematical model involving the weights of both trip and detour time of shuttle buses with the single minimum objective. According to the characteristics of the problem to be solved and the model, a set-partition based heuristic algorithm is designed, in which a set of the sequences of efficient trips of shuttle buses are all routed, then a heuristic PNAC (per-node average-cost), algorithm is developed in combination with the scheduling optimization process to choose a group of route sections to visit all relevant passengers. Simulation results verified the effectiveness of the proposed model and algorithm.

中图分类号: