Maxminmin p-dispersion problem: a variable neighborhood search approach

DOI10.1016/J.COR.2013.09.017zbMATH Open1348.90605OpenAlexW1999665594MaRDI QIDQ337222FDOQ337222

Authors: Behnaz Saboonchi, Pierre Hansen, Sylvain Perron 

Publication date: 10 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.017

Recommendations

• Publication:4887837
• Heuristic solution approaches for the maximum minsum dispersion problem
• Exact algorithms for the max-min dispersion problem
• VNS variants for the Max-Mean dispersion problem
• Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
• A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
• A hybrid heuristic for the maximum dispersion problem

zbMATH Keywords

combinatorial optimizationmetaheuristicsvariable neighborhood searchdispersion problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Variable neighborhood search
• Variable neighbourhood search: methods and applications
• Handbook of metaheuristics
• The discrete p-dispersion problem
• A heuristic approach for the max-min diversity problem based on max-clique
• GRASP and path relinking for the max-min diversity problem
• Heuristic and Special Case Algorithms for Dispersion Problems
• Variable neighborhood search for the heaviest \(k\)-subgraph
• A comparison of \(p\)-dispersion heuristics
• Comparison Of Four Models For dispersing Facilities
• A simple and effective algorithm for the MaxMin diversity problem

Cited In (7)

• Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
• Solving the maximum min-sum dispersion by alternating formulations of two different problems
• A new compact formulation for the discrete \(p\)-dispersion problem
• The conditional \(p\)-dispersion problem
• Heuristic solution approaches for the maximum minsum dispersion problem
• A tabu search based memetic algorithm for the Max-Mean dispersion problem
• The maximal dispersion problem and the ``first point outside the neighbourhood heuristic

This page was built for publication: Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach

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