Multi-objective invasive weeds optimisation algorithm for solving simultaneous scheduling of machines and multi-mode automated guided vehicles

Hojat Nabovati, H. Haleh, B. Vahdani
{"title":"Multi-objective invasive weeds optimisation algorithm for solving simultaneous scheduling of machines and multi-mode automated guided vehicles","authors":"Hojat Nabovati, H. Haleh, B. Vahdani","doi":"10.1504/ejie.2020.10027216","DOIUrl":null,"url":null,"abstract":"In this paper, a novel model is presented for machines and automated guided vehicles' simultaneous scheduling, which addresses an extension of the blocking job shop scheduling problem, considering the transferring of jobs between different machines using a limited number of multi-mode automated guided vehicles. Since the model is strictly NP-hard, and because objectives contradict each other, a meta-heuristic algorithm called 'multi-objective invasive weeds optimisation algorithm' with a new chromosome structure which guarantees the feasibility of solutions is developed to solve the proposed problem. Two other meta-heuristic algorithms namely 'non-dominated sorting genetic algorithm' and 'multi-objective particle swarm optimisation algorithm' are applied to validate the solutions obtained by the developed multi-objective invasive weeds optimisation algorithm. A certain method was applied to select the algorithm with the best performance. The result of ranking the algorithms indicated that the developed multi-objective invasive weeds optimisation algorithm had the best performance in terms of solving the mentioned problems. [Received: 7 January 2017; Revised: 30 December 2017; Revised: 17 August 2018; Revised: 22 January 2019; Accepted: 26 July 2019]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"232 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European J. of Industrial Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ejie.2020.10027216","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, a novel model is presented for machines and automated guided vehicles' simultaneous scheduling, which addresses an extension of the blocking job shop scheduling problem, considering the transferring of jobs between different machines using a limited number of multi-mode automated guided vehicles. Since the model is strictly NP-hard, and because objectives contradict each other, a meta-heuristic algorithm called 'multi-objective invasive weeds optimisation algorithm' with a new chromosome structure which guarantees the feasibility of solutions is developed to solve the proposed problem. Two other meta-heuristic algorithms namely 'non-dominated sorting genetic algorithm' and 'multi-objective particle swarm optimisation algorithm' are applied to validate the solutions obtained by the developed multi-objective invasive weeds optimisation algorithm. A certain method was applied to select the algorithm with the best performance. The result of ranking the algorithms indicated that the developed multi-objective invasive weeds optimisation algorithm had the best performance in terms of solving the mentioned problems. [Received: 7 January 2017; Revised: 30 December 2017; Revised: 17 August 2018; Revised: 22 January 2019; Accepted: 26 July 2019]
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解机器与多模式自动导引车同时调度的多目标入侵杂草优化算法
本文提出了一种机器与自动导引车同步调度的新模型,该模型扩展了阻塞作业车间调度问题,考虑了使用有限数量的多模式自动导引车在不同机器之间进行作业转移。由于该模型是严格的NP-hard,并且由于目标相互矛盾,因此开发了一种称为“多目标入侵杂草优化算法”的元启发式算法,该算法具有新的染色体结构,可以保证解决方案的可行性。另外两种元启发式算法,即“非支配排序遗传算法”和“多目标粒子群优化算法”,用于验证所开发的多目标入侵杂草优化算法得到的解。采用一定的方法选择性能最好的算法。对算法进行排序的结果表明,所提出的多目标入侵杂草优化算法在解决上述问题方面的性能最好。[收稿日期:2017年1月7日;修订日期:2017年12月30日;修订日期:2018年8月17日;修订日期:2019年1月22日;录用日期:2019年7月26日]
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Buyback and risk-sharing contracts to mitigate the supply and demand disruption risks Solution approaches for the parallel machine order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines Conservative profitability evaluation for a newsboy-type product based on achievable capacity index Hub location problem with balanced round-trip flows on hub links Service capacity procurement in Logistics service supply chain with demand updating and reciprocal behavior
×
引用
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