A problem evolution algorithm with linear programming for the dynamic facility layout problem—A general layout formulation

•The problem evolution algorithm (PEA) is developed to solve the Facility Layout Problem (FLP).•The PEA-LP works very well in solving various FLP benchmark problems.•A polyhedral inner-approximation is proposed for the nonlinear department area constraints.•Two symmetry-breaking constraints are intr...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 88; s. 187 - 207
Hlavní autoři:	Xiao, Yiyong, Xie, Yue, Kulturel-Konak, Sadan, Konak, Abdullah
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.12.2017 Pergamon Press Inc
Témata:	Algorithms Computational mathematics Computing time Evolution algorithm Evolutionary algorithms Facilities management Facility layout Heuristic Heuristic methods Hybrid optimization Integer programming Linear programming Mixed integer Mixed integer linear programming Operations research Studies Evolution algorithm Facility layout Mixed integer linear programming Hybrid optimization
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!