Tailoring a Red Deer Algorithm to Solve a Generalized Network Design Problem

I. Mejri, S. Layeb, Emna Drira
{"title":"Tailoring a Red Deer Algorithm to Solve a Generalized Network Design Problem","authors":"I. Mejri, S. Layeb, Emna Drira","doi":"10.5220/0010689000003062","DOIUrl":null,"url":null,"abstract":": This work investigates solving a challenging network design problem using the recently introduced evolutionary metaheuristic, namely the Red Deer Algorithm (RDA), that mimics the Scottish Red Deer’s behavior during their breeding season. The RDA is tailored to solve a generalized network design problem that aims to design a network with minimal cost while satisfying several practical constraints. To assess the performance of this new bio-inspired metaheuristic on solving such NP-hard problem, computational experiments were conducted on Benchmark as well as real-world instances. Computational experimentation illustrates the accuracy of the RDA that outperforms all of the existing recent metaheuristics.","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Innovative Intelligent Industrial Production and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0010689000003062","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

: This work investigates solving a challenging network design problem using the recently introduced evolutionary metaheuristic, namely the Red Deer Algorithm (RDA), that mimics the Scottish Red Deer’s behavior during their breeding season. The RDA is tailored to solve a generalized network design problem that aims to design a network with minimal cost while satisfying several practical constraints. To assess the performance of this new bio-inspired metaheuristic on solving such NP-hard problem, computational experiments were conducted on Benchmark as well as real-world instances. Computational experimentation illustrates the accuracy of the RDA that outperforms all of the existing recent metaheuristics.
裁剪马鹿算法求解广义网络设计问题
本研究使用最近引入的进化元启发式算法,即马鹿算法(RDA)来研究解决一个具有挑战性的网络设计问题,该算法模仿苏格兰马鹿在繁殖季节的行为。RDA是专门为解决一个广义的网络设计问题而设计的,该问题旨在以最小的成本设计一个网络,同时满足几个实际约束。为了评估这种新的生物启发元启发式算法在解决此类np困难问题上的性能,在Benchmark和现实世界实例上进行了计算实验。计算实验表明,RDA的准确性优于所有现有的最新元启发式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信