نتایج جستجو برای: sizing problem

تعداد نتایج: 887247  

2001
Bharadwaj S. Amrutur Mark A. Horowitz

Decoder design involves choosing the optimal circuit style and figuring out their sizing, including adding buffers if necessary. The problem of sizing a simple chain of logic gates has an elegant analytical solution, though there have been no corresponding analytical results until now which include the resistive effects of the interconnect. Using simple RC models, we analyze the problem of opti...

Journal: :Operations Research 2001
Chung-Piaw Teo Dimitris Bertsimas

We study the classical multistage lot sizing problem that arises in distribution and inventory systems. A celebrated result in this area is the 94% and 98% approximation guarantee provided by power-of-two policies. In this paper, we propose a simple randomized rounding algorithm to establish these performance bounds. We use this new technique to extend several results for the capacitated lot si...

2013
S. M. A. Suliman

Needless to say that the combined lot sizing and cutting stock problem is very relevant in a wide range of manufacturing industries. This paper presents an algorithmic solution approach to overcome the difficulty in solving non-linear integer formulation of the problem. The algorithm is based on the traditional approach where the lot sizing is determined for each period, and then the best cutti...

In this paper, we propose a vibration damping optimization algorithm to solve a fuzzy mathematical model for the single-item capacitated lot-sizing problem. At first, a fuzzy mathematical model for the single-item capacitated lot-sizing problem is presented. The possibility approach is chosen to convert the fuzzy mathematical model to crisp mathematical model. The obtained crisp model is in the...

There is a significant interaction between sizing a fleet of rail cars and its utilization. This paper presents a new multi-period mathematical model and a solution procedure to optimize the rail-car fleet size and freight car allocation, wherein car demands, and travel times, are assumed to be deterministic, and unmet demands are backordered. This problem is considered NP-complete. In other wo...

Journal: :Annals OR 2009
Simin Huang Rajan Batta Rakesh Nagi

The benefits of simultaneous consideration of siting and sizing of distribution centers have been well acknowledged in supply chain design. Most formulations assume that the potential DC sites are known and the decision on location is to select sites from the finite potential DC sites. However, the quality of this discrete version problem depends on the selection of potential DC sites. In this ...

2009
M. Grailoo T. Nikoubin K. Navi

Transistor sizing is very important for determination of the circuit performance. As a result for providing fair evaluation, an optimal size of transistor is necessary. Genetic algorithm that is capable of reduction of search problem complexity uses the transistor sizing which is originally a kind of search problem in the large multidimensional search space for energy consumption optimization. ...

Journal: :Appl. Soft Comput. 2013
Ercan Senyigit Muharrem Dügenci Mehmet Emin Aydin Mithat Zeydan

Multi-period single-item lot sizing problem under stochastic environment has been tackled by few researchers and remains in need of further studies. It is mathematically intractable due to its complex structure. In this paper, an optimum lot-sizing policy based on minimum total relevant cost under price and demand uncertainties was studied by using various artificial neural networks trained wit...

Journal: :CoRR 2004
Kumara Sastry Una-May O'Reilly David E. Goldberg

This paper derives a population sizing relationship for genetic programming (GP). Following the population-sizing derivation for genetic algorithms in Goldberg, Deb, and Clark (1992), it considers building block decision making as a key facet. The analysis yields a GP-unique relationship because it has to account for bloat and for the fact that GP solutions often use subsolutions multiple times...

2008
Robert E. Smith Ellen Smuda

Deciding on an appropriate population size for a given GA application can often be critical to the algorithm's success. Too small, and the GA can fall victim to sampling error, affecting the efficacy of its search. Too large, and the GA wastes computational resources. Although advice exists for sizing GA populations, much of this advice involves theoretical aspects that are not accessible to th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید