In this paper, an algorithm is proposed for the design of low complexity linear phase finite impulse response (FIR) filters with optimum discrete coefficients. The proposed algorithm, based on mixedintegerlinear pro...
详细信息
In this paper, an algorithm is proposed for the design of low complexity linear phase finite impulse response (FIR) filters with optimum discrete coefficients. The proposed algorithm, based on mixed integer linear programming (MILP), efficiently traverses the discrete coefficient solutions and searches for the optimum one that results in an implementation using minimum number of adders. During the searching process, discrete coefficients are dynamically synthesized based on a continuously updated subexpression space and, most essentially, a monitoring mechanism is introduced to enable the algorithm's awareness of optimality. Benchmark examples have shown that the proposed algorithm can, in most cases, produce the optimum designs using minimum number of adders for the given specifications. The proposed algorithm can be simply extended for the optimum design with the maximum adder depth constraint.
Global biofuel production has risen substantially in recent years, driven primarily by government support for biofuel industries. The stated motivations for these initiatives are numerous and have varied over time. So...
详细信息
Global biofuel production has risen substantially in recent years, driven primarily by government support for biofuel industries. The stated motivations for these initiatives are numerous and have varied over time. Soybeans are the only field crop produced in sufficient quantities in the province of KwaZulu-Natal (KZN) that the South African industrial biofuel strategy identifies as a potential biodiesel feedstock. Results from a mixed integer linear programming model suggest that significant government support is required to stimulate biodiesel production, and support the notion of Funke et al. (2009), who contend that the incentives and commitments outlined by the industrial biofuel strategy are inadequate to both establish and sustain a domestic biodiesel industry. Under baseline assumptions, a minimum implicit subsidy of R4.37 per litre is required to draw soybean-based biodiesel production into the optimum solution. Results also show that the implicit subsidy is sensitive to changes in the soybean oilcake (by-product) price and the soybean (input) price.
This paper presents an efficient method for the optimal generation scheduling of a microgrid comprising various distributed generators (DG), storage device. To give the optimal operation strategy, an optimization mode...
详细信息
ISBN:
(纸本)9781467325950
This paper presents an efficient method for the optimal generation scheduling of a microgrid comprising various distributed generators (DG), storage device. To give the optimal operation strategy, an optimization model is proposed respecting various distributed energy resources (DER) constraints and system constraints. The objective function is aimed at minimizing the system cost associated with the DCs energy production and start-up and shut-down decisions, along with possible profits. The problem is similar to a unit commitment problem in power system, however, there are some differences due to the special characteristics of DERs in the microgrid, each DER is modeled based on its characteristics and constraints. Finally, a mixed integer linear programming (MILP) method is applied to solve the problem. The effectiveness of the proposed approach is validated by case studies, the test results also indicate the MILP method is a promising approach to solve this kind of problem with high accuracy and low time consumption.
We investigate the joint problem of relay selection and optimal sharing of relay power in wireless cellular networks with multicast traffic. We use two different performance metrics to maximize the network performance...
详细信息
ISBN:
(纸本)9781457720529
We investigate the joint problem of relay selection and optimal sharing of relay power in wireless cellular networks with multicast traffic. We use two different performance metrics to maximize the network performance. We first present a mixed Boolean-convex optimization model to maximize the overall network capacity and solve this combinatorial problem optimally using branch and bound technique. We then show that obtaining the optimal solution is computationally not feasible for large network sizes and, unlike the case of unicast traffic, a water filling method does not yield near optimal solutions in multicast scenarios. We thus adopt an algorithm based on sequential fixing which substantially reduces the computation time and achieves near optimal solutions. In addition, we present a mixed integer linear programming model to maximize the capacity of the minimum capacity link and show that the model is very efficient to reach the optimal solutions.
This paper addresses the main challenges to the security constrained optimal power flow (SCOPF) computations. We first discuss the issues related to the SCOPF problem formulation such as the use of a limited number of...
详细信息
This paper addresses the main challenges to the security constrained optimal power flow (SCOPF) computations. We first discuss the issues related to the SCOPF problem formulation such as the use of a limited number of corrective actions in the post-contingency states and the modeling of voltage and transient stability constraints. Then we deal with the challenges to the techniques for solving the SCOPF, focusing mainly on: approaches to reduce the size of the problem by either efficiently identifying the binding contingencies and including only these contingencies in the SCOPF or by using approximate models for the post-contingency states, and the handling of discrete variables. We finally address the current trend of extending the SCOPF formulation to take into account the increasing levels of uncertainty in the operation planning. For each such topic we provide a review of the state of the art, we identify the advances that are needed, and we indicate ways to bridge the gap between the current state of the art and these needs. (C) 2011 Elsevier B.V. All rights reserved.
The global dwelling energy management problem can be formalized as an optimization problem of energy consumption/production. An optimal solution for the home energy management problem is usually solved by centralized ...
详细信息
ISBN:
(纸本)9781467325950
The global dwelling energy management problem can be formalized as an optimization problem of energy consumption/production. An optimal solution for the home energy management problem is usually solved by centralized solvers. The solver gets the totality of the thermal model of the dwelling but also each appliance composing the system. Nevertheless, this centralized resolution has some limits due to some particular appliances. For example: the appliances with a non-sharable model because of the manufacturer, the appliances that need some precisions that cannot be included in their standard representation used by the solver, the appliances which require specific solvers and the appliances that are managed by user-defined specific heuristic rules. This work proposes to combine the centralized solving approach for energy management problem in dwellings with a multi-agent solving system. The multi agent system provides the possibility of integrating specific models in the global solving of the problem. The proposed system is a mixed centralized/decentralized approach for the solving of global energy management problem. In this paper we present the system and the results of the perfamance tests realized. This work is part of the ANR project ReActivHome.
The topic of this paper is coarse offline path planning for cooperating Unmanned Aerial Vehicles (UAVs), and is motivated by applications such as surveillance of power lines and railways, inspection of gas pipes, and ...
详细信息
ISBN:
(纸本)9781467349420
The topic of this paper is coarse offline path planning for cooperating Unmanned Aerial Vehicles (UAVs), and is motivated by applications such as surveillance of power lines and railways, inspection of gas pipes, and topological surveying to support the planning of new road routes. Such applications typically require a vast amount of data to be transmitted to a control center for analysis. We define a mixed integer linear programming (MBLP) optimization problem in order to solve a surveillance mission using multiple UAVs, and to effectively transmit the data back to the base station we allow for ferrying and relaying, in addition to direct transmission. The paths obtained by solving the optimization problem are analyzed using a realistic radio propagation path loss simulator. If the radio propagation path loss exceeds the maximum design criterion the optimization problem is solved again with stricter communication constraints, and the procedure is continued in an iterative manner until the criterion is met.
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we present three discrete and continuous ...
详细信息
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we present three discrete and continuous time MILP formulations issued from the literature. Second, instead of relying on the traditional discretization of the time horizon, we propose MILP formulations for the RCPSP based on the concept of event: the Start/End formulation and the On/Off formulation. These formulations present the advantage of involving fewer variables than the formulations indexed by time. Because the variables of this type of formulations are not function of the time horizon, we have a better capacity to deal with instances of very large scheduling horizon. Finally, we illustrate our contribution with a series of tests on various types of instance with the MILP formulations issued from the literature, together with our new formulations. We also compare our results with a recent RCPSP-specific exact method. We show that, in terms of exact solving, no MILP formulation class dominates the other ones and that a state-of-the art specialized (non-MILP) method for the RCPSP is even outperformed by MILP on a set of hard instances. Furthermore, on another set of hard "highly cumulative" RCPSP instances with a high processing time range, our On/Off formulation outperforms all the others MILP formulations and obtains results close to the ones of the specialized method. (C) 2009 Elsevier Ltd. All rights reserved.
Electrification systems based on the use of renewable energy sources are suitable for providing electricity to isolated communities autonomously. Specifically, electrification by wind power is one of the technological...
详细信息
Electrification systems based on the use of renewable energy sources are suitable for providing electricity to isolated communities autonomously. Specifically, electrification by wind power is one of the technological options that have been used recently in projects implemented in the Andean highlands of Peru. To date, these projects have tended to install individual microwind turbines at each demand point. Alternatively, we propose a solution that considers both individual generators and microgrids. We develop a mathematical model that gives the location and size or type of the wind turbines and the design of the microgrids, taking into account the demand of the consumption points and the wind potential. The criterion is the minimization of the initial investment cost required to meet the demand. The model is validated by application to a real case in the northern highlands of Peru. Results show that microgrids are used despite the village dispersion, and the solutions significantly reduce the initial investment costs.
A good production schedule in a semiconductor back-end facility is critical for the on time delivery of customer orders. However, the scheduling process is usually difficult due to the wide product mix, large number o...
详细信息
A good production schedule in a semiconductor back-end facility is critical for the on time delivery of customer orders. However, the scheduling process is usually difficult due to the wide product mix, large number of parallel machines, product family-related setups, and high weekly demand consisting of thousands of lots. In this paper, we present a new mixed-integer-linear-programming (MILP) model for the batch production scheduling of a semiconductor back-end facility with serial production stages. Computational results are provided for finding optimal solutions to small problem instances. Due to the limitation on the solvable size of the MILP formulation, a deterministic scheduling system (DSS), including an optimizer and a scheduler, is proposed to provide suboptimal solutions in a reasonable time for large real-world problem instances. Small problem instances are randomly generated to compare the performances of the optimization model and the DSS. An experimental design is utilized to understand the behavior of the DSS under different production scenarios.
暂无评论