Fuzzy Multi-Objective, Multi-Period Integrated Routing–Scheduling Problem to Distribute Relief to Disaster Areas: A Hybrid Ant Colony Optimization Approach

IF 2.3 3区 数学 Q1 MATHEMATICS
Mathematics Pub Date : 2024-09-13 DOI:10.3390/math12182844
Malihe Niksirat, Mohsen Saffarian, Javad Tayyebi, Adrian Marius Deaconu, Delia Elena Spridon
{"title":"Fuzzy Multi-Objective, Multi-Period Integrated Routing–Scheduling Problem to Distribute Relief to Disaster Areas: A Hybrid Ant Colony Optimization Approach","authors":"Malihe Niksirat, Mohsen Saffarian, Javad Tayyebi, Adrian Marius Deaconu, Delia Elena Spridon","doi":"10.3390/math12182844","DOIUrl":null,"url":null,"abstract":"This paper explores a multi-objective, multi-period integrated routing and scheduling problem under uncertain conditions for distributing relief to disaster areas. The goals are to minimize costs and maximize satisfaction levels. To achieve this, the proposed mathematical model aims to speed up the delivery of relief supplies to the most affected areas. Additionally, the demands and transportation times are represented using fuzzy numbers to more accurately reflect real-world conditions. The problem was formulated using a fuzzy multi-objective integer programming model. To solve it, a hybrid algorithm combining a multi-objective ant colony system and simulated annealing algorithm was proposed. This algorithm adopts two ant colonies to obtain a set of nondominated solutions (the Pareto set). Numerical analyses have been conducted to determine the optimal parameter values for the proposed algorithm and to evaluate the performance of both the model and the algorithm. Furthermore, the algorithm’s performance was compared with that of the multi-objective cat swarm optimization algorithm and multi-objective fitness-dependent optimizer algorithm. The numerical results demonstrate the computational efficiency of the proposed method.","PeriodicalId":18303,"journal":{"name":"Mathematics","volume":null,"pages":null},"PeriodicalIF":2.3000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.3390/math12182844","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper explores a multi-objective, multi-period integrated routing and scheduling problem under uncertain conditions for distributing relief to disaster areas. The goals are to minimize costs and maximize satisfaction levels. To achieve this, the proposed mathematical model aims to speed up the delivery of relief supplies to the most affected areas. Additionally, the demands and transportation times are represented using fuzzy numbers to more accurately reflect real-world conditions. The problem was formulated using a fuzzy multi-objective integer programming model. To solve it, a hybrid algorithm combining a multi-objective ant colony system and simulated annealing algorithm was proposed. This algorithm adopts two ant colonies to obtain a set of nondominated solutions (the Pareto set). Numerical analyses have been conducted to determine the optimal parameter values for the proposed algorithm and to evaluate the performance of both the model and the algorithm. Furthermore, the algorithm’s performance was compared with that of the multi-objective cat swarm optimization algorithm and multi-objective fitness-dependent optimizer algorithm. The numerical results demonstrate the computational efficiency of the proposed method.
向灾区分配救援物资的模糊多目标、多周期综合路由调度问题:混合蚁群优化方法
本文探讨了一个在不确定条件下向灾区分配救援物资的多目标、多周期综合路由和调度问题。目标是成本最小化和满意度最大化。为此,提出的数学模型旨在加快向受灾最严重地区运送救灾物资的速度。此外,需求和运输时间使用模糊数表示,以更准确地反映现实世界的条件。该问题是通过模糊多目标整数编程模型提出的。为了解决这个问题,提出了一种结合多目标蚁群系统和模拟退火算法的混合算法。该算法采用两个蚁群获得一组非支配解(帕累托集)。通过数值分析,确定了拟议算法的最佳参数值,并对模型和算法的性能进行了评估。此外,还将该算法的性能与多目标猫群优化算法和多目标适合度依赖优化算法进行了比较。数值结果证明了所提方法的计算效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Mathematics
Mathematics Mathematics-General Mathematics
CiteScore
4.00
自引率
16.70%
发文量
4032
审稿时长
21.9 days
期刊介绍: Mathematics (ISSN 2227-7390) is an international, open access journal which provides an advanced forum for studies related to mathematical sciences. It devotes exclusively to the publication of high-quality reviews, regular research papers and short communications in all areas of pure and applied mathematics. Mathematics also publishes timely and thorough survey articles on current trends, new theoretical techniques, novel ideas and new mathematical tools in different branches of mathematics.
×
引用
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学术官方微信