GRASP and path relinking for the max-min diversity problem

DOI10.1016/j.cor.2008.05.011zbMath1173.90521OpenAlexW2089088038MaRDI QIDQ1038285

Rafael Martí, Mauricio G. C. Resende, Abraham Duarte, Micael Gallego

Publication date: 17 November 2009

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

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

zbMATH Keywords

metaheuristicsGRASPpath relinkingadaptive memory programmingmax-min diversity problem

Mathematics Subject Classification ID

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

Related Items

Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem, Multiobjective GRASP with path relinking, VNS variants for the Max-Mean dispersion problem, An integer programming approach for solving the \(p\)-dispersion problem, A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems, GRASP and path relinking for the equitable dispersion problem, A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem, GRASP with evolutionary path-relinking for the capacitated arc routing problem, GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem, Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach, \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis, GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem, Heuristics for the capacitated modular hub location problem, Tabu search for the dynamic bipartite drawing problem, Variable neighborhood search for the vertex separation problem, A hybrid three-phase approach for the Max-Mean dispersion problem, A tabu search based memetic algorithm for the Max-Mean dispersion problem, A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem, Computing Minimum Dilation Spanning Trees in Geometric Graphs, An exact semidefinite programming approach for the max-mean dispersion problem, A biased random-key genetic algorithm for the tree of hubs location 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, Multi-objective variable neighborhood search: an application to combinatorial optimization problems, Heuristics for the capacitated dispersion problem, A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems, Formulations and valid inequalities for the capacitated dispersion problem, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, A GRASP with evolutionary path relinking for the truck and trailer routing problem, A simple and effective algorithm for the MaxMin diversity problem, Seeking global edges for traveling salesman problem in multi-start search, Memetic self-adaptive evolution strategies applied to the maximum diversity problem, Heuristic solution approaches for the maximum minsum dispersion problem, Effective metaheuristic algorithms for the minimum differential dispersion problem, Scatter search for the bandpass problem, Scatter search for the cutwidth minimization problem, Multistart search for the cyclic cutwidth minimization problem, Measuring diversity. A review and an empirical analysis, Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem, Construction and improvement algorithms for dispersion problems, The maximum diversity assortment selection problem, A heuristic approach for the max-min diversity problem based on max-clique, The equitable dispersion problem, Hybridizations of GRASP with path relinking for the far from most string problem, GRASP with path relinking heuristics for the antibandwidth problem, Metaheuristics—the metaphor exposed, Memory and Learning in Metaheuristics

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Good solutions to discrete noxious location problems via metaheuristics
• Tabu search and GRASP for the maximum diversity problem
• The discrete p-dispersion problem
• A probabilistic heuristic for a computationally difficult set covering problem
• Computational aspects of the maximum diversity problem
• Greedy randomized adaptive search procedures
• A hybrid heuristic for the \(p\)-median problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Principles of scatter search
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
• Convergence of an annealing algorithm
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Heuristic algorithms for the maximum diversity problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization