14 papers · ranked by Valyu relevance
Ahmed A. Zaki Diab, Ashraf M. Abdelhamid, Hamdy M. Sultan
This paper provides six metaheuristic algorithms, namely Fast Cuckoo Search (FCS), Salp Swarm Algorithm (SSA), Dynamic control Cuckoo search (DCCS), Gradient-Based Optimizer (GBO), Northern Goshawk Optimization (NGO), Opposition Flow Direction Algorithm (OFDA) to efficiently solve the optimal power flow (OPF) issue.…
Arsineh Boodaghian Asl, Jayanth Raghothama, Adam S. Darwich, Sebastiaan Meijer
'Sebastiaan Meijer'] Hospitals are complex systems, and the flow of patients is dynamic and nonlinear in such systems. Network representation allows flow algorithms to observe bottlenecks as candidates for optimisation. To model the dynamic behaviour of the patient flow, we need to consider the variability in arrival…
Li Liu, Huan Jin, Yangguang Liu, Xiaomin Zhang + 1 more
This paper focuses on the problem of intelligent evacuation route planning for emergencies, including natural and human resource disasters and epidemic disasters, such as the COVID-19 pandemic. The goal of this study was to quickly generate an evacuation route for a community for victims to be evacuated to safe areas…
Zengkai Wang, Weizhi Liao, Xiaoyun Xia, Zijia Wang + 3 more
'Heming Jia' 'Xuewen Xia'] Routing and scheduling in Time-Sensitive Networking (TSN) is an NP-hard problem. In this paper, we propose a novel routing and scheduling approach for TSN based on evolutionary algorithm. Specifically, we introduce a flow grouping method that leverages the greatest common divisor to optimize…
Congchao Wang, Yizhi Wang, Guoqiang Yu
We developed a minimum-cost circulation framework for solving the global data association problem, which plays a key role in the tracking-by-detection paradigm of multi-object tracking (MOT). The global data association problem was extensively studied under the minimum-cost flow framework, which is theoretically…
Krishneel Deo, Kaylash Chaudhary, Mansour Assaf, Ahyoung Lee
Quality of Service (QoS) is a mechanism used in computer networks to prioritize, classify, and treat packets differently based on certain criteria. This helps the switching devices to schedule and reorder packets if there is congestion in the network. Edge routers experience high traffic congestion as a result of…
Yiping Guo, Guyu Hu, Dongsheng Shao, Hsiao-Chun Wu
To ensure the efficient operation of large-scale networks, the flow scheduling in the software defined network (SDN) requires the matching time and memory overhead of rule matching to be as low as possible. To meet the requirement, we solve the rule matching problem by integrating machine learning methods, including…
Fernando H.C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
'Alexandru I. Tomescu'] Minimum flow decomposition (MFD) is an NP-hard problem asking to decompose a network flow into a minimum set of paths (together with associated weights). Variants of it are powerful models in multiassembly problems in Bioinformatics, such as RNA assembly. Owing to its hardness, practical…
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams + 1 more
'Alexandru I. Tomescu'] Decomposing a network flow into weighted paths is a problem with numerous applications, ranging from networking, transportation planning, to bioinformatics. In some applications we look for a decomposition that is optimal with respect to some property, such as the number of paths used…
Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu
Minimum flow decomposition (MFD) - the problem of finding a minimum set of weighted source-to-sink paths that perfectly decomposes a flow - is a classical problem in Computer Science, and variants of it are powerful models in a different fields such as Bioinformatics and Transportation. Even on acyclic graphs, the…
Alma Ademovic Tahirovic, David Angeli, Goran Strbac
Interacting subsystems are commonly described by networks, where multimodal behaviour found in most natural or engineered systems found recent extension in form of multilayer networks. Since multimodal interaction is often not dictated by network topology alone and may manifest in form of cross-layer information…
Dong Yang, Wei-Tek Tsai
5G cellular networks are already more than six times faster than 4G networks, and their packet loss rate, especially in the Internet of Vehicles (IoV), can reach 0.5% in many cases, such as when there is high-speed movement or obstacles nearby. In such high bandwidth and high packet loss network environments…
Man Tianxing, Mikhail Lushnov, Dmitry I. Ignatov, Yulia Alexandrovna Shichkina + 3 more
Researchers working in various domains are focusing on extracting information from data sets by data mining techniques. However, data mining is a complicated task, including multiple complex processes, so that it is unfriendly to non-computer researchers. Due to the lack of experience, they cannot design suitable…
Min Cui, Yipeng Wang
Workflow scheduling in cloud computing is attracting increasing attention. Cloud computing can assign tasks to available virtual machine resources in cloud data centers according to scheduling strategies, providing a powerful computing platform for the execution of workflow tasks. However, developing effective workflow…