考虑能量的并行机调度问题的改进遗传算法

Hong Lu, F. Qiao
{"title":"考虑能量的并行机调度问题的改进遗传算法","authors":"Hong Lu, F. Qiao","doi":"10.1109/COASE.2017.8256314","DOIUrl":null,"url":null,"abstract":"In recent years, there has been growing interest in reducing energy consumption in manufacturing industry. This paper focuses on the parallel machine scheduling problem extracting from the high-energy heating process in iron and steel enterprises. We first present a mixed integer mathematic model with the objective of minimizing the total energy consumption. Next, we propose an improved genetic algorithm (IGA) to find high-quality solutions to this mathematic model. Since the scheduling problem is NP-hard, the proposed IGA improves standard genetic algorithm (SGA) in following aspects: crossover operation and mutation operation based on problem characteristics and adaptive adjustment. To evaluate the proposed algorithm, we select two comparison algorithms: SGA and adaptive genetic algorithm (AGA), and conduct a serial of experiments with the case scenarios generated according to real-world production process. The results show that the proposed IGA has superior performance to the other two algorithms.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An improved genetic algorithm for a parallel machine scheduling problem with energy consideration\",\"authors\":\"Hong Lu, F. Qiao\",\"doi\":\"10.1109/COASE.2017.8256314\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, there has been growing interest in reducing energy consumption in manufacturing industry. This paper focuses on the parallel machine scheduling problem extracting from the high-energy heating process in iron and steel enterprises. We first present a mixed integer mathematic model with the objective of minimizing the total energy consumption. Next, we propose an improved genetic algorithm (IGA) to find high-quality solutions to this mathematic model. Since the scheduling problem is NP-hard, the proposed IGA improves standard genetic algorithm (SGA) in following aspects: crossover operation and mutation operation based on problem characteristics and adaptive adjustment. To evaluate the proposed algorithm, we select two comparison algorithms: SGA and adaptive genetic algorithm (AGA), and conduct a serial of experiments with the case scenarios generated according to real-world production process. The results show that the proposed IGA has superior performance to the other two algorithms.\",\"PeriodicalId\":445441,\"journal\":{\"name\":\"2017 13th IEEE Conference on Automation Science and Engineering (CASE)\",\"volume\":\"2016 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 13th IEEE Conference on Automation Science and Engineering (CASE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COASE.2017.8256314\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2017.8256314","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

近年来,人们对降低制造业的能源消耗越来越感兴趣。本文主要研究钢铁企业高能耗加热过程中的并行调度问题。首先提出了一个以总能耗最小为目标的混合整数数学模型。接下来,我们提出了一种改进的遗传算法(IGA)来寻找该数学模型的高质量解。由于调度问题是NP-hard问题,本文提出的IGA对标准遗传算法(SGA)进行了基于问题特征和自适应调整的交叉操作和突变操作的改进。为了评估所提出的算法,我们选择了两种比较算法:SGA和自适应遗传算法(AGA),并根据实际生产过程生成的案例场景进行了一系列实验。结果表明,该算法的性能优于其他两种算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An improved genetic algorithm for a parallel machine scheduling problem with energy consideration
In recent years, there has been growing interest in reducing energy consumption in manufacturing industry. This paper focuses on the parallel machine scheduling problem extracting from the high-energy heating process in iron and steel enterprises. We first present a mixed integer mathematic model with the objective of minimizing the total energy consumption. Next, we propose an improved genetic algorithm (IGA) to find high-quality solutions to this mathematic model. Since the scheduling problem is NP-hard, the proposed IGA improves standard genetic algorithm (SGA) in following aspects: crossover operation and mutation operation based on problem characteristics and adaptive adjustment. To evaluate the proposed algorithm, we select two comparison algorithms: SGA and adaptive genetic algorithm (AGA), and conduct a serial of experiments with the case scenarios generated according to real-world production process. The results show that the proposed IGA has superior performance to the other two algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A study on performance evaluation and status-based decision for cyber-physical production systems Optimization of deterministic timed weighted marked graphs An optimization-simulation approach for long term care structure assignment problem for elderly people Stochastic simulation of clinical pathways from raw health databases A circuit-breaker use-case operated by a humanoid in aircraft manufacturing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1