Abstract
One of the most important factors in the design of automated guided vehicle system (AGVS) is the flow path design. The unidirectional/ conventional flow path design in automated guided vehicle (AGV) routing problem considers aisles to be undirected so that each pair of cells could be reached mutually. Regarding the flow between cells, this chapter presents a novel algorithm to minimize the total distance traveled by the loaded vehicles on the block layout graph. The algorithm is an efficient branch-and-band method with branches on the feasible solutions to solve the strongly connected graph layout. To find the feasible and efficient flow path, the authors use the Revised-DFS based on testing connectivity of the graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
