Journal of Japan Society for Fuzzy Theory and Intelligent Informatics
Online ISSN : 1881-7203
Print ISSN : 1347-7986
ISSN-L : 1347-7986
Short Notes
Comparison between Global and Local Optimization Routing Method for Alleviation of Traffic Congestion
Ken OHARAYusuke NOJIMAHisao ISHIBUCHI
Author information
JOURNAL FREE ACCESS

2006 Volume 18 Issue 6 Pages 867-873

Details
Abstract
In this paper, we consider a traffic flow model where the information about the actual travel time for each alternative route is not available when each driver performs a route selection. For such a traffic flow model, we examine the effectiveness of two routing methods for minimizing the average travel time over all vehicles running in the model. One method is to minimize the average travel time globally. In this algorithm, a central manager determines the routes of all vehicles. Since the number of combinations of possible routes of drivers exponentially increases as the number of drivers, we need an efficient combinatorial optimization technique. In this paper, we employ a genetic algorithm to search for a near-optimal route choice of each driver. The other method is to minimize the average travel time locally by each driver with no central manager. In this method, each driver selects the route with the shortest estimated travel time among alternative routes. We employ a neural network to estimate the travel time for each route. Through computational experiments, we compare the two methods with each other and demonstrate the characteristic features of each method.
Content from these authors
© 2006 Japan Society for Fuzzy Theory and Intelligent Informatics
Previous article Next article
feedback
Top