Biobjective Reliable Network Design Problem.

Auteur(s)
Chen, A. Zhou, Z. Chootinan, P. & Wong, S.C.
Jaar
Samenvatting

Capacity reliability is concerned with the probability that the network capacity can accommodate a certain travel demand at a required level of service; while travel time reliability is concerned with the probability that a trip between a given origin-destination (O-D) pair can be made successfully within a specified interval of time for a given level of travel demand in the network. Both are useful performance measures that can describe the supply-side reliability and demand-side reliability of a road network. In this paper, we propose a bi-objective reliable network design problem (BORNDP) model that explicitly considers these two interdependent reliabilities under demand uncertainty. A simulation-based multi-objective genetic algorithm (SMOGA) solution procedure, which consists of a traffic assignment algorithm, a genetic algorithm, a Pareto filter, and a Monte-Carlo simulation, is developed to solve the proposed BORNDP model. A numerical example based on the capacity enhancement problem is also presented to demonstrate the tradeoff between capacity reliability and travel time reliability in the network design problem.

Publicatie aanvragen

8 + 5 =
Los deze eenvoudige rekenoefening op en voer het resultaat in. Bijvoorbeeld: voor 1+3, voer 4 in.

Publicatie

Bibliotheeknummer
C 44275 (In: C 43862 CD-ROM) /71 / ITRD E842218
Uitgave

In: Compendium of papers CD-ROM 87th Annual Meeting of the Transportation Research Board TRB, Washington, D.C., January 13-17, 2008, 20 p.

Onze collectie

Deze publicatie behoort tot de overige publicaties die we naast de SWOV-publicaties in onze collectie hebben.