Network Optimization Research Articles

Nuclear norm regularized loop optimization for tensor network

We propose a loop optimization algorithm based on nuclear norm regularization for the tensor network. The key ingredient of this scheme is to introduce a rank penalty term proposed in the context of data processing. Compared to the standard variational periodic matrix product states method, this algorithm can circumvent the local minima related to short-ranged correlation in a simpler fashion. We demonstrate its performance when used as a part of the tensor network renormalization algorithms [S. Yang, Z.-C. Gu, and X.-G. Wen, ] for the critical two-dimensional Ising model. The scale invariance of the renormalized tensors is attained with higher accuracy while the higher parts of the scaling dimension spectrum are obtained in a more stable fashion. Published by the American Physical Society 2024

Optimal control of a model for dynamic district heating networks

In the present paper an optimal control problem for a concrete system of differential-algebraic equations (DAEs) is considered. This problem arises in the dynamic optimization of unsteady district heating networks. Based on the Carathéodory theory existence of a unique solution to the specific DAE system is proved using specific properties of the considered district heating network model. Moreover, it is shown that the optimal control problem possesses optimal solutions. For the numerical experiments different networks are considered including also data from a real district heating network.

Stochastic Long-Term Energy Optimization in Digital Twin-Assisted Heterogeneous Edge Networks

Stochastic Long-Term Energy Optimization in Digital Twin-Assisted Heterogeneous Edge Networks

Sensor Placement Optimization in Sewer Networks: Machine Learning–Based Source Identification Approach

Sensor Placement Optimization in Sewer Networks: Machine Learning–Based Source Identification Approach

Adaptive Coverage Optimization for Energy-Constrained Multicamera Surveillance Networks

Adaptive Coverage Optimization for Energy-Constrained Multicamera Surveillance Networks

Superpixel-based principal feature clustering annotation method for dual-phase microstructure segmentation

Metallographic analysis is one of the most commonly used techniques by materials scientists for studying metal materials. The deep learning methods, which have been widely applied in metallographic images analysis, demonstrate excellent performance in this task. However, the optimization of deep learning models often relies on a substantial amount of accurately labeled samples for effective supervision. To address this issue, this paper proposes a novel automatic annotation method based on brightness and spatial distribution which is suitable for deep learning-based segmentation of optical dual-phase metallographic microstructure. The proposed automatic annotated method includes the superpixel segmentation, principal feature extraction, and clustering algorithm therefore it is referred as the superpixel-based principal feature clustering annotation (SPFCA) method. SPFCA employs discriminative criteria similar to those used by metallurgists to differentiate between metallographic structures. Furthermore, it can mitigate the occasional errors inherent in manual annotation, leading to improved performance compared to models trained with expert annotations. Experimental validation was conducted using four self-built datasets with different image qualities to test the performance of models from different perspective. Initially, hyperparameter optimization for the SPFCA method tailored to our dataset was performed. Subsequently, SPFCA was utilized to guide the optimization of the convolutional neural network employed for segmentation. The results demonstrate that the segmentation model optimized with SPFCA guidance achieved an F1 score of 0.9226 in the single dataset without the need for manual labeling, surpassing the segmentation models optimized with expert annotations.

Joint Resource Allocation and Trajectory Optimization in Multi-Cell UAV and Sidelink Heterogeneous Networks

Joint Resource Allocation and Trajectory Optimization in Multi-Cell UAV and Sidelink Heterogeneous Networks

Probing an LSTM-PPO-Based reinforcement learning algorithm to solve dynamic job shop scheduling problem

