Improved black widow optimization algorithm for multi-objective hybrid flow shop batch-scheduling problem

IF 1.1 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Xiyang Liu, Fangjun Luan
{"title":"Improved black widow optimization algorithm for multi-objective hybrid flow shop batch-scheduling problem","authors":"Xiyang Liu, Fangjun Luan","doi":"10.1007/s10878-025-01270-x","DOIUrl":null,"url":null,"abstract":"<p>Sustainable scheduling is getting more and more attention with economic globalization and sustainable manufacturing. However, fewer studies on the batch scheduling problem consider energy consumption. This paper conducts an investigation into the multi-objective hybrid flow shop batch-scheduling problem with the objectives of minimizing both the makespan and electrical energy consumption. The study aims to select the optimal scheduling solution for the problem by considering batch splitting for all products. In this paper, we propose an improved black widow optimization (IBWO) algorithm to study the problem, which incorporates procreation, cannibalism, and mutation behaviors to maintain the population’s diversity and stability. To achieve our objectives, we use the dynamic entropy weight topsis method to select individual spiders. Finally, we use the nature theorem construction method, which relies on the property theorem, to solve the Pareto solution set and derive the optimization scheme for the hybrid flow shop batch scheduling problem. We verify the effectiveness of the proposed IBWO on instances of varying sizes. When we keep all other factors and cases constant, we compare the IBWO to the NSGA2 algorithm and find that it converges faster for both goals and has lower goals than the NSGA2.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"34 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-025-01270-x","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Sustainable scheduling is getting more and more attention with economic globalization and sustainable manufacturing. However, fewer studies on the batch scheduling problem consider energy consumption. This paper conducts an investigation into the multi-objective hybrid flow shop batch-scheduling problem with the objectives of minimizing both the makespan and electrical energy consumption. The study aims to select the optimal scheduling solution for the problem by considering batch splitting for all products. In this paper, we propose an improved black widow optimization (IBWO) algorithm to study the problem, which incorporates procreation, cannibalism, and mutation behaviors to maintain the population’s diversity and stability. To achieve our objectives, we use the dynamic entropy weight topsis method to select individual spiders. Finally, we use the nature theorem construction method, which relies on the property theorem, to solve the Pareto solution set and derive the optimization scheme for the hybrid flow shop batch scheduling problem. We verify the effectiveness of the proposed IBWO on instances of varying sizes. When we keep all other factors and cases constant, we compare the IBWO to the NSGA2 algorithm and find that it converges faster for both goals and has lower goals than the NSGA2.

多目标混合流水车间分批调度问题的改进黑寡妇优化算法
随着经济全球化和可持续制造的发展,可持续调度越来越受到人们的关注。然而,对批量调度问题考虑能耗的研究较少。研究了以最大完工时间和电能消耗同时最小为目标的多目标混合流水车间分批调度问题。研究的目的是通过考虑所有产品的批量拆分来选择问题的最优调度方案。本文提出了一种改进的黑寡妇优化算法(IBWO)来研究这一问题,该算法结合了繁殖、同类相食和突变行为,以保持种群的多样性和稳定性。为了实现我们的目标,我们使用动态熵权topsis方法来选择单个蜘蛛。最后,利用依赖于性质定理的自然定理构造方法,求解了混合流车间批量调度问题的Pareto解集,并推导出优化方案。我们在不同规模的实例上验证了所提出的IBWO的有效性。当我们保持所有其他因素和情况不变时,我们将IBWO算法与NSGA2算法进行比较,发现它对两个目标的收敛速度都更快,并且目标比NSGA2低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信