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

Research output: Contribution to journalArticle

12 Citations (Scopus)

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 languageEnglish
Pages (from-to)471-487
Number of pages17
JournalOR Spectrum
Volume29
Issue number3
DOIs
Publication statusPublished - 2007 Jul 1

Fingerprint

Tabu search
Automated guided vehicles
Experiment
Mathematical model
Long-term memory
Optimal solution

Keywords

  • AGV system
  • Tabu search
  • Unidirectional flow path

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems. / Seo, Yoon Ho; Lee, Chul Ung; Moon, Chiung.

In: OR Spectrum, Vol. 29, No. 3, 01.07.2007, p. 471-487.

Research output: Contribution to journalArticle

@article{f2df25541b2b4bc0ae068172b6fcc010,
title = "Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems",
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).",
keywords = "AGV system, Tabu search, Unidirectional flow path",
author = "Seo, {Yoon Ho} and Lee, {Chul Ung} and Chiung Moon",
year = "2007",
month = "7",
day = "1",
doi = "10.1007/s00291-006-0047-2",
language = "English",
volume = "29",
pages = "471--487",
journal = "Operations-Research-Spektrum",
issn = "0171-6468",
publisher = "Springer Verlag",
number = "3",

}

TY - JOUR

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

AU - Seo, Yoon Ho

AU - Lee, Chul Ung

AU - Moon, Chiung

PY - 2007/7/1

Y1 - 2007/7/1

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

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

KW - AGV system

KW - Tabu search

KW - Unidirectional flow path

UR - http://www.scopus.com/inward/record.url?scp=34249747893&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34249747893&partnerID=8YFLogxK

U2 - 10.1007/s00291-006-0047-2

DO - 10.1007/s00291-006-0047-2

M3 - Article

VL - 29

SP - 471

EP - 487

JO - Operations-Research-Spektrum

JF - Operations-Research-Spektrum

SN - 0171-6468

IS - 3

ER -