A hybrid metaheuristic method for the maximum diversity problem

DOI10.1016/J.EJOR.2013.06.002MaRDI QIDQ2356110zbMATH OpenOpenAlexFDO

Authors Qinghua Wu, Jin-Kao Hao

Publication date 28 July 2015

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2013.06.002

zbMATH Keywords

constrained neighborhoodlocal searchmaximum diversity problempopulation diversitysolution combination

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A branch and bound algorithm for the maximum diversity problem
• A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
• Tabu search and GRASP for the maximum diversity problem
• A simple and effective algorithm for the MaxMin diversity problem
• Iterated tabu search for the maximum diversity problem

Cites work

• A branch and bound algorithm for the maximum diversity problem
• A hybrid metaheuristic approach to solving the UBQP problem
• A method for member selection of cross-functional teams using the individual and collaborative performances
• An application of tabu search heuristic for the maximum edge-weighted subgraph problem
• An efficient memetic algorithm for the graph partitioning problem
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
• Approximation algorithms for dispersion problems
• Approximation algorithms for maximum dispersion
• Black box scatter search for general classes of binary optimization problems
• Comparison Of Four Models For dispersing Facilities
• Computational aspects of the maximum diversity problem
• Experimental and Efficient Algorithms
• Fundamentals of scatter search and path relinking
• Good solutions to discrete noxious location problems via metaheuristics
• Heuristic algorithms for the maximum diversity problem
• Heuristic and Special Case Algorithms for Dispersion Problems
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• Hybrid heuristics for the maximum diversity problem
• Iterated greedy for the maximum diversity problem
• Iterated tabu search for the maximum diversity problem
• Memetic search for the max-bisection problem
• Obtaining test problems via Internet
• Optimal results and tight bounds for the Maximum Diversity Problem
• Recent advances in memetic algorithms.
• Solving the maximum edge weight clique problem via unconstrained quadratic programming
• Tabu search and GRASP for the maximum diversity problem
• Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
• Tabu search versus GRASP for the maximum diversity problem
• The dense \(k\)-subgraph problem
• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
• The equitable dispersion problem
• Variable neighborhood search for the heaviest \(k\)-subgraph

Cited in

(29)

• Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report
• GRASP and path relinking for the max-min diversity problem
• Computational aspects of the maximum diversity problem
• Heuristic search to the capacitated clustering problem
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
• The balanced maximally diverse grouping problem with block constraints
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
• Maximization problems of balancing submodular relevance and supermodular diversity
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
• t-linearization for the maximum diversity problem
• Iterated greedy for the maximum diversity problem
• Iterated tabu search for the maximum diversity problem
• Memetic self-adaptive evolution strategies applied to the maximum diversity problem
• A review on algorithms for maximum clique problems
• Hybrid heuristics for the maximum diversity problem
• A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
• A review on discrete diversity and dispersion maximization from an OR perspective
• A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem
• A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
• A three-phased local search approach for the clique partitioning problem
• Optimal results and tight bounds for the Maximum Diversity Problem
• A tabu search based memetic algorithm for the Max-Mean dispersion problem
• Heuristic algorithms for the maximum diversity problem
• Experimental and Efficient Algorithms
• Discrete Diversity and Dispersion Maximization
• A simple and effective algorithm for the MaxMin diversity problem
• Construction and improvement algorithms for dispersion problems
• Tabu search and GRASP for the maximum diversity problem
• Tabu search versus GRASP for the maximum diversity problem

Describes a project that uses

Uses Software

• Scatter Search
• Tabu search

This page was built for publication: A hybrid metaheuristic method for the maximum diversity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2356110)