A tabu search based memetic algorithm for the Max-Mean dispersion problem

DOI10.1016/j.cor.2016.02.016zbMath1349.90860arXiv1503.00980OpenAlexW2292206207MaRDI QIDQ342388

Xiangjing Lai, Jin-Kao Hao

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.00980

zbMATH Keywords

heuristicstabu searchdispersion problemmemetic algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (11)

Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables ⋮ Tabu search guided by reinforcement learning for the max-mean dispersion problem ⋮ An exact semidefinite programming approach for the max-mean dispersion 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 ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem ⋮ Methods for improving the efficiency of swarm optimization algorithms. A survey ⋮ Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem ⋮ A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• GRASP and path relinking for the equitable dispersion problem
• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
• A hybrid three-phase approach for the Max-Mean dispersion problem
• A simple and effective algorithm for the MaxMin diversity problem
• Construction and improvement algorithms for dispersion problems
• An efficient memetic algorithm for the graph partitioning problem
• Tabu search and GRASP for the maximum diversity problem
• Tabu search versus GRASP for the maximum diversity problem
• A heuristic approach for the max-min diversity problem based on max-clique
• The equitable dispersion problem
• GRASP and path relinking for the max-min diversity problem
• A hybrid metaheuristic method for the maximum diversity problem
• A branch and bound algorithm for the maximum diversity problem
• Iterated tabu search for the maximum diversity problem
• A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem
• Heuristic algorithms for the maximum diversity problem
• A Gentle Introduction to Memetic Algorithms

This page was built for publication: A tabu search based memetic algorithm for the Max-Mean dispersion problem