|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts
|Title:||Solving the Capacitated Dispersion Problem with variable neighborhood search approaches: From basic to skewed VNS||Journal:||Computers and Operations Research||Volume:||139||First page:||105622||Issue Date:||Mar-2022||Rank:||~M21||ISSN:||0305-0548||DOI:||10.1016/j.cor.2021.105622||Abstract:||
The topic of this paper is the Capacitated Dispersion Problem (CDP). To solve the problem, variable neighborhood search (VNS) based heuristics are proposed. The proposed heuristics are Basic VNS, General VNS and General Skewed VNS. Their performances are assessed on the benchmark instances from the literature and compared against the state-of-the-art ones. Comparing to the state-of-the-art results, it turns out that Basic VNS is able to provide competitive results, while General VNS and General Skewed VNS advance the state-of-the-art results by establishing 57 new best-known solutions on the data set of 100 instances. Twenty nine new best-known solutions are solely due to the proposed General Skewed VNS.
|Keywords:||Capacitated Dispersion Problem | Combinatorial optimization | Heuristics | Variable neighborhood search||Publisher:||Elsevier||Project:||Advanced artificial intelligence techniques for analysis and design of system components based on trustworthy BlockChain technology - AI4TrustBC|
Show full item record
checked on Apr 8, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.