| Santana R and de León EP (1998), "A conceptual model for detecting structures in graphs using evolutionary optimization algorithms". Research Report at: Institute of Cybernetics, Mathematics and Physics. Havana, Cuba, December, 1998. (ICIMAF 98-69, CENIA 98-03) |
| Abstract: Search and identification of structures on graphs have been topics extensively considered in the literature. Different approaches are known that face these problems as functions optimization. Most of them emphasize on the search of a particular structure (e.g. cliques, spanning trees, hamiltonian paths). In the same way, functions are conceived to be optimized using just one method (e.g. gradient, annealing, genetic algorithms.) Here we analyze the convenience of defining families of functions to be used in the search of different structures. Starting from the identification of a dissection on a graph we propose a family of functions that shows good results in the search of a wide set of structures on graphs. A hierarchy that associates the function definition to a constraint addition process is introduced. We also deal with the question of an optimal representation for the solutions space. Finally we present the results obtained using two different optimization algorithms. A heuristic hill-climbing and a population based search method, which are utilized to deal with the multi-objective character of our constraint optimization problem. |
BibTeX:
@techreport{Santana_and_Ponce:1998,
author = {R. Santana and E. Ponce de León},
title = {A conceptual model for detecting structures in graphs using evolutionary optimization algorithms},
school = {Institute of Cybernetics, Mathematics and Physics},
year = {1998},
number = {ICIMAF 98-69, CENIA 98-03},
url = {https://www.researchgate.net/publication/333719090_A_conceptual_model_for_detecting_structures_on_graphs_using_evolutionary_optimization_algorithms}
}
|
| Santana R and de León EP (1998), "An evolutionary optimization approach for detecting structures on graphs", In Smart Engineering System Design: Neural Network, Fuzzy Logic, Rough Sets and Evolutionary Programming. , pp. 371-376. ASME press. |
| Abstract: This paper introduces a function optimization approach for detecting structures on graphs. Starting from the identification of a dissection on a graph, we propose a family of functions whose parameters vary according to the different structures to be searched. We also deal with the question of an optimal representation for the solutions. Finally we present the results obtained using two different optimization algorithms. A heuristic hill-climbing and a population based search method are presented, which are utilized to deal with the multi-objective character of our constraint optimization problem. |
BibTeX:
@inproceedings{Santana_and_Ponce:1998a,
author = {R. Santana and E. Ponce de León},
editor = {Dagli and Akay and Buczac and Ersoy and Fernandez},
title = {An evolutionary optimization approach for detecting structures on graphs},
booktitle = {Smart Engineering System Design: Neural Network, Fuzzy Logic, Rough Sets and Evolutionary Programming},
publisher = {ASME press},
year = {1998},
pages = {371-376},
url = {https://www.researchgate.net/publication/262522456_An_evolutionary_optimization_approach_for_detecting_structures_on_graphs}
}
|
| Santana R and de León EP (1998), "Defining families of functions to be used in the search of different structures on graphs", In Proceedings of the IX Congreso Iberoamericano de Investigación Operativa. |
| Abstract: Search and identification of structures on graphs have been topics extensively considered in the literature. Different approaches are known that face these problems as functions optimization. Most of them emphasize on the search of a particular structure (e.g. cliques, spanning trees, Hamiltonian paths). In the same way, functions are conceived to be optimized using just one method ( e.g. gradient, annealing, genetic algorithms, etc.) Here we introduce families of functions to be used in the search of different structures with several optimization algorithms. Starting from the identification of a dissection on a graph we propose a family of functions that shows good results in the search of a wide set of structures on graphs. We also consider the question of an optimal representation for the solutions space. We have found structures like triangulations, perfect matching and Hamiltonian circuits using different optimization methods. The behavior of the used algorithms is analyzed. |
BibTeX:
@inproceedings{Santana_and_Ponce:1998b,
author = {R. Santana and E. Ponce de León},
title = {Defining families of functions to be used in the search of different structures on graphs},
booktitle = {Proceedings of the IX Congreso Iberoamericano de Investigación Operativa},
year = {1998},
url = {https://www.researchgate.net/publication/333719090_A_conceptual_model_for_detecting_structures_on_graphs_using_evolutionary_optimization_algorithms}
}
|
| Santana R (1998), "Using Evolutionary Computing and Artificial Life in Theoretical Ecology: A preliminary approach"
[BibTeX] |
BibTeX:
@unpublished{Santana:1998,
author = {Roberto Santana},
title = {Using Evolutionary Computing and Artificial Life in Theoretical Ecology: A preliminary approach},
year = {1998}
}
|