随机到达Agent通过连通网络的最优最小接触路由
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。