A Dual-Population Constrained Multi-Objective Evolutionary Algorithm with Success Incentive Mechanism and its application to uncertain multimodal transportation problems

IF 8 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Zhe Yang , Libao Deng , Yuanzhu Di , Chunlei Li , Yifan Qin , Lili Zhang
{"title":"A Dual-Population Constrained Multi-Objective Evolutionary Algorithm with Success Incentive Mechanism and its application to uncertain multimodal transportation problems","authors":"Zhe Yang ,&nbsp;Libao Deng ,&nbsp;Yuanzhu Di ,&nbsp;Chunlei Li ,&nbsp;Yifan Qin ,&nbsp;Lili Zhang","doi":"10.1016/j.engappai.2025.112586","DOIUrl":null,"url":null,"abstract":"<div><div>The evolution of the transportation industry has heightened the focus on environmentally sustainable multimodal transport, particularly in addressing carbon emissions. In modern logistics, path planning under uncertainty has become a pivotal research area. This paper proposes a multi-objective, multi-constraint optimization model for multimodal transport that aims to concurrently minimize cost, carbon emissions, and time. The model accounts for numerous operational constraints, including timetables, as well as dual sources of uncertainty from demand and the transport environment. To solve this complex problem, this paper introduces a new algorithmic framework. The proposed algorithm, a Dual-Population Constrained Multi-Objective Evolutionary Algorithm with a Success Incentive Mechanism (DSCMOEA), integrates three key innovations: a universal priority-based encoding/decoding adapter, a specialized constraint-handling architecture, and an adaptive operator selection mechanism. The adapter is central to the framework, enabling continuous-domain evolutionary algorithms to solve the discrete transport problem without internal modification. This approach also provides the versatility to handle various uncertainty paradigms through a multi-scenario simulation context. Experimental analysis validates the superiority of the proposed algorithm against eight established competitors, demonstrating its effectiveness in solving complex multimodal transport problems under uncertainty.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"162 ","pages":"Article 112586"},"PeriodicalIF":8.0000,"publicationDate":"2025-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Applications of Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S095219762502617X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The evolution of the transportation industry has heightened the focus on environmentally sustainable multimodal transport, particularly in addressing carbon emissions. In modern logistics, path planning under uncertainty has become a pivotal research area. This paper proposes a multi-objective, multi-constraint optimization model for multimodal transport that aims to concurrently minimize cost, carbon emissions, and time. The model accounts for numerous operational constraints, including timetables, as well as dual sources of uncertainty from demand and the transport environment. To solve this complex problem, this paper introduces a new algorithmic framework. The proposed algorithm, a Dual-Population Constrained Multi-Objective Evolutionary Algorithm with a Success Incentive Mechanism (DSCMOEA), integrates three key innovations: a universal priority-based encoding/decoding adapter, a specialized constraint-handling architecture, and an adaptive operator selection mechanism. The adapter is central to the framework, enabling continuous-domain evolutionary algorithms to solve the discrete transport problem without internal modification. This approach also provides the versatility to handle various uncertainty paradigms through a multi-scenario simulation context. Experimental analysis validates the superiority of the proposed algorithm against eight established competitors, demonstrating its effectiveness in solving complex multimodal transport problems under uncertainty.
具有成功激励机制的双种群约束多目标进化算法及其在不确定多式联运问题中的应用
交通运输业的发展使人们更加关注环境可持续的多式联运,特别是在解决碳排放问题方面。在现代物流中,不确定条件下的路径规划已成为一个重要的研究领域。本文提出了一个多目标、多约束的多式联运优化模型,以同时实现成本、碳排放和时间的最小化。该模型考虑了许多操作限制,包括时间表,以及来自需求和运输环境的双重不确定性来源。为了解决这一复杂问题,本文引入了一种新的算法框架。该算法是一种具有成功激励机制的双种群约束多目标进化算法(DSCMOEA),它集成了三个关键创新:基于通用优先级的编码/解码适配器、专门的约束处理架构和自适应算子选择机制。适配器是框架的核心,使连续域进化算法能够在不进行内部修改的情况下解决离散传输问题。这种方法还提供了通过多场景模拟上下文处理各种不确定性范例的通用性。实验分析验证了该算法在解决不确定条件下复杂多式联运问题中的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Engineering Applications of Artificial Intelligence
Engineering Applications of Artificial Intelligence 工程技术-工程:电子与电气
CiteScore
9.60
自引率
10.00%
发文量
505
审稿时长
68 days
期刊介绍: Artificial Intelligence (AI) is pivotal in driving the fourth industrial revolution, witnessing remarkable advancements across various machine learning methodologies. AI techniques have become indispensable tools for practicing engineers, enabling them to tackle previously insurmountable challenges. Engineering Applications of Artificial Intelligence serves as a global platform for the swift dissemination of research elucidating the practical application of AI methods across all engineering disciplines. Submitted papers are expected to present novel aspects of AI utilized in real-world engineering applications, validated using publicly available datasets to ensure the replicability of research outcomes. Join us in exploring the transformative potential of AI in engineering.
×
引用
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学术官方微信