A GRASP-based heuristic for allocating the roadside infrastructure maximizing the number of distinct vehicles experiencing contact opportunities

J. Sarubbi, D. Vieira, E. Wanner, C. M. Silva
{"title":"A GRASP-based heuristic for allocating the roadside infrastructure maximizing the number of distinct vehicles experiencing contact opportunities","authors":"J. Sarubbi, D. Vieira, E. Wanner, C. M. Silva","doi":"10.1109/NOMS.2016.7502985","DOIUrl":null,"url":null,"abstract":"In this work the allocation of Roadside Units (RSUs) in a V2I network is modeled as a Maximum Coverage Problem. The main objective is to maximize the number of distinct vehicles contacting the infrastructure. Two different approaches are presented to solve the problem. The first one is an ILP model that can found optimal solutions or give sharp upper and lower bounds for the problem. The second one is a GRASP-based heuristic that can found close-to-optimal solutions. The GRASP-based heuristic is compared with a previous work achieving better results. Furthermore, a new metric to measure the efficiency of a Deployment strategy is presented.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOMS.2016.7502985","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this work the allocation of Roadside Units (RSUs) in a V2I network is modeled as a Maximum Coverage Problem. The main objective is to maximize the number of distinct vehicles contacting the infrastructure. Two different approaches are presented to solve the problem. The first one is an ILP model that can found optimal solutions or give sharp upper and lower bounds for the problem. The second one is a GRASP-based heuristic that can found close-to-optimal solutions. The GRASP-based heuristic is compared with a previous work achieving better results. Furthermore, a new metric to measure the efficiency of a Deployment strategy is presented.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于grasp的启发式方法,用于分配路边基础设施,最大限度地增加不同车辆的接触机会
本文将V2I网络中路边单元(rsu)的分配建模为最大覆盖问题。主要目标是最大化接触基础设施的不同车辆的数量。提出了两种不同的方法来解决这个问题。第一类是能够找到问题的最优解或给出问题的明确上界和下界的ILP模型。第二个是基于grasp的启发式方法,它可以找到接近最优的解决方案。将基于grasp的启发式算法与之前的工作进行了比较,取得了更好的效果。此外,还提出了一种新的度量部署策略效率的度量标准。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
PIoT: Programmable IoT using Information Centric Networking Workload interleaving with performance guarantees in data centers Outsourced invoice service: Service-clearing as SaaS in mobility service marketplaces Dynamic load management for IMS networks using network function virtualization On-demand dynamic network service deployment over NaaS architecture
×
引用
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