A tabu search based memetic algorithm for the max-mean dispersion problem
نویسندگان
چکیده
منابع مشابه
A tabu search based memetic algorithm for the max-mean dispersion problem
Given a set V of n elements and a distance matrix [dij ]n×n among elements, the max-mean dispersion problem (MaxMeanDP) consists in selecting a subset M from V such that the mean dispersion (or distance) among the selected elements is maximized. Being a useful model to formulate several relevant applications, MaxMeanDP is known to be NP-hard and thus computationally di cult. In this paper, we p...
متن کاملOn memetic search for the max-mean dispersion problem
Given a set V of n elements and a distance matrix [dij ]n×n among elements, the max-mean dispersion problem (MaxMeanDP) consists in selecting a subset M from V such that the mean dispersion (or distance) among the selected elements is maximized. Being a useful model to formulate several relevant applications, MaxMeanDP is known to be NP-hard and thus computationally difficult. In this paper, we...
متن کاملTabu search for the Max-Mean Dispersion Problem
In this paper, we address a variant of a classical optimization problem in the context of selecting elements in a set, while maximizing their diversity. In particular, we maximize their mean dispersion. This NP-hard problem was recently introduced as the maximum mean dispersion problem (MaxMeanDP), and it models several real problems, from pollution control to capital investment or web page ran...
متن کاملMemetic search for the max-bisection problem
Given an undirected graph G = (V,E) with weights on the edges, the maxbisection problem (MBP) is to find a partition of the vertex set V into two subsets V1 and V2 of equal cardinality such that the sum of the weights of the edges crossing V1 and V2 is maximized. Relaxing the equal cardinality constraint leads to the maxcut problem (MCP). In this work, we present a memetic algorithm for MBP whi...
متن کاملA tabu search based memetic algorithm for the maximum diversity problem
This paper presents a highly effective memetic algorithm for the maximum diversity problem based on tabu search. The tabu search component uses a successive filter candidate list strategy and the solution combination component employs a combination operator based on identifying strongly determined and consistent variables. Computational experiments on three sets of 40 popular benchmark instance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2016
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.02.016