Matches in SemOpenAlex for { <https://semopenalex.org/work/W132068573> ?p ?o ?g. }
Showing items 1 to 91 of
91
with 100 items per page.
- W132068573 abstract "The thesis discusses discrete-time dynamic flows over a finite time horizon T. These flows take time, called travel time, to pass an arc of the network. Travel times, as well as other network attributes, such as, costs, arc and node capacities, and supply at the source node, can be constant or time-dependent. Here we review results on discrete-time dynamic flow problems (DTDNFP) with constant attributes and develop new algorithms to solve several DTDNFPs with time-dependent attributes. Several dynamic network flow problems are discussed: maximum dynamic flow, earliest arrival flow, and quickest flow problems. We generalize the hybrid capacity scaling and shortest augmenting path algorithmic of the static network flow problem to consider the time dependency of the network attributes. The result is used to solve the maximum dynamic flow problem with time-dependent travel times and capacities. We also develop a new algorithm to solve earliest arrival flow problems with the same assumptions on the network attributes. The possibility to wait (or park) at a node before departing on outgoing arc is also taken into account. We prove that the complexity of new algorithm is reduced when infinite waiting is considered. We also report the computational analysis of this algorithm. The results are then used to solve quickest flow problems. Additionally, we discuss time-dependent bicriteria shortest path problems. Here we generalize the classical shortest path problems in two ways. We consider two - in general contradicting - objective functions and introduce a time dependency of the cost which is caused by a travel time on each arc. These problems have several interesting practical applications, but have not attained much attention in the literature. Here we develop two new algorithms in which one of them requires weaker assumptions as in previous research on the subject. Numerical tests show the superiority of the new algorithms. We then apply dynamic network flow models and their associated solution algorithms to determine lower bounds of the evacuation time, evacuation routes, and maximum capacities of inhabited areas with respect to safety requirements. As a macroscopic approach, our dynamic network flow models are mainly used to produce good lower bounds for the evacuation time and do not consider any individual behavior during the emergency situation. These bounds can be used to analyze existing buildings or help in the design phase of planning a building." @default.
- W132068573 created "2016-06-24" @default.
- W132068573 creator A5043538461 @default.
- W132068573 date "2003-08-27" @default.
- W132068573 modified "2023-09-23" @default.
- W132068573 title "Dynamic Network Optimization with Application to the Evacuation Problem" @default.
- W132068573 hasPublicationYear "2003" @default.
- W132068573 type Work @default.
- W132068573 sameAs 132068573 @default.
- W132068573 citedByCount "17" @default.
- W132068573 countsByYear W1320685732012 @default.
- W132068573 countsByYear W1320685732013 @default.
- W132068573 countsByYear W1320685732014 @default.
- W132068573 countsByYear W1320685732015 @default.
- W132068573 countsByYear W1320685732016 @default.
- W132068573 countsByYear W1320685732020 @default.
- W132068573 crossrefType "book" @default.
- W132068573 hasAuthorship W132068573A5043538461 @default.
- W132068573 hasConcept C105795698 @default.
- W132068573 hasConcept C11413529 @default.
- W132068573 hasConcept C114809511 @default.
- W132068573 hasConcept C126255220 @default.
- W132068573 hasConcept C127413603 @default.
- W132068573 hasConcept C132525143 @default.
- W132068573 hasConcept C13540734 @default.
- W132068573 hasConcept C157469704 @default.
- W132068573 hasConcept C199360897 @default.
- W132068573 hasConcept C22590252 @default.
- W132068573 hasConcept C2524010 @default.
- W132068573 hasConcept C2777027219 @default.
- W132068573 hasConcept C2777735758 @default.
- W132068573 hasConcept C28761237 @default.
- W132068573 hasConcept C31258907 @default.
- W132068573 hasConcept C33923547 @default.
- W132068573 hasConcept C38349280 @default.
- W132068573 hasConcept C41008148 @default.
- W132068573 hasConcept C55689738 @default.
- W132068573 hasConcept C62611344 @default.
- W132068573 hasConcept C66938386 @default.
- W132068573 hasConcept C80444323 @default.
- W132068573 hasConcept C99545648 @default.
- W132068573 hasConceptScore W132068573C105795698 @default.
- W132068573 hasConceptScore W132068573C11413529 @default.
- W132068573 hasConceptScore W132068573C114809511 @default.
- W132068573 hasConceptScore W132068573C126255220 @default.
- W132068573 hasConceptScore W132068573C127413603 @default.
- W132068573 hasConceptScore W132068573C132525143 @default.
- W132068573 hasConceptScore W132068573C13540734 @default.
- W132068573 hasConceptScore W132068573C157469704 @default.
- W132068573 hasConceptScore W132068573C199360897 @default.
- W132068573 hasConceptScore W132068573C22590252 @default.
- W132068573 hasConceptScore W132068573C2524010 @default.
- W132068573 hasConceptScore W132068573C2777027219 @default.
- W132068573 hasConceptScore W132068573C2777735758 @default.
- W132068573 hasConceptScore W132068573C28761237 @default.
- W132068573 hasConceptScore W132068573C31258907 @default.
- W132068573 hasConceptScore W132068573C33923547 @default.
- W132068573 hasConceptScore W132068573C38349280 @default.
- W132068573 hasConceptScore W132068573C41008148 @default.
- W132068573 hasConceptScore W132068573C55689738 @default.
- W132068573 hasConceptScore W132068573C62611344 @default.
- W132068573 hasConceptScore W132068573C66938386 @default.
- W132068573 hasConceptScore W132068573C80444323 @default.
- W132068573 hasConceptScore W132068573C99545648 @default.
- W132068573 hasLocation W1320685731 @default.
- W132068573 hasOpenAccess W132068573 @default.
- W132068573 hasPrimaryLocation W1320685731 @default.
- W132068573 hasRelatedWork W1589042192 @default.
- W132068573 hasRelatedWork W1589314644 @default.
- W132068573 hasRelatedWork W1964119857 @default.
- W132068573 hasRelatedWork W1968268863 @default.
- W132068573 hasRelatedWork W1977545325 @default.
- W132068573 hasRelatedWork W2008133042 @default.
- W132068573 hasRelatedWork W2028009313 @default.
- W132068573 hasRelatedWork W2028316882 @default.
- W132068573 hasRelatedWork W2032247582 @default.
- W132068573 hasRelatedWork W2039657689 @default.
- W132068573 hasRelatedWork W2047907098 @default.
- W132068573 hasRelatedWork W2068218328 @default.
- W132068573 hasRelatedWork W2076171427 @default.
- W132068573 hasRelatedWork W2079436493 @default.
- W132068573 hasRelatedWork W2088045969 @default.
- W132068573 hasRelatedWork W2097414563 @default.
- W132068573 hasRelatedWork W2126469728 @default.
- W132068573 hasRelatedWork W2156849732 @default.
- W132068573 hasRelatedWork W2170193147 @default.
- W132068573 hasRelatedWork W2234958105 @default.
- W132068573 isParatext "false" @default.
- W132068573 isRetracted "false" @default.
- W132068573 magId "132068573" @default.
- W132068573 workType "book" @default.