This paper researches on the problem of searching for the reliable path for transportation networks. The reliable path finding problem is concerned with searching for the path with the maximum value of connectivity reliability. In view of the literature on travel time variations, the relationship between the mean travel time and its connectivity reliability is adopted in the proposed model. In order to simplify the difficulties of the solution, this paper takes the travel time and its connectivity reliability equal to a 0-1 knapsack problem, then defines a new conception of greedy transform which is given an efficient algorithm, after combining the new greedy transform method with Genetic Algorithm, obtains Hybrid Genetic Algorithm (HGA). This algorithm (HGA) can be considered as an efficient algorithm to solve the reliable path finding problem and some other knapsack problems. Numerical results are presented to demonstrate the applications of the proposed algorithm.
展开▼
