Feasibility and Availability based Heuristics for ACO algorithms solving Binary CSP - École des Ponts ParisTech Access content directly
Conference Papers Year : 2018

Feasibility and Availability based Heuristics for ACO algorithms solving Binary CSP

Abstract

A Constraint Satisfaction Problem is composed by a set of variables, their related domains and a set of constraints among the variables that must be satisfied. These are known as hard problems to be solved. Many algorithms have been proposed to solve these problems. Metaheuristics and in particular ant-based algorithms have been used to solve difficult instances. In this paper, we propose new heuristics to be included in an ant-based algorithm in order to improve its performance when tackling hard constraint satisfaction problems. These heuristics are focused on the availability of consistent variable values and to restrict the ants collaborative information to the feasibility. To evaluate these heuristics we used the well-known Ant Solver algorithm and tested with problem instances from the transition phase. Results show that using our heuristics the Ants algorithm increases the number of problems that it is able to solve. Finally, a statistical analysis is presented to compare these approaches.
Fichier principal
Vignette du fichier
PID5328385.pdf (264.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01872433 , version 1 (12-09-2018)

Identifiers

  • HAL Id : hal-01872433 , version 1

Cite

Nicolás Rojas-Morales, María-Cristina Riff, Bertrand Neveu. Feasibility and Availability based Heuristics for ACO algorithms solving Binary CSP. IEEE Congress on Evolutionary Computation, Jul 2018, Rio de Janeiro, Brazil. ⟨hal-01872433⟩
45 View
181 Download

Share

Gmail Facebook X LinkedIn More