期刊文献+

免费接送机场服务的多目标规划模型及算法 被引量:13

Multi-objective model and algorithm of free pickup customer and delivery to airport service
下载PDF
导出
摘要 综合考虑了航空票务公司免费接送机场服务过程中的顾客满意度与成本,将顾客满意度这一定性因素量化,并将运输成本分为车次起用的固定费用和车辆运行的运行费用.由此建立了针对免费接送机场服务中车次分配与调度问题的以最大满意度和最小成本费用为目标的0—1混合整数规划模型.根据问题和模型的特点,提出基于 C-W 节约思想的两阶段启发式算法对该问题进行求解.最后通过实验仿真和结果分析,说明了模型的实用性和算法的有效性. Customers' satisfaction degree and total costs of the service of free pick up of customers to airport for Flight Ticket Sales Companies are considered synthetically. The qualitative factor of customer satisfaction degree is quantified and the total costs are divided into vehicle fixed start-up costs and transportation costs, then a multi-objective 0-1 mixed integer programming model is established for the vehicle allocation and scheduling problem arising in the service of free pick up of customers to airport of Flight Ticket Sales Companies. According to the characteristics of the problem and model, a two-stage heuristic algorithm which is based on Savings Algorithm of Clarke and Wright is proposed. The model is useful and the algorithm is effective, which is verified by the simulation experiment and results analysis.
出处 《管理科学学报》 CSSCI 北大核心 2008年第6期35-42,共8页 Journal of Management Sciences in China
基金 国家自然科学基金资助项目(70471028 70601004) 教育部科技研究重点资助项目(104064) 教育部新世纪优秀人才支持计划资助项目(NCET-04-280) 辽宁省自然科学基金资助项目(20022019)
关键词 航空票务公司 免费接送机场服务 多目标规划 启发式算法 顾客满意 flight ticket sales company free pick up to airport service multi-objective programming heuristic customer satisfaction
  • 相关文献

参考文献11

  • 1Simchi-Levi D, Chen Xin, Bramel J. The Logic of Logistics : Theory, Algorithms, and Applications for Logistics and Supply Chain Management[ M]. New York: Springer Science + Business Media, Inc. , 2005. 217-219.
  • 2Fagerholt K. Ship scheduling with soft time windows : An optimization based approach [ J ]. European Journal of Operational Research, 2001, 131 (3) : 559-571.
  • 3Wang X, Regan A C. Local truckload pickup and delivery with hard time window constraints [ J ]. Transportation Research Part B, 2002, 36(2) : 97-112.
  • 4乔伊科奇A 王寅初译.多目标决策分析及其在工程和经济中的应用[M].北京:航空工业出版社,1987..
  • 5Solomon M. Algorithms for the vehicle routing and scheduling problems with time window constraints [ J ]. Operations Research, 1987, 35(2) : 254-265.
  • 6Clarke G, Wright J W. Scheduling of vehicles from a central depot to a number of delivery points[ J]. Operations Research, 1964, 12(4) : 568-581.
  • 7宋伟刚,张宏霞,佟玲.有时间窗约束非满载车辆调度问题的节约算法[J].东北大学学报(自然科学版),2006,27(1):65-68. 被引量:30
  • 8Bennett B, Gazis D. School bus routing by computer[J]. Transportation Research, 1972, 6(4): 317-326.
  • 9陈继山,须鼎兴,刘大杰.多约束条件的车辆装卸算法[J].同济大学学报(自然科学版),2003,31(11):1304-1308. 被引量:3
  • 10Rosenkrantz D J, Stearns R E, Lewis P M. An analysis of several heuristics for the traveling salesman problem [ J ]. SIAM Journal on Computing, 1977, 6(3) : 563-581.

二级参考文献13

  • 1李军.有时间窗的车辆路线安排问题的启发式算法[J].系统工程,1996,14(5):45-50. 被引量:56
  • 2Lau H C, Liang Z. Pickup and delivery with time windows: Algorithms and test case generation [A]. Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence[C]. [ s. 1. ] : [s. n. ], 2001. 333 - 340.
  • 3Savelsbergh M W P. An efficient implementation of local search algorithms for constrained routing problems [ J ]. European Journal of Operational Research, 1990,47 : 75 - 85.
  • 4Golden B L. Transportation planning models [M].Amsterdam.. Elsevier Science Publishers, 1984. 384 - 418.
  • 5Clarke G, Wright J. Scheduling of vehicles from a central depot to a number of delivery points [J]. Operatirm Research, 1964,12(4): 12 - 18.
  • 6Golden B L, Assad A A. Vehicle routing: method and studies [M]. Amsterdam: Elsevier Science Publishers, 1988.1 - 365.
  • 7Fisher M L, Jaikumar R. A generalized assignment heuristic for vehicles muting[J]. Networks, 1981,11 (2) : 101 - 104.
  • 8Desrochers M, Lcustra J K, Savelsbergh M W. A classification scheme for vehicle routing and .scheduling problems[J]. European Journal of Operational Research,1990,46(3):322 - 332.
  • 9Bramel J, Simchi-Levi D. A location based heuristic for general routing problems[J]. Operation Research, 1995,43(4) : 649 - 660.
  • 10Christofides N, Mingozzi A, Foth P, The vehicle routing problem combinatorial optimization [M]. Wiley:Chichester, 1979. 315 - 338.

共引文献34

同被引文献134

  • 1汪应洛.创新服务型制造业,优化产业结构[J].管理工程学报,2010,24(S1):2-5. 被引量:18
  • 2张玉琍,樊建华,徐建刚,陈东升.车辆路径问题的改进遗传算法研究[J].天津理工大学学报,2006,22(5):79-82. 被引量:12
  • 3张旭梅,邱晗光.基于k-中心点法的改进粒子群算法在旅行商问题中的应用[J].计算机集成制造系统,2007,13(1):99-104. 被引量:15
  • 4Laporte G. The vehicle routing problem: an overview of exact and approximate algorithms [J]. European Journal of Operational Research, 1992,59(3) : 345 - 58.
  • 5Laporle G, Gendreau M, Potvin J Y, et al. Classical and modern heuristics for the vehicle routing problem [ J ]. International Transactions in Operational Research, 2000,7 (4) :285-300.
  • 6Simchi D, Chen X, Bramel J. The logic of logistics: theory, algorithms, and applications for logistics and supply chain management [ M ]. New York: Springer Science-Business Media, 2005:280 - 284.
  • 7Dumas Y, Desrosiers J, Soumis F. The pickup and delivery problem with time windows [ J ]. European Journal of Operational Research, 1991,54 ( 1 ) : 7 - 22.
  • 8Bodin L, Golden B, Asad A, et al. Routing and scheduling of vehicles and crews: the state of the art [J]. Computers & Operations Research, 1983,10 (2) : 63 - 211.
  • 9Clarke G, Wright J W. Scheduling of vehicles from a central depot to a number of delivery points[J]. Operations Research , 1964,12(4) :568 - 811.
  • 10Toth P, Vigo D. Exact solution of the vehicle routing problem [M]. Dordrecht: Kluwer, 1998:1-31.

引证文献13

二级引证文献105

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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