With the growth of personalized demand and the continuous improvement in social productivity, the large-scale and few-variety centralized production model is gradually transitioning towards a personalized model of small batches and multiple varieties, which makes the manufacturing process of the job shop increasingly complex. Furthermore, disruptive events such as machinery failures and rush orders in the job shop increase the uncertainty and variability of the production environment. Traditional scheduling methods are usually based on fixed rules and heuristic algorithms, which are difficult to adapt to constantly changing production environments and demands. This may lead to inaccurate scheduling decisions and hinder the optimal allocation of job shop resources. To solve the dynamic job shop scheduling problem (JSP) more effectively, this paper proposes a Reinforcement Learning (RL) optimization algorithm integrating long short-term memory (LSTM) neural network and proximal policy optimization (PPO). It can dynamically adjust scheduling strategies according to the changing production environment, achieving comprehensive status awareness of the job shop environment to make optimal scheduling decisions. First, a state-aware network framework based on LSTM-PPO is proposed to achieve real-time perception of job shop state changes. Then, the state and action space of the job shop are described within the context of the state-aware network framework. Finally, an experimental environment is established to verify the algorithm’s effectiveness. Training the LSTM-PPO algorithm makes it feasible to achieve better performance than other scheduling methods. By comparing the initial planning time with the actual completion time of the rescheduling decision under different dynamic disturbances, the efficiency of the proposed algorithm is verified for the dynamic JSP

MODELING AND MANAGING RESILIENCE AND RISK FOR INTERDEPENDENT NETWORKS

Catastrophic events have the potential to cause major disruptions to interdependent networks such as supply chains, critical infrastructures and other networks that are vital for the functioning of our society. Addressing the resilience and risk of compromised networks is challenging due to a variety of factors. First, these networks are becoming increasingly interdependent, such that network recovery is contingent upon recovery in connected networks. Additionally, interdependent networks may have multiple functions, system users, owners, and stakeholders. There is a need for data-informed decision-making models that address resilience and risk for these interdependent infrastructure networks. We address these issues by: 1) Modeling interdependencies among infrastructure networks using a multi-layer interdependent network framework, 2) Quantifying the relationship between network resilience and the inter-network connection structure, and 3) Supporting management and strategic decision-making for investment in inter-network connection structures, supporting risk mitigation needs and strategies. Our paper combines network optimization and network science methods to produce a unified framework to analyze resilience. We apply the methods of this paper to the interdependent infrastructure network of Puerto Rico following the 2017 Hurricane Maria. This paper supports decision-making for data-informed resilience management for interdependent infrastructure networks.

Synergistic Integration of Local and Global Information for Critical Edge Identification

Identifying critical edges in complex networks is a fundamental challenge in the study of complex networks. Traditional approaches tend to rely solely on either global information or local information. However, this dependence on a single information source fails to capture the multi-layered complexity of critical edges, often resulting in incomplete or inaccurate identification. Therefore, it is essential to develop a method that integrates multiple sources of information to enhance critical edge identification and provide a deeper understanding and optimization of the structure and function of complex networks. In this paper, we introduce a Global–Local Hybrid Centrality method which integrates a second-order neighborhood index, a first-order neighborhood index, and an edge betweenness index, thus combining both local and global perspectives. We further employ the edge percolation process to evaluate the significance of edges in maintaining network connectivity. Experimental results on various real-world complex network datasets demonstrate that the proposed method significantly improves the accuracy of critical edge identification, providing theoretical and methodological support for the analysis and optimization of complex networks.

Weighted Asymmetry Index: A New Graph-Theoretic Measure for Network Analysis and Optimization

Graph theory is a crucial branch of mathematics in fields like network analysis, molecular chemistry, and computer science, where it models complex relationships and structures. Many indices are used to capture the specific nuances in these structures. In this paper, we propose a new index, the weighted asymmetry index, a graph-theoretic metric quantifying the asymmetry in a network using the distances of the vertices connected by an edge. This index measures how uneven the distances from each vertex to the rest of the graph are when considering the contribution of each edge. We show how the index can capture the intrinsic asymmetries in diverse networks and is an important tool for applications in network analysis, optimization problems, social networks, chemical graph theory, and modeling complex systems. We first identify its extreme values and describe the corresponding extremal trees. We also give explicit formulas for the weighted asymmetry index for path, star, complete bipartite, complete tripartite, generalized star, and wheel graphs. At the end, we propose some open problems.

Sign language recognition using modified deep learning network and hybrid optimization: a hybrid optimizer (HO) based optimized CNNSa-LSTM approach.

