In recent years, the research community has witnessed an explosion of literature dealing
with the mimicking of behavioral patterns and social phenomena observed in nature towards …

Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …

Many classical search and optimization algorithms are especially insufficient in solving very
hard large scale nonlinear problems with stringent constraints. Hence, computational …

Optimization is one of the most studied fields within the wider area of artificial intelligence. In
the current literature, hundreds of works can be found focused on solving many diverse …

This paper proposes a new evolutionary region merging method in order to efficiently
improve segmentation quality results. Our approach starts from an oversegmented image …

As the world progresses towards industrialization, engineering problems become
increasingly complex and it becomes even more difficult to optimize these problems. The …

This paper deals with maximum cut problem on a graph with fuzzy edges. This problem is
studied to cluster data under imprecise dependency. Applying the credibility measure, this …

The max-bisection problem consists in partitioning the vertices of a weighted undirected
graph into two equally sized subsets so as to maximize the sum of the weights of crossing …

This paper proposes the use of a genetic algorithm to optimize mask and illumination
geometries in optical projection lithography. A fitness function is introduced that evaluates …

The Max-Cut problem consists of finding a partition of the graph nodes into two subsets,
such that the sum of the edge weights having endpoints in different subsets is maximized …