Multi-dimensional Intelligent Floyd Algorithm Research

Transportation planning problem is a whole process， include the investigationand analysis (existing traffic)， to predict future road traffic demand， planning andtransformation of the road network and the implementation andmodification． Usually it divided into the urban road network planning， city roadplanning and the information highway planning study． In recent years， beengeneral concern by the scholars both of civil and abroad． For solving this problemthere are three algorithms in mainstream: Dijkstra (one node)， Floyd (for all nodes)and Bellman algorithm． Existing algorithms are can only solve a single weightproblem， but all two-way choice of travel routes or multi-weight problem cannot． However many cases should be solved by the multi-weight， of course，multi-weight is much more complex than a single weight． Therefore we need a newalgorithm to establish the mathematical model for the problem of the most optimaltraffic way．With civil automobile industry and highway construction continuous development andimprovement make public traveling more fluent and convenient, but also faced with the choiceof lines． There are many factors of individual differences in public， generally public pathselection infection by many factors， in addition to the time factor， as well as transfer factors，sensory factors (driving safety， landscape， road conditions and comfort)， economic factors(travel costs)， and traffic control factors (traffic restrictions， traffic congestion)． The modelin this paper not only consider the different types of passengers and individual requirements，but also meet the requirements of the majority of passengers travel． According to the individualdemands of the passengers，followed by the main consider car， transfer times， the shortestdistance， travel costs and other factors as the basis for the evaluation of the optimalline． However， these factors influence each other， mutual restraint， the best travel routesin all single-target and can not meet the travel needs of most passengers， the establishment ofevaluation criteria and the best travel routes of the best route choice model isnecessary． Therefore， to quantify the factors that affect traffic in the best line of Floydalgorithm for solving the all-source shortest path， using a modified vector Floyd algorithm tooptimize the model is well application prospects．Urban road network traffic is an important artery of the urban economy， socialactivities and link plays an important role in the city’s economic development andpeople’s living standards improve． Give priority to the development of urban publictransport is one of the fundamental ways to solve the traffic problems． Choice ofpublic transport in urban trips and quickly reach their destination are the problem wetravel close attention to． Existing traditional shortest path algorithm can only solve a single weight to the shortest path， shortest path problem for multi-weight we stillhave no effective solution． This article intends to establish the concept of vectormatrix， and explore the vector matrix operations consistent with the multi-weightcomputing and appropriate layered， stratified as a multi-objective problem， thenestablish the multidimensional Floyd algorithm and prove the convergence of thealgorithm． In addition， the use of Intelligent Algorithm network congestion，given the quantification method， in this basis， the study takes into accountmulti-weight transport planning in the case of network congestion and establishmentof multi-dimensional intelligent Floyd algorithm and prove the convergence of thealgorithm (in fact solve the multi-dimensional intelligent Floyd algorithm Dijkstraalgorithm)． In the end established algorithms used in urban transport planning．...