Extensions of the unidirectional flow path design problem solved by efficient metaheuristics
Abstract
The flow path design problem is one of the most important issues in AGV (automated guided vehicles) systems design. It consists in the determination of each segment direction and the paths to used for automated vehicles in production units. Performances of a system is influenced by organization of these roads because the transport time and the number of necessary vehicles depends on. This work deals with flow path design problem for a conventional unidirectional network. Some new extensions of the total travel distance minimization considering both loaded and empty travels is presented and solved by efficient metaheuristics. Extensions consist in adding different type of vehicle, not allowed some segments and taking into account construction costs. This study is made in collaboration with ANDRA (National Agency for Radioactive Waste Management).