Skip to main content
Erschienen in: Natural Computing 2/2017

13.07.2016

Online control of enumeration strategies via bat algorithm and black hole optimization

verfasst von: Ricardo Soto, Broderick Crawford, Rodrigo Olivares, Stefanie Niklander, Franklin Johnson, Fernando Paredes, Eduardo Olguín

Erschienen in: Natural Computing | Ausgabe 2/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Constraint programming is an efficient and powerful paradigm for solving constraint satisfaction and optimization problems. Under this paradigm, problems are modeled as a sequence of variables and a set of constraints. The variables have a non-empty domain of candidate values and constraints restrict the values that variables can adopt. The solving process operates by assigning values to variables in order to produce potential solutions which are then evaluated. A main component in this process is the enumeration strategy, which decides the order in which variables and values are chosen to produce such potential solutions. There exist different ways to perform this selection, and depending on the quality of this decision, the efficiency of the solving process may dramatically vary. Unfortunately, selecting the proper strategy is known to be a hard task, as its behavior during search is generally unpredictable and certainly depends on the problem at hand. A recent trend to handle this concern, is to interleave a set of different strategies instead of using a single one during the whole process. The strategies are evaluated according to process indicators in order to use the most promising one on each part of the search process. This process is known as online control of enumeration strategies and its correct configuration can be seen itself as an optimization problem. In this paper, we present two new systems for online control of enumeration strategies based on recent nature-inspired metaheuristics: bat algorithm and black hole optimization. The bat algorithm mimics the location capabilities of bats that employ echoes to identify the objects in their surrounding areas, while black hole optimization inspires its behavior on the gravitational pull of black holes in space. We perform different experimental results by using different enumeration strategies and well-known benchmarks, where the proposed approaches are able to noticeably outperform previous work on online control.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Araya I, Soto R, Crawford B (2015) Adaptive filtering strategy for numerical constraint satisfaction problems. Expert Syst Appl 42(21):8086–8094CrossRef Araya I, Soto R, Crawford B (2015) Adaptive filtering strategy for numerical constraint satisfaction problems. Expert Syst Appl 42(21):8086–8094CrossRef
Zurück zum Zitat Baptiste P, Le Pape C (1997) Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. In: Proceedings of principles and practice of constraint programming (CP), volume 1330 of lecture notes in computer science. Springer, pp 375–389 Baptiste P, Le Pape C (1997) Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. In: Proceedings of principles and practice of constraint programming (CP), volume 1330 of lecture notes in computer science. Springer, pp 375–389
Zurück zum Zitat Barták R, Rudová H (2005) Limited assignments: a new cutoff strategy for incomplete depth-first search. In: Proceedings of the 20th ACM symposium on applied computing (SAC), pp 388–392 Barták R, Rudová H (2005) Limited assignments: a new cutoff strategy for incomplete depth-first search. In: Proceedings of the 20th ACM symposium on applied computing (SAC), pp 388–392
Zurück zum Zitat Boussemart F, Hemery F, Lecoutre C, Sais L (2004) Boosting systematic search by weighting constraints. In: Proceedings of the 16th Eureopean conference on artificial intelligence (ECAI). IOS Press, pp 146–150 Boussemart F, Hemery F, Lecoutre C, Sais L (2004) Boosting systematic search by weighting constraints. In: Proceedings of the 16th Eureopean conference on artificial intelligence (ECAI). IOS Press, pp 146–150
Zurück zum Zitat Castro C, Monfroy E, Figueroa C, Meneses R (2005) An approach for dynamic split strategies in constraint solving. In: Proceedings of the 4th Mexican international conference on artificial intelligence (MICAI), volume 3789 of lecture notes in computer science. Springer, pp 162–174 Castro C, Monfroy E, Figueroa C, Meneses R (2005) An approach for dynamic split strategies in constraint solving. In: Proceedings of the 4th Mexican international conference on artificial intelligence (MICAI), volume 3789 of lecture notes in computer science. Springer, pp 162–174
Zurück zum Zitat Chenouard R, Granvilliers L, Sebastian P (2009) Search heuristics for constraint-aided embodiment design. AI EDAM 23(2):175–195 Chenouard R, Granvilliers L, Sebastian P (2009) Search heuristics for constraint-aided embodiment design. AI EDAM 23(2):175–195
Zurück zum Zitat Crawford B, Soto R, Castro C, Monfroy E, Paredes F (2011) An extensible autonomous search framework for constraint programming. Int J Phys Sci 6(14):3369–3376 Crawford B, Soto R, Castro C, Monfroy E, Paredes F (2011) An extensible autonomous search framework for constraint programming. Int J Phys Sci 6(14):3369–3376
Zurück zum Zitat Crawford B, Soto R, Monfroy E, Palma W, Castro C, Paredes F (2013) Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Expert Syst Appl 40(5):1690–1695CrossRef Crawford B, Soto R, Monfroy E, Palma W, Castro C, Paredes F (2013) Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Expert Syst Appl 40(5):1690–1695CrossRef
Zurück zum Zitat Crawford B, Soto R, Castro C, Monfroy E (2011a) A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction. In: Proceedings of the 4th international work-conference on the interplay between natural and artificial computation (IWINAC), volume 6687 of lecture notes in computer science. Springer, pp 295–304 Crawford B, Soto R, Castro C, Monfroy E (2011a) A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction. In: Proceedings of the 4th international work-conference on the interplay between natural and artificial computation (IWINAC), volume 6687 of lecture notes in computer science. Springer, pp 295–304
Zurück zum Zitat Crawford B, Soto R, Montecinos M, Castro C, Monfroy E (2011b) A framework for autonomous search in the eclipse solver. In: Proceedings of the 24th international conference on industrial, engineering and other applications of applied intelligent systems (IEA/AIE), volume 6703 of LNCS. Springer, pp 79–84 Crawford B, Soto R, Montecinos M, Castro C, Monfroy E (2011b) A framework for autonomous search in the eclipse solver. In: Proceedings of the 24th international conference on industrial, engineering and other applications of applied intelligent systems (IEA/AIE), volume 6703 of LNCS. Springer, pp 79–84
Zurück zum Zitat Epstein SL, Freuder EC, Wallace RJ, Morozov A, Samuels B (2002) The adaptive constraint engine. In: Proceedings of the 8th international conference on principles and practice of constraint programming (CP), volume 2470 of lecture notes in computer science. Springer, pp 525–542 Epstein SL, Freuder EC, Wallace RJ, Morozov A, Samuels B (2002) The adaptive constraint engine. In: Proceedings of the 8th international conference on principles and practice of constraint programming (CP), volume 2470 of lecture notes in computer science. Springer, pp 525–542
Zurück zum Zitat Epstein S, Petrovic S (2007) Learning to solve constraint problems. In: Proceedings of the workshop on planning and learning (ICAPS) Epstein S, Petrovic S (2007) Learning to solve constraint problems. In: Proceedings of the workshop on planning and learning (ICAPS)
Zurück zum Zitat Grimes D, Wallace RJ (2007) Learning to identify global bottlenecks in constraint satisfaction search. In: Proceedings of the twentieth international Florida artificial intelligence research society (FLAIRS) conference. AAAI Press, pp 592–597 Grimes D, Wallace RJ (2007) Learning to identify global bottlenecks in constraint satisfaction search. In: Proceedings of the twentieth international Florida artificial intelligence research society (FLAIRS) conference. AAAI Press, pp 592–597
Zurück zum Zitat Hamadi Y, Monfroy E, Saubion F (2012) Autonomous search. Springer, New YorkCrossRef Hamadi Y, Monfroy E, Saubion F (2012) Autonomous search. Springer, New YorkCrossRef
Zurück zum Zitat Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222:175–184MathSciNetCrossRef Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222:175–184MathSciNetCrossRef
Zurück zum Zitat Hoos H (2002) Automated algorithm configuration and parameter tuning. In: Autonomous search. Springer Hoos H (2002) Automated algorithm configuration and parameter tuning. In: Autonomous search. Springer
Zurück zum Zitat Kumar S, Datta D, Singh S (2015) Black hole algorithm and its applications. In: Azar TA, Vaidyanathan S (eds) Computational intelligence applications in modeling and control. Springer, Switzerland, pp 147–170. doi:10.1007/978-3-319-11017-2_7 Kumar S, Datta D, Singh S (2015) Black hole algorithm and its applications. In: Azar TA, Vaidyanathan S (eds) Computational intelligence applications in modeling and control. Springer, Switzerland, pp 147–170. doi:10.​1007/​978-3-319-11017-2_​7
Zurück zum Zitat Lilliefors H (1967) On the Kolmogorov–Smirnov test for normality with mean and variance unknown. J Am Stat Assoc 62(318):399–402CrossRef Lilliefors H (1967) On the Kolmogorov–Smirnov test for normality with mean and variance unknown. J Am Stat Assoc 62(318):399–402CrossRef
Zurück zum Zitat Mann H, Donald W (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18(1):50–60MathSciNetCrossRefMATH Mann H, Donald W (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18(1):50–60MathSciNetCrossRefMATH
Zurück zum Zitat Maturana J, Saubion F (2008) A compass to guide genetic algorithms. In: Proceedings of the 10th international conference on parallel problem solving from nature (PPSN), volume 5199 of LNCS. Springer, pp 256–265 Maturana J, Saubion F (2008) A compass to guide genetic algorithms. In: Proceedings of the 10th international conference on parallel problem solving from nature (PPSN), volume 5199 of LNCS. Springer, pp 256–265
Zurück zum Zitat Métivier J-P, Boizumault P, Loudni S (2009) Solving nurse rostering problems using soft global constraints. In: Proceedings of CP, volume 5732 of LNCS. Springer, pp 73–87 Métivier J-P, Boizumault P, Loudni S (2009) Solving nurse rostering problems using soft global constraints. In: Proceedings of CP, volume 5732 of LNCS. Springer, pp 73–87
Zurück zum Zitat Refalo P (2004) Impact-based search strategies for constraint programming. In: Wallace M (ed) CP volume 3258 of lecture notes in computer science. Springer, New York, pp 557–571 Refalo P (2004) Impact-based search strategies for constraint programming. In: Wallace M (ed) CP volume 3258 of lecture notes in computer science. Springer, New York, pp 557–571
Zurück zum Zitat Rossi F, van Beek P, Walsh T (2006) Handbook of constraint programming. Elsevier, AmsterdamMATH Rossi F, van Beek P, Walsh T (2006) Handbook of constraint programming. Elsevier, AmsterdamMATH
Zurück zum Zitat Soto R, Kjellerstrand H, Durán O, Crawford B, Monfroy E, Paredes F (2012) Cell formation in group technology using constraint programming and Boolean satisfiability. Expert Syst Appl 39(13):11423–11427CrossRef Soto R, Kjellerstrand H, Durán O, Crawford B, Monfroy E, Paredes F (2012) Cell formation in group technology using constraint programming and Boolean satisfiability. Expert Syst Appl 39(13):11423–11427CrossRef
Zurück zum Zitat Soto R, Crawford B, Herrera R, Olivares R, Johnson F, Paredes F (2015) WSM tuning in autonomous search via gravitational search algorithms. In: Proceedings of the 4th computer science on-line conference 2015, vol 1: artificial intelligence perspectives and applications, volume 347 of advances in intelligent systems and computing. Springer, pp 159–168 Soto R, Crawford B, Herrera R, Olivares R, Johnson F, Paredes F (2015) WSM tuning in autonomous search via gravitational search algorithms. In: Proceedings of the 4th computer science on-line conference 2015, vol 1: artificial intelligence perspectives and applications, volume 347 of advances in intelligent systems and computing. Springer, pp 159–168
Zurück zum Zitat Soto R, Crawford B, Monfroy E, Castro C (2011) A hyperheuristic approach for dynamic enumeration strategy selection in constraint programming. In: Proceedings of the 4th international work-conference on the interplay between natural and artificial computation (IWINAC), vol 6687. Springer, pp 295–304 Soto R, Crawford B, Monfroy E, Castro C (2011) A hyperheuristic approach for dynamic enumeration strategy selection in constraint programming. In: Proceedings of the 4th international work-conference on the interplay between natural and artificial computation (IWINAC), vol 6687. Springer, pp 295–304
Zurück zum Zitat Soto R, Crawford B, Olivares R, Franklin J, Paredes F (2015) Online control of enumeration strategies via bat-inspired optimization. In: Proceedings of the international work-conference on the interplay between natural and artificial computation, IWINAC 2015, Elche, Spain, pp 1–10 Soto R, Crawford B, Olivares R, Franklin J, Paredes F (2015) Online control of enumeration strategies via bat-inspired optimization. In: Proceedings of the international work-conference on the interplay between natural and artificial computation, IWINAC 2015, Elche, Spain, pp 1–10
Zurück zum Zitat Wallace RJ, Grimes D (2008) Experimental studies of variable selection strategies based on constraint weights. J Algorithms 63(1–3):114–129MathSciNetCrossRefMATH Wallace RJ, Grimes D (2008) Experimental studies of variable selection strategies based on constraint weights. J Algorithms 63(1–3):114–129MathSciNetCrossRefMATH
Zurück zum Zitat Xin-She Y (2011) Bat algorithm for multi-objective optimisation. IJBIC 3(5):267–274CrossRef Xin-She Y (2011) Bat algorithm for multi-objective optimisation. IJBIC 3(5):267–274CrossRef
Zurück zum Zitat Xu Y, Stern D, Samulowitz H (2009) Learning adaptation to solve constraint satisfaction problems. In: Proceedings of the 3rd international conference on learning and intelligent optimization (LION), pp 507–523 Xu Y, Stern D, Samulowitz H (2009) Learning adaptation to solve constraint satisfaction problems. In: Proceedings of the 3rd international conference on learning and intelligent optimization (LION), pp 507–523
Zurück zum Zitat Yang X-S (2010) A new metaheuristic bat-inspired algorithm. In: Proceedings on nature inspired cooperative strategies for optimization (NICSO), volume 284 of studies in computational intelligence. Springer, pp 65–74 Yang X-S (2010) A new metaheuristic bat-inspired algorithm. In: Proceedings on nature inspired cooperative strategies for optimization (NICSO), volume 284 of studies in computational intelligence. Springer, pp 65–74
Zurück zum Zitat Yang X-S, Deb S, Loomes M, Karamanoglu M (2013) A framework for self-tuning optimization algorithm. Neural Comput Appl 23(7–8):2051–2057CrossRef Yang X-S, Deb S, Loomes M, Karamanoglu M (2013) A framework for self-tuning optimization algorithm. Neural Comput Appl 23(7–8):2051–2057CrossRef
Zurück zum Zitat Yang X-S, He X (2013) Bat algorithm: literature review and applications. IJBIC 5(3):141–149CrossRef Yang X-S, He X (2013) Bat algorithm: literature review and applications. IJBIC 5(3):141–149CrossRef
Metadaten
Titel
Online control of enumeration strategies via bat algorithm and black hole optimization
verfasst von
Ricardo Soto
Broderick Crawford
Rodrigo Olivares
Stefanie Niklander
Franklin Johnson
Fernando Paredes
Eduardo Olguín
Publikationsdatum
13.07.2016
Verlag
Springer Netherlands
Erschienen in
Natural Computing / Ausgabe 2/2017
Print ISSN: 1567-7818
Elektronische ISSN: 1572-9796
DOI
https://doi.org/10.1007/s11047-016-9576-z

Weitere Artikel der Ausgabe 2/2017

Natural Computing 2/2017 Zur Ausgabe

EditorialNotes

Preface