Authors: Mladenović, Nenad 
Todosijević, Raca 
Urošević, Dragan 
Affiliations: Computer Science 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Dispersion Problem Under Capacity and Cost Constraints: Multiple Neighborhood Tabu Search
Series/Report no.: Lecture Notes in Computer Science
Volume: 13367
First page: 108
Last page: 122
Conference: International Conference on Mathematical Optimization Theory and Operations Research MOTOR 2022: Mathematical Optimization Theory and Operations Research
Issue Date: 25-Jun-2022
Rank: M33
DOI: 10.1007/978-3-031-09607-5_8
Diversity and dispersion problems consists of selecting a subset of elements from a given set so that their diversity is maximized. The one of most recently proposed variant is the MaxMin dispersion problem with capacity and cost constraints. This variant usually called the generalized dispersion problem. In this paper we propose variant of tabu search based on multiple neighborhoods to solve large-size instances. Extensive numerical computational experiments are performed to compare our tabu search metaheuristic with the state-of-art heuristic. Results on public benchmark instances show the superiority of our proposal with respect to the previous algorithms.
Keywords: dispersion | diversity maximization | Metaheuristics | tabu search
Publisher: Springer Link
Project: Advanced artificial intelligence techniques for analysis and design of system components based on trustworthy BlockChain technology - AI4TrustBC 

Show full item record


checked on May 20, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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