From Genes to Memes: Optimization by Problem-aware Evolutionary Algorithms

• Autorzy: Cotta C.
• Języki publikacji: EN

Abstrakty

EN

Memetic algorithms are population-based metaheuristics aimed to solve hard optimization problems. These techniques are explicitly concerned with exploiting available knowledge in order to achieve the most effective resolution of the target problem. The rationale behind this optimization philosophy, namely the intrinsic theoretical limitations of problem-unaware optimization techniques, is presented in this work. A glimpse of the main features of memetic algorithms, and a brief overview of the numerous applications of these techniques is provided as well.

Słowa kluczowe

EN

evolutionary computation; memetic algorithms; optimization

• Wydawca: Wydawnictwo Uniwersytetu Jagiellońskiego
• Czasopismo: Schedae Informaticae
• Rocznik: 2006
• Tom: Vol. 15
• Strony: 127--150
• Opis fizyczny: Bibliogr. 115 poz., rys.

Twórcy

autor

Cotta C.

• Universidad de Malaga, Dept. Lenguajes y Ciencias de la Computacion ETSI Informatica, Campus de Teatinos, Malaga,

Bibliografia

• [1] Aggarwal C.C., Orlin J.B., Tai R.P.; Optimized crossover for the independent set problem, Operations Research, 45(2), 1997, pp. 226-234.
• [2] Aldous D. and Vazirani U.; "Go with the winners" algorithms, in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, IEEE,Los Alamitos, CA, 1994, pp. 492-501.
• [3] Bambha N.K., Bhattacharyya S.S., Teich J., Zitzler E.; Systematic integration of parameterized local search into evolutionary algorithms, IEEE Transactions on Evolutionary Computation, 8(2), 2004, pp. 137-155.
• [4] Beasley J., Chu P.C.; A genetic algorithm for the set covering problem, European Journal of Operational Research, 94(2), 1996, pp. 393-404.
• [5] Beasley J., Chu P.C.; A genetic algorithm for the multidimensional knapsack problem, Journal of Heuristics, 4, 1998, pp. 63-86.
• [6] Berretta R., Cotta C., Moscato P.; Enhancing the performance of memetic algorithms by using a matching-based recombination algorithm: Results on the number partitioning problem, in: M. Resende, J. Pinho de Sousa, (eds.), Meta-heuristics: Computer-Decision Making, Kluwer Academic Publishers, Boston,MA, 2003, pp. 65-90.
• [7] Berretta R., Moscato P.; The number partitioning problem: An open challenge for evolutionary computation?, in: D. Corne, M. Dorigo, F. Glover, (eds.),New Ideas in Optimization, McGraw-Hill, Maidenhead, Berkshire, England,UK, 1999, pp. 261-278.
• [8] Brown D., Huntley C., Spillane A.; A Parallel Genetic Heuristic for the Quadratic Assignment Problem, in: J. Schaffer, (ed.), Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, 1989,pp. 406-415.
• [9] Bui T.N., Moon B.R.; Genetic algorithm and graph partitioning, IEEE Transactions on Computers, 45(7), 1996, pp. 841-855.
• [10] Bui T.N., Moon B.R.; GRCA: A hybrid genetic algorithm for circuit ratio-cut partitioning, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 17(3), 1998, pp. 193-204.
• [11] Buriol L., Resende M.G.C., Ribeiro C.C., Thorup M.; A memetic algorithm for OSPF routing, in: Sixth INFORMS Telecommunications Conference, March 10-13, 2002 Hilton Deerfield Beach, Boca Raton, Florida, 2002,pp. 187-188.
• [12] Burke E.K., Newall J.P., Weare R.F.; Initialisation strategies and diversity in evolutionary timetabling, Evolutionary Computation, 6(1), 1998, pp. 81-103.
• [13] Burke E.K., Smith A.J.; A memetic algorithm for the maintenance scheduling problem, in: Proceedings of the ICONIP/ANZIIS/ANNES '97 Conference,Springer-Verlag, Dunedin, New Zealand, 1997, pp. 469-472.
• [14] Cadieux S., Tanizaki N., Okamura T.; Time efficient and robust 3-D brain im-age centering and realignment using hybrid genetic algorithm, in: Proceedings of the 36th SICE Annual Conference, IEEE, 1997, pp. 1279-1284.
• [15] Carrizo J., Tinetti F.G., Moscato P.; A computational ecology for the quadratic assignment problem, in: Proceedings of the 21st Meeting on Informatics and Operations Research, SADIO, Buenos Aires, Argentina, 1992.
• [16] Cavalieri S., Gaiardelli P.; Hybrid genetic algorithms for a multiple-objective scheduling problem, Journal of Intelligent Manufacturing, 9(4), 1998, pp. 361-367.
• [17] Cheng R., Gen M., Tsujimura Y.; A tutorial survey of job-shop scheduling problems using genetic algorithms. II. Hybrid genetic search strategies, Computers& Industrial Engineering, 37(1-2), 1999, pp. 51-55.
• [18] Chu P.C., Beasley J.; A genetic algorithm for the generalized assignment problem, Computers & Operations Research, 24, 1997, pp. 17-23.
• [19] Coello C.A., van Veldhuizen D.A., Lamont G.B.; Evolutionary Algorithms for Solving Multi-Objective Problems, Genetic Algorithms and Evolutionary Computation, No. 5, Kluwer Academic Publishers, 2002.
• [20] Coll P.E., Dur´an G.A., Moscato P.; On worst-case and comparative analysis as design principles for efficient recombination operators: A graph coloring case study, in: D. Corne, M. Dorigo, F. Glover, (eds.), New Ideas in Optimization, McGraw-Hill, Maidenhead, Berkshire, England, UK, 1999, pp. 279-294.
• [21] Costa D.; An evolutionary tabu search algorithm and the NHL scheduling Problem, INFOR, 33(3), 1995, pp. 161-178.
• [22] Costa D., Dubuis N., Hertz A.; Embedding of a sequential procedure within an evolutionary algorithm for coloring problems in graphs, Journal of Heuristics,1(1), 1995, pp. 105-128.
• [23] Cotta C.; Protein structure prediction using evolutionary algorithms hy-bridized with backtracking, in: J. Mira, J.R. ´ Alvarez, (eds.), Artificial Neural Nets Problem Solving Methods, Lecture Notes in Computer Science, Vol. 2687,Springer-Verlag, Berlin-Heidelberg, 2003, pp. 321-328.
• [24] Cotta C.; Scatter search and memetic approaches to the error correcting code problem, in: J. Gottlieb, G. Raidl, (eds.), Evolutionary Computation in Combinatorial Optimization - EvoCOP 2004, Lecture Notes in Computer Science, Coimbra, Portugal, 5-7 April 2004, Vol. 3004, Springer-Verlag, pp. 51-60.
• [25] Cotta C., Aldana J.F., Nebro A.J., Troya J.M.; Hybridizing genetic algorithms with branch and bound techniques for the resolution of the tsp, in: D.W. Pearson, N.C. Steele, R.F. Albrecht, (eds.), Artificial Neural Nets and Genetic Algorithms 2, Springer-Verlag, Wien-New York 1995, pp. 277-280.
• [26] Cotta C., Moscato P.; Evolutionary computation: Challenges and duties, in:. Menon, (ed.), Frontiers of Evolutionary Computation, Kluwer Academic Publishers, Boston MA, 2004, pp. 53-72.
• [27] Cotta C., Troya J.M.; Genetic forma recombination in permutation flowshop problems, Evolutionary Computation, 6(1), 1998, pp. 25-44.
• [28] Cotta C., Troya J.M.; A hybrid genetic algorithm for the 0-1 multiple knapsack problem, in: G.D. Smith, N.C. Steele, R.F. Albrecht, (eds.), Artificial Neural Nets and Genetic Algorithms 3, Springer-Verlag, Wien-New York 1998, pp.251-255.
• [29] Cotta C., Troya J.M.; A comparison of several evolutionary heuristics for the frequency assignment problem, in: J. Mira, A. Prieto, (eds.), Connectionist Models of Neurons, Learning Processes, Artificial Intelligence, Lecture Notes in Computer Science, Vol. 2084, Springer-Verlag, Berlin-Heidelberg 2001, pp.709-716.
• [30] Cotta C., Troya J.M.; Embedding branch and bound within evolutionary algorithms, Applied Intelligence, 18(2), 2003, pp. 137-153.
• [31] Cotta C., Troya J.M.; Information processing in transmitting recombination, Aplied Mathematics Letters, 16(6), 2003, pp. 945-948.
• [32] Culberson J.; On the futility of blind search: An algorithmic view of "no free lunch", Evolutionary Computation, 6(2), 1998, pp. 109-128.
• [33] Dawkins R.; The Selfish Gene, Clarendon Press, Oxford 1976.
• [34] de Causmaecker P., van den Berghe G., Burke E.K.; Using tabu search as a local heuristic in a memetic algorithm for the nurse rostering problem, in: Proceedings of the Thirteenth Conference on Quantitative Methods for Decision Making, abstract only, poster presentation, Brussels, Belgium, 1999.
• [35] Dellaert N., Jeunet J.; Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm, International Journal of Production Research, 38(5), 2000, pp. 1083-1099.
• [36] Dorne R., Hao J.K.; A new genetic local search algorithm for graph coloring, in A.E. Eiben, Th. B¨ack, M. Schoenauer, H.-P. Schwefel, (eds.), Parallel Problem Solving From Nature V, Lecture Notes in Computer Science, Vol. 1498, Springer-Verlag, Berlin 1998, pp. 745-754.
• [37] Downey R., Fellows M.; Parameterized Complexity, Springer-Verlag, 1998.
• [38] Downey R.G., Fellows M.R.; Fixed-parameter tractability and completeness I:Basic results, SIAM Journal on Computing, 24(4), 1995, pp. 873-921.
• [39] Droste S., Jansen T., Wegener I.; Optimization with randomized search heuristics: the (A)NFL theorem, realistic scenarios, difficult functions, Theoretical Computer Science, 287(1), 2002, pp. 131-144.
• [40] Ducek G., Scheuer T.; Threshold accepting: a general purpose optimization algorithm, Journal of Computational Physics, 90, 1990, pp. 161-175.
• [41] Eiben A.E., Raue P.-E., Ruttkay Zs.; Genetic algorithms with multi-parent recombination, in: Y. Davidor, H.-P. Schwefel, R. M¨anner, (eds.), Parallel Problem Solving From Nature III, Lecture Notes in Computer Science, Vol. 866, Springer-Verlag, 1994, pp. 78-87.
• [42] Fleurent C., Ferland J.A.; Genetic and hybrid algorithms for graph coloring, Annals of Operations Research, 63, 1997, pp. 437-461.
• [43] Fogel L.J., Owens A.J., Walsh M.J.; Artificial Intelligence Through Simulated Evolution, Wiley, New York 1966.
• [44] Garcia B.L., Mahey P., LeBlanc L.J.; Iterative improvement methods for a multiperiod network design problem, European Journal of Operational Research, 110(1), 1998, pp. 150-165.
• [45] Garey M.R., Johnson D.S.; Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman and Co., San Francisco, CA, 1979.
• [46] Glover F.; Scatter search and path relinking, in: D. Corne, M. Dorigo, F.Glover, (eds.), New Methods in Optimization, McGraw-Hill, London 1999, pp. 291-316.
• [47] Glover F., Laguna M.; Tabu Search, Kluwer Academic Publishers, Norwell,Massachusetts, USA, 1997.
• [48] Goldberg D.E.; Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
• [49] Gorges-Schleuter M.; ASPARAGOS: An asynchronous parallel genetic optimization strategy., in: J.D. Schaffer, (ed.), Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, 1989, pp. 422-427.
• [50] Gorges-SchleuterM.; Asparagos96 and the traveling salesman problem, in: Th.B¨ack, Z. Michalewicz, X. Yao, (eds.), Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, Indianapolis, USA, IEEE Press, Piscataway, NJ, USA, 1997, pp. 171-174.
• [51] Gottlieb J.; Permutation-based evolutionary algorithms for multidimensional knapsack problems, in: J. Carroll, E. Damiani, H. Haddad, D. Oppenheim,(eds.), ACM Symposium on Applied Computing 2000, ACM Press, 2000, pp.408-414.
• [52] Haas O.C.L., Burnham K.J., Mills J.A.; Optimization of beam orientation in radiotherapy using planar geometry, Physics in Medicine and Biology, 43(8), 1998, pp. 2179-2193.
• [53] Haas O.C.L., Burnham K.J., Mills J.A., Reeves C.R., Fisher M.H.; Hybrid genetic algorithms applied to beam orientation in radiotherapy, in: Fourth European Congress on Intelligent Techniques and Soft Computing Proceedings,Vol. 3, Verlag Mainz, Aachen, Germany, 1996, pp. 2050-2055.
• [54] Hart W.E., Belew R.K.; Optimizing an arbitrary function is hard for the genetic algorithm, in: R.K. Belew, L.B. Booker, (eds.), Proceedings of the 4th International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 1991, pp. 190-195.
• [55] Hifi M.; A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems, Journal of the Operational Research Society, 48(6), 1997, pp. 612-622.
• [56] Holstein D., Moscato P.; Memetic algorithms using guided local search: A case study, in: D. Corne, M. Dorigo, F. Glover, (eds.), New Ideas in Optimization,McGraw-Hill, Maidenhead, Berkshire, England, UK, 1999, pp. 235-244.
• [57] Ibaraki T.; Combination with dynamic programming, in: T. B¨ack D., Fogel, Z. Michalewicz, (eds.), Handbook of Evolutionary Computation, pages D3.4, Oxford University Press, New York, NY, 1997, pp. 1-2.
• [58] Ishibuchi H., Murata T.; Multi-objective genetic local search algorithm, in:Proceedings of the 1996 International Conference on Evolutionary Computation, IEEE Press, 1996, pp. 119-124.
• [59] Jaszkiewicz A.; Do multiple-objective metaheuristics deliver on their promises? a computational experiment on the set-covering problem, IEEE Transactions on Evolutionary Computation, 7(2), 2003, pp. 502-515.
• [60] Jones T.C.; Evolutionary Algorithms, Fitness Landscapes and Search, PhD thesis, University of New Mexico, 1995.
• [61] Kassotakis I.E., Markaki M.E., Vasilakos A.V.; A hybrid genetic approach for channel reuse in multiple access telecommunication networks, IEEE Journal on Selected Areas in Communications, 18(2), 2000, pp. 234-243.
• [62] Katayama K., Hirabayashi H., Narihisa H.; Performance analysis for crossover operators of genetic algorithm, Transactions of the Institute of Electronics, Information and Communication Engineers, J81D-I(6), 1998, pp.639-650.
• [63] Kersting S., Raidl G.R., Ljubi´c I.; A memetic algorithm for vertex-biconnectivity augmentation, in: S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf,G. Raidl, (eds.), Applications of Evolutionary Computing, Proceedings of EvoWorkshops2002: EvoCOP, EvoIASP, EvoSTim, Kinsale, Ireland, 3-4 146 April 2002, Lecture Notes in Computer Science, Vol. 2279, Springer-Verlag, 2002, pp. 101-110.
• [64] Kirkpatrick S., Gelatt Jr. C.D., Vecchi M.P.; Optimization by simulated an-nealing, Science, 2202(4598), 1983, pp. 671-680.
• [65] Knowles J., Corne D.W.; M-PAES: a memetic algorithm for multiobjective optimization, in: Proceedings of the 2000 Congress on Evolutionary Computation, IEEE Press, Piscataway, NJ, 2000, pp. 325-332.
• [66] Krasnogor N.; Coevolution of genes and memes in memetic algorithms, in:Una-May O'Reilly, (ed.), Graduate Student Workshop, Orlando, Florida, USA, July 13, 1999, p. 371.
• [67] Krasnogor N., Smith J.; A memetic algorithm with self-adaptive local search:TSP as a case study, in: D. Whitley et al., (eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), Las Vegas, Nevada, USA, July 10-12, 2000, Morgan Kaufmann, 2000, pp. 987-994.
• [68] Krishna K., Ramakrishnan K.R., Thathachar M.A.L.; Vector quantization using genetic k-means algorithm for image compression, in: 1997 International Conference on Information, Communications and Signal Processing, IEEE, Vol. 3, New York, NY, 1997, pp. 1585-1587.
• [69] Laguna M., Mart´ı R.; Scatter Search. Methodology and Implementations in C,Kluwer Academic Publishers, Boston, MA, 2003.
• [70] Levine D.; A parallel genetic algorithm for the set partitioning problem, in:I.H. Osman, J.P. Kelly, (eds.), Meta-Heuristics: Theory & Applications,Kluwer Academic Publishers, Boston, MA, USA, 1996, pp. 23-35.
• [71] Li F., Morgan R., Williams D.; Economic environmental dispatch made easy with hybrid genetic algorithms, in: Proceedings of the International Conference on Electrical Engineering, Vol. 2, Int. Acad. Publishers, Beijing, China, 1996, pp. 965-969.
• [72] Li S.Z.; Toward global solution to map image estimation: Using common structure of local solutions, in: Energy Minimization Methods in Computer Vision and Pattern Recognition, Lecture Notes in Computer Science, Vol. 1223, Springer-Verlag, Berlin-Heidelberg 1997, pp. 361-374.
• [73] Liaw C.F.; A hybrid genetic algorithm for the open shop scheduling problem, European Journal of Operational Research, 124(1), 2000, pp. 28-42.
• [74] Lozano M., Herrera F., Krasnogor N., Molina D.; Real-coded memetic algorithms with crossover hill-climbing, Evolutionary Computation, 12(2), 2004,pp. 273-302.
• [75] Mathias K.E., Whitley L.D.; Noisy function evaluation and the delta coding algorithm, in: Proceedings of the SPIE-The International Society for Optical Engineering, 1994, pp. 53-64.
• [76] Merz P.; A comparison of memetic recombination operators for the traveling salesman problem, in: W.B. Langdon et al., (eds.), GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, July 9-13, 2002, Morgan Kaufmann Publishers, 2002, pp. 472-479.
• [77] Merz P., Freisleben B.; Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem, in: A.-E. Eiben, T. B¨ack, M. Schoenauer, H.-P. Schwefel, (eds.), Proceedings of the 5th International Conference on Parallel Problem Solving from Nature - PPSN V, Lecture Notes in Computer Science, Vol. 1498, Springer, Berlin, Germany, 1998, pp. 765-774.
• [78] Merz P., Freisleben B.; A Comparison of Memetic Algorithms, Tabu Search, Ant Colonies for the Quadratic Assignment Problem, in: P. Angeline, (ed.), 1999 Congress on Evolutionary Computation (CEC'99), IEEE Press, Piscataway, NJ, USA, 1999, pp. 2063-2070.
• [79] Merz P., Freisleben .; Fitness Landscapes, Memetic Algorithms and Greedy Operators for Graph Bi-Partitioning, Evolutionary Computation, 8(1), 2000, pp. 61-91.
• [80] Merz P., Freisleben B.; Greedy and local search heuristics for the unconstrained binary quadratic programming problem, Journal of Heuristics, 8(2), 2002, pp.197-213.
• [81] Ming X.G., Mak K.L.; A hybrid hopfield network-genetic algorithm approach to optimal process plan selection, International Journal of Production Research, 38(8), 2000, pp. 1823-1839.
• [82] Monfroglio A.; Hybrid genetic algorithms for a rostering problem, Software -Practice and Experience, 26(7), 1996, pp. 851-862.
• [83] Moscato P.; On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms, Technical Report Caltech Concurrent Computation Program, Report. 826, California Institute of Technology, Pasadena, California, USA, 1989.
• [84] Moscato P.; Memetic algorithms: A short introduction, in: D. Corne, M. Dorigo, F. Glover, (eds.), New Ideas in Optimization, McGraw-Hill, Maidenhead,Berkshire, England, UK, 1999, pp. 219-234.
• [85] Moscato P., Cotta C.; A gentle introduction to memetic algorithms, in: F.Glover, G. Kochenberger, (eds.), Handbook of Metaheuristics, Kluwer Academic Publishers, Boston, MA, 2003, pp. 105-144.
• [86] Moscato P., Mendes A., Cotta C.; Memetic algorithms, in: G.C. Onwubolu, B.V. Babu, (eds.), New Optimization Techniques in Engineering, Springer-Verlag, Berlin-Heidelberg 2004, pp. 53-85.
• [87] Moscato P., Norman M.G.; A Memetic Approach for the Traveling Salesman Problem Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems, in: M. Valero, E. Onate, M. Jane, J.L.148 Larriba, B. Suarez, (eds.), Parallel Computing and Transputer Applications, IOS Press, Amsterdam 1992, pp. 177-186.
• [88] Murata T., Ishibuchi H., Tanaka H.; Genetic algorithms for flowshop scheduling problems, Computers & Industrial Engineering, 30(4), 1996, pp. 1061-1071.
• [89] Musil M., Wilmut M.J., Chapman N.R.; A hybrid simplex genetic algorithm for estimating geoacoustic parameters using matched-field inversion, IEEE Journal of Oceanic Engineering, 24(3), 1999, pp. 358-369.
• [90] Nagata Y., Kobayashi Sh.; Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem, in: Th. B¨ack, (ed.), Proceedings of the Seventh International Conference on Genetic Algorithms, East Lansing, EUA, Morgan Kaufmann, San Mateo, CA, 1997, pp. 450-457.
• [91] Ong Y.S., Keane A.J.; Meta-lamarckian learning in memetic algorithms, IEEE Transactions on Evolutionary Computation, 8(2), 2004, pp. 99-110.
• [92] Ostermark R.; Solving irregular econometric and mathematical optimization problems with a genetic hybrid algorithm, Computational Economics, 13(2), 1999, pp. 103-115.
• [93] Paechter B., Rankin R.C., Cumming A.; Improving a lecture timetabling system for university wide use, in: E.K. Burke, M. Carter, (eds.), The Practice and Theory of Automated Timetabling II, Lecture Notes in Computer Science, Vol. 1408, Springer-Verlag, 1998, pp. 156-165.
• [94] Peinado M., Lengauer T.; Parallel "go with the winners algorithms" in the LogP Model, in: Proceedings of the 11th International Parallel Processing Symposium, IEEE Computer Society Press, Los Alamitos, California, 1997, pp. 656-664.
• [95] Puchinger J., Raidl G., Gruber M.; Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem, in: 2005 Meta-heuristics International Conference, University of Vienna, Vienna, Austria, 2005, pp. 775-780.
• [96] Radcliffe N.J.; The algebra of genetic algorithms, Annals of Mathematics and Artificial Intelligence, 10, 1994, pp. 339-384.
• [97] Radcliffe N.J., Surry P.D.; Fitness Variance of Formae and Performance Prediction, in: L.D. Whitley, M.D. Vose, (eds.), Proceedings of the 3rd Workshop on Foundations of Genetic Algorithms, Morgan Kaufmann, San Francisco 1994, pp. 51-72.
• [98] Raidl G.R., Julstron B.A.; A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem, in: J. Carroll, E. Damiani, H. Haddad, D. Oppenheim, (eds.), ACM Symposium on Applied Computing 2000, ACM Press, 2000, pp. 440-445.
• [99] Ramat E., Venturini G., Lente C., Slimane M.; Solving the multiple resource constrained project scheduling problem with a hybrid genetic algorithm, in: Th.B¨ack, (ed.), Proceedings of the Seventh International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 1997, pp. 489-496.
• [100] Ramsey C., Grefensttete J.J.; Case-based initialization of genetic algorithms,in: S. Forrest, (ed.), Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kauffman, San Mateo, CA, 1993, pp. 84-91.
• [101] Reeves C.; Hybrid genetic algorithms for bin-packing and related problems, Annals of Operations Research, 63, 1996, pp. 371-396.
• [102] Reich C.; Simulation of imprecise ordinary differential equations using evolutionary algorithms, in: J. Carroll, E. Damiani, H. Haddad, D. Oppenheim,(eds.), ACM Symposium on Applied Computing 2000, ACM Press, 2000, pp.428-432.
• [103] Rodrigues A.M., Ferreira J.S.; Solving the rural postman problem by memetic algorithms, in: J.P. de Sousa, (ed.), Proceedings of the 4th Metaheuristic International Conference (MIC'2001), Porto, Portugal, July 16-20, 2001, 2001,pp. 679-684.
• [104] Ruff C.F., Hughes S.W., Hawkes D.J.; Volume estimation from sparse planar images using deformable models, Image and Vision Computing, 17(8), 1999,pp. 559-565.
• [105] Runggeratigul S.; A memetic algorithm to communication network design taking into consideration an existing network, in: J.P. de Sousa, (ed.), Proceedings of the 4th Metaheuristic International Conference (MIC'2001), Porto,Portugal, July 16-20, 2001, 2001, pp. 91-96.
• [106] Sakamoto A., Liu X.Z., Shimamoto T.; A genetic approach for maximum independent set problems, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E80A(3), 1997, pp. 551-556.
• [107] Smith J.; Co-evolving memetic algorithms: A learning approach to robust scalable optimization, in: Proceedings of the 2003 Congress on Evolutionary Computation, IEEE Press, Canberra, Australia, 2003, pp. 498-505.
• [108] Surry P.D., Radcliffe N.J.; Inoculation to initialize evolutionary search, in:T.C. Fogarty, (ed.), Evolutionary Computing: AISB Workshop, Lecture Notes in Computer Science, Vol. 1143, Springer-Verlag, 1996, pp. 269-285.
• [109] Taguchi T., Yokota T., Gen M.; Reliability optimal design problem with interval coefficients using hybrid genetic algorithms, Computers & Industrial Engineering, 35(1-2), 1998, pp. 373-376.
• [110] Watson J.P., Rana S., Whitley L.D., Howe A.E.; The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling, Journal of Scheduling, 2(2), 1999, pp. 79-98.150
• [111] Wehrens R., Lucasius C., Buydens L., Kateman G.; HIPS, A hybrid self-adapting expert system for nuclear magnetic resonance spectrum interpretation using genetic algorithms, Analytica Chimica ACTA, 277(2), 1993, pp.313-324.
• [112] Wei P., Cheng L.X.; A hybrid genetic algorithm for function optimization,Journal of Software, 10(8), 1999, pp. 819-823.
• [113] Wei X., Kangling F.; A hybrid genetic algorithm for global solution of nondifferentiable nonlinear function, Control Theory & Applications, 17(2), 2000, pp. 180-183.
• [114] Wolpert D.H., MacreadyW.G.; No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, 1(1), 1997, pp. 67-82.
• [115] Yoneyama M., Komori H., Nakamura S.; Estimation of impulse response of vocal tract using hybrid genetic algorithm - a case of only glottal source, Journal of the Acoustical Society of Japan, 55(12), 1999, pp. 821-830.Received September 14, 2004