A design framework for metaheuristics (original) (raw)

• Abbattista F, Dalbis D (1998) The scout algorithm to explore unknown spaces. In: IEEE international conference on evolutionary computation. IEEE Press, New York, pp 705–708
• Baluja S (1994) Population-based incremental learning. Technical Report CMU-CS-94-163, Carnegie Mellon University
• Baluja S, Caruna R (1995) Removing the genetics from the standard genetic algorithm. In: Twelfth international conference on machine learning. Morgan Kaufmann, Los Altos, pp 38–46
• Belton V, Stewart T (2002) Multiple criteria decision analysis. Kluwer Academic Publishers, Dordrecht
  Google Scholar
• Bentley PJ (eds) (1999) Evolutionary design by computers. Morgan Kaufmann, Los Altos
  MATH Google Scholar
• Bentley PJ, Corne DW (eds) (2002) Creative evolutionary systems. Morgan Kaufmann, Los Altos
  Google Scholar
• Biles JA (1998) Interactive GenJam: integrating real-time performance with a genetic algorithm. In: Proceedings of the 1998 international computer music conference
• Biles JA, Eign W (1995) GenJam Populi: training an IGA via audience-mediated performance. In: Proccedings of the 1995 international computer music conference
• Blum C (2005) Ant colony optimization: introduction and recent trends. Phys Life Rev 2: 353–373
  Article Google Scholar
• Bonabeau E, Dorigo M, Theraulaz G (1999) Swarm intelligence. Oxford University Press, Oxford
  MATH Google Scholar
• Clarke EM Jr, Grumberg O, Peled DA (1999) Model checking. MIT Press, Cambridge
  Google Scholar
• De Bono E (1990) Lateral thinking. Penguin, Harmondsworth
  Google Scholar
• de Castro LN, Timmis J (2002) Artificial immune systems: a new computational intelligence approach. Springer, New York
  MATH Google Scholar
• De Jong K (1993) Genetic algorithms are NOT function optimizers. In: Whitley L (eds) Foundations of genetic algorithms, 2nd edn. Springer, New York, pp 5–17
  Google Scholar
• Derrick J, Boiten E (2001) Refinement in Z and Object-Z. Springer, New York
  MATH Google Scholar
• Dorigo M, Stützle T (2004) Ant colony optimization. MIT Press, Cambridge
  MATH Google Scholar
• Freuder E, Wallace R (1992) Partial constraint satisfaction. Artif Intell 58(1–3): 21–70
  Article MathSciNet Google Scholar
• Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13: 533–549
  Article MATH MathSciNet Google Scholar
• Glover F (1989) Tabu search—part I. ORSA J Comput 1(3): 190–206
  MATH Google Scholar
• Glover F (1990) Tabu search—part II. ORSA J Comput 2(1): 4–32
  MATH Google Scholar
• Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading
  MATH Google Scholar
• Goldberg DE (2002) The design of innovation. Kluwer, Dordrecht
  MATH Google Scholar
• Gong T, Tuson A (2006) Formal descriptions of real parameter optimisation. In: Proceedings of the 2006 IEEE congress on evolutionary computation. IEEE Press, pp 2119–2126
• Gong T, Tuson AL (2007) Enhanced forma analysis of permutation problems. In: Proceedings of the ninth annual genetic and evolutionary computation conference (GECCO), pp 923–930
• Gong T, Tuson AL (2008) Forma analysis of particle swarm optimisation for permutation problems. J Artif Evol Appl, Article ID 587309
• Harman M, Hu L, Hierons R, Baresel A, Sthamer H (2002) Improving evolutionary testing by flag removal. In: Langdon WB, Cantu-Paz E, Mathias K, Roy R, Davis D, Poli R, Balakrishnan K, Honavar V, Rudolph G, Wegener J, Bull L, Potter MA, Schultz AC, Miller JF, Burke E, Jonoska N (eds) Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann, Los Altos
  Google Scholar
• Harvey I (1997) Cognition is not computation: evolution is not optimisation. In: Gerstner W, Germond A, Hasler M, Nicoud JD (eds) Proceedings of the seventh international conference on artificial neural networks. Lecture Notes in Computer Science 1327. Springer, New York, pp 685–690
  Google Scholar
• Hillis WD (1990) Co-evolving parasites improve simulated evolution as an optimization procedure. Phys D 42: 228–234
  Article Google Scholar
• Huelsbergen L (2000) Abstract program evaluation and its application to sorter evolution. In: Proceedings of the 2000 congress on evolutionary computation. IEEE Press, pp 1407–1414
• Huth M, Ryan M (2000) Logic in computer Science: modelling and reasoning about systems. Cambridge University Press, Cambridge
  MATH Google Scholar
• Johnson CG (2001a) Finding qualitative examples with genetic algorithms. In: John R, Birkenhead R (eds) Developments in soft computing. Springer, New York, pp 92–99
  Google Scholar
• Johnson CG (2001b) Understanding complex systems through examples: a framework for qualitative example-finding. Syst Res Inf Syst 10: 239–267
  Google Scholar
• Johnson CG (2002a) Deriving genetic programming fitness properties by static analysis. In: Foster J, Lutton E, Ryan C, Tettamanzi A (eds) Proceedings of the 2002 European conference on genetic programming. Springer, New York, pp 298–307
  Google Scholar
