Authors: Radanović, Luka
Mijović, Ana
Urošević, Dragan 
Davidović, Tatjana 
Jovanović, Raka
Affiliations: Computer Science 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: General Variable Neighborhood Search for Maximum Diversity Problem with Capacity and Budget Constraints
Journal: Expert Systems with Applications
First page: 126188
Issue Date: 2024
Rank: ~M21a
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2024.126188
Abstract: 
We consider a resource allocation problem, referred to as the Maximum Diversity Problem with Capacity and Budget Constraints. It involves establishing some facilities in such a way that the distance between the two closest established facilities is maximized. The number of facilities to be established is not predefined. We developed a General Variable Neighborhood Search (GVNS) approach that uses ...
Keywords: Resource allocation | Mixed-integer programming formulation | Exact solver | Metaheuristic approach | Multiple neighborhoods
Publisher: Elsevier
Project: The research has been partially supported by the Serbian Ministry of Science, Technological Development, and Innovations , Agreement No. 451-03-66/2024-03/200029. Experimental evaluations were conducted on the AI Platform of the Serbian National Data Center.

Show full item record

Page view(s)

17
checked on Jan 31, 2025

Google ScholarTM

Check


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