混合粒子群优化算法:解决交通网络设计问题的 FROG LEAPING 概念

Navid Afkar, A. Babazadeh
{"title":"混合粒子群优化算法:解决交通网络设计问题的 FROG LEAPING 概念","authors":"Navid Afkar, A. Babazadeh","doi":"10.1109/EIT.2015.7293437","DOIUrl":null,"url":null,"abstract":"Transportation Network Design Problem (TNDP) is an important problem in transportation. Various approaches have been taken to solve TNDP up to now. Particle Swarm Optimization (PSO) is one of the metaheuristic search techniques to find the solution. This paper attempts to hybridize PSO algorithm with the frog leaping concept. The benefits of applying the hybridized algorithm have been tested on the Sioux Falls network which had been used in the previous efforts.","PeriodicalId":415614,"journal":{"name":"2015 IEEE International Conference on Electro/Information Technology (EIT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Hybridized Particle Swarm Optimization algorithm: FROG LEAPING concept for solving transportation network design problem\",\"authors\":\"Navid Afkar, A. Babazadeh\",\"doi\":\"10.1109/EIT.2015.7293437\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Transportation Network Design Problem (TNDP) is an important problem in transportation. Various approaches have been taken to solve TNDP up to now. Particle Swarm Optimization (PSO) is one of the metaheuristic search techniques to find the solution. This paper attempts to hybridize PSO algorithm with the frog leaping concept. The benefits of applying the hybridized algorithm have been tested on the Sioux Falls network which had been used in the previous efforts.\",\"PeriodicalId\":415614,\"journal\":{\"name\":\"2015 IEEE International Conference on Electro/Information Technology (EIT)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Conference on Electro/Information Technology (EIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EIT.2015.7293437\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Electro/Information Technology (EIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EIT.2015.7293437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

交通网络设计问题(TNDP)是交通领域的一个重要问题。迄今为止,已有多种方法用于解决 TNDP 问题。粒子群优化算法(PSO)是元启发式搜索技术中的一种。本文尝试将 PSO 算法与蛙跳概念进行混合。在苏福尔斯网络上测试了应用混合算法的好处。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hybridized Particle Swarm Optimization algorithm: FROG LEAPING concept for solving transportation network design problem
Transportation Network Design Problem (TNDP) is an important problem in transportation. Various approaches have been taken to solve TNDP up to now. Particle Swarm Optimization (PSO) is one of the metaheuristic search techniques to find the solution. This paper attempts to hybridize PSO algorithm with the frog leaping concept. The benefits of applying the hybridized algorithm have been tested on the Sioux Falls network which had been used in the previous efforts.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信