A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem
Published Online:1 Feb 2008https://doi.org/10.1287/ijoc.1070.0224
References
- Optimal lot-sizing algorithms for complex product structures. Oper. Res. (1986) 34:237–249Link, Google Scholar
- Computationally efficient optimal solutions to the lot-sizing problem in multistage assembly systems. Management Sci. (1984) 30:222–239Link, Google Scholar
- Parallel evolutionary algorithms can achieve super-linear performance. Inform. Process. Lett. (2002) 82:7–13Crossref, Google Scholar
- Parallelism and evolutionary algorithms. IEEE Trans. Evolutionary Comput. (2002) 6:443–462Crossref, Google Scholar
- Heterogeneous computing and parallel genetic algorithms. J. Parallel Distributed Comput. (2002) 62:1362–1385Crossref, Google Scholar
- Computational complexity of uncapacitated multi-echelon production planning problems. Oper. Res. Lett. (1989) 8:61–66Crossref, Google Scholar
- Optimal mutation rates in genetic search. 5th Internat. Conf. Genetic Algorithms (ICGA) (1993) July 1993Urbana-Champaign, IL(Morgan Kaufmann, San Francisco) 2–8Google Scholar
- Product structure complexity and multilevel lot sizing using alternative costing policies. Decision Sci. (1985) 16:357–369Crossref, Google Scholar
- Production planning for mixed assembly/arborescent systems. J. Oper. Management (1990) 9:7–23Crossref, Google Scholar
- A survey of parallel genetic algorithms. Calculateurs Paralleles, Reseaux et Systems Repartis (1998) 10:141–171Google Scholar
- Migration policies, selection pressure, and parallel evolutionary algorithms. J. Heuristics (2001) 7:311–334Crossref, Google Scholar
- Efficient parallel genetic algorithms: Theory and practice. Comput. Methods Appl. Mech. Engrg. (2000) 186:221–238Crossref, Google Scholar
- An experimental study of some control parameters in parallel genetic programming. Neural, Parallel Sci. Comput. (2003) 11:377–394Google Scholar
- On the use of genetic algorithm with elitism in robust and nonparametric multivariate analysis. Austrian J. Statist. (2003) 32:13–27Google Scholar
- An improved heuristic for multilevel lot sizing in material requirements planning. Decision Sci. (1991) 22:136–156Crossref, Google Scholar
- , Alba E. Parallel meta-heuristics applications. Parallel Metaheuristics (2005) (John Wiley & Sons, Hoboken, NJ) 447–494Crossref, Google Scholar
- , Glover F., Kochenberger G. Parallel strategies for meta-heuristics. State-of-the-Art Handbook in Metaheuristics (2003) (Kluwer, Norwell, MA) 475–513Crossref, Google Scholar
- Analysis of the behaviour of a class of genetic adaptive systems. (1975) . PhD thesis, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor, MIGoogle Scholar
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm. Internat. J. Production Res. (2000) 38:1083–1099Crossref, Google Scholar
- Randomized cost-modification procedures for multilevel lot sizing heuristics. Eur. J. Oper. Res. (2003) 148:211–228Crossref, Google Scholar
- Untersuchungen zur effizienten Lösbarkeit dynamischer, unkapazitierter, mehrstufiger Mehrprodukt-Losgrößenprobleme. (1997) . Research Report AP-Nr. 97/11, Technical University Braunschweig, Braunschweig, GermanyGoogle Scholar
- Genetic Algorithms in Search, Optimization and Machine Learning (1989) (Addison-Wesley, Reading, MA) Google Scholar
- , Rawlins G. J. E. A comparison of selection schemes used in genetic algorithms. Foundations of Genetic Algorithms (1991) (Morgan Kaufmann, San Mateo, CA) 69–93Crossref, Google Scholar
- MIT Press. Adaptation in Natural and Artificial Systems (1975) 2nd ed.(Cambridge, MA)Google Scholar
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic. Eur. J. Oper. Res. (1990) 45:25–37Crossref, Google Scholar
- Graphensuchverfahren und genetische Algorithmen als Problemlösungsmethoden—dargestellt am Beispiel des Standardproblems der Tourenplanung. (1994) . PhD thesis, University of Hagen, Hagen, GermanyGoogle Scholar
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems. Comput. Oper. Res. (2007) 34:2533–2552Crossref, Google Scholar
- Genetic algorithms for the multiple container packing problem. Fifth Internat. Conf. Parallel Problem Solving from Nature (PPSN) (1998) 1498September 1989Amsterdam, The Netherlands(Springer-Verlag, Berlin) 875–884Lecture Notes in Comput. Sci.Crossref, Google Scholar
- Statistical search methods for lotsizing problems. Ann. Oper. Res. (1993) 41:453–468Crossref, Google Scholar
- The influence of migration sizes and intervals on island models. Genetic and Evolutionary Comput. Conf. (GECCO) (2005) June 2005Washington, D.C.(ACM Press, New York) 1295–1302Crossref, Google Scholar
- Optimal multi-level lot sizing for requirements planning systems. Management Sci. (1980) 26:1258–1271Link, Google Scholar
- Uniform crossover in genetic algorithms. Third Internat. Conf. Genetic Algorithms (ICGA) (1989) June 1989Fairfax, VA(Morgan Kaufmann, San Francisco) 2–9Google Scholar
- Systemic behavior of cooperative search algorithms. Parallel Comput. (2004) 30:57–79Crossref, Google Scholar
- Minimum concave cost solution of Leontief substitution models of multi-facility inventory systems. Oper. Res. (1969) 17:262–291Link, Google Scholar
- The performance of a simple incremental lot-sizing rule in a multilevel inventory environment. Decision Sci. (1985) 16:57–72Crossref, Google Scholar
- Materials requirements lot sizing: A multilevel approach. Internat. J. Production Res. (1979) 17:223–232Crossref, Google Scholar
- A deterministic multiproduct, multifacility production and inventory model. Oper. Res. (1966) 14:486–507Link, Google Scholar

