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

An effective PSO-based hybrid algorithm for multiobjective permutation flow shop scheduling

Li, Bin-Bin*; Wang, Ling; Liu, Bo清华大学
IEEE Transactions on Systems, Man and Cybernetics Part A: Systems and Humans.2008-7DOI: 10.1109/TSMCA.2008.923086
93被引10阅读
引用收藏
分享

摘要

This paper proposes a hybrid algorithm based on particle swarm optimization (PSO) for a multiobjective permutation flow shop scheduling problem, which is a typical NP-hard combinatorial optimization problem with strong engineering backgrounds. Not only does the proposed multiobjective algorithm (named MOPSO) apply the parallel evolution mechanism of PSO characterized by individual improvement, population cooperation, and competition to effectively perform exploration but it also utilizes several adaptive local search methods to perform exploitation. First, to make PSO suitable for solving scheduling problems, a ranked-order value (ROV) rule based on a random key technique to convert the continuous position values of particles to job permutations is presented. Second, a multiobjective local search based on the Nawaz-Enscore-Ram heuristic is applied to good solutions with a specified probability to enhance the exploitation ability. Third, to enrich the searching behavior and to avoid premature convergence, a multiobjective local search based on simulated annealing with multiple different neighborhoods is designed, and an adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood will be used. Due to the fusion of multiple different searching operations, good solutions approximating the real Pareto front can be obtained. In addition, MOPSO adopts a random weighted linear sum function to aggregate multiple objectives to a single one for solution evaluation and for guiding the evolution process in the multiobjective sense. Due to the randomness of weights, searching direction can be enriched, and solutions with good diversity can be obtained. Simulation results and comparisons based on a variety of instances demonstrate the effectiveness, efficiency, And robustness of the proposed hybrid algorithm.

学科与关键词

关键词
adaptive meta-Lamarckian learninghybrid algorithmlocal searchmultiobjective optimization (MOO)Pareto frontparticle swarm optimization (PSO)permutation flow shop scheduling
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
IEEE Transactions on Systems, Man and Cybernetics Part A: Systems and Humans.
发表日期
2008-07
卷期
第 38 卷, 第 4 期
页码
818-831
DOI
10.1109/TSMCA.2008.923086
语言
ENGLISH
成果收录
SCIE

作者

  • L

    Li, Bin-Bin (通讯) (第一作者)

    tsinghua univ

  • W

    Wang, Ling

    tsinghua univ

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

    Liu, Bo

    tsinghua univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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