期刊文献+

改进蘑菇算法求解开放式同时送取货选址-路径问题 被引量:1

An Improved Mushroom Algorithm for Solving the Open Location-routing Problem with Simultaneous Pickup and Delivery
下载PDF
导出
摘要 研究了开放式同时送取货的选址-路径问题,车辆在服务完路线客户点之后不返回起始仓库,直接返回第三方物流公司。同时,车辆服务的每个客户点都有不可拆分的送货需求和取货需求,两种需求由一辆车在客户点同时服务。在此条件下,建立最小成本选址-路径模型,并针对该模型设计了一种改进蘑菇算法进行求解。首先,运用三段式生成策略生成初始解;然后,利用模拟退火算法的接受准则考虑是否接受子代解替代父代解;最后,由两种算子操作生成邻域解,产生新种群。与混合免疫算法、模拟退火算法、蚁群算法的比较结果验证了改进蘑菇算法的有效性。 The open location-routing problem with simultaneous pickup and delivery is studied,in which the vehicle does not return to the starting warehouse after serving the route customers,directly back to the thirdparty logistics company.At the same time,every customer of the vehicle service has the demand of delivery and pickup which cannot be separated,and the two demands are served by one vehicle simultaneously.Under this condition,the location-routing model of minimum cost is established.For the characteristics of the model,an improved mushroom algorithm is designed to solve the problem.Firstly,the initial solution is generated by a three-step generating strategy.Secondly,the acceptance criterion of the simulated annealing algorithm is used to consider whether to accept the child solution instead of the parent solution.Finally,the neighborhood solution is generated by two operators to generate a new population.Compared with hybrid immune algorithm,simulated annealing algorithm,ant colony algorithm,the effectiveness of the improved mushroom algorithm is verified.
作者 刘冬 张惠珍 刘亚平 罗诗琪 LIU Dong;ZHANG Huizhen;LIU Yaping;LUO Shiqi(Business School,University of Shanghai for Science and Technology,Shanghai 200093,China)
出处 《控制工程》 CSCD 北大核心 2023年第10期1801-1811,共11页 Control Engineering of China
基金 国家自然科学基金资助项目(72101149) 教育部人文社会科学基金资助项目(21YJC630087)。
关键词 选址-路径 开放式选址-路径问题 同时送取货 改进蘑菇算法 元启发式算法 Location-routing open location-routing problem simultaneous pickup and delivery improved mushroom algorithm meta heuristic algorithm
  • 相关文献

参考文献10

二级参考文献49

  • 1赵燕伟,彭典军,张景玲,吴斌.有能力约束车辆路径问题的量子进化算法[J].系统工程理论与实践,2009,29(2):159-166. 被引量:41
  • 2张军,唐加福,潘震东,孔媛.分散搜索算法求解带货物权重的车辆路径问题[J].系统工程学报,2010,25(1):91-97. 被引量:11
  • 3YU V F, LIN S W, LEE W, et al. A simulated annealing heuristic for the capaeitated location routing problem [J]. Computers &Industrial Engineering,2010,58(2) : 288-299. 被引量:1
  • 4TING C J, CHEN C H. A multiple ant colony optimization al- gorithm for the eapaeitated location routing problem[J]. Inter- national Journal of Production Economics, 2013, 141 (1):34-44. 被引量:1
  • 5ZACHARIADIS E E, KIRANOUDIS C T. A local search me taheuristic algorithm for the vehicle routing problem with sim- ultaneous pick-ups and deliveries[J]. Expert Systems with Ap- plications, 2011,38 (3) :2717-2726. 被引量:1
  • 6ZACHARIADIS E E, TARANTILIS C D, KIRANOUDIS C T. A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up serviee [J]. Expert Systems with Applications,2009,36(2):1070-1081. 被引量:1
  • 7LIU Ran, XIE Xiaolan, AUGUSTO V, et al. Heuristic algo- rithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care[J]. Europe- an Journal of Operational Research,2013,230(3) :475-486. 被引量:1
  • 8GOKSAL F P, KARAOGLAN I, ALTIPARMAK F. A hy- brid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery[J]. Computers Industrial Engineering, 2013,65 (1) : 39-53. 被引量:1
  • 9KARAOGLAN I, ALTIPARMAK F, KARA I, et al. For- mulations for a location-routing problem with simultaneous pickup and delivery[EB/OL]. [2014-03-05]. http://w3, gazi. edu. tr/MYMfulyaal/Papers/LRP SPD MIP Formulations. pdf. 被引量:1
  • 10KARAOGLAN I, ALTIPARMAK F, KARA I, et al. A bra- nch and cut algorithm for the location-routing problem with simultaneous pickup and delivery[J]. European Journal of Op- erational Research, 2011,211 (2) : 318-332. 被引量:1

共引文献76

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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