Effective metaheuristic algorithms for the minimum differential dispersion problem

DOI10.1016/j.ejor.2016.10.035zbMath1394.90584OpenAlexW2535423790MaRDI QIDQ1751715

Yang Wang, Qinghua Wu, Fred Glover

Publication date: 25 May 2018

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

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

zbMATH Keywords

combinatorial optimizationmetaheuristicstabu searchmemetic searchdispersion problems

Mathematics Subject Classification ID

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

Related Items

Tabu search guided by reinforcement learning for the max-mean dispersion problem, Bi-objective optimization of biclustering with binary data, A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem, Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS, A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem, A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment, A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem, Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem, Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem, The balanced maximally diverse grouping problem with block constraints, A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem

Uses Software

• PERL
• Scatter Search
• TTTPLOTS
• Tabu search

Cites Work

• Unnamed Item
• GRASP and path relinking for the equitable dispersion problem
• A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times
• A tabu search/path relinking algorithm to solve the job shop scheduling problem
• A simple and effective algorithm for the MaxMin diversity problem
• Good solutions to discrete noxious location problems via metaheuristics
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• Tabu search and GRASP for the maximum diversity problem
• The discrete p-dispersion 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 note on hashing functions and tabu search algorithms
• Path relinking for unconstrained binary quadratic programming
• The quadratic balanced optimization problem
• A user's guide to tabu search
• Hashing vectors for tabu search
• TTT plots: a perl program to create time-to-target plots
• Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
• A review on algorithms for maximum clique problems
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• The Sharing Problem
• The Knapsack Sharing Problem
• Heuristic algorithms for the maximum diversity problem