Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems

Citations

WEB OF SCIENCE

8
Citations

SCOPUS

15

초록

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).

키워드

tabu search; unidirectional flow path; AGV system; AGV SYSTEMS; MANUFACTURING SYSTEMS; DISPATCHING RULES; SHORTEST-PATH; LOOP; LAYOUT; ASSIGNMENT
제목
Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems
저자
Seo, Yoonho; Lee, Chulung; Moon, Chiung
DOI
10.1007/s00291-006-0047-2
발행일
2007-07
유형
Article
저널명
OR Spektrum
권
29
호
3
페이지
471 ~ 487