Optimal dwell point location of automated guided vehicles to minimize mean response time in a loop layout

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

An important control issue in operating an automated guided vehicle system is where to locate idle vehicles. Dwell points for idle vehicles affect the performance of manufacturing systems. A polynomial time algorithm has been developed to determine dwell points for idle automated guided vehicles that minimize the mean response time. Both uni- and bidirectional loop layouts are considered. The proposed algorithm, based on a dynamic programming model, partitions the set of pick-up stations into subsets so that a single vehicle serves all stations in a subset. The dynamic programming algorithm has been streamlined by applying certain optimality properties. Computational results show that the proposed algorithm can solve large-scale problems in a reasonable time. A simulation experiment has also been conducted to compare several idle vehicle positioning rules, and the results show that best performance is obtained by positioning idle vehicles in dwell points that minimize the mean response time.

Original languageEnglish (US)
Pages (from-to)4013-4031
Number of pages19
JournalInternational Journal of Production Research
Volume39
Issue number17
DOIs
StatePublished - Jan 1 2001

Fingerprint

Dynamic programming
Response time
Automated guided vehicles
Layout
Set theory
Polynomials
Positioning
Experiments
Manufacturing systems
Optimality
Simulation experiment
Polynomial-time algorithm

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

@article{12b4c54487d5424a940c87a5498cc44c,
title = "Optimal dwell point location of automated guided vehicles to minimize mean response time in a loop layout",
abstract = "An important control issue in operating an automated guided vehicle system is where to locate idle vehicles. Dwell points for idle vehicles affect the performance of manufacturing systems. A polynomial time algorithm has been developed to determine dwell points for idle automated guided vehicles that minimize the mean response time. Both uni- and bidirectional loop layouts are considered. The proposed algorithm, based on a dynamic programming model, partitions the set of pick-up stations into subsets so that a single vehicle serves all stations in a subset. The dynamic programming algorithm has been streamlined by applying certain optimality properties. Computational results show that the proposed algorithm can solve large-scale problems in a reasonable time. A simulation experiment has also been conducted to compare several idle vehicle positioning rules, and the results show that best performance is obtained by positioning idle vehicles in dwell points that minimize the mean response time.",
author = "Chulung Lee and Ventura, {Jose Antonio}",
year = "2001",
month = "1",
day = "1",
doi = "10.1080/00207540110054605",
language = "English (US)",
volume = "39",
pages = "4013--4031",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "17",

}

Optimal dwell point location of automated guided vehicles to minimize mean response time in a loop layout. / Lee, Chulung; Ventura, Jose Antonio.

In: International Journal of Production Research, Vol. 39, No. 17, 01.01.2001, p. 4013-4031.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Optimal dwell point location of automated guided vehicles to minimize mean response time in a loop layout

AU - Lee, Chulung

AU - Ventura, Jose Antonio

PY - 2001/1/1

Y1 - 2001/1/1

N2 - An important control issue in operating an automated guided vehicle system is where to locate idle vehicles. Dwell points for idle vehicles affect the performance of manufacturing systems. A polynomial time algorithm has been developed to determine dwell points for idle automated guided vehicles that minimize the mean response time. Both uni- and bidirectional loop layouts are considered. The proposed algorithm, based on a dynamic programming model, partitions the set of pick-up stations into subsets so that a single vehicle serves all stations in a subset. The dynamic programming algorithm has been streamlined by applying certain optimality properties. Computational results show that the proposed algorithm can solve large-scale problems in a reasonable time. A simulation experiment has also been conducted to compare several idle vehicle positioning rules, and the results show that best performance is obtained by positioning idle vehicles in dwell points that minimize the mean response time.

AB - An important control issue in operating an automated guided vehicle system is where to locate idle vehicles. Dwell points for idle vehicles affect the performance of manufacturing systems. A polynomial time algorithm has been developed to determine dwell points for idle automated guided vehicles that minimize the mean response time. Both uni- and bidirectional loop layouts are considered. The proposed algorithm, based on a dynamic programming model, partitions the set of pick-up stations into subsets so that a single vehicle serves all stations in a subset. The dynamic programming algorithm has been streamlined by applying certain optimality properties. Computational results show that the proposed algorithm can solve large-scale problems in a reasonable time. A simulation experiment has also been conducted to compare several idle vehicle positioning rules, and the results show that best performance is obtained by positioning idle vehicles in dwell points that minimize the mean response time.

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

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

U2 - 10.1080/00207540110054605

DO - 10.1080/00207540110054605

M3 - Article

VL - 39

SP - 4013

EP - 4031

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 17

ER -