z-logo
open-access-imgOpen Access
A reliability‐based network design problem
Author(s) -
Chootinan Piya,
Wong S. C.,
Chen Anthony
Publication year - 2005
Publication title -
journal of advanced transportation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.577
H-Index - 46
eISSN - 2042-3195
pISSN - 0197-6729
DOI - 10.1002/atr.5670390303
Subject(s) - reliability (semiconductor) , network planning and design , computer science , maximization , flow network , mathematical optimization , monte carlo method , measure (data warehouse) , traffic flow (computer networking) , reliability engineering , mathematics , data mining , statistics , engineering , computer network , power (physics) , physics , computer security , quantum mechanics
Abstract This paper presents a reliability‐based network design problem. A network reliability concept is embedded into the continuous network design problem in which travelers' route choice behavior follows the stochastic user equilibrium assumption. A new capacity‐reliability index is introduced to measure the probability that all of the network links are operated below their capacities when serving different traffic patterns deviating from the average condition. The reliability‐based network design problem is formulated as a bi‐level program in which the lower level sub‐program is the probit‐based stochastic user equilibrium problem and the upper level sub‐program is the maximization of the new capacity reliability index. The lower level sub‐program is solved by a variant of the method of successive averages using the exponential average to represent the learning process of network users on a daily basis that results in the daily variation of traffic‐flow pattern, and Monte Carlo stochastic loading. The upper level sub‐program is tackled by means of genetic algorithms. A numerical example is used to demonstrate the concept of the proposed framework.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here