Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Abraham Duarte is active.

Publication


Featured researches published by Abraham Duarte.


Computers & Operations Research | 2010

GRASP and path relinking for the max-min diversity problem

Mauricio G. C. Resende; Rafael Martí; Micael Gallego; Abraham Duarte

The max-min diversity problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The problem is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in the social and biological sciences. We propose a heuristic method-based on the GRASP and path relinking methodologies-for finding approximate solutions to this optimization problem. We explore different ways to hybridize GRASP and path relinking, including the recently proposed variant known as GRASP with evolutionary path relinking. Empirical results indicate that the proposed hybrid implementations compare favorably to previous metaheuristics, such as tabu search and simulated annealing.


European Journal of Operational Research | 2007

Tabu search and GRASP for the maximum diversity problem

Abraham Duarte; Rafael Martí

In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NP-hard problem has a significant number of practical applications such as environmental balance, telecommunication services or genetic engineering. The proposed algorithm is based on the tabu search methodology and incorporates memory structures for both construction and improvement. Although proposed in seminal tabu search papers, memory-based constructions have often been implemented in naive ways that disregard important elements of the fundamental tabu search proposals. We will compare our tabu search construction with a memory-less design and with previous algorithms recently developed for this problem. The constructive method can be coupled with a local search procedure or a short-term tabu search for improved outcomes. Extensive computational experiments with medium and large instances show that the proposed procedure outperforms the best heuristics reported in the literature within short computational times.


Informs Journal on Computing | 2009

Advanced Scatter Search for the Max-Cut Problem

Rafael Martí; Abraham Duarte; Manuel Laguna

The max-cut problem consists of finding a partition of the nodes of a weighted graph into two subsets such that the sum of the weights on the arcs connecting the two subsets is maximized. This is an NP-hard problem that can also be formulated as an integer quadratic program. Several solution methods have been developed since the 1970s and applied to a variety of fields, particularly in engineering and layout design. We propose a heuristic method based on the scatter-search methodology for finding approximate solutions to this optimization problem. Our solution procedure incorporates some innovative features within the scatter-search framework: (1) the solution of the maximum diversity problem to increase diversity in the reference set, (2) a dynamic adjustment of a key parameter within the search, and (3) the adaptive selection of a combination method. We perform extensive computational experiments to first study the effect of changes in critical scatter-search elements and then to compare the efficiency of our proposal with previous solution procedures.


European Journal of Operational Research | 2010

A branch and bound algorithm for the maximum diversity problem

Rafael Martí; Micael Gallego; Abraham Duarte

This article begins with a review of previously proposed integer formulations for the maximum diversity problem (MDP). This problem consists of selecting a subset of elements from a larger set in such a way that the sum of the distances between the chosen elements is maximized. We propose a branch and bound algorithm and develop several upper bounds on the objective function values of partial solutions to the MDP. Empirical results with a collection of previously reported instances indicate that the proposed algorithm is able to solve all the medium-sized instances (with 50 elements) as well as some large-sized instances (with 100 elements). We compare our method with the best previous linear integer formulation solved with the well-known software Cplex. The comparison favors the proposed procedure.


European Journal of Operational Research | 2015

Multiobjective GRASP with Path Relinking

Rafael Martí; Vicente Campos; Mauricio G. C. Resende; Abraham Duarte

In this paper we review and propose different adaptations of the GRASP metaheuristic to solve multiobjective combinatorial optimization problems. In particular, we describe several alternatives to specialize the construction and improvement components of GRASP when two or more objectives are considered. GRASP has been successfully coupled with Path Relinking for single-objective optimization. Moreover, we propose different hybridizations of GRASP and Path Relinking for multiobjective optimization. We apply the proposed GRASP with Path Relinking variants to two combinatorial optimization problems, the biobjective orienteering problem and the biobjective path dissimilarity problem. We report on empirical tests with 70 instances and 30 algorithms, that show that the proposed heuristics are competitive with the state-of-the-art methods for these problems.


Pattern Recognition Letters | 2006

Improving image segmentation quality through effective region merging using a hierarchical social metaheuristic

Abraham Duarte; Ángel Sánchez; Felipe Fernández; Antonio S. Montemayor

