The Quick Time Dependent Quickest Flow Problem: A Lesson in Zero-Sum Cycles
dc.contributor.advisor | Miller-Hooks, Elise D | en_US |
dc.contributor.author | Dhundia, Harsh | en_US |
dc.contributor.department | Civil Engineering | en_US |
dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
dc.date.accessioned | 2005-02-02T06:59:50Z | |
dc.date.available | 2005-02-02T06:59:50Z | |
dc.date.issued | 2005-01-03 | en_US |
dc.description.abstract | A quick solution technique for the integral time-dependent quickest flow problem with no waiting is presented. The proposed technique is based on the successive shortest path approach and modifies an existing algorithm to improve its average performance. At each iteration, a reoptimization procedure is employed to determine the augmenting path given updates to the residual graph. The residual graph, by construction, almost always contains zero-sum cycles when employed in this context. These zero-sum cycles pose a unique problem for the reoptimization technique. A heuristic that can be embedded in the reoptimization algorithm to provide path solutions in the presence of zero-sum cycles has been proposed. In the computational experiments, the heuristic provided an optimal solution nearly 100% of the times. Further, a modified implementation of an existing path-finding algorithm has been used to solve the time-dependent quickest flow problem with source waiting. | en_US |
dc.format.extent | 403978 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/1903/2173 | |
dc.language.iso | en_US | |
dc.subject.pqcontrolled | Engineering, Civil | en_US |
dc.subject.pqcontrolled | Operations Research | en_US |
dc.subject.pqcontrolled | Engineering, Industrial | en_US |
dc.subject.pquncontrolled | successive shortest path | en_US |
dc.subject.pquncontrolled | reoptimization | en_US |
dc.subject.pquncontrolled | residual graph | en_US |
dc.subject.pquncontrolled | zero-sum cycle | en_US |
dc.title | The Quick Time Dependent Quickest Flow Problem: A Lesson in Zero-Sum Cycles | en_US |
dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1