文章基本信息

标题：Variable neighborhood search for maximum diverse grouping problem
本地全文：下载
作者：Urošević Dragan
期刊名称：Yugoslav Journal of Operations Research
印刷版ISSN：0354-0243
电子版ISSN：1820-743X
出版年度：2014
页码：3-3
DOI：10.2298/YJOR121223003U
出版社：Faculty of Organizational Sciences, Belgrade, Mihajlo Pupin Institute, Belgrade, Economics Institute, Belgrade, Faculty of Transport and Traffic Engineering, Belgrade, Faculty of Mechanical Engineering, Belgrade
摘要：
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. [Projekat Ministarstva nauke Republike Srbije, br. ON174010 i br. III44006]
关键词：combinatorial optimization; maximum diverse grouping; metaheuristics; variable neighborhood search