This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a pathrelinking intensification procedure ...

natural frequency is one of the parameters that represent useful information about the dynamic behavior of structures. controlling this parameter can decrease the probability of damage under dynamic loading. weight optimization on layout and sizing with frequency constraints is a well known problem because of its highly non-linear behavior. improved ray optimization (iro) algorithm is utilized ...

distributed generation (dg) sources are becoming more prominent indistribution systems due to the incremental demands for electrical energy. locationsand capacities of dg sources have great impacts on the system losses in adistribution network. this paper presents a study aimed for optimally determiningthe size and location of distributed generation units in distribution systems withdifferent l...

| The gate sizing problem is the problem of nd-ing load drive capabilities for all gates in a given Boolean network such, that a given delay limit is kept, and the necessary cost in terms of active area usage and / or power consumption is minimal. This paper describes a way to obtain the entire cost versus delay trade-oo curve of a combi-national logic circuit in an eecient way. Every point on ...

The minimum concave cost network flow problem (MCCNFP) is NP-hard, but efficient polynomial-time algorithms exist for some special cases such as the uncapacitated lot-sizing problem and many of its variants. We study the MCCNFP over a grid network with a general nonnegative separable concave cost function. We show that this problem is polynomially solvable when all sources are in the first eche...

This study aims at optimally coordinating inventory among all the partners in a supply chain system with a central warehouse and multiple local retailers so as to minimize the average total costs. After reviewing the literature, we found no study proposes an efficient solution approach that guarantees to secure an optimal solution for the one-warehouse multi-retailer lot-sizing problem. A major...

We describe a fast (linear time) procedure to optimally size transistors in a chain of multi-input gates/stages. The fast sizing is used in a simultaneous sizing and restructuring optimization procedure, to accurately predict relative optimal performance of alternative circuit structures for a given total area. The idea extends the concept of optimally sizing a buffer chain[5], and uses taperin...

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

Optimal placement and sizing of DG in distribution network is an optimization problem with continuous and discrete variables. Many researchers have used evolutionary methods for finding the optimal DG placement and sizing. This paper proposes a hybrid algorithm PSO&HBMO for optimal placement and sizing of distributed generation (DG) in radial distribution system to minimize the total power loss...

A new method of Second order PSO for a more effective capacitor sizing in radial distribution feeders to reduce the real power loss and to improve the voltage profile is proposed. The location of the nodes where the capacitors should be placed is decided by a set of rules given by the fuzzy expert system and the sizing of the capacitors is modeled by the objective function to obtain maximum sav...