A fuzzy logic-based method for designing an urban transport network using a shark smell optimisation algorithm

IF 1.7 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Journal of Experimental & Theoretical Artificial Intelligence Pub Date : 2021-05-16 DOI:10.1080/0952813X.2021.1924867
Habibeh Nazif
{"title":"A fuzzy logic-based method for designing an urban transport network using a shark smell optimisation algorithm","authors":"Habibeh Nazif","doi":"10.1080/0952813X.2021.1924867","DOIUrl":null,"url":null,"abstract":"ABSTRACT Transportation is a significant issue due to providing people to participate in human activities. Due to an increase in population, the need for transportation has also been increased. Therefore, more traffic is visible on streets that produce more issues related to mobility like noise pollution, air pollution, and accidents. This study pays attention to an impressive transit network design in urban areas. Because of the NP-hard nature of this problem, a shark smell optimisation (SSO) algorithm based on fuzzy logic is employed. A developed system is utilised to produce, optimise, and analyse frequencies and routes of transit in the level of a network. Its target is maximising the direct travellers per unit length, i.e., subject to route length, direct traveller density, and nonlinear rate constraints (a route length ratio to the shortest road interval between the beginning and destination). Since designing an urban transport network issue is in heterogeneous environments is involved, this article provides a new method for lowering the feasible urban travel time, the urban traffic, and the feasible urban travel cost using a well-known SSO algorithm. According to the results, the proposed method has higher efficiency compared to the previous methods. In addition, the results showed that the proposed technique offers fewer transfers and travel time.","PeriodicalId":15677,"journal":{"name":"Journal of Experimental & Theoretical Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2021-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Experimental & Theoretical Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1080/0952813X.2021.1924867","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 2

Abstract

ABSTRACT Transportation is a significant issue due to providing people to participate in human activities. Due to an increase in population, the need for transportation has also been increased. Therefore, more traffic is visible on streets that produce more issues related to mobility like noise pollution, air pollution, and accidents. This study pays attention to an impressive transit network design in urban areas. Because of the NP-hard nature of this problem, a shark smell optimisation (SSO) algorithm based on fuzzy logic is employed. A developed system is utilised to produce, optimise, and analyse frequencies and routes of transit in the level of a network. Its target is maximising the direct travellers per unit length, i.e., subject to route length, direct traveller density, and nonlinear rate constraints (a route length ratio to the shortest road interval between the beginning and destination). Since designing an urban transport network issue is in heterogeneous environments is involved, this article provides a new method for lowering the feasible urban travel time, the urban traffic, and the feasible urban travel cost using a well-known SSO algorithm. According to the results, the proposed method has higher efficiency compared to the previous methods. In addition, the results showed that the proposed technique offers fewer transfers and travel time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于模糊逻辑的城市交通网络鲨鱼气味优化设计方法
交通运输是一个重要的问题,因为它提供了人们参与人类活动。由于人口的增加,对交通工具的需求也增加了。因此,街道上可见更多的交通,产生了更多与交通有关的问题,如噪音污染、空气污染和事故。本研究关注城市地区令人印象深刻的交通网络设计。由于该问题的NP-hard性质,采用了一种基于模糊逻辑的鲨鱼气味优化算法。一个发达的系统被用来产生、优化和分析网络层面的交通频率和路线。它的目标是最大化单位长度的直接旅客,即受路线长度、直接旅客密度和非线性速率约束(路线长度与起点和目的地之间最短道路间隔的比率)的影响。针对异构环境下的城市交通网络设计问题,本文提出了一种利用著名的单点登录算法降低城市可行出行时间、城市交通流量和城市可行出行成本的新方法。结果表明,该方法具有较高的效率。此外,结果表明,该技术提供了更少的转移和旅行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
6.10
自引率
4.50%
发文量
89
审稿时长
>12 weeks
期刊介绍: Journal of Experimental & Theoretical Artificial Intelligence (JETAI) is a world leading journal dedicated to publishing high quality, rigorously reviewed, original papers in artificial intelligence (AI) research. The journal features work in all subfields of AI research and accepts both theoretical and applied research. Topics covered include, but are not limited to, the following: • cognitive science • games • learning • knowledge representation • memory and neural system modelling • perception • problem-solving
期刊最新文献
Occlusive target recognition method of sorting robot based on anchor-free detection network An effectual underwater image enhancement framework using adaptive trans-resunet ++ with attention mechanism An experimental study of sentiment classification using deep-based models with various word embedding techniques Sign language video to text conversion via optimised LSTM with improved motion estimation An efficient safest route prediction-based route discovery mechanism for drivers using improved golden tortoise beetle optimizer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1