• Johnson CG (2002b) What can automatic programming learn from theoretical computer science? In: Yao X, Shen Q, Bullinaria J (eds) Proceedings of the 2002 UK workshop on computational intelligence, pp 89–95
• Johnson CG (2003) A design framework for evolutionary algorithms. PhD thesis, University of Kent
• Johnson CG (2004) Genetic programming with guaranteed constraints. In: Lotfi A, Garibaldi JM (eds) Applications and science in soft computing. Springer, New York, pp 95–100
  Google Scholar
• Kennedy J, Eberhart RC, Shi Y (2002) Swarm intelligence. Morgan Kaufmann, Los Altos
  Google Scholar
• Laguna M, Glover F (1993) Integrating target analysis and tabu search for improved scheduling systems. Expert Syst Appl 6: 287–297
  Article Google Scholar
• Lin S, Kernighan B (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21: 498–516
  Article MATH MathSciNet Google Scholar
• Martin O, Otto S (1996) Combining simulated annealing with local search heuristics. Ann Oper Res 63: 57–75
  Article MATH Google Scholar
• May TD (2000) Music and computers: the design and implementation of a musical genetic algorithm. Master’s thesis, University of Kent
• Menczer F, Belew RK (1996) Latent energy environments. In: Belew RK, Mitchell M (eds) Adaptive individuals in evolving populations. Addison-Wesley, Santa Fe Institute Studies in the Sciences of Complexity, pp 191–208
  Google Scholar
• Menczer F, Willuhn W, Belew RK (1994) An endogenous fitness paradigm for adaptive information agents. In: Proceedings of the third international conference on information and knowledge management
• Mitchell M (1996) An introduction to genetic algorithms. Series in complex adaptive systems. Bradford Books/MIT Press, Cambridge
  Google Scholar
• Morgan C (1994) Programming from specifications, 2nd edn. Prentice Hall, Englewood Cliffs
  MATH Google Scholar
• Nielson F, Nielson HR, Hankin C (1999) Principles of program analysis. Springer, New York
  MATH Google Scholar
• Olsson B (1998) A host-parasite genetic algorithm for asymmetric tasks. In: Nédellec C, Rouveroi C (eds) Machine learning: ECML-98. Springer, New York
  Google Scholar
• Osman I (1996) Meta-heuristics. Kluwer Academic Publishers, Dordrecht
  MATH Google Scholar
• Papadimitriou CH, Steiglitz K (2000) Combinatorial optimization: algorithms and complexity. Dover Publications, New York
  Google Scholar
• Paredis J (1996) Coevolutionary computation. Artif Life 2(4): 355–375
  Article Google Scholar
• Partridge D (1992) Engineering artificial intelligence software. Intellect Books, Oxford
  Google Scholar
• Partridge D (1997) The case for inductive programming. IEEE Computer Society Press, Los Alamitos
  Google Scholar
• Partridge D, Galton A (1995) The specification of ‘specification’. Minds Mach 5(2): 243–255
  Article Google Scholar
• Partridge D, Yates W (1997) Data-defined problems and multiversion neural-net systems. J Intell Syst 7(1–2): 19–32
  Google Scholar
• Picard R (1997) Affective computing. MIT Press, Cambridge
  Google Scholar
• Polya G (1945) How to solve it: a new aspect of mathematical method. Princeton University Press, Princeton
  MATH Google Scholar
• Potter MA, De Jong KA (1994) A cooperative coevolutionary approach to function optimization. In: Parallel Problem Solving from Nature III, Springer, New York, pp 249–257
• Radcliffe NJ (1991) Equivalence class analysis of genetic algorithms. Complex Syst 5(2): 183–205
  MATH MathSciNet Google Scholar
• Radcliffe NJ (1994) The algebra of genetic algorithms. Ann Math Artif Intell 10: 339–384
  Article MATH MathSciNet Google Scholar
• Robillard D, Fonlupt C (2000) A shepherd and a sheepdog to guide evolutionary computation. In: Fonlupt C, Hao JK, Lutton E, Ronald E, Schoenhauer M (eds) Artificial evolution 1999. Lecture Notes in Computer Science 1829. Springer, New York, pp 277–291
  Google Scholar
• Rosin CD, Belew RK (1996) New methods for cooperative coevolution. Evol Comput 5: 1–30
  Article Google Scholar
• Rothlauf F (2002) Representations for genetic and evolutionary algorithms. Springer/Physica-Verlag, New York
  MATH Google Scholar
• Rowland D, Biocca F (2002) Cooperative design methodology: genetic sculpture park. Leonardo 35(2): 193–196
  Article Google Scholar
• Saaty TL (1980) The analytic hierarchy process. McGraw-Hill, New York
  MATH Google Scholar
• Tuson AL (1999) No optimisation without representation. PhD thesis, University of Edinburgh
• Venturini G, Slimane M, Morin F, Asselinde Beauville JP (1997) On using interactive genetic algorithms for knowledge discovery in databases. In: Bäck T (eds) Proceedings of the seventh international conference on genetic algorithms. Morgan Kaufmann, Los Altos, pp 696–703
  Google Scholar
• Williams HP (1999) Model building in mathematical programming, 4th edn. Wiley, New York
  Google Scholar
• Wilson R (1996) Introduction to graph theory, 4th edn. Addison-Wesley-Longman, Reading
  MATH Google Scholar
• Winston PH (1992) Artificial intelligence. Addison-Wesley, Reading
  Google Scholar