Optimally locating multiple dwell points in a single loop guide path system

José A. Ventura, Chul Ung Lee

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Dwell points for idle vehicles affect the performance of automated guided vehicle systems. An exact polynomial-time algorithm to solve idle vehicle positioning problems in both unidirectional and bidirectional single loop systems is developed to minimize the maximum response time. The proposed algorithm considers several potential locations for the first dwell point and applies a dynamic programming procedure to obtain the remaining dwell points for each initial location. The algorithm is streamlined by applying certain optimality properties. Computational results show that the algorithm can solve large-scale problems in reasonable time.

Original languageEnglish
Pages (from-to)727-737
Number of pages11
JournalIIE Transactions (Institute of Industrial Engineers)
Volume35
Issue number8
DOIs
Publication statusPublished - 2003 Aug 1
Externally publishedYes

Fingerprint

Dynamic programming
Polynomials
Automated guided vehicles
Positioning
Optimality
Polynomial-time algorithm
Response time

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research

Cite this

Optimally locating multiple dwell points in a single loop guide path system. / Ventura, José A.; Lee, Chul Ung.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 35, No. 8, 01.08.2003, p. 727-737.

Research output: Contribution to journalArticle

@article{ecfa8b69269043c18622c200a2904be7,
title = "Optimally locating multiple dwell points in a single loop guide path system",
abstract = "Dwell points for idle vehicles affect the performance of automated guided vehicle systems. An exact polynomial-time algorithm to solve idle vehicle positioning problems in both unidirectional and bidirectional single loop systems is developed to minimize the maximum response time. The proposed algorithm considers several potential locations for the first dwell point and applies a dynamic programming procedure to obtain the remaining dwell points for each initial location. The algorithm is streamlined by applying certain optimality properties. Computational results show that the algorithm can solve large-scale problems in reasonable time.",
author = "Ventura, {Jos{\'e} A.} and Lee, {Chul Ung}",
year = "2003",
month = "8",
day = "1",
doi = "10.1080/07408170304346",
language = "English",
volume = "35",
pages = "727--737",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "8",

}

TY - JOUR

T1 - Optimally locating multiple dwell points in a single loop guide path system

AU - Ventura, José A.

AU - Lee, Chul Ung

PY - 2003/8/1

Y1 - 2003/8/1

N2 - Dwell points for idle vehicles affect the performance of automated guided vehicle systems. An exact polynomial-time algorithm to solve idle vehicle positioning problems in both unidirectional and bidirectional single loop systems is developed to minimize the maximum response time. The proposed algorithm considers several potential locations for the first dwell point and applies a dynamic programming procedure to obtain the remaining dwell points for each initial location. The algorithm is streamlined by applying certain optimality properties. Computational results show that the algorithm can solve large-scale problems in reasonable time.

AB - Dwell points for idle vehicles affect the performance of automated guided vehicle systems. An exact polynomial-time algorithm to solve idle vehicle positioning problems in both unidirectional and bidirectional single loop systems is developed to minimize the maximum response time. The proposed algorithm considers several potential locations for the first dwell point and applies a dynamic programming procedure to obtain the remaining dwell points for each initial location. The algorithm is streamlined by applying certain optimality properties. Computational results show that the algorithm can solve large-scale problems in reasonable time.

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

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

U2 - 10.1080/07408170304346

DO - 10.1080/07408170304346

M3 - Article

AN - SCOPUS:0042705569

VL - 35

SP - 727

EP - 737

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 8

ER -