带禁忌搜索元素的卡车和拖车路径问题的启发式算法
Heuristic with elements of tabu search for Truck and Trailer Routing Problem
摘要：
车辆路径问题是物流和运输领域中的一个著名问题，它在现实生活中的许多情况下都会发生，这就解释了这类问题的多样性。这是一个NP难的组合优化问题，几乎不可能找到精确的最优解。在这项工作中，站点相关的卡车和拖车路径问题的硬，软时间窗和分裂的库存被认为是（SDTTRPTWSD）。在这篇文章中，我们开发了一个启发式的禁忌搜索解决SDTTRPTWSD的元素。启发式算法使用邻域的概念，并在搜索过程中访问不可行的解决方案。一个贪婪的启发式构造一个初始解。
英文摘要：
Vehicle Routing Problem is a well-known problem in logistics and transportation, and the variety of such problems is explained by the fact that it occurs in many real-life situations. It is an NP-hard combinatorial optimization problem and finding an exact optimal solution is practically impossible. In this work, Site-Dependent Truck and Trailer Routing Problem with hard and soft Time Windows and Split Deliveries is considered (SDTTRPTWSD). In this article, we develop a heuristic with the elements of Tabu Search for solving SDTTRPTWSD. The heuristic uses the concept of neighborhoods and visits infeasible solutions during the search. A greedy heuristic is applied to construct an initial solution.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
