Solving the capacitated single allocation hub location problem using genetic algorithm

Abstract

The aim of this study is to present a Genetic Algorithm (GA) for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) and to deiiionstrate its robustness aiid effectiveness for solving this problem. The apprcpriate objective function is correcting infeasible individuals to be feasible. These corrections are frequent in the initial population, so that in the subsequent generations genetic operators slightly violate the feasibility of individuals and the necessary corrections are rare. The solutions of proposed GA method are compared with the best solutions presented in the literature by considering various problem sizes of the AP data set.