References

  1. Özgür Akgün, Saad Attieh, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon, Patrick Spracklen & James Wetter (2018): A Framework for Constraint Based Local Search using Essence. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18. International Joint Conferences on Artificial Intelligence Organization, pp. 1242–1248, doi:10.24963/ijcai.2018/173.
  2. Peter J. Angeline (1994): Genetic programming and emergent intelligence. In: Kenneth E. Kinnear, Jr.: Advances in Genetic Programming. MIT Press, Cambridge, MA, USA, pp. 75–97. Available at http://dl.acm.org/citation.cfm?id=185984.185992.
  3. Gustav Björdal, Jean-Noël Monette, Pierre Flener & Justin Pearson (2015): A constraint-based local search backend for MiniZinc. Constraints 20(3), pp. 325–345, doi:10.1007/s10601-015-9184-z.
  4. Samir A. Mohamed Elsayed & Laurent Michel (2011): Synthesis of Search Algorithms from High-Level CP Models. In: Jimmy Lee: Principles and Practice of Constraint Programming – CP 2011, Lecture Notes in Computer Science. Springer Berlin Heidelberg, pp. 256–270, doi:10.1007/978-3-642-23786-7_21.
  5. Thomas Elsken, Jan Hendrik Metzen & Frank Hutter (2019): Neural Architecture Search, pp. 63–77. Springer International Publishing, Cham, doi:10.1007/978-3-030-05318-5_3.
  6. D. Fagan, M. Fenton & M. O'Neill (2016): Exploring position independent initialisation in grammatical evolution. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 5060–5067, doi:10.1109/CEC.2016.7748331.
  7. Michael Fenton, James McDermott, David Fagan, Stefan Forstenlechner, Michael O'Neill & Erik Hemberg (2017): PonyGE2: Grammatical Evolution in Python. Proceedings of the Genetic and Evolutionary Computation Conference Companion on - GECCO '17, pp. 1194–1201, doi:10.1145/3067695.3082469. Available at http://arxiv.org/abs/1703.08535. ArXiv: 1703.08535.
  8. Jun He, Pierre Flener & Justin Pearson (2012): Solution Neighbourhoods for Constraint-directed Local Search. In: Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC '12. ACM, New York, NY, USA, pp. 74–79, doi:10.1145/2245276.2245294.
  9. Tiago Januario & Sebastián Urrutia (2016): A new neighborhood structure for round robin scheduling problems. Computers & Operations Research 70, pp. 127–139, doi:10.1016/j.cor.2015.12.016.
  10. David S. Johnson & Lyle A. McGeoch (1997): The traveling salesman problem: A case study in local optimization. In: E. H. L. Aarts & J. K. Lenstra: Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester, United Kingdom, pp. 215–310.
  11. A. Kaul, S. Maheshwary & V. Pudi (2017): AutoLearn — Automated Feature Generation and Selection. In: 2017 IEEE International Conference on Data Mining (ICDM), pp. 217–226, doi:10.1109/ICDM.2017.31.
  12. Michael Marte (2017): Yuck is a constraint-based local-search solver with FlatZinc interface. Available at https://github.com/informarte/yuck. Accessed 2019/05/13.
  13. Erik Meijer, Maarten Fokkinga & Ross Paterson (1991): Functional programming with bananas, lenses, envelopes and barbed wire. In: John Hughes: Functional Programming Languages and Computer Architecture. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 124–144, doi:10.1007/3540543961_7.
  14. Michael O’Neil & Conor Ryan (2003): Grammatical Evolution. In: Grammatical Evolution, Genetic Programming Series. Springer, Boston, MA, pp. 33–47, doi:10.1007/978-1-4615-0447-4_4.
  15. B. Shahriari, K. Swersky, Z. Wang, R. P. Adams & N. de Freitas (2016): Taking the Human Out of the Loop: A Review of Bayesian Optimization. Proceedings of the IEEE 104(1), pp. 148–175, doi:10.1109/JPROC.2015.2494218.
  16. Mateusz \'Slażyński, Salvador Abreu & Grzegorz J. Nalepa (2019): Towards a Formal Specification of Local Search Neighborhoods from a Constraint Satisfaction Problem Structure. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO '19. ACM, New York, NY, USA, pp. 137–138, doi:10.1145/3319619.3321968.
  17. Pascal Van Hentenryck & Laurent Michel (2005): Constraint-Based Local Search. The MIT Press.
  18. Pascal Van Hentenryck & Laurent Michel (2007): Synthesis of Constraint-based Local Search Algorithms from High-level Models. In: Proceedings of the 22Nd National Conference on Artificial Intelligence - Volume 1, AAAI'07. AAAI Press, Vancouver, British Columbia, Canada, pp. 273–278.
  19. Pascal Van Hentenryck & Yannis Vergados (2006): Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling. In: J. Christopher Beck & Barbara M. Smith: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science. Springer Berlin Heidelberg, pp. 228–243, doi:10.1007/11757375_19.
  20. Jan Wielemaker, Tom Schrijvers, Markus Triska & Torbjörn Lager (2012): SWI-Prolog. Theory and Practice of Logic Programming 12(1-2), pp. 67–96, doi:10.1017/S1471068407003237.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org