Immune algorithm for solving the smooth economic dispatch problem

Mostrar todas las versiones(2)

In this paper, an algorithm inspired on the T- Cell model of the immune system is presented, it is used to solve Economic Dispatch Problems with smooth objective function. The proposed approach is called IA EDP S, which stands for Immune Algorithm for Economic Dispatch Prob- lem for smooth objective...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Aragón, Victoria S., Esquivel, Susana Cecilia
Formato:	Articulo
Lenguaje:	Inglés
Publicado:	2015
Materias:	Ciencias Informáticas artificial immune systems economic dispatch problem Heuristic methods
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/50201 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST41-Paper-14.pdf
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Immune algorithm for solving the smooth economic dispatch problem
por: Aragón, Victoria S., et al.
Publicado: (2015)

A T-cell algorithm for solving dynamic economic power dispatch problems
por: Aragón, Victoria S., et al.
Publicado: (2020)

An Artificial Immune System for Solving Dynamic Economic Power Dispatch Problems
por: Aragón, Victoria S., et al.
Publicado: (2019)

Immune Algorithm for Solving the Dynamic Economic Dispatch Problem
por: Aragón, Victoria S., et al.
Publicado: (2016)

Artificial immune system for solving global optimization problems
por: Aragón, Victoria S., et al.
Publicado: (2008)

Hybridizing an immune artificial algorithm with epsilon constrained method
por: Aragón, Victoria S., et al.
Publicado: (2012)

The Dispatch. Remote Mining work
por: Clemenceau, Lautaro
Publicado: (2018)

Artificial immune system for solving constrained optimization problems
por: Aragón, Victoria S., et al.
Publicado: (2006)

Optimizing constrained problems through a T-Cell artificial immune system
por: Aragón, Victoria S., et al.
Publicado: (2008)

A study of genotype and phenotype distributions in hybrid evolutionary algorithms to solve the flow shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2002)

El Dispatch. Trabajo minero en forma remota
por: Clemenceau, Lautaro
Publicado: (2019)

An immune artificial algorithm for dynamic optimization problems: a case of study
por: Aragón, Victoria S., et al.
Publicado: (2009)

Solving constrained optimization using a T-Cell artificial immune system
por: Aragón, Victoria S., et al.
Publicado: (2007)

A GRASP algorithm to solve the problem of dependent tasks scheduling in different machines
por: Tupia Anticona, Manuel
Publicado: (2006)

A randomized algorithm for solving the satisfiability problem
por: Cecchi, Laura
Publicado: (1997)

Recursive and iterative algorithms for N-ary search problems
por: Sklyarov, Valery, et al.
Publicado: (2006)

Current applications of ant systems for subset problems
por: Leguizamón, Guillermo
Publicado: (2000)

Evolutionary algorithms to solve the school timetabling problem
por: Fernandez, Natalia, et al.
Publicado: (2002)

An ant colony optimization algorithm for job shop scheduling problem
por: Flórez, Edson, et al.
Publicado: (2013)

Knowledge insertion: an efficient approach to reduce search effort in evolutionary scheduling
por: Pandolfi, Daniel, et al.
Publicado: (2003)

Hybrid evolutionary algorithms to solve scheduling problems
por: Minetti, Gabriela F., et al.
Publicado: (2002)

Algorithms to solve the dynamic weighted tardiness problem
por: Lasso, Marta Graciela, et al.
Publicado: (2002)

Theory of problem solving ; an approach to artificial intelligence /
por: Banerji, Ranan B., 1928-
Publicado: (1969)

A Metaheuristic Compendium for Scheduling Problems
por: Bermúdez, Carlos, et al.
Publicado: (2017)

Heurística para TSP-2d euclideo y simétrico basadas en la triangulación de Delaunay y sus subgrafos
por: Krasnogor, Natalio
Publicado: (1997)

An ant system for the maximum independent set problem
por: Leguizamón, Guillermo, et al.
Publicado: (2001)

Una metaheurística co-evolutiva para el problema del viajante de comercio
por: Holstein, Diana
Publicado: (1998)

A new metaheuristic and its application to the Steiner problems in graphs
por: Urrutia, S., et al.

A new metaheuristic and its application to the Steiner problems in graphs
por: Urrutia, Sebastián, et al.
Publicado: (2001)

Global convexity in the bi-criteria Traveling Salesman problem
por: Barán, Benjamín, et al.
Publicado: (2006)

Adding problem-specific knowledge in evolutionary algorithms to solve W-T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2002)

Técnicas de Inteligencia Artificial aplicadas a problemas científico-tecnológicos
por: Izetta Riera, C. Javier, et al.
Publicado: (2016)

Técnicas de inteligencia artificial aplicadas a problemas científico-tecnológicos
por: Pérez Otero, Nilda, et al.
Publicado: (2017)

An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
por: Balseiro, S.R., et al.

An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
por: Loiseau, Irene
Publicado: (2011)

Solving motion planning problems
por: Pereira, André Grahl, et al.
Publicado: (2014)

PhD. Subject: Strategies to design life-long learning heuristic based algorithms
por: Rojas Morales, Nicolás
Publicado: (2014)

Variable neighborhood search for solving the DNA fragment assembly problem
por: Minetti, Gabriela F., et al.
Publicado: (2007)

Comparative and competitive adventages with the functioning of a reception. Storing and the dispach of fuels in Paraguay an southern ern region
por: Duarte Chávez, Héctor A.
Publicado: (2021)

Evaluation of a heuristic search algorithm based on sampling and clustering
por: Harita, Maria, et al.
Publicado: (2021)