arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.17403math.OC
收藏

最小化最大异构多车辆多仓库旅行商问题的启发式算法

Heuristic for Min-Max Heterogeneous Multi-Vehicle Multi-Depot Traveling Salesman Problem

Deepak Prakash Kumar, Sivakumar Rathinam, Swaroop Darbha, Trevor Bihl

AI总结:

本文提出一种三阶段启发式算法,用于最小化最大异构多车辆多仓库旅行商问题,通过初始化、局部搜索和扰动生成高质量解,平均误差在最优解的4%以内。

摘要:

本文针对最小化最大异构多车辆多仓库旅行商问题(TSP)提出了一种启发式算法,其中异构车辆从给定的仓库位置出发,需要覆盖一组给定的目标。车辆应覆盖给定目标,使得最大行程时间最小化。在所考虑的问题中,车辆可以是功能异构的,即特定目标必须由特定车辆覆盖;也可以是结构异构的,即车辆可以以不同速度行驶;或者两者兼有。所提出的启发式算法推广了用于最小化最大同构多车辆多仓库TSP的MD启发式算法,并包含三个阶段:初始化阶段生成可行解,局部搜索阶段改进具有最大行程时间的车辆,以及扰动阶段以跳出局部最小值。所提出的启发式算法与通过分支切割法求解混合整数线性规划获得的最优解进行了基准比较,实例涉及三辆车辆覆盖三十个目标。研究了车辆-目标分配百分比和从同一仓库出发的车辆数量的变化,以展示该启发式算法在生成高质量解方面的有效性。观察到,对于所考虑的实例,该启发式算法平均生成的可行解在最优解的4%以内。

英文摘要:

In this article, a heuristic is proposed for a min-max heterogeneous multi-vehicle multi-depot traveling salesman problem (TSP), wherein heterogeneous vehicles start from given depot positions and need to cover a given set of targets. The vehicles should cover given targets such that the maximum tour time is minimized. In the considered problem, vehicles considered can be functionally heterogeneous, wherein specific targets must be covered by a particular vehicle, structurally heterogeneous, wherein the vehicles can travel at different speeds, or both. The proposed heuristic generalizes the MD heuristic for the min-max homogeneous multi-vehicle multi-depot TSP and has three stages: an initialization stage to generate a feasible solution, a local search stage in which the vehicle with the maximum tour time is improved, and a perturbation stage to break from a local minimum. The proposed heuristic is benchmarked with the optimal solution obtained by solving a mixed integer linear program using branch and cut for instances considering three vehicles covering thirty targets. Variations in the percentage of vehicle-target assignments and the number of vehicles starting at the same depot are studied to show the heuristic's effectiveness in producing high-quality solutions. It was observed that the heuristic generated feasible solutions within 4% of the optimum on average for the considered instances.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