【24h】

ANT COLONY OPTIMISATION MODEL FOR VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICKUP AND DELIVERY

机译:同时取送的车辆路径问题的蚁群优化模型

获取原文

摘要

Reverse logistics is an area that has come under increased scrutiny in recent years as legislators and companies try to increase the amount of goods that businesses reuse and recycle. The vehicle routing problem with simultaneous pickup and delivery arises when firms want to reduce handling costs by dealing with deliveries and returns in one operation. This is a complex problem for planners who aim to minimise the vehicle route length as the vehicle load rises and falls during a tour of facilities. This paper investigates the use of Ant Colony Optimisation to find solutions to this problem. An algorithm combining elements of three different studies is proposed. The algorithm finds results within 0.2% of the best known results and performs well for half of the benchmark problems, but needs further work to reach the same level on the other half. It is found that the proposed changes can have up to a 3.1% improvement in results when compared to previous methods run on this algorithm.
机译:近年来,由于立法者和公司试图增加企业可重复使用和再循环的商品数量,反向物流是一个受到越来越严格审查的领域。当公司希望通过一次操作处理交货和退货来降低处理成本时,就会出现同时提货和运输的车辆路径问题。对于计划者而言,这是一个复杂的问题,他们的目标是在设施游览期间随着车辆负荷的上升和下降而使车辆路线的长度最小化。本文调查了蚁群优化的使用,以找到该问题的解决方案。提出了一种结合了三种不同研究的要素的算法。该算法发现的结果在最著名结果的0.2%之内,并且对于一半的基准测试问题表现良好,但是还需要进一步的工作才能达到另一半的相同水平。结果发现,与以前在该算法上运行的方法相比,所提出的更改最多可将结果提高3.1%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号