MastersWork.ReferencesToFind History
Hide minor edits - Show changes to output
Deleted lines 24-25:
Added lines 7-8:
* RefBelewBooker1991 - Belew, Richard K. and Booker, Lashon B. (eds) ''Proceedings of the Fourth International Conference on Genetic Algorithms'', University of California, San Diego, 13-16 July 1991, Morgan Kaufmann, San Mateo, CA.
Added lines 65-66:
* RefRadcliffe1991 - Radcliffe, Nicholas J. (1991). Forma Analysis and random respectful recombination, in Belew and Booker (1991), pp. 222-229 %red%([[#fn5 5]])
Added line 92:
# [[#fn5]]On representation design principles
Deleted lines 28-29:
Changed line 23 from:
* RefFalkenauer1998 - Falkenauer E. ''Genetic Algorithms for grouping problems'', New York: Wiley, 1998. %red&(Describes representations, prob worth getting)
to:
* RefFalkenauer1998 - Falkenauer E. ''Genetic Algorithms for grouping problems'', New York: Wiley, 1998. %red%(Describes representations, prob worth getting)
Changed line 33 from:
* RefGoldberg1989 - Goldberg, D.E., ''Genetic Algorithms in Search, Optimization and Machine Learning'', Addison-Wesley, Reading, MA, 1989.
to:
* RefGoldberg1989 - Goldberg, D.E., ''Genetic Algorithms in Search, Optimization and Machine Learning'', Addison-Wesley, Reading, MA, 1989. %green%Schemata theory
Added lines 23-24:
* RefFalkenauer1998 - Falkenauer E. ''Genetic Algorithms for grouping problems'', New York: Wiley, 1998. %red&(Describes representations, prob worth getting)
Changed lines 84-87 from:
to:
# [[#fn1]]GA performance improved with {{Gray code}}
# [[#fn2]]{{Gray code}} found to not be helpful
# [[#fn3]]Arguments that {{Gray code}} is better
# [[#fn4]]On representation optimisation
# [[#fn2]]{{Gray code}} found to not be helpful
# [[#fn3]]Arguments that {{Gray code}} is better
# [[#fn4]]On representation optimisation
Added lines 82-87:
----
!!!Notes:
* [[#fn1]]GA performance improved with {{Gray code}}
* [[#fn2]]{{Gray code}} found to not be helpful
* [[#fn3]]Arguments that {{Gray code}} is better
* [[#fn4]]On representation optimisation
!!!Notes:
* [[#fn1]]GA performance improved with {{Gray code}}
* [[#fn2]]{{Gray code}} found to not be helpful
* [[#fn3]]Arguments that {{Gray code}} is better
* [[#fn4]]On representation optimisation
Added lines 9-12:
* RefCaruanaSchaffer1988 - R.A. Caruana, J.D. Schaffer, Representation and hidden bias: Gray vs. binary coding for genetic algorithms, in: Proceedings of 5th International Conference on Machine Learning, Morgan Kaufmann, Los Altos, CA, 1988, pp. 153?161 %red%([[#fn1 1]])
* RefChakrabortyDastidar1991 - U.K. Chakraborty, D.G. Dastidar, Chromosomal encoding in genetic adaptive search, in: Proceedings of International Conference on Signals, Data and Systems, AMSE, vol. 2, 1991, pp. 191?195 %red%([[#fn1 1]])
* RefChakrabortyDastidar1991 - U.K. Chakraborty, D.G. Dastidar, Chromosomal encoding in genetic adaptive search, in: Proceedings of International Conference on Signals, Data and Systems, AMSE, vol. 2, 1991, pp. 191?195 %red%([[#fn1 1]])
Added lines 21-22:
* RefEshelman1991 - L.J. Eshelman, The CHC adaptive search algorithm, Foundations of Genetic Algorithms??I., Morgan Kaufmann (1991).%red%([[#fn1 1]])
Added lines 27-28:
* RefGilbert1958 - E.N. Gilbert, Gray Codes and Paths on the n-Cube. Bell System Technical Journal 37 (1958), pp. 815?826. %green%On Gray codes
Changed lines 39-43 from:
* RefHollstein1971 - Hollstein, R. B., (1971). ''Artificial Genetic adaption in computer control systems.'' Doctoral Dissertation, University of Michigan, Ann.
to:
* RefHauptHaupt1998 - R.L. Haupt and S.E. Haupt, Practical Genetic Algorithms. , Wiley, New York (1998). %red%([[#fn2 2]])
* RefHollstein1971 - Hollstein, R. B., (1971). ''Artificial Genetic adaption in computer control systems.'' Doctoral Dissertation, University of Michigan, Ann. %red%([[#fn1 1]])
* RefHornGoldberg1994 - J. Horn, D.E. Goldberg, Genetic algorithm difficulty and the modality of fitness landscapes, FOGA-3, 1994, pp. 243?269
* RefHollstein1971 - Hollstein, R. B., (1971). ''Artificial Genetic adaption in computer control systems.'' Doctoral Dissertation, University of Michigan, Ann. %red%([[#fn1 1]])
* RefHornGoldberg1994 - J. Horn, D.E. Goldberg, Genetic algorithm difficulty and the modality of fitness landscapes, FOGA-3, 1994, pp. 243?269
Added lines 63-66:
* RefRanaWhitley1997 - S.B. Rana, L.D. Whitley, Bit representations with a twist, in: Proceedings of 7th ICGA, 1997, pp. 188?195 %red%([[#fn3 3]])
* RefSchaffer1989 - J.D. Schaffer et al., A study of control parameters affecting online performance of genetic algorithms for function optimization, in: Proceedings of 3rd ICGA, Morgan Kaufmann, 1989 %red%([[#fn1 1]])
* RefSchaffer1989 - J.D. Schaffer et al., A study of control parameters affecting online performance of genetic algorithms for function optimization, in: Proceedings of 3rd ICGA, Morgan Kaufmann, 1989 %red%([[#fn1 1]])
Added lines 77-80:
* RefWhitley1999 - D. Whitley, A free lunch proof for Gray versus binary encodings, in: Proceedings of Genetic and Evolutionary Computation (GECCO-1999), 1999, pp. 726?733 %red%([[#fn3 3]])
* RefWolpertMacReady1997 - D.H. Wolpert and W.G. MacReady, No free lunch theorems for optimization. ''IEEE Transactions on Evolutionary Computation'' '''1''' 1 (1997), pp. 67?82. %red%([[#fn4 4]]) %green%Prob. quite relevant.
* RefWolpertMacReady1997 - D.H. Wolpert and W.G. MacReady, No free lunch theorems for optimization. ''IEEE Transactions on Evolutionary Computation'' '''1''' 1 (1997), pp. 67?82. %red%([[#fn4 4]]) %green%Prob. quite relevant.
Added lines 17-20:
* RefFreitas2002a - Freitas AA. A survey of evolutionary algorithms for data mining and knowledge discovery. In: Ghosh A, Tsutsui S, editors. Advances in evolutionary computation. Berlin: Springer-Verlag; 2002. p. 819?45.
* RefFreitas2002b - Freitas AA. Data mining and knowledge discovery with evolutionary algorithms. Berlin: Springer-Verlag; 2002.
* RefFreitas2002b - Freitas AA. Data mining and knowledge discovery with evolutionary algorithms. Berlin: Springer-Verlag; 2002.
Added lines 29-30:
* RefGreenSmith1993 - D.P. Greene and S.F. Smith, Competition-based induction of decision models from examples. Machine Learn. 13 (1993), pp. 229?257.
Added lines 35-36:
* RefKoza1992 - Koza JR. Genetic programming: on the programming of computers by means of natural selection. Cambridge: MIT Press; 1992.
Added lines 39-42:
* RefMichalewicz1992 - Michalewicz, Z., ''Genetic Algorithms + Data Structures = Evolution Programs'', Springer-Verlag, New York, NY, pp.3337-347
* RefMontana1995 - D.J. Montana, Strongly typed genetic programming. Evol. Comput. 3 (1995), pp. 199?230.
* RefMontana1995 - D.J. Montana, Strongly typed genetic programming. Evol. Comput. 3 (1995), pp. 199?230.
Deleted lines 44-45:
Added lines 13-14:
* RefDavis1985 - Davis, L., 1985. Job shop scheduling with genetic algorithms. In: Proceedings of the 1st International Conference on Genetic Algorithms ICGA-85. pp. 136?140.
Added lines 23-24:
* RefGoldbergLingle1985 - Goldberg, D.E., Lingle Jr., R., 1985. Alleles, loci, and the traveling salesman problem. In: Proceedings of the 1st International Conference on Genetic Algorithms ICGA-85. pp. 154?159.
Added lines 37-38:
* RefOliverEtAl1987 - Oliver, I.M., Smith, D.J., Holland, J.R.C., 1987. A study on permutation crossover operators on the traveling salesman problem. In: Proceedings of the 2nd International Conference on Genetic Algorithms ICGA-8. pp. 224?230.
Added lines 45-46:
* RefVanBatenburgEtAl1995 - F.H.D. Van Batenburg, A.P. Gultyaev and C.W.A. Pleij, An APL-programmed genetic algorithm for the prediction of RNA secondary structure. J. Theor. Biol. 174 3 (1995), pp. 269?280.
Deleted line 1:
Deleted lines 6-7:
Added lines 10-11:
* RefBookerEtAl1989 - Booker, L.B., Goldberg, D.E. and Holland, J.H., (1989) Classifier systems and genetic algorithms. ''Artificial Intelligence, 40'', pp235-282
Added lines 26-27:
* RefManEtAl1996 - Man, K.F., Tang, K.S. and Kwong, S. (1996), "Genetic algorithms: concepts and applications", ''IEEE Trans. on Industrial Electronics'', Vol. 43 No. 5, October, pp. 519-533.
Changed line 22 from:
* Hollstein, R. B., (1971). ''Artificial Genetic adaption in computer control systems.'' Doctoral Dissertation, University of Michigan, Ann.
to:
* RefHollstein1971 - Hollstein, R. B., (1971). ''Artificial Genetic adaption in computer control systems.'' Doctoral Dissertation, University of Michigan, Ann.
Deleted lines 25-26:
Added lines 2-3:
* RefAltenberg1994 - Altenberg, L. (1994) The evolution of Evolvability in genetic programming, in ''Advances in Genetic Programming'', K.E. Kinnear Jr. (Ed.), pp. 47-74, Cambridge, MA: MIT Press.
Added lines 8-13:
* RefBierwirth1995 - Bierwirth, C., A generalized permutation approach to job-shop scheduling with genetic algorithms. ''OR SPEKTRUM'', Vol. 17, No. 2-3, pp. 87-92, 1995
* RefChengGen1996 - Cheng, R., and Gen, M., A tutorial survey of job-shop scheduling problems using genetic algorithms - I. ''Representation, Computers ind. Engng.'', Vol. 30, No. 4, pp. 983-997, 1996
* RefConrad1990 - Conrad, M. (1990) The geometry of evolution. ''BioSystems 24'', 61-81.
* RefChengGen1996 - Cheng, R., and Gen, M., A tutorial survey of job-shop scheduling problems using genetic algorithms - I. ''Representation, Computers ind. Engng.'', Vol. 30, No. 4, pp. 983-997, 1996
* RefConrad1990 - Conrad, M. (1990) The geometry of evolution. ''BioSystems 24'', 61-81.
Added lines 22-24:
* Hollstein, R. B., (1971). ''Artificial Genetic adaption in computer control systems.'' Doctoral Dissertation, University of Michigan, Ann.
* RefJonesBeltramo1991 - Jones, D.R. and Beltramo, M.A., "Solving partitioning problems with genetic algorithms", in Below, R.K. and Booker, L.B. (Eds), ''Proceedings of the Fourth International Conference on Genetic Algorithms'', Morgan Kaufmann, San Mateo, CA, 1991, pp 442-9
* RefJonesBeltramo1991 - Jones, D.R. and Beltramo, M.A., "Solving partitioning problems with genetic algorithms", in Below, R.K. and Booker, L.B. (Eds), ''Proceedings of the Fourth International Conference on Genetic Algorithms'', Morgan Kaufmann, San Mateo, CA, 1991, pp 442-9
Added line 26:
* RefKargupta - Kargupta, H., (1996). The Gene Expression Messy Genetic Algorithm. In ''Proceedings of the International Conference on Evolutionary Computation'', 814-819
Changed line 28 from:
* RefJonesBeltramo1991 - Jones, D.R. and Beltramo, M.A., "Solving partitioning problems with genetic algorithms", in Below, R.K. and Booker, L.B. (Eds), ''Proceedings of the Fourth International Conference on Genetic Algorithms'', Morgan Kaufmann, San Mateo, CA, 1991, pp 442-9
to:
* RefNewmanEngelhardt1998 - Newman, M.E.J & R. Engelhardt, (1998). Effects of Neutral Selection on the Evolution of Molecular Species. In ''Proceedings of R. Soc. of London B.'', 265, 1333-1338
Added lines 32-35:
* RefNormanBean1997 - Norman, B., and Bean, J., Random keys gentic algorithm for job-shop scheduling, ''Engineering Design & Automation'' Vol. 3, No. 2, pp. 145-156, 1997
* RefONeillRyan2000 - O'Neill M., & C. Ryan (2000). Incorporating Gene Expression Models into Evolutionary Algorithms. In ''Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program'' 167-172.
* RefONeillRyan2000 - O'Neill M., & C. Ryan (2000). Incorporating Gene Expression Models into Evolutionary Algorithms. In ''Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop Program'' 167-172.
Added lines 40-41:
* RefWagnerAltenberg1996 - Wagner, G.P. & Altenberg, L. (1996). Complex Adaption and Evolution of Evolvability. ''Evolution 50'', 967-976
Added lines 2-5:
* RefAngeline1995 - Angeline, P. J., (1995) Morphogenic Evolutionary Computations: Introduction, Issues and Examples. In ''The Fifth Annual Conference on Evolutionary Programming'', 387-401
* RefBartnett1998 - Bartnett, L., (1998). ''Tangled Webs: Evolutionary Dynamics on Fitness Landscape with Neutrality''. Masters Dissertation, University of East Sussex, Brighton.
* RefBartnett1998 - Bartnett, L., (1998). ''Tangled Webs: Evolutionary Dynamics on Fitness Landscape with Neutrality''. Masters Dissertation, University of East Sussex, Brighton.
Added lines 12-15:
* RefGoldbergEtAl1993 - Goldberg, D. E., Deb, K., & Thierens, D. (1993). Toward a better understanding of mixing in genetic algorithms. ''Journal of the Society of Instrument and COntrol Engineers'', 32(1), 10-16.
Added line 3:
Added line 5:
Added line 7:
Added lines 9-11:
* RefMichalewicz1992 - Michalewicz, Z., ''Genetic Algorithms + Data Structures = Evolution Programs'', Springer-Verlag, New York, NY, pp.3337-347
Added line 13:
Added line 15:
Added line 17:
Changed line 2 from:
* RefDavis1991 - Davis, L. (1991), ''Handbook of Genetic Algorithms'', Von Nostrand Reinhold
to:
* RefDavis1991 - Davis, L. (1991), ''Handbook of Genetic Algorithms'', Von Nostrand Reinhold, New York, NY
Added line 7:
* RefStarkweatherEtAl1991 - Starkweather, T., McDaniel, S., Mathias, K., Whitley, D. and Whitley, C., "A comparison of genetic sequencing operators", in Below, R.K. and Booker, L.B. (Eds), ''Proceedings of the Fourth International Conference on Genetic Algorithms'', Morgan Kaufmann, San Mateo, CA, 1991, pp 69-76.
Added line 4:
* RefGoldberg1989 - Goldberg, D.E., ''Genetic Algorithms in Search, Optimization and Machine Learning'', Addison-Wesley, Reading, MA, 1989.
Added line 4:
* RefJonesBeltramo1991 - Jones, D.R. and Beltramo, M.A., "Solving partitioning problems with genetic algorithms", in Below, R.K. and Booker, L.B. (Eds), ''Proceedings of the Fourth International Conference on Genetic Algorithms'', Morgan Kaufmann, San Mateo, CA, 1991, pp 442-9
Added line 6:
* RefXuEtAl2000 - Z.B. Xu, K.S. Leung and Y. Liang, "Fast-GEA: A Genetic Evolutionary Algorithm Based on Using Splicing/Decomposable Representation Scheme and Exclusion-based Operators", submitted to ''IEEE Trans. Evolutionary Computation'', 2000.
Added line 3:
* RefGoldbergEtAl1988 - Goldberg, D.E., Korb, B. and Deb, K (1988), "Messy genetic algorithms: Motivation, analysis, and first results", ''Complex System'', Vol. 3, pp. 493-530.
Added line 3:
* RefSchraudolphBelew1992 - Schraudolph, N.N. and Belew, R.K. (1992), "Dynamic Parameter Encoding for Genetic Algorithms", ''Machine Learning'', Vol. 9 No. 1, pp. 9-22
Added line 3:
* RefWhitleyEtAl1991 - Whitley, D., Mathias, K. and Fitzhorn, P. (1991), "Delta coding: an iterative search strategy for genetic algorithms", in Belew, R.K., Booker, L.B. (Eds), ''Proc. of the Fourth International Conference on Genetic Algorithms'', Morgan Kaufmann, San Mateo, CA pp. 77-84
Changed lines 1-4 from:
to:
A list of references that need to be found. once found, they will link to more info.
* RefDavis1991 - Davis, L. (1991), ''Handbook of Genetic Algorithms'', Von Nostrand Reinhold
-----
<|HomePage|>
* RefDavis1991 - Davis, L. (1991), ''Handbook of Genetic Algorithms'', Von Nostrand Reinhold
-----
<|HomePage|>
Page last modified on January 12, 2005, at 02:50 AM