Cloud computing involves remote server deployments with public net-work infrastructures that allow clients to access computational resources.Virtual Machines(VMs)are supplied on requests and launched without interacti...Cloud computing involves remote server deployments with public net-work infrastructures that allow clients to access computational resources.Virtual Machines(VMs)are supplied on requests and launched without interactions from service providers.Intruders can target these servers and establish malicious con-nections on VMs for carrying out attacks on other clustered VMs.The existing system has issues with execution time and false-positive rates.Hence,the overall system performance is degraded considerably.The proposed approach is designed to eliminate Cross-VM side attacks and VM escape and hide the server’s position so that the opponent cannot track the target server beyond a certain point.Every request is passed from source to destination via one broadcast domain to confuse the opponent and avoid them from tracking the server’s position.Allocation of SECURITY Resources accepts a safety game in a simple format as input andfinds the best coverage vector for the opponent using a Stackelberg Equilibrium(SSE)technique.A Mixed Integer Linear Programming(MILP)framework is used in the algorithm.The VM challenge is reduced by afirewall-based controlling mechanism combining behavior-based detection and signature-based virus detection.The pro-posed method is focused on detecting malware attacks effectively and providing better security for the VMs.Finally,the experimental results indicate that the pro-posed security method is efficient.It consumes minimum execution time,better false positive rate,accuracy,and memory usage than the conventional approach.展开更多
In this paper,a mixed integer linear programming(MILP)formulation for robust state estimation(RSE)is proposed.By using the exactly linearized measurement equations instead of the original nonlinear ones,the existingmi...In this paper,a mixed integer linear programming(MILP)formulation for robust state estimation(RSE)is proposed.By using the exactly linearized measurement equations instead of the original nonlinear ones,the existingmixed integer nonlinear programming formulation for RSE is converted to a MILP problem.The proposed approach not only guarantees to find the global optimum,but also does not have convergence problems.Simulation results on a rudimentary 3-bus system and several IEEE standard test systems fully illustrate that the proposed methodology is effective with high efficiency.展开更多
Technological advancements in unmanned aerial vehicles(UAVs)have revolutionized various industries,enabling the widespread adoption of UAV-based solutions.In engineering management,UAV-based inspection has emerged as ...Technological advancements in unmanned aerial vehicles(UAVs)have revolutionized various industries,enabling the widespread adoption of UAV-based solutions.In engineering management,UAV-based inspection has emerged as a highly efficient method for identifying hidden risks in high-risk construction environments,surpassing traditional inspection techniques.Building on this foundation,this paper delves into the optimization of UAV inspection routing and scheduling,addressing the complexity introduced by factors such as no-fly zones,monitoring-interval time windows,and multiple monitoring rounds.To tackle this challenging problem,we propose a mixed-integer linear programming(MILP)model that optimizes inspection task assignments,monitoring sequence schedules,and charging decisions.The comprehensive consideration of these factors differentiates our problem from conventional vehicle routing problem(VRP),leading to a mathematically intractable model for commercial solvers in the case of large-scale instances.To overcome this limitation,we design a tailored variable neighborhood search(VNS)metaheuristic,customizing the algorithm to efficiently solve our model.Extensive numerical experiments are conducted to validate the efficacy of our proposed algorithm,demonstrating its scalability for both large-scale and real-scale instances.Sensitivity experiments and a case study based on an actual engineering project are also conducted,providing valuable insights for engineering managers to enhance inspection work efficiency.展开更多
在优化左转错位交叉口相位相序的基础上,提出了3套左转错位交叉口信号配时策略的混合整数规划(mixed integer linear programming,MILP)模型。MILP-1模型以交叉口通行能力最大为目标函数,以排队长度约束、最小绿灯时间约束、最大等待时...在优化左转错位交叉口相位相序的基础上,提出了3套左转错位交叉口信号配时策略的混合整数规划(mixed integer linear programming,MILP)模型。MILP-1模型以交叉口通行能力最大为目标函数,以排队长度约束、最小绿灯时间约束、最大等待时间约束共同构成约束集合。MILP-2模型引入进口道重要程度的概念,修正目标函数,调整优化方向,以期获得最真实的配时方案。通过引入若干等式约束,可以得到简化模型MILP-3,并可运用分枝定界算法予以求解。广州市白云区金钟横云龙路口是一个典型的左转错位交叉口,分别运用MILP-1模型、MILP-2模型及MILP-3模型进行配时设计,求解结果表明:3个模型均能得到合理的优化结果,且以MILP-2优化效果最佳,MILP-3优化速度最快。展开更多
Oil depots along products pipelines are important components of the pipeline transportation system and down-stream markets.The operating costs of oil depots account for a large proportion of the total system’s operat...Oil depots along products pipelines are important components of the pipeline transportation system and down-stream markets.The operating costs of oil depots account for a large proportion of the total system’s operating costs.Meanwhile,oil depots and pipelines form an entire system,and each operation in a single oil depot may have influence on others.It is a tough job to make a scheduling plan when considering the factors of delivering contaminated oil and batches migration.So far,studies simultaneously considering operating constraints and contaminated oil issues are rare.Aiming at making a scheduling plan with the lowest operating costs,the paper establishes a mixed-integer linear programming model,considering a sequence of operations,such as delivery, export, blending,fractionating and exchanging operations,and batch property differences of the same oil as well as influence of batch migration on contaminated volume.Moreover,the paper verifies the linear relationship between oil concentration and blending capability by mathematical deduction.Finally,the model is successfully applied to one of the product pipelines in China and proved to be practical.展开更多
Intelligent process planning(PP)is one of the most important components in an intelligent manufacturing system and acts as a bridge between product designing and practical manufacturing.PP is a nondeterministic polyno...Intelligent process planning(PP)is one of the most important components in an intelligent manufacturing system and acts as a bridge between product designing and practical manufacturing.PP is a nondeterministic polynomial-time(NP)-hard problem and,as existing mathematical models are not formulated in linear forms,they cannot be solved well to achieve exact solutions for PP problems.This paper proposes a novel mixed-integer linear programming(MILP)mathematical model by considering the network topology structure and the OR nodes that represent a type of OR logic inside the network.Precedence relationships between operations are discussed by raising three types of precedence relationship matrices.Furthermore,the proposed model can be programmed in commonly-used mathematical programming solvers,such as CPLEX,Gurobi,and so forth,to search for optimal solutions for most open problems.To verify the effectiveness and generality of the proposed model,five groups of numerical experiments are conducted on well-known benchmarks.The results show that the proposed model can solve PP problems effectively and can obtain better solutions than those obtained by the state-ofthe-art algorithms.展开更多
文摘Cloud computing involves remote server deployments with public net-work infrastructures that allow clients to access computational resources.Virtual Machines(VMs)are supplied on requests and launched without interactions from service providers.Intruders can target these servers and establish malicious con-nections on VMs for carrying out attacks on other clustered VMs.The existing system has issues with execution time and false-positive rates.Hence,the overall system performance is degraded considerably.The proposed approach is designed to eliminate Cross-VM side attacks and VM escape and hide the server’s position so that the opponent cannot track the target server beyond a certain point.Every request is passed from source to destination via one broadcast domain to confuse the opponent and avoid them from tracking the server’s position.Allocation of SECURITY Resources accepts a safety game in a simple format as input andfinds the best coverage vector for the opponent using a Stackelberg Equilibrium(SSE)technique.A Mixed Integer Linear Programming(MILP)framework is used in the algorithm.The VM challenge is reduced by afirewall-based controlling mechanism combining behavior-based detection and signature-based virus detection.The pro-posed method is focused on detecting malware attacks effectively and providing better security for the VMs.Finally,the experimental results indicate that the pro-posed security method is efficient.It consumes minimum execution time,better false positive rate,accuracy,and memory usage than the conventional approach.
基金This work was supported in part by the National High Technology Research and Development Program(2012AA 050208)in part by the National Natural Science Foundation of China(51407069)in part by the Fundamental Research Funds for the Central Universities(2014QN02).
文摘In this paper,a mixed integer linear programming(MILP)formulation for robust state estimation(RSE)is proposed.By using the exactly linearized measurement equations instead of the original nonlinear ones,the existingmixed integer nonlinear programming formulation for RSE is converted to a MILP problem.The proposed approach not only guarantees to find the global optimum,but also does not have convergence problems.Simulation results on a rudimentary 3-bus system and several IEEE standard test systems fully illustrate that the proposed methodology is effective with high efficiency.
基金supported by the National Natural Science Foundation of China(72201229,72025103,72394360,72394362,72361137001,72071173,and 71831008).
文摘Technological advancements in unmanned aerial vehicles(UAVs)have revolutionized various industries,enabling the widespread adoption of UAV-based solutions.In engineering management,UAV-based inspection has emerged as a highly efficient method for identifying hidden risks in high-risk construction environments,surpassing traditional inspection techniques.Building on this foundation,this paper delves into the optimization of UAV inspection routing and scheduling,addressing the complexity introduced by factors such as no-fly zones,monitoring-interval time windows,and multiple monitoring rounds.To tackle this challenging problem,we propose a mixed-integer linear programming(MILP)model that optimizes inspection task assignments,monitoring sequence schedules,and charging decisions.The comprehensive consideration of these factors differentiates our problem from conventional vehicle routing problem(VRP),leading to a mathematically intractable model for commercial solvers in the case of large-scale instances.To overcome this limitation,we design a tailored variable neighborhood search(VNS)metaheuristic,customizing the algorithm to efficiently solve our model.Extensive numerical experiments are conducted to validate the efficacy of our proposed algorithm,demonstrating its scalability for both large-scale and real-scale instances.Sensitivity experiments and a case study based on an actual engineering project are also conducted,providing valuable insights for engineering managers to enhance inspection work efficiency.
文摘在优化左转错位交叉口相位相序的基础上,提出了3套左转错位交叉口信号配时策略的混合整数规划(mixed integer linear programming,MILP)模型。MILP-1模型以交叉口通行能力最大为目标函数,以排队长度约束、最小绿灯时间约束、最大等待时间约束共同构成约束集合。MILP-2模型引入进口道重要程度的概念,修正目标函数,调整优化方向,以期获得最真实的配时方案。通过引入若干等式约束,可以得到简化模型MILP-3,并可运用分枝定界算法予以求解。广州市白云区金钟横云龙路口是一个典型的左转错位交叉口,分别运用MILP-1模型、MILP-2模型及MILP-3模型进行配时设计,求解结果表明:3个模型均能得到合理的优化结果,且以MILP-2优化效果最佳,MILP-3优化速度最快。
基金part of the Program of ‘‘Study of the mechanism of complex heat and mass transfer during batch transport process in product pipelines’’ funded under the National Natural Science Foundation of China, Grant Number 51474228
文摘Oil depots along products pipelines are important components of the pipeline transportation system and down-stream markets.The operating costs of oil depots account for a large proportion of the total system’s operating costs.Meanwhile,oil depots and pipelines form an entire system,and each operation in a single oil depot may have influence on others.It is a tough job to make a scheduling plan when considering the factors of delivering contaminated oil and batches migration.So far,studies simultaneously considering operating constraints and contaminated oil issues are rare.Aiming at making a scheduling plan with the lowest operating costs,the paper establishes a mixed-integer linear programming model,considering a sequence of operations,such as delivery, export, blending,fractionating and exchanging operations,and batch property differences of the same oil as well as influence of batch migration on contaminated volume.Moreover,the paper verifies the linear relationship between oil concentration and blending capability by mathematical deduction.Finally,the model is successfully applied to one of the product pipelines in China and proved to be practical.
基金supported in part by the National Natural Science Foundation of China(51825502,51775216)in part by the Program for Huazhong University of Science and Technology(HUST)Academic Frontier Youth Team(2017QYTD04).
文摘Intelligent process planning(PP)is one of the most important components in an intelligent manufacturing system and acts as a bridge between product designing and practical manufacturing.PP is a nondeterministic polynomial-time(NP)-hard problem and,as existing mathematical models are not formulated in linear forms,they cannot be solved well to achieve exact solutions for PP problems.This paper proposes a novel mixed-integer linear programming(MILP)mathematical model by considering the network topology structure and the OR nodes that represent a type of OR logic inside the network.Precedence relationships between operations are discussed by raising three types of precedence relationship matrices.Furthermore,the proposed model can be programmed in commonly-used mathematical programming solvers,such as CPLEX,Gurobi,and so forth,to search for optimal solutions for most open problems.To verify the effectiveness and generality of the proposed model,five groups of numerical experiments are conducted on well-known benchmarks.The results show that the proposed model can solve PP problems effectively and can obtain better solutions than those obtained by the state-ofthe-art algorithms.
