dc.contributor.author | Soto R. | |
dc.contributor.author | Crawford B. | |
dc.contributor.author | Olivares R. | |
dc.contributor.author | Johnson F. | |
dc.contributor.author | Paredes F. | |
dc.date.accessioned | 2020-09-02T22:28:43Z | |
dc.date.available | 2020-09-02T22:28:43Z | |
dc.date.issued | 2015 | |
dc.identifier | 10.1007/978-3-319-18833-1_1 | |
dc.identifier.citation | 9108, , 1-10 | |
dc.identifier.issn | 03029743 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/6323 | |
dc.description | Constraint programming allows to solve constraint satisfaction and optimization problems by building and then exploring a search tree of potential solutions. Potential solutions are generated by firstly selecting a variable and then a value from the given problem. The enumeration strategy is responsible for selecting the order in which those variables and values are selected to produce a potential solution. 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. A modern idea to handle this concern, is to interleave during solving time a set of different strategies instead of using a single one. 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 a new system for online control of enumeration strategies based on bat-inspired optimization. The bat algorithm is a relatively modern metaheuristic based on the location behavior of bats that employ echoes to identify the objects in their surrounding area. We illustrate, promising results where the proposed bat algorithm is able to outperform previously reported metaheuristic-based approaches for online control of enumeration strategies. © Springer International Publishing Switzerland 2015 | |
dc.language.iso | en | |
dc.publisher | Springer Verlag | |
dc.source | Alvarez-Sanchez J.R.de la Paz Lopez F.Adeli H.Vicente J.M.F.Toledo-Moreo F.J. | |
dc.subject | Bat Algorithm | |
dc.subject | Constraint Programming | |
dc.subject | Constraint Satisfaction Problems | |
dc.subject | Swarm Intelligence | |
dc.subject | Algorithms | |
dc.subject | Artificial intelligence | |
dc.subject | Computer programming | |
dc.subject | Constraint theory | |
dc.subject | Optimization | |
dc.subject | Social networking (online) | |
dc.subject | Bat algorithms | |
dc.subject | Constraint programming | |
dc.subject | Constraint Satisfaction | |
dc.subject | On-line controls | |
dc.subject | Optimization problems | |
dc.subject | Process indicators | |
dc.subject | Search process | |
dc.subject | Swarm Intelligence | |
dc.subject | Constraint satisfaction problems | |
dc.title | Online control of enumeration strategies via bat-inspired optimization | |
dc.type | Conference Paper | |