Hybrid genetic algorithm for travel time reliability of optimal path

Abstract

This paper investigates the problem of searching the reliable path for transportation networks. The reliable path finding problem is concerned with searching the path with the maximum value of 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 through innovate assumption, takes the travel time and its reliability equal to 0-1 Knapsack Problem, defines a new conception of greedy transform, and gives a new and efficient algorithm to the greedy transform, combined with Genetic Algorithm, then obtains Hybrid Genetic Algorithm (HGA). This algorithm can be considered as an efficient algorithm to solve the reliable path finding problem or Knapsack Problem. Numerical results are presented to demonstrate the applications of the proposed algorithm. © 2009 Springer Berlin Heidelberg.