Optimal flow path design of unidirectional AGV systems

Moshe Kaspi; J. M.A. Tanchoco

doi:10.1080/00207549008942772

Optimal flow path design of unidirectional AGV systems

Moshe Kaspi, J. M.A. Tanchoco

Research output: Contribution to journal › Article › peer-review

122 Scopus citations

Abstract

This paper describes an alternative formulation of the AGV flow path layout (FPL) problem which was first formulated by Gaskins and Tanchoco (1987) as a zero-one integer programming problem. A computationally efficient procedure is proposed which is based on the branch-and-bound technique. An algorithm for satisfying the reachability condition for nodes in the AGV flow path network is also presented. A simple illustrative example is discussed to demonstrate the procedure, and a more complex problem is also given.

Original language	English
Pages (from-to)	1023-1030
Number of pages	8
Journal	International Journal of Production Research
Volume	28
Issue number	6
DOIs	https://doi.org/10.1080/00207549008942772
State	Published - 1 Jan 1990
Externally published	Yes

ASJC Scopus subject areas

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

Access to Document

10.1080/00207549008942772

Cite this

@article{2ec4fc55bed8471ea1093b0c774b2b4e,

title = "Optimal flow path design of unidirectional AGV systems",

abstract = "This paper describes an alternative formulation of the AGV flow path layout (FPL) problem which was first formulated by Gaskins and Tanchoco (1987) as a zero-one integer programming problem. A computationally efficient procedure is proposed which is based on the branch-and-bound technique. An algorithm for satisfying the reachability condition for nodes in the AGV flow path network is also presented. A simple illustrative example is discussed to demonstrate the procedure, and a more complex problem is also given.",

author = "Moshe Kaspi and Tanchoco, {J. M.A.}",

year = "1990",

month = jan,

day = "1",

doi = "10.1080/00207549008942772",

language = "English",

volume = "28",

pages = "1023--1030",

journal = "International Journal of Production Research",

issn = "0020-7543",

publisher = "Taylor and Francis Ltd.",

number = "6",

}

TY - JOUR

T1 - Optimal flow path design of unidirectional AGV systems

AU - Kaspi, Moshe

AU - Tanchoco, J. M.A.

PY - 1990/1/1

Y1 - 1990/1/1

N2 - This paper describes an alternative formulation of the AGV flow path layout (FPL) problem which was first formulated by Gaskins and Tanchoco (1987) as a zero-one integer programming problem. A computationally efficient procedure is proposed which is based on the branch-and-bound technique. An algorithm for satisfying the reachability condition for nodes in the AGV flow path network is also presented. A simple illustrative example is discussed to demonstrate the procedure, and a more complex problem is also given.

AB - This paper describes an alternative formulation of the AGV flow path layout (FPL) problem which was first formulated by Gaskins and Tanchoco (1987) as a zero-one integer programming problem. A computationally efficient procedure is proposed which is based on the branch-and-bound technique. An algorithm for satisfying the reachability condition for nodes in the AGV flow path network is also presented. A simple illustrative example is discussed to demonstrate the procedure, and a more complex problem is also given.

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

U2 - 10.1080/00207549008942772

DO - 10.1080/00207549008942772

M3 - Article

AN - SCOPUS:0009338739

SN - 0020-7543

VL - 28

SP - 1023

EP - 1030

JO - International Journal of Production Research

JF - International Journal of Production Research

IS - 6

ER -

Optimal flow path design of unidirectional AGV systems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this