We propose new heuristic procedures for the maximally diverse grouping problem (MDGP). This NP-hard problem consists of forming maximally diverse groups—of equal or different size—from a given set of elements. The most general formulation, which we address, allows for the size of each group to fall within specified limits. The MDGP has applications in academics, such as creating diverse teams of students, or in training settings where it may be desired to create groups that are as diverse as possible. Search mechanisms, based on the tabu search methodology, are developed for the MDGP, including a strategic oscillation that enables search paths to cross a feasibility boundary. We evaluate construction and improvement mechanisms to configure a solution procedure that is then compared to state-of-the-art solvers for the MDGP. Extensive computational experiments with medium and large instances show the advantages of a solution method that includes strategic oscillation.

M Gallego

M Laguna

R Martí

A Duarte

Journal of the Operational Research Society

JORS 是运筹学协会的官方期刊，发表原创研究论文，涵盖 OR 的理论、实践、历史或方法。

The Journal of the Operational Research Society is the official journal of the Operational Research Society, publishing original research papers that cover the theory, practice, history, and methodology of operational research.

《Journal of the Operational Research Society》是运筹学协会的官方期刊，发表原创研究论文，涵盖运筹学的理论、实践、历史和方法。

Tabu search with strategic oscillation for the maximally diverse grouping problem

Search mechanisms, based on the tabu search methodology, are developed for the maximally diverse grouping problem, including a strategic oscillation that enables search paths to cross a feasibility boundary.

Category	Quartile
管理学	4
管理学, 运筹学与管理科学	3
管理学, 管理学	4

Tabu search with strategic oscillation for the maximally diverse grouping problem

ivySCI AI Smartly Parses PDF, Answers Researchers' Questions, and Helps You Understand Papers in Seconds

Journal Info

Category	Quartile
OPERATIONS RESEARCH & MANAGEMENT SCIENCE	2