Changlin Yang, Zhenglin Li, Yang Peng, Guangsong Yang
{"title":"基于VANET和蚁群算法的交通路径规划方法","authors":"Changlin Yang, Zhenglin Li, Yang Peng, Guangsong Yang","doi":"10.12783/dtetr/mcaee2020/35048","DOIUrl":null,"url":null,"abstract":"Intelligent Transport System (ITS) has been widely used in our life. A traffic path planning method based on VANET (Vehicular Ad Hoc Network) is proposed, which considers the path length and congestion comprehensively, uses ant colony algorithm to find an optimal path with the shortest delay, redesigns the pheromone update and heuristic function, dynamic adjusts evaporation rate to avoid the old information and reduce the re exploration of the visited path, in order to speed up the convergence speed and expand the search space. Simulation results show that this method can avoid congestion path, shorten path search time, and ensure the effectiveness of the path.","PeriodicalId":11264,"journal":{"name":"DEStech Transactions on Engineering and Technology Research","volume":"46 45 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Traffic Path Planning Method Based on VANET and Ant Colony Algorithm\",\"authors\":\"Changlin Yang, Zhenglin Li, Yang Peng, Guangsong Yang\",\"doi\":\"10.12783/dtetr/mcaee2020/35048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Intelligent Transport System (ITS) has been widely used in our life. A traffic path planning method based on VANET (Vehicular Ad Hoc Network) is proposed, which considers the path length and congestion comprehensively, uses ant colony algorithm to find an optimal path with the shortest delay, redesigns the pheromone update and heuristic function, dynamic adjusts evaporation rate to avoid the old information and reduce the re exploration of the visited path, in order to speed up the convergence speed and expand the search space. Simulation results show that this method can avoid congestion path, shorten path search time, and ensure the effectiveness of the path.\",\"PeriodicalId\":11264,\"journal\":{\"name\":\"DEStech Transactions on Engineering and Technology Research\",\"volume\":\"46 45 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DEStech Transactions on Engineering and Technology Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12783/dtetr/mcaee2020/35048\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DEStech Transactions on Engineering and Technology Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12783/dtetr/mcaee2020/35048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
智能交通系统(ITS)在我们的生活中得到了广泛的应用。提出了一种基于VANET (Vehicular Ad Hoc Network)的交通路径规划方法,综合考虑路径长度和拥塞,采用蚁群算法寻找时延最短的最优路径,重新设计信息素更新和启发式功能,动态调整蒸发速率以避免旧信息,减少对已访问路径的重新探索,从而加快收敛速度,扩大搜索空间。仿真结果表明,该方法可以避免路径拥塞,缩短路径搜索时间,保证路径的有效性。
Traffic Path Planning Method Based on VANET and Ant Colony Algorithm
Intelligent Transport System (ITS) has been widely used in our life. A traffic path planning method based on VANET (Vehicular Ad Hoc Network) is proposed, which considers the path length and congestion comprehensively, uses ant colony algorithm to find an optimal path with the shortest delay, redesigns the pheromone update and heuristic function, dynamic adjusts evaporation rate to avoid the old information and reduce the re exploration of the visited path, in order to speed up the convergence speed and expand the search space. Simulation results show that this method can avoid congestion path, shorten path search time, and ensure the effectiveness of the path.