Authors: Urošević, Dragan 
Title: Variable neighborhood search for maximum diverse grouping problem
Journal: Yugoslav Journal of Operations Research
Volume: 24
Issue: 1
First page: 21
Last page: 33
Issue Date: 1-Jan-2014
Rank: M51
ISSN: 0354-0243
DOI: 10.2298/YJOR121223003U
This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the maximum diversity problem taken from the literature show that the results obtained by GVNS consistently outperform the best heuristics from the literature.
Keywords: Combinatorial optimization | Maximum Diverse Grouping | Metaheuristics | Variable Neighborhood Search
Publisher: Faculty of Organizational Sciences, University of Belgrade
Project: Mathematical Modelas and Optimization Methods on Large-Scale Systems 
Development of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education 

Show full item record


checked on Apr 17, 2024

Page view(s)

checked on Apr 16, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.