摘要
为了解决自动导引小车系统(AGV S)中由于两辆以上自动导引小车竞争同一资源(通道或缓冲区)所引起的碰撞导致的运输能力设计问题,提出了一种基于贪心算法的时间窗技术方法.仿真实验表明,该方法完全可以解决这一问题,同时可以使系统的运输能力最大化.
To solve design problem of transportation capacity, caused by two or more AGVs in AGVS competing the same resource, a time window technology based on greedy algorithm is presented. Simulation experiments indicate that this method can completely solve this problem and meantime maximize the transportation capacity of this system.
出处
《工程设计学报》
CSCD
北大核心
2005年第6期359-362,共4页
Chinese Journal of Engineering Design
关键词
AGVS
时间窗
贪心算法
避碰问题
运输能力设计
AGVS
time window
greedy algorithm
conflict-free problem
design of transportation capability
