activity
20082024
most citedA GRASP-based memetic algorithm with path relinking for the far from most string problem

19 citations · 46 across the 6 of their papers we have counts for

collaborators

6 papers

cs.NE2024★ 1 cited

New perspectives on the optimal placement of detectors for suicide bombers using metaheuristics

Carlos Cotta, José E. Gallardo

We consider an operational model of suicide bombing attacks -- an increasingly prevalent form of terrorism -- against specific targets, and the use of protective countermeasures ba…

cs.NE2024★ 6 cited

Metaheuristic approaches to the placement of suicide bomber detectors

Carlos Cotta, José E. Gallardo

Suicide bombing is an infamous form of terrorism that is becoming increasingly prevalent in the current era of global terror warfare. We consider the case of targeted attacks of th…

cs.NE2024★ 2 cited

Evolutionary Algorithms for Optimizing Emergency Exit Placement in Indoor Environments

Carlos Cotta, José E. Gallardo

The problem of finding the optimal placement of emergency exits in an indoor environment to facilitate the rapid and orderly evacuation of crowds is addressed in this work. A cellu…

cs.AI2024★ 19 cited

A GRASP-based memetic algorithm with path relinking for the far from most string problem

José E. Gallardo, Carlos Cotta

The FAR FROM MOST STRING PROBLEM (FFMSP) is a string selection problem. The objective is to find a string whose distance to other strings in a certain input set is above a given th…

cs.AI2014★ 17 cited

Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms

José Enrique Gallardo, Carlos Cotta, Antonio José Fernández

A weighted constraint satisfaction problem (WCSP) is a constraint satisfaction problem in which preferences among solutions can be expressed. Bucket elimination is a complete techn…

cs.NE2008★ 1 cited

Finding Still Lifes with Memetic/Exact Hybrid Algorithms

Jose E. Gallardo, Carlos Cotta, Antonio J. Fernandez

The maximum density still life problem (MDSLP) is a hard constraint optimization problem based on Conway's game of life. It is a prime example of weighted constrained optimization…