Network slicing deployment method based on isolation level by Qirun PAN, Kaizhi HUANG, Wei YOU

“…In order to balance the performance isolation requirements and security isolation requirements of network slicing,a network slice deployment method based on isolation level was proposed.The method first determined the isolation level of the network slice instance from the aspects of performance isolation and security isolation.When deploying the virtual nodes in the appropriate location,not only ensured that all network slice instances could reach their respective performance levels and security levels,but also isolated them.The gradation difference started to limit the coexistence condition of the virtual node.Then the integer linear programming method was used to model the problem,and the deployment cost was minimized as the objective function.Finally,the particle swarm optimization algorithm based on genetic algorithm was used to find the final deployment result.The simulation results show that the method has lower deployment cost and higher benefit-to-cost ratio,and can guarantee both performance and security.…”
Get full text

Research on the Scheduling Problem of Movie Scenes by Yulian Liu, Qiuji Sun, Xiaotian Zhang, Yiwei Wu

“…This paper considers the factors affecting the cost of movie scenes shooting in the real world and constructs an integer linear programming model. A tabu search based method (TSBM) and a particle swarm optimization based method (PSOBM) are designed to solve larger-scale problems. …”
Get full text

Research on mapping algorithm of virtual network oriented to SDN by Jian WANG, Guo-sheng ZHAO, Zhi-xin LI

“…In order to solve the problem of virtual network mapping,a mapping method based on ant colony hybrid genetic algorithm was put forward under SDN environment,which established a linear programming model for virtual network mapping,and divided the mapping process into node mapping and link mapping.Firstly,the fusion algorithm was adopted,in which virtual nodes were mapped to physical nodes.Then the shortest path algorithm was used to map the virtual link to a physical link.On this basis,the acceptance ratio of virtual network requests can be improved.Simulation experiment results show that acceptance rate of virtual network requests can be increased by 10% efficiently using the ant colony hybrid genetic algorithm,compared with existing mapping algorithms D-ViNE,RW-BFS and R-ViNE.Further more,proposed method can greatly improve the average utilization rate of nodes and links and the ratio of the mapping income to cost.…”
Get full text

Topological Optimum Approach for Improving Indicators for Agricultural Sustainability by Waseem Asghar Khan

“…Also using the linear programming approach to reproduce the results of CRS and VRS models.…”
Get full text

Markov game modeling of mimic defense and defense strategy determination by Xingming ZHANG, Zeyu GU, Shuai WEI, Jianliang SHEN

“…Network mimic defense technology enhances the robustness of active defense through the redundancy,dynamic and diversity as well as the decision feedback mechanism.However,little work has been done for its security assessment and existing classic game models are not suitable for its dynamic characteristics and lack of universality.A Markov game model was proposed to analyze the transfer relationship between offensive and defensive status and the measurement method of safety and reliability of mimic defense,and calculated the offensive and defensive game equilibrium through non-linear programming algorithm to determine the best defensive strategy considering performance.Experiments give a comparison with the multi-target hiding technique and shows that the mimic defense has a higher defensive effect.Combining with the specific network case,the specific attack and defense path for the exploit of the system vulnerability is given and the effectiveness of the defense strategy algorithm is verified.…”
Get full text

On Computation of Recently Defined Degree-Based Topological Indices of Some Families of Convex Polytopes via M-Polynomial by Deeba Afzal, Farkhanda Afzal, Mohammad Reza Farahani, Samia Ali

“…Convex polytopes play a significant role both in various branches of mathematics and also in applied areas, most notably in linear programming. We have calculated some topological indices such as atom-bond connectivity index, geometric arithmetic index, K-Banhatti indices, and K-hyper-Banhatti indices and modified K-Banhatti indices from some families of convex polytopes through M-polynomials. …”
Get full text

Optimization of industrial symbiosis in coffee-based eco-industrial park design by N. Laili, T. Djatna, N.S. Indrasti, M. Yani

“…Subsequently, the optimization of industrial symbiosis within eco-industrial parks was realized using a mixed-integer linear programming mathematical model.FINDINGS: The eco-industrial park design presents the actors, internal business processes, material and data exchanges, various actors’ interdependence and critical roles in material exchanges, and value creation processes using valorization within the eco-industrial park. …”
Get full text

Time deterministic network routing algorithm based on stochastic temporal graph by Peng WANG, Xiushe ZHANG, Long SUO, Keyi SHI

“…With respect to the contradiction between the randomness of space-terrestrial integrated network resources and the deterministic requirements of service delay in the network, a stochastic temporal graph model was proposed, based on which a routing algorithm that could guarantee the service delay was constructed.Firstly, how to compute the time-deterministic route over the space information network was modeled as a non-linear programming.To mitigate the problem, a stochastic temporal graph model was proposed, which characterized the stochastic features, caused by the stochastic services of communication links, storage and temporal resources.In addition, the coupling relationship between storage and communication links was also modeled by the graph.Thus, a model was provided by the graph for enhancing the communication link utilization and supporting the time-deterministic routing.Based on this, a routing algorithm fulfilling service delay requirements with the highest probability was proposed with O(n²) polynomial time.The optimality of the algorithm was proved.…”
Get full text

Transmitter selection and receiver placement for target parameter estimation in cooperative radar‐communications system by Liming Wang, Qian He, Huiyong Li

