Learn More
The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the diversity of their characteristics, calculated by a function applied on their attributes. This problem belongs to the class of NP-hard problems. This paper presents new GRASP heuristics for(More)
The Maximum Diversity Problem (MDP) consists in identifying , in a population, a subset of elements, characterized by a set of attributes, that present the most diverse characteristics between themselves. The identification of such solution is an NP-hard problem. Some heuristics are available to obtain approximate solutions for this problem. In this paper(More)
This paper deals with the application of genetic algorithms and simulated annealing in order to solve the hydrothermal coordination problem through the optimal operation planning of large and nonlinear complex systems. Aiming to explore different solutions for this kind of problem, this paper suggests a comparison between the results of genetic algorithms(More)
  • 1