外文文9献与翻译.docxVIP

外文文献与翻译文献原文：A SHORTEST PATH ALGORITHM FOR REAL ROAD NETWORK BASED ON PATH OVERLAP1 INTRODUCTIONA shortest path problem is for finding a path with minimum travel cost from one or more origins to one or more destinations through a connected network. It is an important issue because of its wide range of applications in transportations. In some applications, it is also beneficial to know the second or third shortest paths between two nodes. For instance, in order to improve the effectiveness of travel information provision, there is a need to provide some rational alternative paths for road users driving in real road network. To meet it, k shortest path algorithms have been used in general. Yen (1971) first proposed k shortest path searching method, which could generate several additional paths by deleting node on the shortest path. Since Yen, Several k-shortest algorithms have been suggested. Although k shortest path algorithm can provide several alternative paths, it has inherent limit of heavy overlapping among derived paths, which may lead to wrong travel information to the users. This is that significant proportion of links on the first path is overlapped by second and third path calculated from the method, so the drivers on those links may suffer severe congestions if they follow the travel information. This is the same problem of IIA (Independence of Irrelevant Alternatives) in logit-based stochastic assignment.On the other hand existing shortest path algorithms such as Dijkstra, Moore build the optimal path based on the node they reach. However, in the case of considering the network consisting of several turn prohibitions such as restricting left-turn, which are popularly adopted in real world network, it makes difficult for the traditional network optimization technique to deal with. Banned and penalized turns may be not described appropriately for in the standard node/link method of network definition with intersections represented by nodes only. The reason i