Minimum parametric flow in time-dependent dynamic networks
| Autor: | Nicoleta Avesalon, Eleonor Ciurea, Mircea Parpalea |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
050210 logistics & transportation
Dynamic network analysis Computer science General Mathematics 05 social sciences Single parameter 0102 computer and information sciences Residual 01 natural sciences Upper and lower bounds Computer Science Applications Flow (mathematics) 010201 computation theory & mathematics 0502 economics and business Algorithm Minimum flow Software Labelling algorithm Parametric statistics |
| Zdroj: | RAIRO - Theoretical Informatics and Applications. 52:43-53 |
| ISSN: | 1290-385X 0988-3754 |
| DOI: | 10.1051/ita/2018002 |
| Popis: | The paper presents a dynamic solution method for the parametric minimum flow in time-dependent, dynamic network. This approach solves the problem for a special parametric dynamic network with linear lower bound functions of a single parameter. Instead of directly working in the original network, the method implements a labelling algorithm which works in the parametric dynamic residual network where repeatedly decreases the flow along quickest dynamic source-sink paths for different subintervals of parameter values, in their increasing order. In each iteration, the algorithm computes both the parametric minimum flow within a certain subinterval, and the new subinterval for which the flow needs to be computed. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|