The ability of traditional economic order quantity (EOQ) models to successfully determine optimum purchase and process batch sizes has declined in recent years. These models are simplistic in nature in that they make assumptions that are no longer valid in practice, in addition, they cannot take into account the wide variety of cost and other factors that influence inventory control decisions. Presents an alternative method for identifying economic batch quantities that uses genetic algorithms (GA) based on the underlying mathematical processes that control the reproduction of genes within biological species. Using genetic algorithms it is possible to successfully deal with complex inventory situations and there are no limits on the type and number of variables that can be used to influence the batch‐sizing decision.
An aggregate plan is a statement of future resources and finished goods inventory levels that must be made available to enable a manufacturing organization to meet its forecast sales demand. The aggregate planning process must enable the strategic business objectives of a manufacturing organization to be quickly converted into short-term operational plans that are economical to implement. This link between strategy and the day-to-day activities of an organization is becoming increasingly important in enabling organizations to cope with the faster rate at which business objectives must be changed in order to remain competitive. This paper initially examines the aggregate planning process and describes the basic tasks involved. Current methods of setting aggregate plans are then compared and the main limitations of such techniques highlighted. Using an aggregate planning example, the paper then explains how genetic algorithms can be used to develop such plans and illustrates how this type of algorithm provides the means by which the limitations of existing aggregate planning techniques can be overcome.
Research has been carried out to investigate the use of genetic algorithms (GAs) as a common solution technique for solving the range of problems that arise when designing and planning manufacturing operations. A variety of problem areas have been selected that are representative of the range of problem types found in manufacturing decision-making, i.e. assortment planning, aggregate planning, lot sizing within material requirements planning environments, line balancing and facilities layout. Part 1 of this paper reported how typical solutions for each problem area were coded in terms of a genetic algorithm structure and how suitable objective functions were constructed. In addition, comparisons of performance were carried out between GA solution methods and traditional solution methods. Part 2 of this paper now describes the GA experiments undertaken during the identi®cation of suitable GA operators and operator parameter values. These experiments have enabled underlying relationships between problem characteristics and performance of individual operator types and parameter values to be identi®ed. From this work a set of guidelines has been identi®ed for selecting appropriate genetic algorithm structures for speci®c types of operations management decision area.Keywords: genetic algorithms, manufacturing system design, assortment planning, aggregate planning, material requirements planning, assembly line balancing, facilities layout ASSORTMENT PROBLEMIn Part 1 of this paper the assortment problem was coded into a format suitable for a genetic algorithm (GA) solution string using a single binary digit to represent each product speci®cation considered as a standard [1]. The decision the GA then had to make was simply to determine whether or not to include a particular standard in the product range.In order to determine the applicability of individual GA operators for providing solutions to the assortment problem, a range of experiments was performed as follows:1. The alternative selection operators investigated were roulette wheel, roulette wheel with elitism, tournament and truncated. The e ciency of each selection operator was identi®ed using experiments in which other operator types and their values remained constant: the number of replications was set at 10, single-point crossover was used with a probability value set at 0.6, the mutation probability rate was set at 0.0001 and the population size was set at 100. The results are shown in Fig. 1 and indicate that all types of selection operator investigated were able to ®nd the best solution. However, the e ciency in terms of the number of generations required varies between selection operator types, i.e. both the tournament and truncated selection operators allowed the GA to ®nd good solutions in fewer generations than the roulette wheel and the roulette wheel with elitism operators. The inclusion of the elitism option improved the performance of the roulette wheel operator by retaining in the next generation the best solution found in the current population. Th...
Research has been carried out to investigate the use of genetic algorithms (GAs) as a common solution technique for solving the range of problems that arise when designing and planning manufacturing operations. A variety of problem areas have been selected that are representative of the range of problem types found in manufacturing decision-making, i.e. assortment planning, aggregate planning, lot sizing within material requirements planning environments, line balancing and facilities layout. In Part 1 of this paper, for each problem area, a typical solution has been coded in terms of a GA structure, a suitable objective function has been constructed and experiments have been performed in order to identify suitable GA operators and operator parameter values. The potential suitability of GAs to solve these problem types has then been determined by comparing the best solution generated using a GA to a solution derived using a traditional solution technique. Part 2 of this paper focuses on the range of GA experiments undertaken to investigate the underlying relationships between problem characteristics and the performance of individual operator types and their parameter values.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.