Suppr超能文献

稳健动态多目标车辆路径优化方法。

Robust Dynamic Multi-Objective Vehicle Routing Optimization Method.

出版信息

IEEE/ACM Trans Comput Biol Bioinform. 2018 Nov-Dec;15(6):1891-1903. doi: 10.1109/TCBB.2017.2685320. Epub 2017 Mar 21.

Abstract

For dynamic multi-objective vehicle routing problems, the waiting time of vehicle, the number of serving vehicles, and the total distance of routes were normally considered as the optimization objectives. Except for the above objectives, fuel consumption that leads to the environmental pollution and energy consumption was focused on in this paper. Considering the vehicles' load and the driving distance, a corresponding carbon emission model was built and set as an optimization objective. Dynamic multi-objective vehicle routing problems with hard time windows and randomly appeared dynamic customers, subsequently, were modeled. In existing planning methods, when the new service demand came up, global vehicle routing optimization method was triggered to find the optimal routes for non-served customers, which was time-consuming. Therefore, a robust dynamic multi-objective vehicle routing method with two-phase is proposed . Three highlights of the novel method are: (i) After finding optimal robust virtual routes for all customers by adopting multi-objective particle swarm optimization in the first phase, static vehicle routes for static customers are formed by removing all dynamic customers from robust virtual routes in next phase. (ii) The dynamically appeared customers append to be served according to their service time and the vehicles' statues. Global vehicle routing optimization is triggered only when no suitable locations can be found for dynamic customers. (iii) A metric measuring the algorithms robustness is given. The statistical results indicated that the routes obtained by the proposed method have better stability and robustness, but may be sub-optimum. Moreover, time-consuming global vehicle routing optimization is avoided as dynamic customers appear.

摘要

对于动态多目标车辆路径问题,通常将车辆等待时间、服务车辆数量和路线总距离作为优化目标。除了上述目标外,本文还关注了导致环境污染和能源消耗的燃料消耗。考虑到车辆的负载和行驶距离,建立了相应的碳排放模型,并将其设置为优化目标。随后对具有硬时间窗和随机出现动态客户的动态多目标车辆路径问题进行建模。在现有的规划方法中,当出现新的服务需求时,会触发全局车辆路径优化方法来为未服务的客户找到最佳路线,这非常耗时。因此,提出了一种具有两阶段的鲁棒动态多目标车辆路径方法。该新方法有三个亮点:(i)通过在第一阶段采用多目标粒子群优化方法为所有客户找到最佳的鲁棒虚拟路线后,在下一阶段通过从鲁棒虚拟路线中删除所有动态客户来形成静态客户的静态车辆路线。(ii)根据服务时间和车辆状态,动态出现的客户将被添加进行服务。只有当无法为动态客户找到合适的位置时,才会触发全局车辆路径优化。(iii)给出了一种衡量算法鲁棒性的度量。统计结果表明,所提出的方法得到的路线具有更好的稳定性和鲁棒性,但可能不是最优的。此外,随着动态客户的出现,避免了耗时的全局车辆路径优化。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验