A hybrid approach using ant colony optimisation for integrated scheduling of production and transportation tasks within flexible manufacturing systems

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Naihui He , M’hammed Sahnoun , David Zhang , Belgacem Bettayeb
{"title":"A hybrid approach using ant colony optimisation for integrated scheduling of production and transportation tasks within flexible manufacturing systems","authors":"Naihui He ,&nbsp;M’hammed Sahnoun ,&nbsp;David Zhang ,&nbsp;Belgacem Bettayeb","doi":"10.1016/j.cor.2025.107059","DOIUrl":null,"url":null,"abstract":"<div><div>This paper studies the integrated scheduling problem in flexible manufacturing systems (FMS), where flexible machines and Automated Guided Vehicles (AGV) shared by production jobs are scheduled simultaneously in an integrated manner. Routing flexibility, a crucial advantage of FMS, enabling a job to be handled via alternative machine combinations, is involved. To address this problem, we propose a novel hybrid approach using Ant Colony Optimisation (ACO), which employs a two-element vector structure to model the ACO decision nodes. Each node represents an operation from a job assigned to a particular machine. During the ACO process, to decide a node for next movement, an ant first assesses potential nodes through a node scheduling procedure with two consecutive steps: firstly, using a heuristic vehicle assignment method, an AGV is designated and scheduled for the operation specified in a node. Following this, based on the established transportation timeline, the operation’s production schedule on the assigned machine is determined. Subsequently, the node selection is guided by the pheromone information on potential paths and the heuristic data of potential nodes derived from their scheduling information. To avoid local optima, multiple heuristic rules are incorporated in the ACO, with one chosen randomly for node selection each time. Numerical tests show that our proposed approach outperforms contemporary metaheuristic approaches in the literature. In addition, its efficiency of handling complex problem instances is also assessed and demonstrated.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"180 ","pages":"Article 107059"},"PeriodicalIF":4.1000,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825000875","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper studies the integrated scheduling problem in flexible manufacturing systems (FMS), where flexible machines and Automated Guided Vehicles (AGV) shared by production jobs are scheduled simultaneously in an integrated manner. Routing flexibility, a crucial advantage of FMS, enabling a job to be handled via alternative machine combinations, is involved. To address this problem, we propose a novel hybrid approach using Ant Colony Optimisation (ACO), which employs a two-element vector structure to model the ACO decision nodes. Each node represents an operation from a job assigned to a particular machine. During the ACO process, to decide a node for next movement, an ant first assesses potential nodes through a node scheduling procedure with two consecutive steps: firstly, using a heuristic vehicle assignment method, an AGV is designated and scheduled for the operation specified in a node. Following this, based on the established transportation timeline, the operation’s production schedule on the assigned machine is determined. Subsequently, the node selection is guided by the pheromone information on potential paths and the heuristic data of potential nodes derived from their scheduling information. To avoid local optima, multiple heuristic rules are incorporated in the ACO, with one chosen randomly for node selection each time. Numerical tests show that our proposed approach outperforms contemporary metaheuristic approaches in the literature. In addition, its efficiency of handling complex problem instances is also assessed and demonstrated.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
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学术官方微信