In emerging electric power systems, increased transactions often lead to the situations where the system no longer remains in secure operating region. The flexible Ac transmission system (FACTS) controllers can play an important role in the power system security enhancement. However, due to high capital investment, it is necessary to locate these controllers optimally in the power system. FACTS...

This paper applies to the scientific area of electronic design automation (EDA) and addresses the automatic sizing of analog integrated circuits (ICs). Particularly, this work presents an innovative approach to enhance a state-of-the-art layout-aware circuit-level optimizer (GENOM-POF), by embedding statistical knowledge from an automatically generated gradient model into the multi-objective mu...

We present eecient, optimal algorithms for timing optimization by discrete wire sizing and buuer insertion. Our algorithms are able to minimize a cost function subject to given timing constraints; we focus on minimization of dynamic power dissipation, but the algorithm is also easily adaptable to, for example, area minimization. In addition, the algorithm eeciently computes the complete, optima...

Despite its great applicability in several industries, the combined cutting stock and lot-sizing problem has not been sufficiently studied because of its great complexity. This paper analyses the trade-off that arises when we solve the cutting stock problem by taking into account the production planning for various periods. An optimal solution for the combined problem probably contains non-opti...

In this paper, we present a fast algorithm for continuous wire-sizing under the distributed Elmore delay model. Our algorithm GWSA-C is an extension of the GWSA algorithm (for discrete wire-sizing) in CL93a]. GWSA-C is an iterative algorithm with guaranteed convergence to optimal wire-sizing solutions. When specialized to discrete wire-sizing problems, GWSA-C is an improved implementation of GW...

  This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .

We present eecient, optimal algorithms for timing optimization by discrete wire sizing and buuer insertion. Our algorithms are able to minimize a cost function subject to given timing constraints; we focus on minimization of dynamic power dissipation, but the algorithm is also easily adaptable to, for example, area minimization. In addition, the algorithm eeciently computes the complete, optima...

In this paper we consider the uncapacitated economic lot-size model, where demand is a deterministic function of price. In the model a single price need to be set for all periods. The objective is to find an optimal price and ordering decisions simultaneously. In 1973 Kunreuther and Schrage proposed an heuristic algorithm to solve this problem. The contribution of our paper is twofold. First, w...

Demand response (DR) can be very useful for an industrial facility, since it allows noticeable reductions in the electricity bill due to the significant value of energy demand. Although most industrial processes have stringent constraints in terms of hourly active power, DR only becomes attractive when performed with the contemporaneous use of battery energy storage systems (BESSs). When this o...

This paper investigates the optimal sampling and the speed-up obtained through sampling for the sampled OneMax problem. Theoretical and experimental analyses are given for three different population-sizing models: the decision-making model, the gambler’s ruin model, and the fixed population-sizing model. The results suggest that, when the desired solution quality is fixed to a high value, the d...