This paper proposes a new evolutionary region merging method in order to efficiently improve segmentation quality results. Our approach starts from an oversegmented image, which is obtained by applying a standard morphological watershed transformation on the original image. Next, each resulting region is represented by its centroid. The oversegmented image is described by a simplified undirected weighted graph, where each node represents one region and weighted edges measure the dissimilarity between pairs of regions (adjacent and non-adjacent) according to their intensities, spatial locations and original sizes. Finally, the resulting graph is iteratively partitioned in a hierarchical fashion into two subgraphs, corresponding to the two most significant components of the actual image, until a termination condition is met. This graph-partitioning task is solved by a variant of the min-cut problem (normalized cut) using a hierarchical social (HS) metaheuristic. We have efficiently applied the proposed approach to brightness segmentation on different standard test images, with good visual and objective segmentation quality results.


Journal of the Operational Research Society | 2013

Tabu Search with Strategic Oscillation for the Maximally Diverse Grouping Problem

Micael Gallego; Manuel Laguna; Rafael Martí; Abraham Duarte

We propose new heuristic procedures for the maximally diverse grouping problem (MDGP). This NP-hard problem consists of forming maximally diverse groups—of equal or different size—from a given set of elements. The most general formulation, which we address, allows for the size of each group to fall within specified limits. The MDGP has applications in academics, such as creating diverse teams of students, or in training settings where it may be desired to create groups that are as diverse as possible. Search mechanisms, based on the tabu search methodology, are developed for the MDGP, including a strategic oscillation that enables search paths to cross a feasibility boundary. We evaluate construction and improvement mechanisms to configure a solution procedure that is then compared to state-of-the-art solvers for the MDGP. Extensive computational experiments with medium and large instances show the advantages of a solution method that includes strategic oscillation.


Computers & Operations Research | 2012

Variable neighborhood search for the Vertex Separation Problem

Abraham Duarte; Laureano F. Escudero; Rafael Martí; Nenad Mladenović; Juan José Pantrigo; Jesús Sánchez-Oro

The Vertex Separation Problem belongs to a family of optimization problems in which the objective is to find the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others. All of these optimization problems are NP-hard and have practical applications in VLSI (Very Large Scale Integration), computer language compiler design or graph drawing. Up to know, they have been generally tackled with exact approaches, presenting polynomial-time algorithms to obtain the optimal solution for specific types of graphs. However, in spite of their practical applications, these problems have been ignored from a heuristic perspective, as far as we know. In this paper we propose a pure 0-1 optimization model and a metaheuristic algorithm based on the variable neighborhood search methodology for the Vertex Separation Problem on general graphs. Computational results show that small instances can be optimally solved with this optimization model and the proposed metaheuristic is able to find high-quality solutions with a moderate computing time for large-scale instances.


Computational Optimization and Applications | 2009

Hybrid heuristics for the maximum diversity problem

Micael Gallego; Abraham Duarte; Manuel Laguna; Rafael Martí

Abstract The maximum diversity problem presents a challenge to solution methods based on heuristic optimization. We undertake the development of hybrid procedures within the scatter search framework with the goal of uncovering the most effective designs to tackle this difficult but important problem. Our research revealed the effectiveness of adding simple memory structures (based on recency and frequency) to key scatter search mechanisms. Our extensive experiments and related statistical tests show that the most effective scatter search variant outperforms state-of-the-art methods.


Annals of Operations Research | 2011

Hybrid scatter tabu search for unconstrained global optimization

Abraham Duarte; Rafael Martí; Fred Glover; Francisco Gortázar

The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances in solution methods. We examine this problem within the framework of adaptive memory programming (AMP), focusing particularly on AMP strategies that derive from an integration of Scatter Search and Tabu Search. Computational comparisons involving 16 leading methods for multimodal function optimization, performed on a testbed of 64 problems widely used to calibrate the performance of such methods, disclose that our new Scatter Tabu Search (STS) procedure is competitive with the state-of-the-art methods in terms of the average optimality gap achieved.

Collaboration


Dive into the Abraham Duarte's collaboration.

Top Co-Authors

Avatar

Rafael Martí

King Juan Carlos University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Manuel Laguna

University of Colorado Boulder

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Eduardo G. Pardo

King Juan Carlos University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Micael Gallego

King Juan Carlos University

View shared research outputs
Top Co-Authors

Avatar

Ángel Sánchez

King Juan Carlos University

View shared research outputs
Top Co-Authors

Avatar

Nenad Mladenović

Serbian Academy of Sciences and Arts

View shared research outputs
Top Co-Authors

Avatar

Borja Menéndez

King Juan Carlos University

View shared research outputs
Researchain Logo
Decentralizing Knowledge