Solving the uncapacitated multiple allocation p-hub center problem by genetic algorithm

Abstract

In this paper we describe a genetic algorithm (GA) for the uncapacitated multiple allocation p-hub center problem (UMApHCP). Binary coding is used and genetic operators adapted to the problem are constructed and implemented in our GA. Computational results are presented for the standard hub instances from the literature. It can be seen that proposed GA approach reaches all solutions that are proved to be optimal so far. The solutions are obtained in a reasonable amount of computational time, even for problem instances of higher dimensions.