Locating input and output points in facilities design - A comparison of constructive, evolutionary, and exact methods

Rifat Aykut Arapoglu; Bryan A. Norman; Alice E. Smith

doi:10.1109/4235.930310

Locating input and output points in facilities design - A comparison of constructive, evolutionary, and exact methods

Rifat Aykut Arapoglu, Bryan A. Norman, Alice E. Smith

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

21 Scopus citations

Abstract

This paper formulates and compares four new approaches to optimally locate the input and output station for each department within a facility design such that material handling costs are minimized. This problem is an NP-hard combinatorial problem with many real-life applications of considerable economic consequence. A genetic algorithm (GA) is shown to be an effective and efficient optimization method when compared to integer programming, simulated annealing, and three versions of a greedy constructive heuristic on a suite of test problems of varying size. Seeding versus random initialization of GA populations are compared.

Original language	English
Pages (from-to)	192-203
Number of pages	12
Journal	IEEE Transactions on Evolutionary Computation
Volume	5
Issue number	3
DOIs	https://doi.org/10.1109/4235.930310
State	Published - Jun 2001

Keywords

Genetic alogorithms
Materials handling
Optimization methods

Access to Document

10.1109/4235.930310

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Locating input and output points in facilities design - A comparison of constructive, evolutionary, and exact methods'. Together they form a unique fingerprint.

Cite this

@article{258098f723994b648cd79d09ac178218,

title = "Locating input and output points in facilities design - A comparison of constructive, evolutionary, and exact methods",

abstract = "This paper formulates and compares four new approaches to optimally locate the input and output station for each department within a facility design such that material handling costs are minimized. This problem is an NP-hard combinatorial problem with many real-life applications of considerable economic consequence. A genetic algorithm (GA) is shown to be an effective and efficient optimization method when compared to integer programming, simulated annealing, and three versions of a greedy constructive heuristic on a suite of test problems of varying size. Seeding versus random initialization of GA populations are compared.",

keywords = "Genetic alogorithms, Materials handling, Optimization methods",

author = "Arapoglu, {Rifat Aykut} and Norman, {Bryan A.} and Smith, {Alice E.}",

year = "2001",

month = jun,

doi = "10.1109/4235.930310",

language = "English",

volume = "5",

pages = "192--203",

journal = "IEEE Transactions on Evolutionary Computation",

issn = "1089-778X",

number = "3",

}

TY - JOUR

T1 - Locating input and output points in facilities design - A comparison of constructive, evolutionary, and exact methods

AU - Arapoglu, Rifat Aykut

AU - Norman, Bryan A.

AU - Smith, Alice E.

PY - 2001/6

Y1 - 2001/6

N2 - This paper formulates and compares four new approaches to optimally locate the input and output station for each department within a facility design such that material handling costs are minimized. This problem is an NP-hard combinatorial problem with many real-life applications of considerable economic consequence. A genetic algorithm (GA) is shown to be an effective and efficient optimization method when compared to integer programming, simulated annealing, and three versions of a greedy constructive heuristic on a suite of test problems of varying size. Seeding versus random initialization of GA populations are compared.

AB - This paper formulates and compares four new approaches to optimally locate the input and output station for each department within a facility design such that material handling costs are minimized. This problem is an NP-hard combinatorial problem with many real-life applications of considerable economic consequence. A genetic algorithm (GA) is shown to be an effective and efficient optimization method when compared to integer programming, simulated annealing, and three versions of a greedy constructive heuristic on a suite of test problems of varying size. Seeding versus random initialization of GA populations are compared.

KW - Genetic alogorithms

KW - Materials handling

KW - Optimization methods

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

U2 - 10.1109/4235.930310

DO - 10.1109/4235.930310

M3 - Article

AN - SCOPUS:0035362129

VL - 5

SP - 192

EP - 203

JO - IEEE Transactions on Evolutionary Computation

JF - IEEE Transactions on Evolutionary Computation

SN - 1089-778X

IS - 3

ER -