Evolution Program for Optimal Capacity Expansion with Backlogs in Demand


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 3, pp. 672-680, Mar. 1999
10.3745/KIPSTE.1999.6.3.672,   PDF Download:

Abstract

This paper presents an evolution program for optimal capacity expansion problem with backlogs in demand which is to determine when and how much capacity should be added under varying types of demand and cost. To overcome premature convergence and stalling, we employ an exponential-fitness scaling scheme. To improve the chromosomes, we introduce hetero-dimensional mutation which generates a new dimension and produces a feasible solution, and homo-dimensional mutation which mutates the chromosomes in the negative of gradient direction. Finally, a numerical example is discussed.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. J. Bok, Y. H. Kyu, L. J. Uk, H. C. Hyun, "Evolution Program for Optimal Capacity Expansion with Backlogs in Demand," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 3, pp. 672-680, 1999. DOI: 10.3745/KIPSTE.1999.6.3.672.

[ACM Style]
Jo Jung Bok, Yang Hwang Kyu, Lee Jae Uk, and Ham Chang Hyun. 1999. Evolution Program for Optimal Capacity Expansion with Backlogs in Demand. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 3, (1999), 672-680. DOI: 10.3745/KIPSTE.1999.6.3.672.