Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/2710
Title: | Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem | Authors: | Marić, Miroslav | Affiliations: | Informatics and Computer Science | Issue Date: | 2013 | Publisher: | Sofia : Institute of Mathematics and Informatics, Bulgarian Academy of Sciences | Journal: | Serdica Journal of Computing | Abstract: | In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results demonstrate that the proposed algorithm has reached optimal solutions on all 20 test instances for which optimal solutions are known, and this in short computational time. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/2710 | DOI: | 10.55630/sjc.2013.7.343-354 |
Appears in Collections: | Research outputs |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.