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).
Original language | English |
---|---|
Pages (from-to) | 471-487 |
Number of pages | 17 |
Journal | OR Spectrum |
Volume | 29 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2007 Jul |
Keywords
- AGV system
- Tabu search
- Unidirectional flow path
ASJC Scopus subject areas
- Management Science and Operations Research