An artificial bee colony algorithm for the maximally diverse grouping problem
From MaRDI portal
Publication:2510152
DOI10.1016/j.ins.2012.12.020zbMath1293.90085OpenAlexW2023502410MaRDI QIDQ2510152
Jonathan D. González-Barrera, Manuel Lozano, Francisco J. Rodriguez, Carlos García-Martínez
Publication date: 1 August 2014
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2012.12.020
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (13)
Heuristic search to the capacitated clustering problem ⋮ Iterated maxima search for the maximally diverse grouping problem ⋮ A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem ⋮ The balanced maximally diverse grouping problem with attribute values ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ The balanced maximally diverse grouping problem with integer attribute values ⋮ Solving the capacitated clustering problem with variable neighborhood search ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects ⋮ Estimation of distribution algorithm for a class of nonlinear bilevel programming problems ⋮ A mixed integer programming formulation and solution for traffic analysis zone delineation considering zone amount decision ⋮ On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation ⋮ Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping ⋮ A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values
Uses Software
This page was built for publication: An artificial bee colony algorithm for the maximally diverse grouping problem
