基于改进混沌多元宇宙算法的可重构作业车间的物料配送优化

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Qinge Xiao , Kai Wang , Chi Ma , Ye Chen
{"title":"基于改进混沌多元宇宙算法的可重构作业车间的物料配送优化","authors":"Qinge Xiao ,&nbsp;Kai Wang ,&nbsp;Chi Ma ,&nbsp;Ye Chen","doi":"10.1016/j.swevo.2025.102167","DOIUrl":null,"url":null,"abstract":"<div><div>The increasing demand for product customization has highlighted the importance of make-to-order (MTO) material delivery. Although manufacturers have deployed intelligent reconfigurable job shops equipped with flexible workstations and automated guided vehicles (AGVs), challenges remain due to inefficient material scheduling, delayed deliveries, and the complexity arising from diverse material types. This study proposes an active delivery strategy based on a workshop material supermarket, in which both AGV path planning and workstation layout are jointly optimized in response to dynamically changing orders. A multi-objective delivery path model is formulated to support demand splitting while minimizing material delivery costs and maximizing timeliness satisfaction. The model incorporates constraints related to AGV capacity, path feasibility, and demand alignment. To address the nonlinearity and complexity of the problem, an improved chaotic multi-verse optimizer (ICMVO) is proposed. The algorithm employs chaotic encoding to enhance population diversity and mitigate premature convergence. It further integrates gravitational and collision operators to improve global and local search capabilities and adopts adaptive orbital dynamics control to balance exploration and exploitation. A dual-population iterative strategy is employed to enable joint decision-making on workstation coordinates, path direction, and vehicle assignment. Through comprehensive comparisons with state-of-the-art meta-heuristics, the superiority of the ICMVO algorithm and the effectiveness of its components are demonstrated. Moreover, the proposed material delivery optimization method is implemented in a cloud–edge–terminal system and validated in practical MTO reconfigurable job shops through improvements in productivity and cost efficiency.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"99 ","pages":"Article 102167"},"PeriodicalIF":8.5000,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Material delivery optimization for make-to-order reconfigurable job shops using an improved chaotic multi-verse algorithm\",\"authors\":\"Qinge Xiao ,&nbsp;Kai Wang ,&nbsp;Chi Ma ,&nbsp;Ye Chen\",\"doi\":\"10.1016/j.swevo.2025.102167\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The increasing demand for product customization has highlighted the importance of make-to-order (MTO) material delivery. Although manufacturers have deployed intelligent reconfigurable job shops equipped with flexible workstations and automated guided vehicles (AGVs), challenges remain due to inefficient material scheduling, delayed deliveries, and the complexity arising from diverse material types. This study proposes an active delivery strategy based on a workshop material supermarket, in which both AGV path planning and workstation layout are jointly optimized in response to dynamically changing orders. A multi-objective delivery path model is formulated to support demand splitting while minimizing material delivery costs and maximizing timeliness satisfaction. The model incorporates constraints related to AGV capacity, path feasibility, and demand alignment. To address the nonlinearity and complexity of the problem, an improved chaotic multi-verse optimizer (ICMVO) is proposed. The algorithm employs chaotic encoding to enhance population diversity and mitigate premature convergence. It further integrates gravitational and collision operators to improve global and local search capabilities and adopts adaptive orbital dynamics control to balance exploration and exploitation. A dual-population iterative strategy is employed to enable joint decision-making on workstation coordinates, path direction, and vehicle assignment. Through comprehensive comparisons with state-of-the-art meta-heuristics, the superiority of the ICMVO algorithm and the effectiveness of its components are demonstrated. Moreover, the proposed material delivery optimization method is implemented in a cloud–edge–terminal system and validated in practical MTO reconfigurable job shops through improvements in productivity and cost efficiency.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"99 \",\"pages\":\"Article 102167\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2025-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210650225003244\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225003244","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

日益增长的产品定制需求凸显了按订单生产(MTO)材料交付的重要性。尽管制造商已经部署了配备灵活工作站和自动导引车(agv)的智能可重构作业车间,但由于材料调度效率低下、交货延迟以及材料类型多样化带来的复杂性,挑战仍然存在。本研究提出了一种基于车间物料超市的主动配送策略,该策略中AGV路径规划和工作站布局共同优化,以响应动态变化的订单。建立了一个多目标配送路径模型,以支持需求分割,同时最小化物料配送成本和最大化及时性满意度。该模型结合了与AGV容量、路径可行性和需求对齐相关的约束。为了解决该问题的非线性和复杂性,提出了一种改进的混沌多宇宙优化器(ICMVO)。算法采用混沌编码,增强种群多样性,避免过早收敛。它进一步整合了引力和碰撞算子,以提高全局和局部搜索能力,并采用自适应轨道动力学控制来平衡勘探和开采。采用双种群迭代策略对工作站坐标、路径方向和车辆分配进行联合决策。通过与最先进的元启发式算法的综合比较,证明了ICMVO算法的优越性及其组成部分的有效性。此外,提出的材料交付优化方法在云边缘终端系统中实现,并通过提高生产率和成本效率在实际的MTO可重构作业车间中得到验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Material delivery optimization for make-to-order reconfigurable job shops using an improved chaotic multi-verse algorithm
The increasing demand for product customization has highlighted the importance of make-to-order (MTO) material delivery. Although manufacturers have deployed intelligent reconfigurable job shops equipped with flexible workstations and automated guided vehicles (AGVs), challenges remain due to inefficient material scheduling, delayed deliveries, and the complexity arising from diverse material types. This study proposes an active delivery strategy based on a workshop material supermarket, in which both AGV path planning and workstation layout are jointly optimized in response to dynamically changing orders. A multi-objective delivery path model is formulated to support demand splitting while minimizing material delivery costs and maximizing timeliness satisfaction. The model incorporates constraints related to AGV capacity, path feasibility, and demand alignment. To address the nonlinearity and complexity of the problem, an improved chaotic multi-verse optimizer (ICMVO) is proposed. The algorithm employs chaotic encoding to enhance population diversity and mitigate premature convergence. It further integrates gravitational and collision operators to improve global and local search capabilities and adopts adaptive orbital dynamics control to balance exploration and exploitation. A dual-population iterative strategy is employed to enable joint decision-making on workstation coordinates, path direction, and vehicle assignment. Through comprehensive comparisons with state-of-the-art meta-heuristics, the superiority of the ICMVO algorithm and the effectiveness of its components are demonstrated. Moreover, the proposed material delivery optimization method is implemented in a cloud–edge–terminal system and validated in practical MTO reconfigurable job shops through improvements in productivity and cost efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术官方微信