최적 경로와 최소 AGV 댓수를 갖는 AGVS에 관한 연구

An optimal flow path design & minimum numbers of vehicle for AGVS

This paper presents that model 1 is to show an approach to determining unidirection or bidirection of the optimal flow path design, model 2 is to show the design of an AGV can determine the minimum number of required vehicles. Our purposes of this article are that first, it is easy to see that computationlly advanced efficient procedure with some pairwises of comparision, zero-one integer and northwest rule by using, second, to determine the minimum number of vehicles in the layout for manufacturing facility, we used a coefficient ratio with moved numbers of loaded & unloaded vehicles between stations and available time of AGV's capacity for per shift per vehicle. Example is presented to demonstrate the approach.