Tabu search and GRASP for the maximum diversity problem
From MaRDI portal
Publication:857362
DOI10.1016/j.ejor.2006.01.021zbMath1109.90081OpenAlexW2009273111MaRDI QIDQ857362
Publication date: 14 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.01.021
Nonconvex programming, global optimization (90C26) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Heuristic search to the capacitated clustering problem, VNS variants for the Max-Mean dispersion problem, A branch and bound algorithm for the maximum diversity problem, Iterated tabu search for the maximum diversity problem, Multiple-path selection for new highway alignments using discrete algorithms, Iterated maxima search for the maximally diverse grouping problem, GRASP and path relinking for the equitable dispersion problem, Generalized route planning model for hazardous material transportation with VaR and equity considerations, A tabu search based memetic algorithm for the Max-Mean dispersion problem, Hybrid heuristics for the maximum diversity problem, A review on discrete diversity and dispersion maximization from an OR perspective, A two-phase tabu search based evolutionary algorithm for the maximum diversity problem, A two-stage method for member selection of emergency medical service, Heuristics for the capacitated dispersion problem, Approaching the rank aggregation problem by local search-based metaheuristics, Formulations and valid inequalities for the capacitated dispersion problem, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem, A simple and effective algorithm for the MaxMin diversity problem, Memetic self-adaptive evolution strategies applied to the maximum diversity problem, Solving the capacitated clustering problem with variable neighborhood search, \(t\)-linearization for 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, Black box scatter search for general classes of binary optimization problems, Iterated greedy for the maximum diversity problem, Measuring diversity. A review and an empirical analysis, 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, Variable neighborhood search for the heaviest \(k\)-subgraph, Heuristics for the bi-objective path dissimilarity problem, GRASP and path relinking for the max-min diversity problem, A hybrid metaheuristic method for the maximum diversity problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Computational aspects of the maximum diversity problem
- Greedy randomized adaptive search procedures
- Scatter search. Methodology and implementation in C. With CD-ROM.
- A discrete optimization model for preserving biological diversity
- Heuristic algorithms for the maximum diversity problem
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
