Solution for integer linear bilevel programming problems using orthogonal genetic algorithm

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.

An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint

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%.

Short-Term Scheduling of Combined Cycle Units Using Mixed Integer Linear Programming Solution

Combined cycle plants (CCs) are broadly used all over the world. The inclusion of CCs into the optimal resource scheduling causes difficulties because they can be operated in different operating configuration modes based on the number of combustion and steam turbines. In this paper a model CCs based on a mixed integer linear programming approach to be included into an optimal short term resource optimization problem is presented. The proposed method allows modeling of CCs in different modes of operation taking into account the non convex operating costs for the different combined cycle mode of operation.

The Linear Formulation of Thermal Unit Commitment Problem with Uncertainties through a Computational Mixed Integer

The solar and wind renewable energy is developing very rapidly to fulfill the energy gap. This specific increasing share of renewable energy is a reaction to the ecological trepidations to conciliate economics with security due to the new challenges in power system supply. In solar and wind renewable energy, the only partially predictable is the output with very low controllability which creates unit commitment problems in thermal units. In this research paper, a different linear formulation via mixed integer is presented that only requires “binary variables” and restraints concerning earlier stated models. The framework of this model allows precisely the costs of time-dependent startup & intertemporal limitations, for example, minimum up & down times and a ramping limit. To solve the unit commitment problem efficiently, a commercially available linear programming of mixed-integer is applied for sizeable practical scale. The results of the simulation are shown in conclusions.

A new heuristic algorithm for general integer linear programming problems

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.

Application of Optimization Principle in Landmark University Project Selection under Multi-Period Capital Rationing Using Linear and Integer Programming

The current structure of Landmark University (LU) was induced by raising a generation of solution providers through a qualitative and life-applicable training system that focuses on values and creative knowledge by making it more responsive and relevant to the modern-day demands of demonstration, industrialization and development. The challenge facing Landmark University is the question of which of its numerous projects they should invest to give maximum output with minimum input. In this paper, we maximize the Net Present Value (NPV) and maintain the net discount cash overflow of each project per period as contained and extracted as the secondary data of cash inflows of the Landmark University (LU) monthly financial statement and annual reports from 2012 to 2017 of which the documents have been regrouped as small and large scale projects as many enterprises make more use of the trial-and-error method and as such firms have been finding it difficult in allocating scarce resources in a manner that will ensure profit maximization and/or cost minimization with a simple and accurate decision making by the company through an optimization principle in selecting LU project under multi-period capital rationing using linear programming (LP) and integer programming (IP). The annual net cash flow which is the difference between the cash inflows and cash outflows during each period for the project was estimated and recorded. The discount factors were estimated at cost of capital of 10% for each cash flow per period with the corresponding NPV at 10% which revealed that the optimal decision achieves maximum returns of $110 × 102 and this assisted the project manager to select a large number of the variable projects that can maximize the profit which is far better than relying on an ad-hoc judgmental approach to project investment that could have cost 160 × 102 for the same project. Sensitivity analysis on the project parameters are also carried out to test the extent to which project selection is sensitive to changes in the parameters of the system revealed that a little reduction and or addition of reduced cost by certain amount or percentages to its corresponding coefficient in the objective function effect no changes in the shadow prices with solution values for variables (x1), (x4), (x5) and the optimal objective function.

Revision of stratified OWL ontologiesbased on integer linear programming

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.

Multi-Document Summarization Model Based on Integer Linear Programming

This paper proposes an extractive generic text summarization model that generates summaries by selecting sentences according to their scores. Sentence scores are calculated using their extensive coverage of the main content of the text, and summaries are created by extracting the highest scored sentences from the original document. The model formalized as a multiobjective integer programming problem. An advantage of this model is that it can cover the main content of source (s) and provide less redundancy in the generated sum- maries. To extract sentences which form a summary with an extensive coverage of the main content of the text and less redundancy, have been used the similarity of sentences to the original document and the similarity between sentences. Performance evaluation is conducted by comparing summarization outputs with manual summaries of DUC2004 dataset. Experiments showed that the proposed approach outperforms the related methods.

A mixed integer linear programming approach for municipal solid waste management

ＡｍｉｘｅｄｉｎｔｅｇｅｒｌｉｎｅａｒｐｒｏｇｒａｍｍｉｎｇａｐｐｒｏａｃｈｆｏｒｍｕｎｉｃｉｐａｌｓｏｌｉｄｗａｓｔｅｍａｎａｇｅｍｅｎｔＧｏｒｄｏｎＧｕｏＨｅＨｕａｎｇＥｎｖｉｒｏｎｍｅｎｔａｌＳｙｓｔｅｍｓＥｎｇｉｎｅｅｒｉｎｇ，Ｕｎｉｖｅｒ...

Combining Geographic Information Systems for Transportation and Mixed Integer Linear Programming in Facility Location-Allocation Problems

In this study, we aimed to assess the solution quality for location-allocation problems from facilities generated by the software TransCAD®?, 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.

Solving Integer Programming by Evolutionary Soft Agent

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.

Integer Programming Formulations for Maximum Lifetime Broadcasting Problems in Wireless Sensor Networks

Approaches based on integer linear programming have been recently proposed for topology optimization in wireless sensor networks. They are, however, based on over-theoretical, unrealistic models. Our aim is to show that it is possible to accommodate realistic models for energy consumption and communication protocols into integer linear programming. We analyze the maximum lifetime broadcasting topology problem and we present realistic models that are also shown to provide efficient and practical solving tools. We present a strategy to substantially speed up the convergence of the solving process of our algorithm. This strategy introduces a practical drawback, however, in the characteristics of the optimal solutions retrieved. A method to overcome this drawback is discussed. Computational experiments are reported.

