Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
A dissimilar alternative paths-search algorithm for navigation services: A heuristic approach
Abstract The purpose of this paper is to present the development of a heuristic algorithm that searches dissimilar alternative paths efficiently for multi-route problems in navigation services. The K shortest paths algorithm, one of the algorithms that provides multiple paths, often provides very similar paths between an origin and a destination, oftentimes differentiated by only one different link. The algorithm developed in this paper is based on the renewed path-partition-deletion method, which searches for the shortest paths by executing the shortest-path algorithm only once. Users can obtain information on the alternative paths corresponding with their preferences by the user-specified allowable cost and duplication ratios included in the algorithm. Empirical studies based on a toy network and a Chicago network are presented to evaluate the efficiency of the developed algorithm. The results show the algorithm can be applied to the implementation of the paths-search algorithm for multi-route navigation services.
A dissimilar alternative paths-search algorithm for navigation services: A heuristic approach
Abstract The purpose of this paper is to present the development of a heuristic algorithm that searches dissimilar alternative paths efficiently for multi-route problems in navigation services. The K shortest paths algorithm, one of the algorithms that provides multiple paths, often provides very similar paths between an origin and a destination, oftentimes differentiated by only one different link. The algorithm developed in this paper is based on the renewed path-partition-deletion method, which searches for the shortest paths by executing the shortest-path algorithm only once. Users can obtain information on the alternative paths corresponding with their preferences by the user-specified allowable cost and duplication ratios included in the algorithm. Empirical studies based on a toy network and a Chicago network are presented to evaluate the efficiency of the developed algorithm. The results show the algorithm can be applied to the implementation of the paths-search algorithm for multi-route navigation services.
A dissimilar alternative paths-search algorithm for navigation services: A heuristic approach
Jeong, Yeon-Jeong (Autor:in) / Kim, Tschangho John (Autor:in) / Park, Chang-Ho (Autor:in) / Kim, Dong-Kyu (Autor:in)
KSCE Journal of Civil Engineering ; 14 ; 41-49
18.09.2009
9 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach
| British Library Online Contents | 1997
Improved Heuristic Search Algorithm for Capacitated Vehicle Routing Problem
| British Library Conference Proceedings | 2013
Improved Heuristic Search Algorithm for Multi-Cargo Loading Problem
| British Library Conference Proceedings | 2013
Research on Automatic Nesting Algorithm Based on Heuristic Search
| British Library Online Contents | 2014