具有时空约束的工厂起重机多目标优化方法

Binghai Zhou, Xiu-mei Liao
{"title":"具有时空约束的工厂起重机多目标优化方法","authors":"Binghai Zhou, Xiu-mei Liao","doi":"10.1504/ejie.2020.10032196","DOIUrl":null,"url":null,"abstract":"In order to improve the performance of large manufacturing enterprises, besides the adoption of new technologies, it is also feasible to efficiently schedule logistics equipment such as cranes, which costs much less since only software changes are involved. In this research, the objectives of minimising total waiting cost and total delay cost are optimised simultaneously when executing crane-delivery tasks in factories. Given the time-space constraints and NP-hard nature of the problem, a generalised opposition-based learning (GOBL) mechanism and two problem-based searching strategies are developed and fused into the multi-objective differential evolution approach, namely GOMODE. The introduction of GOBL mechanism enables the proposed algorithm to search in a more extensive solution space, which improves the population diversity and avoids the premature problem. The performance of the GOMODE has been compared with classical multi-objective optimisation algorithms. The experimental results indicate that the GOMODE achieves a better performance both on solutions' quality and diversity. [Received: 11 December 2018; Accepted: 23 December 2019]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient generalised opposition-based multi-objective optimisation method for factory cranes with time-space constraints\",\"authors\":\"Binghai Zhou, Xiu-mei Liao\",\"doi\":\"10.1504/ejie.2020.10032196\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to improve the performance of large manufacturing enterprises, besides the adoption of new technologies, it is also feasible to efficiently schedule logistics equipment such as cranes, which costs much less since only software changes are involved. In this research, the objectives of minimising total waiting cost and total delay cost are optimised simultaneously when executing crane-delivery tasks in factories. Given the time-space constraints and NP-hard nature of the problem, a generalised opposition-based learning (GOBL) mechanism and two problem-based searching strategies are developed and fused into the multi-objective differential evolution approach, namely GOMODE. The introduction of GOBL mechanism enables the proposed algorithm to search in a more extensive solution space, which improves the population diversity and avoids the premature problem. The performance of the GOMODE has been compared with classical multi-objective optimisation algorithms. The experimental results indicate that the GOMODE achieves a better performance both on solutions' quality and diversity. [Received: 11 December 2018; Accepted: 23 December 2019]\",\"PeriodicalId\":314867,\"journal\":{\"name\":\"European J. of Industrial Engineering\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European J. of Industrial Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ejie.2020.10032196\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European J. of Industrial Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ejie.2020.10032196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了提高大型制造企业的绩效,除了采用新技术之外,高效调度起重机等物流设备也是可行的,由于只涉及软件更改,因此成本要低得多。在本研究中,工厂在执行起重机交付任务时,同时优化了总等待成本和总延迟成本最小化的目标。考虑到问题的时空约束和NP-hard性质,本文提出了一种基于广义对立的学习(GOBL)机制和两种基于问题的搜索策略,并将其融合为多目标差分进化方法,即GOMODE。引入GOBL机制使算法能够在更广泛的解空间中进行搜索,提高了种群多样性,避免了早熟问题。并与经典的多目标优化算法进行了性能比较。实验结果表明,该算法在解的质量和多样性方面都取得了较好的效果。[收稿日期:2018年12月11日;录用日期:2019年12月23日]
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An efficient generalised opposition-based multi-objective optimisation method for factory cranes with time-space constraints
In order to improve the performance of large manufacturing enterprises, besides the adoption of new technologies, it is also feasible to efficiently schedule logistics equipment such as cranes, which costs much less since only software changes are involved. In this research, the objectives of minimising total waiting cost and total delay cost are optimised simultaneously when executing crane-delivery tasks in factories. Given the time-space constraints and NP-hard nature of the problem, a generalised opposition-based learning (GOBL) mechanism and two problem-based searching strategies are developed and fused into the multi-objective differential evolution approach, namely GOMODE. The introduction of GOBL mechanism enables the proposed algorithm to search in a more extensive solution space, which improves the population diversity and avoids the premature problem. The performance of the GOMODE has been compared with classical multi-objective optimisation algorithms. The experimental results indicate that the GOMODE achieves a better performance both on solutions' quality and diversity. [Received: 11 December 2018; Accepted: 23 December 2019]
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信