This paper presents a novel method for designing and sizing high-efficient hydrostatic transmissions (HTs) heavy duty propulsion applications such as agricultural construction machinery. The proposed consists in providing cost effective HT architectures that maximizes efficiency at the most frequent operating conditions of transmission, opposed to traditional design methods based on demanding r...

optimization models have been used to support decision making in production planning for a long time. however, several of those models are deterministic and do not address the variability that is present in some of the data. robust optimization is a methodology which can deal with the uncertainty or variability in optimization problems by computing a solution which is feasible for all possible ...

The aim of lot sizing problems is to determine the periods where production takes place and the quantities to be produced in order to satisfy the customer demand while minimizing the total cost. Due to its importance on the efficiency of the production and inventory systems, Lot sizing problems are one of the most challenging production planning problems and have been studied for many years wit...

Objective: This paper presents a long-term dynamic multi-objective model for distributed generation investment. In this model, sizing, sitting of DG units and specially the dynamics of investment over the planning period is considered as three objectives as multi-objective optimization problem. Accordingly, the multiobjective Interactive Artificial Bee Colony (IABC) is implemented for solving t...

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