Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem

Maric, Miroslav. "Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem." Serdica Journal of Computing 7.4 (2013): 343-354. <http://eudml.org/doc/268670>.

@article{Maric2013,
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.},
author = {Maric, Miroslav},
journal = {Serdica Journal of Computing},
keywords = {CSAHLP; VNS; CPLEX; Metaheuristic; Mathematical Optimization},
language = {eng},
number = {4},
pages = {343-354},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem},
url = {http://eudml.org/doc/268670},
volume = {7},
year = {2013},
}

TY - JOUR
AU - Maric, Miroslav
TI - Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem
JO - Serdica Journal of Computing
PY - 2013
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 7
IS - 4
SP - 343
EP - 354
AB - 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.
LA - eng
KW - CSAHLP; VNS; CPLEX; Metaheuristic; Mathematical Optimization
UR - http://eudml.org/doc/268670
ER -