This paper considers the e ect of stochasticity on the quality of convergence of genetic algorithms (GAs). In many problems, the variance of building-block tness or so-called collateral noise is the major source of variance, and a population-sizing equation is derived to ensure that average signalto-collateral-noise ratios are favorable to the discrimination of the best building blocks required...

The Inventory Routing Problem (IRP) involves the distribution of one or more products from a supplier to a set of customers over a discrete planning horizon. The version treated here, the so-called Vendor Managed Inventory Routing Problem (VMIRP), is the Inventory Routing problem arising when the replenishment policy is decided a priori. We consider two replenishment policies. The first is know...

In the dynamic software field there are major challenges in adapting metrics and cost estimation methods to continuing changes. There is a need to assess emerging trends and re-interpret software size measures and estimation models for new processes. Future trends of software systems are overviewed with implications for software sizing and cost estimation capabilities. Methods are shown to hand...

Analog circuits form an important part in integrated circuits and in particular in ASICs (Application Specific Integrated Circuits). However, due to the high complexity, design of this part has become a bottle-neck in the design flow (Gielen, 2007; Rutenbar et al., 2007). To overcome this problem and to guaranty that the analog part can be designed in reasonable time even for future technologie...

Batch sizing in different planning period is categorized as a classical problem in production planning, that so many exact & heuristic methods have been proposed to solve this problem, each of which considering various aspects of the original problem. The solution obtained from majority – e.g. MRP – is in this format that there may be some periods of idleness or each period should produce a...

In this paper we study an integrated lot sizing problem with distribution and delivery time windows in which the producer has the choice to locate distribution centers from where products are stored and shipped to customers. Based on a real case study, we describe, model, and solve this rich integrated lot sizing problem. In this integrated optimization application, we consider a multi-plant, m...

The wellknown CLSP problem is generalized including sequence dependent setup times and overtimes and modeling it as a quadratic mixed 0-1 integer programming problem called Capacitated Lot Sizing Problem with Sequence Dependent Setups and Overtimes. We develop a heuristics based on Lagrangean relaxation and tabu search for solving the problem. At the end, some computational results are presented.