This article discusses the guide path design of automated guided vehicle (AGV) systems for which we propose a model that incorporates a dynamic multicommodity flow with capacity constraints from a pickup to a delivery point. The problem is formulated as the selection of a guide path connecting a given set of pickup/delivery points. A cell-based local search that is based on an original neighborhood technique is developed. In the proposed method, the guide path is effectively optimized based on a local search of cell-based neighborhood search preserving connectivity constraints and the subsequent solution of a dynamic multicommodity flow problem. The performance of the proposed method is strengthened by the redundant elimination of arcs and intensification of search according to the concept of the flow-concentrated cell. The effectiveness of the proposed method is demonstrated by comparing it with a general-purpose solver and recent algorithms for fixed-charge capacitated multicommodity network design problems. A real case study is presented to demonstrate the applicability of the proposed method by using simulation software.

中文翻译：

---

基于单元的局部搜索启发式动态多商品流自动导引车系统的引导路径设计


本文讨论了自动导引车 (AGV) 系统的引导路径设计，我们提出了一个模型，该模型将动态多商品流与从取货点到交货点的容量限制相结合。该问题被表述为选择连接给定的一组取货/送货点的引导路径。开发了一种基于原始邻域技术的基于单元的局部搜索。在所提出的方法中，基于基于单元的邻域搜索的局部搜索保留连通性约束以及动态多商品流问题的后续解决方案，有效地优化了引导路径。根据流集中单元的概念，通过冗余消除弧和强化搜索来增强该方法的性能。通过将所提出的方法与固定电荷容量多商品网络设计问题的通用求解器和最新算法进行比较，证明了该方法的有效性。通过使用仿真软件，提出了一个真实的案例研究来证明该方法的适用性。