论文标题
通过连接的网络随机到达代理的最佳最小接触路由
Optimal minimal-contact routing of randomly arriving agents through connected networks
论文作者
论文摘要
通过连接的网络通过无碰撞或无接触性路由在工业自动化和制造环境中进行了积极研究。通过连接的网络（例如，工厂，零售仓库）对人员的无联系路由也可能需要在COVID-19上下文中。在这种情况下，我们提出了一个优化框架，用于通过连接的网络识别路由，该网络消除或最小化需要在最小时间内访问网络中的一部分节点之间的随机到达代理之间的联系。我们模拟了代理到达和网络遍历过程，并在行进速度，节点停留时间以及遵守分配的路线中引入随机性。我们提供了两个优化公式，用于实时生成最佳路由 - 无接触和最小接口 - ，对于到达网络的每个代理，给定了网络中的其他代理信息。我们为网络中所花费的时间平均数量和标准化时间生成结果。
Collision-free or contact-free routing through connected networks has been actively studied in the industrial automation and manufacturing context. Contact-free routing of personnel through connected networks (e.g., factories, retail warehouses) may also be required in the COVID-19 context. In this context, we present an optimization framework for identifying routes through a connected network that eliminate or minimize contacts between randomly arriving agents needing to visit a subset of nodes in the network in minimal time. We simulate the agent arrival and network traversal process, and introduce stochasticity in travel speeds, node dwell times, and compliance with assigned routes. We present two optimization formulations for generating optimal routes - no-contact and minimal-contact - on a real-time basis for each agent arriving to the network given the route information of other agents already in the network. We generate results for the time-average number of contacts and normalized time spent in the network.
