期刊文献+
共找到52篇文章
< 1 2 3 >
每页显示 20 50 100
An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint 被引量:3
1
作者 Zeheng Yang Yongan Guo 《China Communications》 SCIE CSCD 2016年第8期177-183,共7页
Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in net... Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%. 展开更多
关键词 network virtualization virtual network embedding exact VNE algorithm integer linear programming location constraint VNR acceptance ratio
下载PDF
A new heuristic algorithm for general integer linear programming problems 被引量:1
2
作者 高培旺 《Journal of Chongqing University》 CAS 2006年第3期170-174,共5页
A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of a... A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of assistant sets, an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane. A simple numerical example shows that the algorithm is efficient for some problems, and therefore, of practical interest. 展开更多
关键词 integer linear programming objective function hyperplane cutting plane heuristic algorithm
下载PDF
Revision of stratified OWL ontologiesbased on integer linear programming
3
作者 Ji Qiu Qi Guilin Boutouhami Khaoula 《Journal of Southeast University(English Edition)》 EI CAS 2020年第1期1-7,共7页
To revise stratified web ontology language(OWL)ontologies,the kernel revision operator is extended by defining novel conflict stratification and the incision function based on integer linear programming(ILP).The ILP-b... To revise stratified web ontology language(OWL)ontologies,the kernel revision operator is extended by defining novel conflict stratification and the incision function based on integer linear programming(ILP).The ILP-based model considers an optimization problem of minimizing a linear objective function which is suitable for selecting the minimal number of axioms to remove when revising ontologies.Based on the incision function,a revision algorithm is proposed to apply ILP to all minimal incoherence-preserving subsets(MIPS).Although this algorithm can often find a minimal number of axioms to remove,it is very time-consuming to compute MIPS.Thus,an adapted revision algorithm to deal with unsatisfiable concepts individually is also given.Experimental results reveal that the proposed ILP-based revision algorithm is much more efficient than the commonly used algorithm based on the hitting set tree.In addition,the adapted algorithm can achieve higher efficiency,while it may delete more axioms. 展开更多
关键词 ontology revision inconsistency handling semantic web integer linear programming
下载PDF
A mixed integer linear programming approach for municipal solid waste management
4
《Journal of Environmental Sciences》 SCIE EI CAS CSCD 1997年第4期49-63,共15页
AmixedintegerlinearprogrammingapproachformunicipalsolidwastemanagementGordonGuoHeHuangEnvironmentalSystemsEn... AmixedintegerlinearprogrammingapproachformunicipalsolidwastemanagementGordonGuoHeHuangEnvironmentalSystemsEngineering,Univer... 展开更多
关键词 A mixed integer linear programming approach for municipal solid waste management
下载PDF
Combining Geographic Information Systems for Transportation and Mixed Integer Linear Programming in Facility Location-Allocation Problems
5
作者 Silvia Maria Santana Mapa Renato da Silva Lima 《Journal of Software Engineering and Applications》 2014年第10期844-858,共15页
In this study, we aimed to assess the solution quality for location-allocation problems from facilities generated by the software TransCAD&reg;?, a Geographic Information System for Transportation (GIS-T). Such fa... In this study, we aimed to assess the solution quality for location-allocation problems from facilities generated by the software TransCAD&reg;?, a Geographic Information System for Transportation (GIS-T). Such facilities were obtained after using two routines together: Facility Location and Transportation Problem, when compared with optimal solutions from exact mathematical models, based on Mixed Integer Linear Programming (MILP), developed externally for the GIS. The models were applied to three simulations: the first one proposes opening factories and customer allocation in the state of Sao Paulo, Brazil;the second involves a wholesaler and a study of location and allocation of distribution centres for retail customers;and the third one involves the location of day-care centers and allocation of demand (0 - 3 years old children). The results showed that when considering facility capacity, the MILP optimising model presents results up to 37% better than the GIS and proposes different locations to open new facilities. 展开更多
关键词 Geographic Information Systems for Transportation Location-Allocation Problems Mixed integer linear programming TRANSPORTATION TransCAD^(█)
下载PDF
A Green Mixed Integer Linear Programming Model for Optimization of Byproduct Gases in Iron and Steel Industry 被引量:6
6
作者 Hai-ning KONG 《Journal of Iron and Steel Research International》 SCIE EI CAS CSCD 2015年第8期681-685,共5页
Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to c... Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to construct an integrated optimized system, taking economics, energy consumption and environment into consideration. Therefore, the environmental cost caused by pollutants discharge should be factored in total cost when optimizing byproduct gas distribution. A green mixed integer linear programming (MILP) model for the optimization of byproduct gases was established to reduce total cost, including both operation cost and environmental cost. The operation cost included penalty for gas deviation, costs of fuel and water consumption, holder booster trip penalty, and so forth; while the environmental cost consisted of penalties for both direct and indirect pollutants discharge. Case study showed that the proposed model brought an optimum solution and 2.2% of the total cost could be reduced compared with previous one. 展开更多
关键词 green mixed integer linear programming environmental cost OPTIMIZATION iron and steel industry byproduct gas
原文传递
Reserve Constrained Dynamic Economic Dispatch with Valve-point Effect:A Two-stage Mixed Integer Linear Programming Approach 被引量:3
7
作者 Zhaolong Wu Jianying Ding +2 位作者 Q.H.Wu Zhaoxia Jing Jiehui Zheng 《CSEE Journal of Power and Energy Systems》 SCIE 2017年第2期203-211,共9页
This paper proposes a deterministic two-stage mixed integer linear programming(TSMILP)approach to solve the reserve constrained dynamic economic dispatch(DED)problem considering valve-point effect(VPE).In stage one,th... This paper proposes a deterministic two-stage mixed integer linear programming(TSMILP)approach to solve the reserve constrained dynamic economic dispatch(DED)problem considering valve-point effect(VPE).In stage one,the nonsmooth cost function and the transmission loss are piecewise linearized and consequently the DED problem is formulated as a mixed integer linear programming(MILP)problem,which can be solved by commercial solvers.In stage two,based on the solution obtained in stage one,a range compression technique is proposed to make a further exploitation in the subspace of the whole solution domain.Due to the linear approximation of the transmission loss,the solution obtained in stage two dose not strictly satisfies the power balance constraint.Hence,a forward procedure is employed to eliminate the error.The simulation results on four test systems show that TSMILP makes satisfactory performances,in comparison with the existing methods. 展开更多
关键词 Dynamic economic dispatch mixed integer linear programming valve-point effect spinning reserve transmission loss non-convex optimization
原文传递
A mixed-integer linear programming approach for robust state estimation 被引量:2
8
作者 Yanbo CHEN Jin MA 《Journal of Modern Power Systems and Clean Energy》 SCIE EI 2014年第4期366-373,共8页
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. 展开更多
关键词 State estimation ROBUSTNESS Leverage point Mathematical programming Mixed integer linear programming(MILP)
原文传递
Solution for integer linear bilevel programming problems using orthogonal genetic algorithm 被引量:9
9
作者 Hong Li Li Zhang Yongchang Jiao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2014年第3期443-451,共9页
An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorith... An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm. 展开更多
关键词 integer linear bilevel programming problem integer optimization genetic algorithm orthogonal experiment design
下载PDF
Solving Integer Programming by Evolutionary Soft Agent
10
作者 Yin JianDepartment of Computer Science, Zhongshan University, Guangzhou 510275,Guangdong, ChinaState Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, Jiangsu, China 《Wuhan University Journal of Natural Sciences》 CAS 2003年第S1期283-286,共4页
Many practical problems in commerce and industry involve finding the best way to allocate scarce resources a-mong competing activities. This paper focuses on the problem of integer programming, and describes an evolut... Many practical problems in commerce and industry involve finding the best way to allocate scarce resources a-mong competing activities. This paper focuses on the problem of integer programming, and describes an evolutionary soft a-gent model to solve it. In proposed model, agent is composed of three components: goal, environment and behavior. Experimental shows the model has the characters of parallel computing and goal driving. 展开更多
关键词 AGENT integer linear programming DUPLICATION
下载PDF
Detection of gross errors using mixed integer optimization approach in process industry
11
作者 MEI Cong-li SU Hong-ye CHU Jian 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2007年第6期904-909,共6页
A novel mixed integer linear programming (NMILP) model for detection of gross errors is presented in this paper. Yamamura et al.(1988) designed a model for detection of gross errors and data reconciliation based on Ak... A novel mixed integer linear programming (NMILP) model for detection of gross errors is presented in this paper. Yamamura et al.(1988) designed a model for detection of gross errors and data reconciliation based on Akaike information cri- terion (AIC). But much computational cost is needed due to its combinational nature. A mixed integer linear programming (MILP) approach was performed to reduce the computational cost and enhance the robustness. But it loses the super performance of maximum likelihood estimation. To reduce the computational cost and have the merit of maximum likelihood estimation, the simultaneous data reconciliation method in an MILP framework is decomposed and replaced by an NMILP subproblem and a quadratic programming (QP) or a least squares estimation (LSE) subproblem. Simulation result of an industrial case shows the high efficiency of the method. 展开更多
关键词 Data reconciliation Detection of gross errors Mixed integer linear programming (MILP) Novel MILP (NMILP) Quadratic programming (QP)
下载PDF
Convexity Properties for a Function of Two Integer Variables
12
作者 Sara Nourazari Hillel Kumin 《American Journal of Operations Research》 2021年第6期253-256,共4页
Sufficient conditions are given for any local minimum of a function of two integer variables to be a global minimum. An example is given </span><span style="font-family:Verdana;">to</span>&... Sufficient conditions are given for any local minimum of a function of two integer variables to be a global minimum. An example is given </span><span style="font-family:Verdana;">to</span><span style="font-family:Verdana;"> show that a function of two integer variables need not be discrete convex for this condition to hold. 展开更多
关键词 linear integer programming CONVEXITY
下载PDF
An Intelligent Optimization Method of Reinforcing Bar Cutting for Construction Site
13
作者 Zhaoxi Ma Qin Zhao +3 位作者 Tianyou Cang Zongjian Li Yiyun Zhu Xinhong Hei 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第1期637-655,共19页
To meet the requirements of specifications,intelligent optimization of steel bar blanking can improve resource utilization and promote the intelligent development of sustainable construction.As one of the most importa... To meet the requirements of specifications,intelligent optimization of steel bar blanking can improve resource utilization and promote the intelligent development of sustainable construction.As one of the most important building materials in construction engineering,reinforcing bars(rebar)account for more than 30%of the cost in civil engineering.A significant amount of cutting waste is generated during the construction phase.Excessive cutting waste increases construction costs and generates a considerable amount of CO_(2)emission.This study aimed to develop an optimization algorithm for steel bar blanking that can be used in the intelligent optimization of steel bar engineering to realize sustainable construction.In the proposed algorithm,the integer linear programming algorithm was applied to solve the problem.It was combined with the statistical method,a greedy strategy was introduced,and a method for determining the dynamic critical threshold was developed to ensure the accuracy of large-scale data calculation.The proposed algorithm was verified through a case study;the results confirmed that the rebar loss rate of the proposed method was reduced by 9.124%compared with that of traditional distributed processing of steel bars,reducing CO_(2)emissions and saving construction costs.As the scale of a project increases,the calculation quality of the optimization algorithmfor steel bar blanking proposed also increases,while maintaining high calculation efficiency.When the results of this study are applied in practice,they can be used as a sustainable foundation for building informatization and intelligent development. 展开更多
关键词 Building construction rebar work cutting stock problem optimization algorithm integer linear programming
下载PDF
Randomized MILP framework for Securing Virtual Machines from Malware Attacks
14
作者 R.Mangalagowri Revathi Venkataraman 《Intelligent Automation & Soft Computing》 SCIE 2023年第2期1565-1580,共16页
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. 展开更多
关键词 Virtualization technology security cross-VM channel attack VM-escape R-VM-MILP algorithm(randomized VM allocation of security resources) Mixed integer linear programming(MILP) SSE strategy firewall-based monitoring method
下载PDF
Optimization Models for Hybrid Work Scheduling
15
作者 Vardges Melkonian 《American Journal of Operations Research》 2023年第6期147-176,共30页
Remote and Hybrid work has been a common practice for many organizations in recent years. It has many advantages such as offering a better work-life balance but it might also negatively affect productivity and teamwor... Remote and Hybrid work has been a common practice for many organizations in recent years. It has many advantages such as offering a better work-life balance but it might also negatively affect productivity and teamwork. While an organization would like to satisfy the remote/hybrid preferences of its employees, it also must ensure that there are enough people working in the office to satisfy certain professional needs. Finding the right balance between in-office and remote work is not an easy task. We develop three optimization models to give solutions to the problem. The most comprehensive model allows employees to work remotely some days of the week and flexible hours for those weekdays when employees work in the office. Our computational results show that the models are very time-efficient in practice. The computational results also include a sensitivity analysis of the most comprehensive model. 展开更多
关键词 integer linear programming Work Scheduling Remote Work Hybrid Work
下载PDF
A Linear Mixed Integer Programming Model for N-Vehicle Exploration Problem 被引量:1
16
作者 Li-Li Wang Bing-Ling She +1 位作者 Jun-Feng Liu Jin-Chaun Cui 《Journal of the Operations Research Society of China》 EI CSCD 2015年第4期489-498,共10页
Finding the accurate solution for N-vehicle exploration problem is NP-hard in strong sense.In this paper,authors build a linear mixed integer programming model for N-vehicle exploration problem based on its properties... Finding the accurate solution for N-vehicle exploration problem is NP-hard in strong sense.In this paper,authors build a linear mixed integer programming model for N-vehicle exploration problem based on its properties.The model is then proved equivalent to the original problem.Given the model,one can apply the already existed methods and algorithms for mixed integer linear programming on N-vehicle exploration problem,which helps to enrich methods for solving N-vehicle exploration problem. 展开更多
关键词 linear mixed integer programming N-Vehicle exploration problem NP-HARD
原文传递
Fitting boxes to Manhattan scenes using linear integer programming
17
作者 Minglei Li Liangliang Nan Shaochuang Liu 《International Journal of Digital Earth》 SCIE EI CSCD 2016年第8期806-817,共12页
We propose an approach for automatic generation of building models by assembling a set of boxes using a Manhattan-world assumption.The method first aligns the point cloud with a per-building local coordinate system,an... We propose an approach for automatic generation of building models by assembling a set of boxes using a Manhattan-world assumption.The method first aligns the point cloud with a per-building local coordinate system,and then fits axis-aligned planes to the point cloud through an iterative regularization process.The refined planes partition the space of the data into a series of compact cubic cells(candidate boxes)spanning the entire 3D space of the input data.We then choose to approximate the target building by the assembly of a subset of these candidate boxes using a binary linear programming formulation.The objective function is designed to maximize the point cloud coverage and the compactness of the final model.Finally,all selected boxes are merged into a lightweight polygonal mesh model,which is suitable for interactive visualization of large scale urban scenes.Experimental results and a comparison with state-of-the-art methods demonstrate the effectiveness of the proposed framework. 展开更多
关键词 Urban building models aerial point cloud Manhattan scenes linear integer programming
原文传递
Strategic mining options optimization:Open pit mining, underground mining or both 被引量:16
18
作者 Ben-Awuah Eugene Richter Otto +1 位作者 Elkington Tarrant Pourrahimian Yashar 《International Journal of Mining Science and Technology》 SCIE EI CSCD 2016年第6期1065-1071,共7页
Near-surface deposits that extend to considerable depths are often amenable to both open pit mining and/or underground mining. This paper investigates the strategy of mining options for an orebody using a Mixed Intege... Near-surface deposits that extend to considerable depths are often amenable to both open pit mining and/or underground mining. This paper investigates the strategy of mining options for an orebody using a Mixed Integer Linear Programming(MILP) optimization framework. The MILP formulation maximizes the Net Present Value(NPV) of the reserve when extracted with(i) open pit mining,(ii) underground mining, and(iii) concurrent open pit and underground mining. Comparatively, implementing open pit mining generates a higher NPV than underground mining. However considering the investment required for these mining options, underground mining generates a better return on investment than open pit mining. Also, in the concurrent open pit and underground mining scenario, the optimizer prefers extracting blocks using open pit mining. Although the underground mine could access ore sooner, the mining cost differential for open pit mining is more than compensated for by the discounting benefits associated with earlier underground mining. 展开更多
关键词 Mining options optimization Open pitUnderground Concurrent Open stope Mixed integer linear programming (MILP)
下载PDF
Energy-constrained ferry route design for sparse wireless sensor networks 被引量:2
19
作者 王勇 彭伟 +1 位作者 窦强 龚正虎 《Journal of Central South University》 SCIE EI CAS 2013年第11期3142-3149,共8页
In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such ... In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such highly partitioned scenario,a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the sink.Typically,practical constraints(e.g.,the energy)preclude a ferry from visiting all sensors in a single tour.In such case,the ferry can only access part of the sensors in each tour and move back to the sink to get the energy refilled.So,the energy-constrained ferry route design(ECFRD)problem is discussed,which leads to the optimization problem of minimizing the total route length of the ferry,while keeping the route length of each tour below a given constraint.The ECFRD problem is proved to be NP-hard problem,and the integer linear programming(ILP)formulation is given.After that,efficient heuristic algorithms are proposed to solve this problem.The experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution. 展开更多
关键词 message ferry energy-constrained route design integer linear programming wireless sensor networks
下载PDF
Improved design of online fault diagnoser for partially observed Petri nets with generalized mutual exclusion constraints 被引量:2
20
作者 Jiufu Liu Wenliang Liu +2 位作者 Jianyong Zhou Yan Sun Zhisheng Wang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2017年第5期971-978,共8页
This paper investigates the fault detection problem for discrete event systems (DESs) which can be modeled by partially observed Petri nets (POPNs). To overcome the problem of low diagnosability in the POPN online fau... This paper investigates the fault detection problem for discrete event systems (DESs) which can be modeled by partially observed Petri nets (POPNs). To overcome the problem of low diagnosability in the POPN online fault diagnoser in current use, an improved online fault diagnosis algorithm that integrates generalized mutual exclusion constraints (GMECs) and integer linear programming (ILP) is proposed. Assume that the POPN structure and its initial markings are known, and the faults are modeled as unobservable transitions. First, the event sequence is observed and recorded. GMEC is used for elementary diagnosis of the system behavior, then the ILP problem of POPN is solved for further diagnosis. Finally, an example of a real DES to test the new fault diagnoser is analyzed. The proposed algorithm increases the diagnosability of the DES remarkably, and the effectiveness of the new algorithm integrating GMEC and ILP is verified. 展开更多
关键词 fault diagnosis partially observed Petri nets (POPNs) integer linear programming (ILP) generalized mutual exclusion constraints (GMECs)
下载PDF
上一页 1 2 3 下一页 到第
使用帮助 返回顶部