期刊文献+

考虑能耗和时间窗的物流无人机路径问题及求解

Drone Routing Problem with Time Windows and Energy-consumption
下载PDF
导出
摘要 考虑到现阶段国内外相关企业正在开展的无人机快递模式研发和试验这一实践背景,文章提出带时间窗的多旋翼无人机路径问题(简称DDP问题),特别兼顾无人机能耗与无人机载重量和飞行距离之间的关系,构建混合整数规划模型,设计差分进化算法,基于小规模和大规模算例运算验证混合整数规划模型及其求解算法的有效性。该研究可拓展学术界针对传统车辆路径问题的研究工作,也可为相关企业提供多旋翼无人机配送路径优化设计的决策参考。 Considering the realistic development of using drones for last-mile parcel deliveries,we introduce and formally define the drone routing problem with time windows and energy-consumption(DDP).The DDP especially considers the energy-consumption affected by drone load and flying distance.We develop a mixed integer programming model,and propose a differential evolution algorithm.We experimentally evaluate the effectiveness of the DDP model and applicability of the heuristic algorithm,based on computational experiments on small-scale and large-scale instances.The DDP model and solution method are expected to support enterprises’operation strategy decision on the utilization of drones in last-mile parcel deliveries.
作者 王飞龙 赵佳敏 李红启 WANG Fei-long;ZHAO Jia-min;LI Hong-qi(School of Transportation Science and Engineering,Beihang University,Beijing 100191)
出处 《供应链管理》 2021年第7期91-110,共20页 SUPPLY CHAIN MANAGEMENT
基金 国家自然科学基金面上项目“考虑配送时效要求的卡车及车载无人机路径问题研究”(71972007)。
关键词 路径问题 物流无人机 时间窗 混合整数规划 差分进化算法 routing problem logistics drone time windows mixed integer programming differential evolution algorithm
  • 相关文献

参考文献2

二级参考文献24

  • 1刘波,王凌,金以慧.差分进化算法研究进展[J].控制与决策,2007,22(7):721-729. 被引量:291
  • 2Dantzig G,Ramser J.The truck dispatching problem[J].Man- agement Science, 1959(6) :58-102.
  • 3Storn R, Price K.Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces, TR-95-012[R].Berkley: International Computer Science Institute, 1995.
  • 4Vesterstorm J, Thomsen R.A comparative study of differential evolution,particle swarm optimization and evolutionary algo- rithm on numerical benchmark problem[C]//Proceedings of IEEE Congress on Evolutionary Computation, 2004 : 1980-1987.
  • 5Min H. The multiple vehicle routing problem with simultane- ous delivery and pickup points [ J]. Transportation Research A, 1989, 23A(5) : 377-386.
  • 6Dethloff J. Vehicle routing and reserse logistics: the vehicle routing problem with simultaneous delivery and pick-up[ J ]. OR Spektrum, 2001,23 ( 1 ) : 79-96.
  • 7Nagy G, Salhi S. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries [ J]. European Journal of Operational Research, 2005, 162 ( 1 ) : 126-141.
  • 8Alfredo Tang Montan6 F, Galvao R D. A tabu search algo- rithm for the vehicle routing problem with simultaneous pick- up and delivery service [ J ]. Computers & Operations Re- search, 2006, 33(3): 595-619.
  • 9Ganesh K, Narendran T T. TASTE: a two-phase heuristic to solve a routing problem with simultaneous delivery and pick- up [ J ]. The International Journal of Advanced Manufacturing Technology, 2008, 37( 11-12): 1221-1231.
  • 10Karlaftis M G, Kepaptsoglou K, Sambracos E. Containership routing with time deadlines and simultaneous deliveries and pick-ups [ J ]. Transportation Research Part E, 2009,45(1) : 210-221.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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