{"title":"一种基于grasp的启发式方法，用于分配路边基础设施，最大限度地增加不同车辆的接触机会","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":"{\"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}","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}
A GRASP-based heuristic for allocating the roadside infrastructure maximizing the number of distinct vehicles experiencing contact opportunities
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