Detection of gross errors using mixed integer optimization approach in process industry

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.

Convexity Properties for a Function of Two Integer Variables

Sufficient conditions are given for any local minimum of a function of two integer variables to be a global minimum. An example is given to show that a function of two integer variables need not be discrete convex for this condition to hold.

电力系统混合整数线性规划问题的运筹决策关键技术综述与展望

机组组合、检修计划、拓扑运行优化、电力系统规划等电力系统混合整数线性规划(MILP)问题旨在实现电力资源的最佳配置,应用广泛,其精准性与高效性直接影响了电力系统的安全性与经济性。随着“双碳”目标的提出,新型电力系统MILP问题模型复杂度更高、计算效率要求更严格,对当前运筹决策技术提出了更严峻的挑战。然而,现有依赖于国外进口求解器的电力系统运筹决策技术面临“组合爆炸”,且求解器依赖进口面临“卡脖子”困境,亟须实现技术突破。为此,该文系统地梳理了电力系统MILP问题的运筹决策技术,以及近年来通用MILP问题的最新进展,并展望了电力系统MILP问题运筹决策关键技术未来的研究方向,旨在为我国相关研究工作提供参考和思路。

考虑节点度紧致化的最优主动解列模型

为解决主动解列模型的连通性和解列模型趋于复杂化导致计算效率下降的问题,本文提出了考虑节点度紧致化的主动解列模型。首先基于单商品流的思想,提出保证孤岛连通性的解析约束;再结合主动解列自身特点和复杂网络中度的概念,提出一种模型紧致化方法以压缩混合整数规划模型的可行域;最后以切负荷与最小潮流中断之和最小为目标求取最优的解列断面。所提模型能保证孤岛内的连通性并且能够较快地求解大型系统的解列问题。3个测试系统的仿真实验表明了该模型的有效性和快速性。

分支定界搜索信息深度引导的电-气互联系统调度决策加速求解方法

电-气互联系统调度决策问题旨在实现天然气系统和电力系统中可调节资源的最佳配置,其精准性与高效性直接影响电-气互联系统运行的安全性与经济性。为描述可调节资源离散状态、非线性运行特性等物理性质,电-气互联系统调度决策问题中含有规模庞大的离散决策变量,模型复杂度高,使得现有依赖于商业混合整数线性规划(MILP)求解器的电力系统运筹优化技术面临“组合爆炸”的计算负担。为此,该文提出一种分支定界搜索信息深度引导的电-气互联系统调度决策加速求解方法。所提方法利用分支定界初始搜索阶段的信息构建小规模辅助MILP模型,并内嵌于分支定界搜索过程,引导剪除更多冗余搜索空间,在不损失最优性的前提下加速收敛。基于RTS-GMLC电力系统和天然气系统不同负荷水平及线性分段数下的30个算例仿真结果说明,相比于直接使用商业MILP求解器,所提方法在不损失最优性的前提下可实现平均4.20倍的加速,验证了所提方法的有效性。

低轨星座传感器资源调度的自主任务规划建模方法

低轨星座传感器资源的优化调度是复杂多约束下的任务规划问题,为了满足多个运动目标全程跟踪与监视的资源实时优化调度需求,提出一种星上自主快速求解的规划模型.在对自主任务规划问题进行详细建模的基础上,考虑各项约束条件与优化因素,将原问题转化成简易的0-1线性整数规划模型,并构建多目标跟踪试验场景对所提方法进行了仿真验证.仿真结果表明,基于简易规划模型的资源调度可实现多目标的全程跟踪与监视.

基于装卸顺序的中型机多航段协同配载优化

多航段、多经停的航空货运航班,飞行过程中需要合理控制飞机的重心(CG)位置,保持平衡状态,中转站装卸操作过程中需要避免额外装卸操作,减少时间和劳力浪费,因此,研究多航段航班的协同配载问题具有重要现实意义。根据航空器自身特点与集装器(ULD)装卸顺序,结合各航段飞机装载平衡与过站机场ULD装卸操作要求,通过协调分配各航段ULD和散货位置,建立了中型机联程航班多目标整数线性规划模型。模型考虑了ULD和散货的质量、体积及与舱位的匹配限制,航空器限重、舱位限重、舱位及区域累积限重、上下舱联合限重和CG位置的平衡限制,以及前后航段ULD和散货的连接性约束。根据造成中间机场额外装卸操作的2种原因,基于装卸顺序,提出装卸优化模型,通过ULD的舱内平移,优化了CG,减少了装卸次数。以B757-200F机型为例,在两装一卸、一装两卸和两装两卸3种场景下,采用商用求解器Gurobi,分别针对3种不同目标函数组合进行求解和分析对比。实验表明:所提模型可以有效协调过站货物的额外装卸次数,优化前后两航段的CG位置。

融合原子交换特征信息的代谢路径预测

为获取从任意起始代谢物到目标代谢物的生化相关性较好的代谢路径,提出一种融合原子交换特征信息的基于约束的代谢路径预测算法PVA。结合代谢网络中具有的原子交换特征信息,建立一种基于约束的混合整数线性规划(MILP)代谢路径预测模型,以搜索从任意起始代谢物到目标代谢物并包含特定原子交换信息的代谢路径。实验结果表明,与同类方法相比,PVA能够有效地发现生化相关性更好的代谢路径。