Two optimal algorithms for finding bi-directional shortest path design problem in a block layout
محورهای موضوعی : Mathematical Optimization
M Hamzeei
1
(M.Sc., Dep. of Industrial Engineering, Sharif University of Technology, Tehran, Iran)
R Zanjirani Farahani
2
(Assistant Professor, Dep. of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran)
کلید واژه: AGV, Block layout, Bi-directional path, Integer Linear Programming, Branch-and-Cut,
چکیده مقاله :
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are to find the shortest path. The path must be connected and incident to all cells at least in one edge or node. A simple Branch-and-Cut ap-proach is used to solve the ILP models. Computational results show that the models easily can solve the prob-lem with less than 45 cells using a commercial ILP solver.