“…To efficiently solve this mix‐integer non‐linear programming problem approximately, a genetic algorithm (GA)‐based method is proposed. …”
Get full text

Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem by S. Molla-Alizadeh-Zavardehi, R. Tavakkoli-Moghaddam, F. Hosseinzadeh Lotfi

“…In this paper, first a fuzzy mixed integer linear programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA), variable neighborhood search (VNS), and simulated annealing (SA) frameworks. …”
Get full text

Integrated Berth Allocation and Time-Variant Quay Crane Scheduling with Tidal Impact in Approach Channel by Xiaogang Jiao, Feifeng Zheng, Ming Liu, Yinfeng Xu

“…We mainly consider the impact of tides on the transport capacity of an approach channel that connects quay and anchorage. An integer linear programming model is developed, and then three heuristic algorithms, Genetic Algorithm, Hybrid Particle Swarm Optimization, and Hybrid Simulated Annealing, are proposed to solve the model. …”
Get full text

Economical operation strategy of integrated energy system under fault state by Yuquan LIU, Xudong CHEN, Wen XIONG, Li WANG, Dongwen CHEN, Yong LI

“…A fault-state operation strategy for integrated energy systems based on multi-energy transfer was proposed.Firstly,an integrated energy system model was built to model each energy-supply device in the system using actual measurable parameters.Then,the calculation method of maximum energy supply capacity when energy-supply device fails was introduced,and the power constraint conditions of each equipment were obtained,and the power balance equations of cold/heat/electricity power were established.Then,set the lowest operating cost as the optimization goal,the objective function was solved by the linear programming method.Finally,taking a factory-level integrated energy system as an example,the rationality of the output changes of each equipment after using this strategy under several fault conditions was analyzed.It is pointed out that the strategy has three characteristics:the cost control effect is significant at low load situation,remarkably impacted by time-sharing energy prices,the outsourcing resource curve can predict the change of operating costs when fault occurs.…”
Get full text

A PSO-CVX Algorithm of Sum and Difference Beam Patterns for Time-Modulated Antenna Array by Xikuan Dong, Hailin Li, Jing Tan, Jiawen Hu, Yachao Jiang

“…The turn-on times of antenna array are achieved by solving a quadratic constraint linear programming; meanwhile, the opening times are optimized by particle swarm optimization algorithm. …”
Get full text

Optimizing the Service Network Design Problem for Railroad Intermodal Transportation of Hazardous Materials by Lixia Huang, Jun Zhao

“…Based on a unified method, we build a multiobjective mixed-integer linear-programming model that comprehensively considers both hazardous and ordinary materials, the compatibility of goods and services, the capacity of the transfer station, and the delivery time limit of each shipment. …”
Get full text

Adaptive Multilevel Collaborative Passenger Flow Control in Peak Hours for a Subway Line by Hongjiao Xue, Limin Jia, Jianyuan Guo

“…To ensure travel safety, improve travel efficiency, and ameliorate waiting environments for passengers, this paper proposes an adaptive multilevel collaborative passenger flow control strategy integrating the control of station entrance and station hall. An integer linear programming model is constructed, which aims at minimizing the total passenger waiting time and taking the safe capacity of each key area of all stations as the necessary constraints. …”
Get full text

Uncertain edge coalition game based EIP revenue estimation strategy by ZHAO Shuxu, XIA Xinyu, WANG Xiaolong

“…Firstly, a resource scheduling model was constructed using a mixed integer linear programming method to maximize the revenue of the edge coalition. …”
Get full text

EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks by Chuanhuang LI, Junhu LIAO, Jiadong XUAN, Qi XU, Huifeng ZHANG, Jun ZHU, Tao ZOU, Ruyun ZHANG

“…With the rapid integration and development of industrial control and information networks, time-sensitive networks based on ethernet have received widespread attention.In these networks, time-triggered communication scheduling is adopted to ensure the determinacy of data transmission.However, existing scheduling algorithms have struggled to rapidly calculate the scheduling tables for large-scale periodic traffic.Therefore, a heuristic scheduling algorithm based on the earliest deadline with weight first-maximum transfer time first was designed.This algorithm, by flexibly adapting traffic sorting weights and enhancing backtracking methods, could resolve the scheduling issues of large-scale traffic in industrial automation scenarios in a relatively short time.Experimental results show that compared to the classic integer linear programming method, the earliest deadline with weight first-maximum transfer time first heuristic scheduling algorithm is able to calculate a more optimal solution for the scheduling table of large-scale periodic traffic more swiftly.…”
Get full text

Internet intelligent routing architecture and algorithm by Fei GUI, Yang CHENG, Dan LI, Sihong HONG

“…However, traditional routing schemes are either traffic oblivious such as OSPF, which can’t adapt to real-time traffic changes, or centralized control such as linear programming, which can’t efficiently react to traffic bursts due to slow computation. …”
Get full text

ROLLING BEARING FAULT DIAGNOSIS BASED ON ADAPTIVE FEATURE SELECTION <italic>k</italic>-SUB CONVEX HULL by HU AiRu, WU ZhanTao, YANG Yu, CHENG JunSheng

“…Secondly, thedistance was solved by the method of linear programming proximity, and the adaptive feature space was obtained by using the multiplier alternating direction method. …”
Get full text

Optimizing Aircraft Operations in Case of Increasing Demand for Limited Airport Capacity by Soner Demirel, Ertan Çınar

“…The mathematical model was formed by employing mixed integer linear programming. The parameters, decision variables, and constraints were defined to cover the problem. …”
Get full text