dynamic network flow
Recently Published Documents


TOTAL DOCUMENTS

32
(FIVE YEARS 1)

H-INDEX

11
(FIVE YEARS 0)

2020 ◽  
Vol 37 (1-2) ◽  
pp. 1-13
Author(s):  
Iswar Mani Adhikari ◽  
Tanka Nath Dhamala

Evacuation planning problem deals with sending the maximum number of evacuees from the danger zone to the safe zone in minimum time as eciently as possible. The dynamic network flow models for various evacuation network topology have been found suitable for the solution of such a problem. Bus based evacuation planning problem (BEPP), as an important variant of the vehicle routing problem (VRP), is one of the emerging evacuation planning problems. In this work, an organized overview of this problem with a focus on their solution status is compactly presented. Arrival patterns of the evacuees including their transshipments at different pickup locations and their assignments are presented. Finally, a BEPP model and a solution for a special network are also proposed.



The theory of flows is one of the most important parts of Combinatorial Optimization and it has various applications. In this paper we study optimum (maximum or minimum) flows in directed bipartite dynamic network and is an extension of article [9]. In practical situations, it is easy to see many time-varying optimum problems. In these instances, to account properly for the evolution of the underlying system overtime, we need to use dynamic network flow models. When the time is considered as a variable discrete values, these problems can be solved by constructing an equivalent, static time expanded network. This is a static approach.



2019 ◽  
Vol 7 (3) ◽  
pp. 292-318 ◽  
Author(s):  
Xi Chen ◽  
David Banks ◽  
Mike West

AbstractIn the context of a motivating study of dynamic network flow data on a large-scale e-commerce website, we develop Bayesian models for online/sequential analysis for monitoring and adapting to changes reflected in node–node traffic. For large-scale networks, we customize core Bayesian time series analysis methods using dynamic generalized linear models (DGLMs). These are integrated into the context of multivariate networks using the concept of decouple/recouple that was recently introduced in multivariate time series. This method enables flexible dynamic modeling of flows on large-scale networks and exploitation of partial parallelization of analysis while maintaining coherence with an over-arching multivariate dynamic flow model. This approach is anchored in a case study on Internet data, with flows of visitors to a commercial news website defining a long time series of node–node counts on over 56,000 node pairs. Central questions include characterizing inherent stochasticity in traffic patterns, understanding node–node interactions, adapting to dynamic changes in flows and allowing for sensitive monitoring to flag anomalies. The methodology of dynamic network DGLMs applies to many dynamic network flow studies.





2018 ◽  
Vol 113 (522) ◽  
pp. 519-533 ◽  
Author(s):  
Xi Chen ◽  
Kaoru Irie ◽  
David Banks ◽  
Robert Haslinger ◽  
Jewell Thomas ◽  
...  






Sign in / Sign up

Export Citation Format

Share Document