Speech impairment limits a person's capacity for oral and auditory communication. Improvements in communication between the deaf and the general public can be progressed by a real-time sign language detector. Recent studies have contributed to make progress in motion and gesture identification processes using Deep Learning (DL) methods and computer vision. But the development of static and dynamic sign language recognition (SLR) models is still a challenging area of research. The difficulty is in obtaining an appropriate model that addresses the challenges of continuous signs that are independent of the signer. Different signers' speeds, durations, and many other factors make it challenging to create a model with high accuracy and continuity. This study mainly focused on SLR using a modified DL and hybrid optimization approach. Notably, spatial and geometric-based features are extracted via the Visual Geometry Group 16 (VGG16), and motion features are extracted using the optical flow approach. A new DL model, CNNSa-LSTM, is a combination of a Convolutional Neural Network (CNN), Self-Attention (SA), and Long-Short-Term Memory (LSTM) to identify sign language. This model is developed for feature extraction by combining CNNs for spatial analysis with SA mechanisms for focusing on relevant features, while LSTM effectively models temporal dependencies. The proposed CNNSa-LSTM model enhances performance in tasks involving complex, sequential data, such as sign language processing. Besides, a Hybrid Optimizer (HO) is proposed using the Hippopotamus Optimization Algorithm (HOA) and the Pathfinder Algorithm (PFA). The proposed model has been implemented in Python, and it has been evaluated over the existing models in terms of accuracy (98.7%), sensitivity (98.2%), precision (98.5%), Word Error Rate (WER) (0.131), Sign Error Rate (SER) (0.114), and Normalized Discounted Cumulative Gain (NDCG) (98%) as well. The proposed model has recorded the highest accuracy of 98.7%.

Dirichlet Integral and Its Generalization by Different Methods

Dirichlet integral, as the integration of sine function over x from positive infinity to 0, or negative infinity, is known as one of the most important concepts in mathematical analysis. In probability and statistics, Dirichlet integral is used in calculating expectation and variance. In physics, Dirichlet integral is used in describing the movement of a charged particle in specific electromagnetic fields, and the wave function of particles in quantum physics. In computer science, Dirichlet integral is used in the optimization of neural network. In economics and management, Dirichlet integral is used in the optimization of production and distribution, the estimation of the risk and return in investment. In this paper, Dirichlet Integral and its generalization are studied. This paper provides several methods including residue theorem and Feynman’s trick to determine the value of Dirichlet integral. Meanwhile, this paper extends Dirichlet integral to the case of n -th power and deduces a general solution by gamma function for the integral.

Cost-Effective Power Management for Smart Homes: Innovative Scheduling Techniques and Integrating Battery Optimization in 6G Networks

This paper presents an Optimal Power Management System (OPMS) for smart homes in 6G environments, which are designed to enhance the sustainability of Green Internet of Everything (GIoT) applications. The system employs a brute-force search using an exact solution to identify the optimal decision for adapting power consumption to renewable power availability. Key techniques, including priority-based allocation, time-shifting, quality degradation, battery utilization and service rejection, will be adopted. Given the NP-hard nature of this problem, the brute-force approach is feasible for smaller scenarios but sets the stage for future heuristic methods in large-scale applications like smart cities. The OPMS, deployed on Multi-Access Edge Computing (MEC) nodes, integrates a novel demand response (DR) strategy to manage real-time power use effectively. Synthetic data tests achieved a 100% acceptance rate with zero reliance on non-renewable power, while real-world tests reduced non-renewable power consumption by over 90%, demonstrating the system’s flexibility. These results provide a foundation for further AI-based heuristics optimization techniques to improve scalability and power efficiency in broader smart city deployments.

A novel optimization framework for natural gas transportation pipeline networks based on deep reinforcement learning

Natural gas is an emerging and reliable energy source in transition to a low-carbon economy. The natural gas transportation pipeline network systems are crucial when transporting natural gas from the production endpoints to processing or consuming endpoints. Optimizing the operational efficiency of compressor stations within pipeline networks is an effective way to reduce energy consumption and carbon emissions during transportation. This paper proposes an optimization framework for natural gas transportation pipeline networks based on deep reinforcement learning (DRL). The mathematical simulation model is derived from mass balance, hydrodynamics principles of gas flow, and compressor characteristics. The optimization control problem in steady state is formulated into a one-step Markov decision process (MDP) and solved by DRL. The decision variables are selected as the discharge ratio of each compressor. By the comprehensive comparison with dynamic programming (DP) and genetic algorithm (GA) in three typical element topologies (a linear topology with gun-barrel structure, a linear topology with branch structure, and a tree topology), the proposed method can obtain 4.60% lower power consumption than GA, and the time consumption is reduced by 97.5% compared with DP. The proposed framework could be further utilized for future large-scale network optimization practices.

