基于检查酒驾问题的最短路径算法研究与改进

Research and Improvement of the Shortest Path Algorithm Based on Checking Drunk Driving Problem

随着市场经济的发展和社会的进步,人们生活质量都有很大的提升,私家车也越来越多,这无疑给交通带来巨大压力,尤其是城市交通。为了降低交通事故的发生,交管部门到处设立酒驾检查点。这固然是为了交通安全而进行执法,不过也给本来高压的交通带来严重的堵塞问题。尤其逢年过节,公司年会等更是严重。本研究通过对某城市交通道路和区域的分析,在研究弗洛伊德等最短路径算法的基础上,对其做了优化与改进。得出解决检查酒驾问题的最短路径算法,以解决城市交通拥堵问题。

With the development of market economy and social progress,people's quality of life has greatly improved,and there are more and more private cars.This will undoubtedly bring huge pressure on transportation,especially urban transportation.In order to reduce the occurrence of traffic accidents,drunk driving has been strengthened everywhere.Of course,this is to enforce the law for traffic safety,but it also brings serious congestion problems to high-pressure traffic.Especially during the New Year,the company's annual meeting is even more serious.This study has optimized and improved the analysis of the shortest path calculations such as Floyd by analyzing the roads and regions of a city.The shortest path algorithm to solve the problem of drunk driving is obtained to solve the problem of urban traffic congestion.