Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/2418

 Title: Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem Authors: Maric, Miroslav Keywords: CSAHLPVNSCPLEXMetaheuristicMathematical Optimization Issue Date: 2013 Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences Citation: Serdica Journal of Computing, Vol. 7, No 4, (2013), 343p-354p 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: http://hdl.handle.net/10525/2418 ISSN: 1312-6555 Appears in Collections: Volume 7 Number 4

Files in This Item:

File Description SizeFormat