Experimental investigation on tailoring compressive properties and energy absorption of 3D printed gradient star re-entrant hybrid auxetic structure

Purpose Fused filament fabrication (FFF) is a widely used 3D printing technique for the fabrication of mechanical metamaterials with intricate geometries. Gradient strategy is applied to geometric parameters of gradient star re-entrant hybrid auxetic (GSRA) structure. Deformation behaviour is studied under compressive loading. The purpose of this study is to investigate the influence of gradient geometric parameters on mechanical properties, namely, specific strength (SS), specific modulus (SM) and specific energy absorption (SEA). Design/methodology/approach Response surface methodology (RSM) is implemented for the design of experiments of gradient geometric parameters to minimize the number of experimental tests. Acrylonitrile butadiene styrene material is used for the fabrication of GSRA structures by FFF technique. The best set of gradient parameters has been optimized maximizing all three responses using RSM and artificial neural network optimization technique. Findings During compressive testing, row-wise deformation is observed with two-stage plateau regions, which results in increase in SEA of the structure. Furthermore, based on analysis of variance and 3D response plots, it is found that height gradient is the most influencing gradient geometric parameter on SS and SM, whereas the wall thickness gradient has maximum influence on SEA. Meanwhile, the interaction effect of wall thickness gradient and height gradient has maximum influence on SS, SM and SEA. Research limitations/implications This study of applying gradient strategy to geometric parameters is limited to GSRA structure under compressive loading. In addition, findings are valid within the selected range of gradient geometric parameters. These findings are useful for the selection of gradient geometric parameters to maximize SS, SM and SEA of GSRA structure simultaneously. These outcomes pave the way for designing light-weight gradient hybrid auxetic structures in the field of construction, aerospace, automobile and biomedical engineering. Originality/value Limited experimental study is available on investigating the influence of gradient geometric parameters on mechanical properties, namely, SS, SM and SEA, and deformation behaviours of hybrid auxetic structures. This study directly addresses the above research gaps.

On Interdicting Dense Clusters in a Network

Given a vertex-weighted undirected graph with blocking costs of its vertices and edges, we seek a minimum cost subset of vertices and edges to block such that the weight of any γ-quasi-clique in the interdicted graph is at most some predefined threshold parameter. The value of [Formula: see text] specifies the edge density of cohesive vertex groups of interest in the network. The considered weighted γ-quasi-clique interdiction problem can be viewed as a natural generalization of several variations of the clique blocker problem previously studied in the literature. From the application perspective, this setting is primarily motivated by the problem of disrupting adversarial (“dark”) networks (e.g., social or communication networks), where γ-quasi-cliques represent “tightly knit” groups of adversaries that we aim to dismantle. We first address the theoretical computational complexity of the problem. We then exploit some basic characterization of its feasible solutions to derive a linear integer programming (IP) formulation. This linear IP model can be solved using a lazy-fashioned branch-and-cut scheme. We also propose a combinatorial branch-and-bound algorithm for solving this problem. The computational performance of the developed exact solution schemes is studied using a test bed of randomly generated and real-life networks. Finally, some interesting insights and observations are also provided using a well-known example of a terrorist network. History: Accepted by Russel Bent, Area Editor for Network Optimization: Algorithms & Applications. Funding: The work of S. Butenko was partially supported by the Air Force Office of Scientific Research under Award FA9550-23-1-0300. The work of O. A. Prokopyev was partially supported by the Office of Naval Research under Award ONR N00014-22-1-2678. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0027 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0027 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ . The online appendix is available at https://doi.org/10.1287/ijoc.2023.0027 .

Efficient and secure service function chain deployment method for delay optimization in air traffic information network

