Choice Functions for Autonomous Search in Constraint Programming: Ga Vs. Pso

dc.authorid Misra, Sanjay/0000-0002-3556-9331
dc.authorid Soto, Ricardo/0000-0002-5755-6929
dc.authorid Crawford, Broderick/0000-0001-5500-0188
dc.authorid Palma, Wenceslao/0000-0002-7232-0412
dc.authorscopusid 24403038600
dc.authorscopusid 23395875300
dc.authorscopusid 56962766700
dc.authorscopusid 6603419658
dc.authorscopusid 6701648878
dc.authorscopusid 7202237871
dc.authorscopusid 7202237871
dc.authorwosid Misra, Sanjay/K-2203-2014
dc.contributor.author Soto, Ricardo
dc.contributor.author Crawford, Broderick
dc.contributor.author Misra, Sanjay
dc.contributor.author Palma, Wenceslao
dc.contributor.author Monfroy, Eric
dc.contributor.author Castro, Carlos
dc.contributor.author Paredes, Fernando
dc.contributor.other Computer Engineering
dc.contributor.other Computer Engineering
dc.date.accessioned 2024-10-06T10:56:57Z
dc.date.available 2024-10-06T10:56:57Z
dc.date.issued 2013
dc.department Atılım University en_US
dc.department-temp [Soto, Ricardo; Crawford, Broderick; Palma, Wenceslao] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile; [Soto, Ricardo] Univ Autonoma Chile, Santiago, Chile; [Crawford, Broderick] Univ Finis Terrae, Santiago, Chile; [Misra, Sanjay] Atilim Univ, Ankara, Turkey; [Monfroy, Eric] Univ Nantes, LINA, CNRS, Nantes, France; [Castro, Carlos] Univ Tecn Federico Santa Maria, Valparaiso, Chile; [Paredes, Fernando] Univ Diego Portales, Escuela Ingn Ind, Santiago, Chile en_US
dc.description Misra, Sanjay/0000-0002-3556-9331; Soto, Ricardo/0000-0002-5755-6929; Crawford, Broderick/0000-0001-5500-0188; Palma, Wenceslao/0000-0002-7232-0412 en_US
dc.description.abstract The variable and value ordering heuristics are a key element in Constraint Programming. Known together as the enumeration strategy they may have important consequences on the solving process. However, a suitable selection of heuristics is quite hard as their behaviour is complicated to predict. Autonomous search has been recently proposed to handle this concern. The idea is to dynamically replace strategies that exhibit poor performances by more promising ones during the solving process. This replacement is carried out by a choice function, which evaluates a given strategy in a given amount of time via quality indicators. An important phase of this process is performed by an optimizer, which aims at finely tuning the choice function in order to guarantee a precise evaluation of strategies. In this paper we evaluate the performance of two powerful choice functions: the first one supported by a genetic algorithm and the second one by a particle swarm optimizer. We present interesting results and we demonstrate the feasibility of using those optimization techniques for Autonomous Search in a Constraint Programming context. en_US
dc.description.woscitationindex Science Citation Index Expanded
dc.identifier.citationcount 11
dc.identifier.endpage 627 en_US
dc.identifier.issn 1330-3651
dc.identifier.issn 1848-6339
dc.identifier.issue 4 en_US
dc.identifier.scopus 2-s2.0-84883174309
dc.identifier.scopusquality Q3
dc.identifier.startpage 621 en_US
dc.identifier.uri https://hdl.handle.net/20.500.14411/8627
dc.identifier.volume 20 en_US
dc.identifier.wos WOS:000323558800009
dc.identifier.wosquality Q4
dc.institutionauthor Mısra, Sanjay
dc.institutionauthor Mısra, Sanjay
dc.language.iso en en_US
dc.publisher Univ Osijek, Tech Fac en_US
dc.relation.ispartof Tehnicki Vjesnik en_US
dc.relation.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.scopus.citedbyCount 13
dc.subject Artificial Intelligence en_US
dc.subject Autonomous Search en_US
dc.subject Constraint Programming en_US
dc.title Choice Functions for Autonomous Search in Constraint Programming: Ga Vs. Pso en_US
dc.title.alternative Funkcije izbora za samostalno pretraživanje u ograničenom programiranju: Genetski algoritam nasuprot optimizaciji roja čestica en_US
dc.type Article en_US
dc.wos.citedbyCount 11
dspace.entity.type Publication
relation.isAuthorOfPublication 53e88841-fdb7-484f-9e08-efa4e6d1a090
relation.isAuthorOfPublication.latestForDiscovery 53e88841-fdb7-484f-9e08-efa4e6d1a090
relation.isOrgUnitOfPublication e0809e2c-77a7-4f04-9cb0-4bccec9395fa
relation.isOrgUnitOfPublication.latestForDiscovery e0809e2c-77a7-4f04-9cb0-4bccec9395fa

Files

Collections