.png){kind=icon}
Return
Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2021.105283.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The bi-objective double-floor corridor allocation problem (bDFCAP) investigated here explores the effective placement of given departments in a double-floor space to minimise the overall flow cost and the corridor length objectives. Within each floor, departments are arranged in two parallel rows on opposite sides along a central corridor without overlapping. In this study, the bDFCAP is formulated as a mixed integer linear programming model, which has improved the performance over the previous one. Thereafter, a genetic algorithm with a variable neighbourhood search technique is designed and employed to solve the bDFCAP in a more effective manner. This technique is utilized to improve the local search capability by adaptively transforming between a deep-searching strategy and broad-searching strategy, and the superior performance of the proposed method is proven through comparisons with two other algorithms in current literature. Besides, the state-of-the-art lower bounds of several benchmark instances are updated.
Keywords:
Facility layout design
Multi-objective optimisation
Genetic algorithm
Mixed integer linear programming
Variable neighbourhood search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
ShareSaveShareSave
View more