The air traffic information network is fundamental for ensuring the efficient and safe operation of flights. However, with the increasing demands of air traffic services, the rigidity of the traditional air traffic information network has become increasingly pronounced. Network function virtualization (NFV) technology presents an effective solution to address this issue. Within the NFV environment, the deployment of service function chains (SFC) forms the basis for achieving end-to-end air traffic services. This paper addresses the low delay and high security requirements inherent in air traffic services and proposes an efficient and secure SFC deployment for delay optimization (ESSFCD-DO) method. Primarily, the paper conducts a theoretical analysis of SFC deployment, and derives four key principles related to SFC delay, security, and resource cost. Subsequently, based on these principles, the ESSFCD-DO method is developed, which encompasses the virtual network function (VNF) aggregation algorithm for security and resources cost optimization (VNFAA-SRCO), the VNF deployment algorithm based on topology aware (VNFD-TA), and the algorithm for deploying virtual links based on k-shortest path. Experimental results demonstrate that, in comparison to other SFC deployment methods within this domain, ESSFCD-DO achieves significant optimizations in terms of end-to-end delay of SFC and long-term revenue-cost ratio, while ensuring security and service request acceptance rate.

Lifelong QoT prediction: an adaptation to real-world optical networks

Predicting the quality of transmission (QoT) is a critical task in the management and optimization of modern fiber-optic networks. Traditional machine learning (ML) QoT prediction models, typically trained on pre-collected datasets, are designed to make long-term predictions once deployed. However, this static training strategy often falls short in the face of time-dependent network evolution and variations. We identify the root cause of these shortcomings as shifts in data distribution, which are not accounted for in conventional static models. In response to these challenges, we propose an online continual learning pipeline that is specifically designed for stable QoT prediction in optical networks. This pipeline directly addresses the problem of distribution shifts by continuously updating the prediction model in response to real-time network data. We explore and compare various strategies within this framework and demonstrate that the integration of the adaptive retraining strategy and the regularized online continual learning algorithm (OCL-REG) significantly enhances the QoT prediction stability while optimizing the resource efficiency. OCL-REG demonstrates superior adaptability and stability, achieving an average cumulative mean squared error (C-MSE) of 0.19 on a testbench with a data distribution shift sequence containing 1000 batches. Moreover, the OCL-REG model requires fewer samples for adaptation, averaging around 107 samples, compared to the conventional retraining strategy, which requires an average of 253 samples. Our approach presents a paradigm shift in QoT prediction, moving from a static to a dynamic, lifelong learning model that is more attuned to the evolving realities of real fiber-optic networks.

Analysis of Spatial Agglomeration Characteristics of Logistics Enterprises in Henan Province based on Poi

As an important industry connecting urban and rural areas and serving production and life, logistics enterprises, as the micro-foundation of the development of logistics industry, have a profound impact on the spatial reconstruction of regional economic and social development. National Development and Reform Commission issued the "Fourteenth Five-Year Plan" modern logistics development and "Fourteenth Five-Year Plan" modern circulation system construction planning "put forward new requirements for the development of logistics industry, emphasizing the optimization of logistics spatial layout and speed up the construction of national logistics hub, especially pointed out that to make up for the shortcomings of the central and western regions. As an important base for the development of China's logistics industry, the spatial layout of logistics enterprises in Henan province not only affects the high-quality development of the logistics industry in the province, but also plays an important role in the improvement of the national logistics network. In this paper, based on POI data, the mean nearest neighbor method, local Moran scatter plot analysis and kernel density visualization technology are used to analyze the spatial agglomeration characteristics of logistics enterprises in 157 counties in Henan Province. It is found that the spatial distribution of logistics enterprises in Henan Province has gradually evolved from multi-point dispersion to a single-core and multi-core collaborative model with Zhengzhou as the core, and presents a significant spatial positive correlation and agglomeration trend. This change has improved the logistics efficiency and promoted the strengthening of regional economic ties. At the same time, the agglomeration trend of logistics enterprises in Henan Province continues to strengthen, from the initial agglomeration in the core area to the diversified diffusion pattern, showing the continuous optimization and reconstruction of logistics network in the province.