Using immunogenetic algorithms for solving combinatorial optimization problems

Francisco Javier Díaz-Delgadillo; Oscar Montiel-Ross; Roberto Sepúlveda

doi:10.1007/978-3-642-33021-6_22

Using immunogenetic algorithms for solving combinatorial optimization problems

Francisco Javier Díaz-Delgadillo, Oscar Montiel-Ross, Roberto Sepúlveda

Centro de Investigación y Desarrollo de Tecnología Digital (CITEDI)

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

2 Scopus citations

Abstract

We present a novel approach for reducing the computational time of Combinatorial Optimization Problems (COPs). The approach is inspired by the use of Artificial Vaccines, a concept that is classified as being part of a set of algorithms called Artificial Immune Systems (AIS). Artificial Vaccines are able to reduce the computational time and quality of the solution of any existing COP solving algorithm by reducing the size of the problem set. To demonstrate the usefulness of this proposal we provide comparative results obtained with a Genetic Algorithm (GA) solving the Traveling Salesman Problem (TSP) for three large instances of 423, 737 and 1583 cities.

Original language	English
Title of host publication	Recent Advances on Hybrid Intelligent Systems
Editors	Oscar Castillo, Patricia Melin, Oscar Castillo, Patricia Melin, Janusz Kacprzyk
Pages	273-288
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-33021-6_22
State	Published - 2013

Publication series

Name	Studies in Computational Intelligence
Volume	451
ISSN (Print)	1860-949X

Keywords

AIS
Artificial Vaccines
COP
TSP

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/978-3-642-33021-6_22

Cite this

Díaz-Delgadillo, F. J., Montiel-Ross, O., & Sepúlveda, R. (2013). Using immunogenetic algorithms for solving combinatorial optimization problems. In O. Castillo, P. Melin, O. Castillo, P. Melin, & J. Kacprzyk (Eds.), Recent Advances on Hybrid Intelligent Systems (pp. 273-288). (Studies in Computational Intelligence; Vol. 451). https://doi.org/10.1007/978-3-642-33021-6_22

@inbook{0ed7ad98f5d34bad8df329b3095d8f7a,

title = "Using immunogenetic algorithms for solving combinatorial optimization problems",

abstract = "We present a novel approach for reducing the computational time of Combinatorial Optimization Problems (COPs). The approach is inspired by the use of Artificial Vaccines, a concept that is classified as being part of a set of algorithms called Artificial Immune Systems (AIS). Artificial Vaccines are able to reduce the computational time and quality of the solution of any existing COP solving algorithm by reducing the size of the problem set. To demonstrate the usefulness of this proposal we provide comparative results obtained with a Genetic Algorithm (GA) solving the Traveling Salesman Problem (TSP) for three large instances of 423, 737 and 1583 cities.",

keywords = "AIS, Artificial Vaccines, COP, TSP",

author = "D{\'i}az-Delgadillo, {Francisco Javier} and Oscar Montiel-Ross and Roberto Sep{\'u}lveda",

year = "2013",

doi = "10.1007/978-3-642-33021-6_22",

language = "Ingl{\'e}s",

isbn = "9783642330209",

series = "Studies in Computational Intelligence",

pages = "273--288",

editor = "Oscar Castillo and Patricia Melin and Oscar Castillo and Patricia Melin and Janusz Kacprzyk",

booktitle = "Recent Advances on Hybrid Intelligent Systems",

}

Using immunogenetic algorithms for solving combinatorial optimization problems. / Díaz-Delgadillo, Francisco Javier; Montiel-Ross, Oscar; Sepúlveda, Roberto.
Recent Advances on Hybrid Intelligent Systems. ed. / Oscar Castillo; Patricia Melin; Oscar Castillo; Patricia Melin; Janusz Kacprzyk. 2013. p. 273-288 (Studies in Computational Intelligence; Vol. 451).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Using immunogenetic algorithms for solving combinatorial optimization problems

AU - Díaz-Delgadillo, Francisco Javier

AU - Montiel-Ross, Oscar

AU - Sepúlveda, Roberto

PY - 2013

Y1 - 2013

N2 - We present a novel approach for reducing the computational time of Combinatorial Optimization Problems (COPs). The approach is inspired by the use of Artificial Vaccines, a concept that is classified as being part of a set of algorithms called Artificial Immune Systems (AIS). Artificial Vaccines are able to reduce the computational time and quality of the solution of any existing COP solving algorithm by reducing the size of the problem set. To demonstrate the usefulness of this proposal we provide comparative results obtained with a Genetic Algorithm (GA) solving the Traveling Salesman Problem (TSP) for three large instances of 423, 737 and 1583 cities.

AB - We present a novel approach for reducing the computational time of Combinatorial Optimization Problems (COPs). The approach is inspired by the use of Artificial Vaccines, a concept that is classified as being part of a set of algorithms called Artificial Immune Systems (AIS). Artificial Vaccines are able to reduce the computational time and quality of the solution of any existing COP solving algorithm by reducing the size of the problem set. To demonstrate the usefulness of this proposal we provide comparative results obtained with a Genetic Algorithm (GA) solving the Traveling Salesman Problem (TSP) for three large instances of 423, 737 and 1583 cities.

KW - AIS

KW - Artificial Vaccines

KW - COP

KW - TSP

UR - http://www.scopus.com/inward/record.url?scp=84870486733&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-33021-6_22

DO - 10.1007/978-3-642-33021-6_22

M3 - Capítulo

AN - SCOPUS:84870486733

SN - 9783642330209

T3 - Studies in Computational Intelligence

SP - 273

EP - 288

BT - Recent Advances on Hybrid Intelligent Systems

A2 - Castillo, Oscar

A2 - Melin, Patricia

A2 - Castillo, Oscar

A2 - Melin, Patricia

A2 - Kacprzyk, Janusz

ER -

Using immunogenetic algorithms for solving combinatorial optimization problems

Abstract

Publication series

Keywords

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this