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

Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues

Juan, Angel A.*; Lourenco, Helena R.; Mateo, Manuel; Luo, Rachel; Castella, Quim
International Transactions in Operational Research2014-1DOI: 10.1111/itor.12028
56被引5阅读
引用收藏
分享

摘要

Iterated local search (ILS) is a powerful framework for developing efficient algorithms for the permutation flow-shop problem (PFSP). These algorithms are relatively simple to implement and use very few parameters, which facilitates the associated fine-tuning process. Therefore, they constitute an attractive solution for real-life applications. In this paper, we discuss some parallelization, parametrization, and randomization issues related to ILS-based algorithms for solving the PFSP. In particular, the following research questions are analyzed: (a) Is it possible to simplify even more the parameter setting in an ILS framework without affecting performance? (b) How do parallelized versions of these algorithms behave as we simultaneously vary the number of different runs and the computation time? (c) For a parallelized version of these algorithms, is it worthwhile to randomize the initial solution so that different starting points are considered? (d) Are these algorithms affected by the use of a good-quality pseudorandom number generator? In this paper, we introduce the new ILS-ESP (where ESP is efficient, simple, and parallelizable) algorithm that is specifically designed to take advantage of parallel computing, allowing us to obtain competitive results in real time for all tested instances. The ILS-ESP also uses natural parameters, which simplifies the calibration process. An extensive set of computational experiments has been carried out in order to answer the aforementioned research questions.

学科与关键词

关键词
flow-shop problemschedulingiterated local searchparallelizable algorithmsbiased randomized heuristicsmetaheuristicsparameters setting
相关
加载中…
  • Local search methods for the flowshop scheduling problem with flowtime minimization
    Pan, Quan-Ke; Ruiz, Ruben*EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 222(1): 31-43.被引 100
  • A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
    Ruiz, Ruben*; Stutzle, ThomasEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177(3): 2033-2049.被引 812
  • A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem
    Ferone, Daniele*; Hatami, Sara; Gonzalez-Neira, Eliana M.; Juan, Angel A.; Festa, PaolaInternational Transactions in Operational Research, 2020, 27(3): 1368-1391.被引 50
查看全部 →

发表信息

论文状态
公开发表
期刊
International Transactions in Operational Research
发表日期
2014-01
卷期
第 21 卷, 第 1 期
页码
103-126
DOI
10.1111/itor.12028
语言
ENGLISH
期刊收录
SSCI.SCIE
期刊等级
Q3
成果收录
SCIE
资助标注
Spanish Ministry of Science and Innovation [TRA2010-21644-C03, ECO2009-11307, DPI2007-61371]; CYTED-HAROSA Network

作者

  • J

    Juan, Angel A. (通讯) (第一作者)

  • L

    Lourenco, Helena R.

查看全部 5 位作者收起作者
  • M

    Mateo, Manuel

  • L

    Luo, Rachel

  • C

    Castella, Quim

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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