ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Configuration space evolutionary algorithm for multi-objective unequal-area facility layout problems with flexible bays

Liu, Jingfa*; Liu, Siyu; Liu, Zhaoxia; Li, Biguangdong univ foreign studies; nanjing univ informat sci & technol
APPLIED SOFT COMPUTING2020-4DOI: 10.1016/j.asoc.2019.106052
13被引2阅读
引用收藏
分享

摘要

Facility layout problem (FLP) which deals with the layout of facilities within a given plant floor is an NP-hard combinatorial optimization problem. This paper studies multi-objective unequal-area facility layout problems (UA-FLPs) with the flexible bay structure (FBS), whose objectives refer to the material handling cost, the closeness relationship, the distance requirement and the aspect ratio of facilities. In recent years, some successes have been achieved by multi-objective evolutionary algorithms (MOEAs) for solving various kinds of optimization problems with multiple conflicting objectives. However, traditional MOEAs face a great challenge in the convergence and diversity of solutions for UA-FLPs. In this paper, a novel MOEA called the configuration space evolutionary (CSE) algorithm is developed to solve the UA-FLPs with multiple objectives. We consider a mating pool called a configuration (solution) bank in the CSE, and use evolutionary operations (selection, novel crossover and mutation) to produce new configurations of the pool. By introducing a measure of the radius d(spaces) of the configuration bank, whose value is gradually reduced to narrow the search space, the convergence of solutions in the CSE is controlled. A method of the nearest and farthest candidate solution based on objective function normalization is combined with the fast non-dominated sorting to choose the Pareto-optimal solutions, which is good for the algorithm to keep diversity of the obtained solutions. The main contributions of this study lie in the use of a mechanism of evolution of population in the algorithm based on a configuration bank, and the use of a selection strategy based on the nearest and farthest candidate solution method, in order to improve the convergence and diversity of solutions. Experiments are carried out on eight different representative instances and performance metrics from the literature. Compared with the existing MOEAs, the CSE is able to find the better results and show better performance. The numerical experiments confirm the effectiveness of the CSE for solving multi-objective UA-FLPs.

学科与关键词

关键词
Multi-objective optimizationConfiguration space evolutionary algorithmFlexible bay structurePareto-optimal solutionsFacility layout problem
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
APPLIED SOFT COMPUTING
发表日期
2020-04
卷期
第 89 卷
页码
106052
DOI
10.1016/j.asoc.2019.106052
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
1区
成果收录
SCIE
资助标注
Natural Science Foundation of Jiangsu Province [BK20181409]; Major Program of the National Social Science Foundation of China [16ZDA047]; Special Foundation of Guangzhou Key Laboratory of Multilingual Intelligent Processing, China [201905010008]; Program of Basic and Applied Basic Research of Guangzhou, China

作者

  • L

    Liu, Jingfa (通讯) (第一作者)

    guangdong univ foreign studies

  • L

    Liu, Siyu

    nanjing univ informat sci & technol

查看全部 4 位作者收起作者
  • L

    Liu, Zhaoxia

    guangdong univ foreign studies

  • L

    Li, Bi

    guangdong univ foreign studies

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417