返回
Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
DOI:10.1016/j.cor.2014.07.008.png)
摘要
En 中文
The corridor allocation problem (CAP) seeks an effective placement of given facilities in two parallel rows on opposite sides of a central corridor. The placement of the facilities in both the rows starts from the same level along the corridor and no gap is allowed between two facilities of a row. The CAP is formulated here as a nonlinear bi-objective optimization problem, in which both the overall flow cost among the facilities and the length of the corridor are to be minimized. A permutation-based genetic algorithm (pGA) is applied to handle the CAP as an unconstrained bi-objective optimization problem. The performance of the pGA is demonstrated through its application to a number of instances of varying sizes available in the literature. The results presented in this paper can be used as benchmark instances in the future work on the CAP. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Combinatorial optimization
Corridor allocation
Multi-objective optimization
Genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
2.3W
机构
引用论文
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods使用穷举2-opt和插入邻域的单行设施布局问题的禁忌搜索

