Queuing model-based optimal traffic flow in a grid network

Sayan Sen Sarma, G. Chakraborty
{"title":"Queuing model-based optimal traffic flow in a grid network","authors":"Sayan Sen Sarma, G. Chakraborty","doi":"10.1109/ANTS.2015.7413614","DOIUrl":null,"url":null,"abstract":"A transportation network describes a network structure to allow flow of some commodity. Flow maximization is a classical problem in this domain. In this paper, we address the problem of flow maximization in a transportation network with fix sources and a fixed sink. For simplicity to find an analytical solution, we start with a grid structured road network. The goal is to find a traffic distribution over the road network such that the total average time of travel from source to sink is minimized. The theoretical result obtained was verified using linear programming problem solving tool in MATLAB.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS.2015.7413614","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

A transportation network describes a network structure to allow flow of some commodity. Flow maximization is a classical problem in this domain. In this paper, we address the problem of flow maximization in a transportation network with fix sources and a fixed sink. For simplicity to find an analytical solution, we start with a grid structured road network. The goal is to find a traffic distribution over the road network such that the total average time of travel from source to sink is minimized. The theoretical result obtained was verified using linear programming problem solving tool in MATLAB.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于排队模型的网格网络最优交通流
运输网络描述了允许某些商品流动的网络结构。流量最大化是该领域的经典问题。本文研究了具有固定源和固定汇的运输网络中的流量最大化问题。为了简单地找到解析解,我们从网格结构的道路网络开始。目标是找到路网上的交通分布,使从源到汇的总平均旅行时间最小化。利用MATLAB中的线性规划问题求解工具对理论结果进行了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic multi-hop switch handoffs in Software Defined Wireless Mesh Networks Genetic max-SINR algorithm for interference alignment Reconfigurable and efficient fronthaul of 5G systems Carbon-aware routing in software defined inter data center network “NeSen” - a tool for measuring link quality and stability of heterogeneous cellular network
×
引用
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