Abstract
The unidirectional flow path design problem is one of the most important but difficult problems for the efficient design of automated-guided vehicle systems. As the problem was first formulated by Gaskins and Tanchoco, many researchers have studied the problem. However, the existing solution methods fail to provide an efficient solution approach. In this paper, a mathematical model for the unidirectional flow path design problem is developed. To obtain a near-to-optimal solution in reasonable computation time, a tabu search algorithm is presented. A fast construction algorithm first obtains a feasible initial solution, and a long-term memory structure and a neighbor solution generation approach are adapted to the problem characteristics and embedded in the proposed tabu search algorithm. Computational experiments show that the developed tabu search algorithm outperforms the Ko and Egbelu’s algorithm, Int J Prod Res, 41:2325–2343, (2003).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs, NJ
Benjaafar S (2002) Modeling and analysis of congestion in the design of facility layouts. Manage Sci 48(5):679–704
Bozer YA, Srinivasan MM (1991) Tandem configurations for automated guided vehicle systems and the analysis of single vehicle loop. J Manuf Syst 15(4):226–236
Chang S-H, Egbelu PJ (1996) Dynamic relative positioning of AGVs in a loop layout to minimize mean system response time. Int J Prod Res 34(6):1655–1673
Chiang W-C, Kouvelis P (1996) An improved tabu search heuristic for solving facility layout design problems. Int J Prod Res 34(9):2565–2585
De Guzman MC, Prabhu N, Tanchoco JMA (1997) Complexity of the AGV shortest path and single-loop guide path layout problems. Int J Prod Res 35(8):2083–2092
Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271
Egbelu PJ, Tanchoco JMA (1984) Characterization of automatic guided vehicle dispatching rules. Int J Prod Res 22(3):359–374
Farahani RZ, Laporte G, Sharifyazdi M (2005) A practical exact algorithm for the shortest loop design problem in a block layout. Int J Prod Res 43(9):1879–1887
Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5:345
Ganesharajah T, Hall NG, Sriskandarajah C (1998) Design and operational issues in AGV-served manufacturing systems. Ann Oper Res 76:109–154
Gaskins RJ, Tanchoco JMA (1987) Flow path design for automated guided vehicle systems. Int J Prod Res 25:667–676
Gaskins RJ, Tanchoco JMA, Taghaboni F (1989) Virtual flow paths for free-ranging automated guided vehicle systems. Int J Prod Res 27(1):91–100
Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156–166
Glover F (1989) Tabu search—Part I. ORSA J Comput 1:190–206
Glover F (1990) Tabu search—Part II. ORSA J Comput 2:4–32
Glover F, Laguna M (1997) Tabu search. Kluwer, Boston, MA
Goetz WG Jr, Egbelu PJ (1990) Guide path design and location of load pick-up/drop-off points for an automated guided vehicle system. Int J Prod Res 28:927–941
Ho Y-C, Hsieh P-F (2004) A machine-to-loop assignment and layout design methodology for tandem AGV systems with multiple-load vehicles. Int J Prod Res 42(4):801–832
Hoff EB, Sarker BR (1998) An overview of path design and dispatching methods for automated guided vehicles. Integr Manuf Syst 9(5):296–307
Kaspi M, Tanchoco JMA (1990) Optimal flow design of unidirectional AGV systems. Int J Prod Res 28(6):1023–1030
Kaspi M, Kesselman U, Tanchoco JMA (2002) Optimal solution for the flow path design problem of a balanced unidirectional AGV system. Int J Prod Res 40(2):389–401
Ko KC, Egbelu PJ (2003) Unidirectional AGV guidepath network design: a heuristic algorithm. Int J Prod Res 41:2325–2343
Kouvelis P, Kim MW (1992) Unidirectional loop network layout problem in automated manufacturing systems. Oper Res 40(3):533–550
Moon YM, Kota S (2002) Design of reconfigurable machine tools. Trans Am Soc Mech Eng 124:480–483
Seo Y, Egbelu PJ (1995) Flexible guidepath design for automated guided vehicle systems. Int J Prod Res 33:1135–1156
Sinreich D, Tanchoco JMA (1993) Solution methods for the mathematical models of single-loop AGV systems. Int J Prod Res 31(4):705–725
Sinriech D, Tanchoco JMA (1995) An introduction to the segmented flow approach for discrete material flow systems. Int J Prod Res 33(12):3381–3410
Skorin-Kapov J (1990) Tabu search applied to the quadratic assignment problem. ORSA J Comput 2(1):33–45
Skorin-Kapov J (1994) Extension of a tabu search adaptation to the quadratic assignment problem. Comput Oper Res 21(8):855–865
Sun X-C, Tchernev N (1996) Impact of empty vehicle flow on optimal flow path design for unidirectional AGV systems. Int J Prod Res 34(10):2827–2852
Ventura JA, Lee C (2001) A study of the tandem loop with multiple vehicles configuration for automated guided vehicle systems. J Manuf Syst 20(3):153–165
Acknowledgements
This research is supported by the fund from the Basic Research Program (grant No.: R01-2002-000-00232-0) of the Korea Science and Engineering Foundation.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Seo, Y., Lee, C. & Moon, C. Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems. OR Spectrum 29, 471–487 (2007). https://doi.org/10.1007/s00291-006-0047-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-006-0047-2