HEAL DSpace

Evolutionary combinatorial programming for discrete road network design with reliability requirements

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Dimitriou, L en
dc.contributor.author Tsekeris, T en
dc.contributor.author Stathopoulos, A en
dc.date.accessioned 2014-03-01T02:44:37Z
dc.date.available 2014-03-01T02:44:37Z
dc.date.issued 2007 en
dc.identifier.issn 03029743 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/31905
dc.subject Game theory en
dc.subject Genetic algorithms en
dc.subject Mathematical simulation en
dc.subject Network reliability en
dc.subject Stochastic discrete network design en
dc.subject.other Game theory en
dc.subject.other Problem solving en
dc.subject.other Reliability en
dc.subject.other Transportation en
dc.subject.other Urban planning en
dc.subject.other Mathematical simulation en
dc.subject.other Network reliability en
dc.subject.other Stochastic discrete network design en
dc.subject.other Evolutionary algorithms en
dc.title Evolutionary combinatorial programming for discrete road network design with reliability requirements en
heal.type conferenceItem en
heal.identifier.primary 10.1007/978-3-540-71805-5_74 en
heal.identifier.secondary http://dx.doi.org/10.1007/978-3-540-71805-5_74 en
heal.publicationDate 2007 en
heal.abstract This paper examines the formulation and solution of the discrete version of the stochastic Network Design Problem (NDP) with incorporated network travel time reliability requirements. The NDP is considered as a twostage Stackelberg game with complete information and is formulated as a combinatorial stochastic bi-level programming problem. The current approach introduces the element of risk in the metrics of the design process through representing the stochastic nature of various system components related to users' attributes and network characteristics. The estimation procedure combines the use of mathematical simulation for the risk assessment with evolutionary optimization techniques (Genetic Algorithms), as they can suitably address complex non-convex problems, such as the present one. The implementation over a test network signifies the potential benefits of the proposed methodology, in terms of intrinsically incorporating stochasticity and reliability requirements to enhance the design process of urban road networks. © Springer-Verlag Berlin Heidelberg 2007. en
heal.journalName Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) en
dc.identifier.doi 10.1007/978-3-540-71805-5_74 en
dc.identifier.volume 4448 LNCS en
dc.identifier.spage 678 en
dc.identifier.epage 687 en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record