Comparative Analysis of Two Distribution Building Optimization Algorithms
This paper proposes the modification of genetic algorithm, which uses genetic operators, effecting not on particular solutions, but on the probabilities distribution of solution vector’s components. This paper also compares reliability and efficiency of basic algorithm and proposed modification using the set of benchmark functions and real-world problem of dynamic scheduling of truck painting.
KeywordsProbability Vector Benchmark Function Tournament Selection Dynamic Schedule Reproduction Probability
Unable to display preview. Download preview PDF.
- 1.Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, techniques, and tools, 2nd edn. Addison-Wesley (2007)Google Scholar
- 2.Baluja, S.: Population-Based Incremental Learning: A method for integrating Genetic Search Based Function Optimization and Competitive Learning, Technical Report. Carnegie Mellon University, Pittsburgh (1994)Google Scholar
- 3.Knuth, D.: The Art of Computer Programming, 3rd edn. Seminumerical algorithms, vol. 2. Addison-Wesley (1997)Google Scholar