Show simple item record

dc.creatorTuydes, H.en
dc.creatorZiliaskopoulos, A.en
dc.date.accessioned2015-11-23T10:52:32Z
dc.date.available2015-11-23T10:52:32Z
dc.date.issued2006
dc.identifier.isbn309099730
dc.identifier.issn3611981
dc.identifier.urihttp://hdl.handle.net/11615/34097
dc.description.abstractIn urban evacuations, especially in response to an expected disaster, capacity reversibility (also known as contraflow) has been considered a workable strategy to reduce traffic congestion and to meet evacuation time deadlines. Currently, contraflow strategies are mostly planned by relying on engineering judgment because of the lack of appropriate large-scale decision support tools. A tabu search-based heuristic approach is introduced here that can be applied on realistic-size networks. The approach relies on insights from an analytical formulation of optimal reversibility design that reduces total system travel time. Computational results on a hypothetical and an urban network example network are presented and discussed.en
dc.source.urihttp://www.scopus.com/inward/record.url?eid=2-s2.0-33846873907&partnerID=40&md5=8e0fcc48d01c8a7b911700d296c95480
dc.subjectComputational methodsen
dc.subjectCongestion control (communication)en
dc.subjectDecision support systemsen
dc.subjectHeuristic methodsen
dc.subjectOptimizationen
dc.subjectReverse engineeringen
dc.subjectEvacuation timeen
dc.subjectNetwork evacuation contraflowen
dc.subjectTabu search based heuristic approachen
dc.subjectTraffic congestionen
dc.subjectTelecommunication networksen
dc.titleTabu-based heuristic approach for optimization of network evacuation contraflowen
dc.typeotheren


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record