Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusing on maximizing the network throughput. We formu...
详细信息
Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusing on maximizing the network throughput. We formulate the maximum throughput link scheduling with power control (MATH-SPC) problem, and present a mixed integer linear programming (MILP) formulation to provide optimal solutions. However, simply maximizing the throughput leads to a severe bias on bandwidth allocation among all links. In order to enhance both throughput and fairness, we define a new parameter, the demand satisfaction factor (DSF), to characterize the fairness of bandwidth allocation. We formulate the maximum throughput fair link scheduling with power control (MATA-SPC) problem and present an MILP formulation for this problem. We also present an effective polynomial time heuristic algorithm, namely, the serial LP rounding (SLPR) heuristic. Our numerical results show that bandwidth can be fairly allocated among all links/flows by solving our MATA-SPC formulation or using our heuristic algorithm at the cost of a minor reduction of network throughput
A probabilistic finite receding horizon approach for trajectory planning of autonomous air vehicles is presented. The approach is based on mixed integer linear programming (MILP) techniques. The risk areas are modelle...
详细信息
A probabilistic finite receding horizon approach for trajectory planning of autonomous air vehicles is presented. The approach is based on mixed integer linear programming (MILP) techniques. The risk areas are modelled by dynamic boundaries to direct the vehicle towards the target. Various constraints are formulated to avoid radar zones and collisions, etc. These constraints are extended to be both hard and soft so as to alleviate the infeasibility problem usually encountered. The finite receding horizon approach is numerically stable and can be applied to centralized trajectory planning of a fleet of UAVs in real time. The MILP problem is solved using commercially available software AMPL/CPLEX. Finally the approach is applied to different scenarios with upper and lower bounds on the speed and acceleration of each UAV.
In service oriented architectures, complex applications are composed from a variety of functionally equivalent Web services, which may differ for quality parameters. Under this scenario, applications are defined as hi...
详细信息
In service oriented architectures, complex applications are composed from a variety of functionally equivalent Web services, which may differ for quality parameters. Under this scenario, applications are defined as high level business processes and service composition can be implemented dynamically by identifying the best set of services available at run time. In this paper, we model the service composition problem as a mixedintegerlinear problem where both local constraints and global constraints can be specified.
We consider the problem of maximizing the lifetime of a given multicast connection in wireless networks that use directional antennas and have limited energy resources. We present a constraint formulation for the MLM ...
详细信息
We consider the problem of maximizing the lifetime of a given multicast connection in wireless networks that use directional antennas and have limited energy resources. We present a constraint formulation for the MLM (multicast lifetime maximization) problem in terms of MILP (mixed integer linear programming) for wireless ad hoc networks, which we can use to evaluate and compare the realistic performance of different heuristic algorithms.
In this paper, a new methodology for combined location of thyristor controlled phase angle regulator (TCPAR) and thyristor controlled series compensator (TCSC) has been proposed using a mixedintegerlinear programmin...
详细信息
In this paper, a new methodology for combined location of thyristor controlled phase angle regulator (TCPAR) and thyristor controlled series compensator (TCSC) has been proposed using a mixed integer linear programming approach in the deregulated electricity environment. The methodology is based on DC load flow equations taking constraints on generation, line flow, TCPAR and TCSC parameters, power angle, and number of FACTS controllers. The system loadability has been determined without and with the combined optimal location of FACTS controllers for a pool model and hybrid model using secure bilateral transaction matrix. The results have been compared for a pool model and hybrid model with and without individual optimal location of FACTS controllers. The proposed technique has been demonstrated on IEEE 24 bus reliability test system.
This paper discusses the implementation of a guidance system based on mixed integer linear programming (MILP) on a modified, autonomous T-33 aircraft equipped with Boeing's UCAV avionics package. A receding horizo...
详细信息
This paper discusses the implementation of a guidance system based on mixed integer linear programming (MILP) on a modified, autonomous T-33 aircraft equipped with Boeing's UCAV avionics package. A receding horizon MILP formulation is presented for safe, real-time trajectory generation in a partially-known, cluttered environment. Safety at all times is guaranteed by constraining the intermediate trajectories to terminate in a loiter pattern that does not intersect with any no-fly zones and can always be used as a safe backup plan. Details about the real-time software implementation using CPLEX and Boeing's OCP platform are given. A test scenario developed for the DARPA-sponsored software enabled control capstone demonstration is outlined, and simulation and flight test results are presented
This work presents a method of finding near global optima to minimum-time trajectory generation problems for systems that would be linear if it were not for the presence of Coulomb friction. The required final state o...
详细信息
This work presents a method of finding near global optima to minimum-time trajectory generation problems for systems that would be linear if it were not for the presence of Coulomb friction. The required final state of the system is assumed to be maintainable by the system, and the input bounds are assumed to be large enough so that the role of maintaining zero acceleration during finite time intervals of zero velocity (the role of static friction) can always be assumed by the input. Other than the previous work for generating minimum-time trajectories for robotic manipulators for which the path in joint space is already specified, this work represents, to the best of our knowledge, the first approach for generating near global optima for minimum-time problems involving a non-linear class of dynamic systems. The reason the optima generated are near global optima instead of exactly global optima is due to a discrete-time approximation of the system (which is usually used anyway to simulate such a system numerically). The method closely resembles previous methods for generating minimum-time trajectories for linear systems, where the core operation is the solution of a Phase I linearprogramming problem. For the non-linear systems considered herein. the core operation is instead the solution of a mixed integer linear programming problem. Copyright (C) 2001 John Wiley & Sons, Ltd.
This paper describes experiences with mixed integer linear programming (MILP) based approaches on the short-term hydro scheduling (STHS) function. The STHS is used to determine the optimal or near-optimal schedules fo...
详细信息
This paper describes experiences with mixed integer linear programming (MILP) based approaches on the short-term hydro scheduling (STHS) function. The STHS is used to determine the optimal or near-optimal schedules for the dispatchable hydro units in a hydro-dominant system for a user-definable study period at each time step while respecting all system and hydraulic constraints. The problem can be modeled in detail for a hydro system that contains both conventional and pumped-storage units. Discrete and dynamic constraints such as unit startup/shutdown and minimum-up/minimum-down time limits are also included in the model for hydro unit commitment (HUC). The STHS problem is solved with a state-of-the-art package which includes an algebraic modeling language and a MILP solver. The usefulness of the proposed solution algorithm is illustrated by testing the problem with actual hydraulic system data. Numerical experiences show that the solution technique is computationally efficient, simple, and suit able for decision support of short-term hydro operations planning. In addition, the proposed approaches can be easily extended for scheduling applications In deregulated environment.
In this paper, the short-term scheduling optimization of a combined cycle power plant is accomplished by exploiting hybrid systems, i.e., systems evolving according to continuous dynamics, discrete dynamics, and logic...
详细信息
In this paper, the short-term scheduling optimization of a combined cycle power plant is accomplished by exploiting hybrid systems, i.e., systems evolving according to continuous dynamics, discrete dynamics, and logic rules. Discrete features of a power plant are, for instance, the possibility of turning on/off the turbines, operating constraints like minimum up and down times and the different types of start up of the turbines. On the other hand, features with continuous dynamics are power and steam output, the corresponding fuel consumption, etc. The union of these properties characterize the hybrid behavior of a combined cycle power plant. In order to model both the continuous/discrete dynamics and the switching between different operating conditions, we use the framework of mixed logic dynamical (MLD) systems. Then, we recast the economic optimization problem as a model predictive control (MPC) problem, that allows us to optimize the plant operations by taking into account the time variability of both prices and electricity/steam demands. Because of the presence of integer variables, the MPC scheme is formulated as a mixedintegerlinear program that can be solved in an efficient way via dedicated software.
The problem of short-term production scheduling has been realized to be one of the most important problems in batch process operations. Often different intermediate storage policies may greatly change the scheduling r...
详细信息
The problem of short-term production scheduling has been realized to be one of the most important problems in batch process operations. Often different intermediate storage policies may greatly change the scheduling result. Generally, storage policies can be divided into four classes: zero wait (ZW), no intermediate storage (NIS), finite intermediate storage (FIS) and unlimited intermediate storage (UIS). ZW, NIS or UIS are often considered in previous works. However, FIS or the mixed situation of these four storage policies is seldom involved because the state and storage time for storage tank is hard to represent. Though some approaches have been reported in recent literature, they are either limited to multi-product process or too complex to apply in large problems. In this paper, a novel simple mathematical formulation for short-term scheduling of batch process under mixed intermediate storage policies has been presented. It can deal with complex multi-purpose problems, in which processing paths of batches are different and storage policies may be optional so that the utilization of storage tanks is uncertain. The model uses a new kind of time domain representation that dose not rely on the definition of time slot. As a result binary variable and constraint can be effectively reduced. Intermediate storage tank is regarded as a unit with the particularity that material may not pass through it and the time for storage is variable. Consequently different intermediate storage policies can be described by an uniformed format. Finally the formulation results in an MILP problem. The new model has been tested by some case studies to show the good computational efficiency. Optimal result has been got quickly under GAMS/CPLEX.
暂无评论