solver_ffa: Firefly Solver (Fister Version)

In caranha/EvoGCP: Evolutionary Computation Tools for the Graph Coloring Problem

Description

Solves a instance of the 3-GCP problem using the Firefly Algorithm (FFA) implementation described in Fister et al., 2012.

Usage

solver_ffa(G, nfe, args)

Arguments

G	the graph to be solved, represented by a list where G$V is the number of nodes, and G$E is a |E|x2 matrix of edges.
nfe	the number of function evaluations. The solver will stop after this number has been exceeded.
args	a list with arguments for the method. The list must contain the following names: pop: Integer > 0. The size of the solution set X lb: Number, 0 <= lv <= ub. The lower bound of the values in the weight set ub: Number, 0 <= lv <= ub. The upper bound of the values in the weight set alpha: Integer > 0. The size of the randomness move withim the search space beta: Integer > 0. The attractiveness at distance 0 gamma: Integer > 0. The absorbtion coefficient swap: Boolean. If it is to use the heuristical swap.

Value

A list with three names:

• violation: the number of graph coloring violations of the best solution found (0 for a correct solution)

• best: a vector with the best solution found

• evals: the number of evaluations used by the time the solver stopped.

References

I. Fister Jr., X.-S. Yang, I. Fister, J. Brest, Memetic firefly algorithm for combinatorial optimization, in Bioinspired Optimization Methods and their Applications (BIOMA 2012), B. Filipic and J.Silc, Eds. Jozef Stefan Institute, Ljubljana, Slovenia, 2012

caranha/EvoGCP documentation built on May 3, 2021, 3:40 p.m.