Recently, linear temporal logic (LTL) has been employed as a tool for formal specification in dynamical control systems. With this formal approach, control systems can be designed to provably accomplish a large class ...
详细信息
ISBN:
(纸本)9781424431236
Recently, linear temporal logic (LTL) has been employed as a tool for formal specification in dynamical control systems. With this formal approach, control systems can be designed to provably accomplish a large class of complex tasks specified via LTL. For this purpose, language generating Buchi automata with finite abstractions of dynamical systems have been used in the literature. In this paper, we take a mathematical programming-based approach to control of a broad class of discrete-time dynamical systems, called mixed logic dynamical (MLD) systems, with LTL specifications. MLDs include discontinuous and hybrid piecewise discrete-time linear systems. We apply these tools for model checking and optimal control of MLD systems with LTL specifications. Our algorithms exploit mixed integer linear programming (MILP) as well as, in the appropriate setting, mixedinteger quadratic programming (MIQP) techniques. Our solution approach introduces a general technique useful in representing LTL constraints as mixed-integerlinear constraints.
Energy-efficient multicast routing is of primary concern for mobile ad hoc networks (MANET). However, none of existing energy-efficient multicast algorithms is applicable to large-scale MANETs, either due to their com...
详细信息
Energy-efficient multicast routing is of primary concern for mobile ad hoc networks (MANET). However, none of existing energy-efficient multicast algorithms is applicable to large-scale MANETs, either due to their complexity (which is either NP-hard or polynomial with respect to the network size), or due to the huge overhead caused by frequent exchanges of location information. To solve the scalability and overhead issues, we propose the Predictive .Energy-efficient Multicast Algorithm (PEMA) which exploits statistical properties of the network, as opposed to relying on route details or network topology. The running time of PEMA depends on the multicast group size, not network size; this makes PEMA fast enough even for MANETs consisting of 1000 or more nodes. Simulation results show that PEMA not only results in significant energy savings compared to other existing algorithms, but also attains good packet delivery ratio in mobile environments.
In this paper, we propose a cross-layer optimization framework to jointly design the spectrum sharing and flow routing with the interference considerations in cognitive radio networks. Given multiple traffic demands f...
详细信息
In this paper, we propose a cross-layer optimization framework to jointly design the spectrum sharing and flow routing with the interference considerations in cognitive radio networks. Given multiple traffic demands from different source nodes to destination nodes, we formulate an optimization problem in the form of mixed integer linear programming (MILP) to provide a fair routing. Different from the existing work, we consider bi-directional links because we believe the link level acknowledgements in an ad-hoc network are a must. For traffic routing we allow multi-path for each traffic demand. Numerical results show that the spectrum sharing among the secondary users is interference-free and a fair routing is guaranteed for different traffic demands.
Phase shifting mask (PSM) is a promising resolution enhancement technique, which is used in the deep sub-wavelength lithography of the VLSI fabrication process. However, applying the PSM technique requires the layout ...
详细信息
ISBN:
(纸本)9781424419210
Phase shifting mask (PSM) is a promising resolution enhancement technique, which is used in the deep sub-wavelength lithography of the VLSI fabrication process. However, applying the PSM technique requires the layout to be free of phase conflicts. In this paper, we present a mixed integer linear programming (MILP) based layout modification algorithm which solves the phase conflict problem by wire spreading. Unlike existing layout modification methods which first solve the phase conflict problem by removing edges from the layout-associated conflict graphs and then try to revise the layout to match the resultant conflict graphs, our algorithm simultaneously considers the phase conflict problem and the feasibility of modifying the layout. The experimental results indicate that without increasing the chip size, the phase conflict problem can be well tackled with minimal perturbation to the layout.
This study presents an evaluation of heuristics that reconfigure a multi-layer network logical topology for efficiently accommodating variable traffic patterns. Numerical results show that reconfiguration is useful if...
详细信息
This study presents an evaluation of heuristics that reconfigure a multi-layer network logical topology for efficiently accommodating variable traffic patterns. Numerical results show that reconfiguration is useful if the network is not heavily loaded.
For the goal of energy-saving and environmental protection and increasing the re-utilization of recycling products for enterprises, the paper discusses an open-loop remanufacturing reverse logistics network which has ...
详细信息
For the goal of energy-saving and environmental protection and increasing the re-utilization of recycling products for enterprises, the paper discusses an open-loop remanufacturing reverse logistics network which has a location selection of two layers, then constructs a mixed integer linear programming model to achieve the overall minimum cost including the freight between nodes, the fixed cost, the disposal cost and operation cost of storage and demolition nodes and remanufacturing centers, the penalty cost of the unmet or remaining demand quantity, as well as the operating subsidy of recycling product from government for dealing with environmental protection. According to the characteristics of the model, the paper uses two ways to solve the problem which are Lingo and adaptive genetic algorithm based on Matlab, and then provides an instance where solution steps and results analysis are given, which verifies the feasibility of applying adaptive genetic algorithm on the reverse logistics network model.
In this paper, we consider a special discount where: (1) the price breaks depend on the size of the order quantities, (2) independent products¿ sales volume affect the prices and discounts of the other products a...
详细信息
ISBN:
(纸本)9781424426294
In this paper, we consider a special discount where: (1) the price breaks depend on the size of the order quantities, (2) independent products¿ sales volume affect the prices and discounts of the other products and (3) all products must be sold as a bundle. In this circumstance, which the buyer wants to buy multi-product and suppliers also offer the special discount, the problem becomes more complicated. To formulate the problem, multi-objective mixed integer linear programming (MOMILP) is used to define the optimum quantities among the selected suppliers. The problem includes the three objective functions: to minimize the inverse Total Value of Purchasing (TVP), the total cost and total defect rate, while satisfying capacity and demand requirement constraints. In order to solve the model, a single objective function is used that considers relative importance of the goals. A numerical example is given to illustrate how the multi-objective model is applied.
We consider a version of the total flow time single machine scheduling problem where uncertainty about processing times is taken into account. Namely an interval of equally possible processing times is considered for ...
详细信息
This paper presents a profit-based model for short-term hydro scheduling adapted to pool-based electricity markets. The objective is to determine a feasible and realistic operation of a set of coupled hydro units belo...
详细信息
This paper presents a profit-based model for short-term hydro scheduling adapted to pool-based electricity markets. The objective is to determine a feasible and realistic operation of a set of coupled hydro units belonging to a small or medium-size hydroelectric company in order to build the generation bids for the next 24 hourly periods. The company is assumed to be price-taker, and therefore, market prices are considered exogenous variables and modeled via scenarios generated by an Input/Output Hidden Markov Model (IOHMM). In order to be protected against low prices scenarios, two different risk-aversion criteria are introduced in the model: a minimum profit constraint and a minimum conditional Value-at-Risk (CVaR) requirement, which can be formulated linearly in the context of the optimization problem. In order to ensure a feasible operation, the model takes into account a very detailed representation of the generating units, which includes forbidden discharge intervals, spatial-temporal constraints among cascaded reservoirs, etc. The non-linear relationship among the electrical power, the net-head and the turbine water discharge is treated by means of an under-relaxed iterative procedure where net-heads are successively update until convergence is reached. During each algorithm stage, previous iterations' information is used to build the input-output curves. This way, the hydro scheduling problem can be formulated as a MILP optimization problem, where unit-commitment decisions are modeled by means of binary variables. The model has been successfully applied to a real-size example case, which is also presented in this paper. (C) 2006 Elsevier B.V. All rights reserved.
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integerlinear program. Traditional approaches to branching variable selection rely on estima...
详细信息
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integerlinear program. Traditional approaches to branching variable selection rely on estimating the effect of the candidate variables on the objective function. We present a new approach that relies on estimating the impact of the candidate variables on the active constraints in the current LP relaxation. We apply this method to the problem of finding the first feasible solution as quickly as possible. Empirical experiments demonstrate a significant improvement compared to a state-of-the art commercial MIP solver.
暂无评论