A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem

DOI10.1016/j.ejor.2022.02.003OpenAlexW4210521040MaRDI QIDQ2672118

Shangce Gao, Xiao Yang, Ting Jin, Zheng Tang, Zonghui Cai

Publication date: 8 June 2022

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

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

zbMATH Keywords

heuristicslocal searchcrossoverdynamic population sizemaximally diverse grouping problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• final exam scheduling
• TPSDP

Cites Work

• Operational research in education
• Iterated maxima search for the maximally diverse grouping problem
• Constrained group balancing: why does it work
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
• An artificial bee colony algorithm for the maximally diverse grouping problem
• Variable neighborhood search for maximum diverse grouping problem
• An empirical comparison of heuristic methods for creating maximally diverse groups
• A class of bounded approximation algorithms for graph partitioning
• Design of balanced MBA student teams

This page was built for publication: A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem