Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at We apologize for any inconvenience.
By Topic

Model for road network equilibrium bi-level programming based on rough genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhang Liangzhi ; Dept. of Traffic & Logistic Eng., Shandong Jiaotong Univ., Jinan, China ; Bai Lutao

In the traffic system with flow guidance, travelers can choose their paths according to both guidance information and their experience. In this paper, based on the relationship between the effects of traffic guidance and the construction cost, the optimization plan is established as a bi-level program. The objective function at the upper level is defined as the total travel time on the network, plus total investment costs of link capacity expansions. The lower level problem is formulated as a stochastic user equilibrium model. General genetic algorithm combined with rough set theory is used to find the optimal solution. Attributes reduction of rough set is adopted to filtrate new chromosome comes from crossover operation of GA, so as to increasing seeking speed. The result of a road network example verified high efficient of the rough genetic algorithm.

Published in:

Advanced Computer Control (ICACC), 2010 2nd International Conference on  (Volume:5 )

Date of Conference:

27-29 March 2010