Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem
Serdica Journal of Computing, Tome 7 (2013) no. 4, pp. 343-354
Cet article a éte moissonné depuis la source Bulgarian Digital Mathematics Library
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.
Keywords:
CSAHLP, VNS, CPLEX, Metaheuristic, Mathematical Optimization
@article{SJC_2013_7_4_a2,
author = {Maric, Miroslav},
title = {Variable {Neighborhood} {Search} for {Solving} the {Capacitated} {Single} {Allocation} {Hub} {Location} {Problem}},
journal = {Serdica Journal of Computing},
pages = {343--354},
year = {2013},
volume = {7},
number = {4},
language = {en},
url = {http://geodesic.mathdoc.fr/item/SJC_2013_7_4_a2/}
}
Maric, Miroslav. Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem. Serdica Journal of Computing, Tome 7 (2013) no. 4, pp. 343-354. http://geodesic.mathdoc.fr/item/SJC_2013_7_4_a2/