Genetic Algorithm for Solving Uncapacitated Multiple Allocation Hub Location Problem
Keywords:Hub location problem, genetic algorithms, evolutionary computation, discrete location and assignment, network design, combinatorial optimization
AbstractHub location problems are widely used for network designing. Many variations of these problems can be found in the literature. In this paper we deal with the uncapacitated multiple allocation hub location problem (UMAHLP). We propose a genetic algorithm (GA) for solving UMAHLP that uses binary encoding and genetic operators adapted to the problem. Overall performance of GA implementation is improved by caching technique. We present the results of our computational experience on standard ORLIB instances with up to 200 nodes. The results show that GA approach quickly reaches all optimal solutions that are known so far and also gives results on some large-scale instances that were unsolved before.
Download data is not yet available.
How to Cite
Kratica, J., Stanimirović, Z., Tošić, D., & Filipović, V. (2012). Genetic Algorithm for Solving Uncapacitated Multiple Allocation Hub Location Problem. COMPUTING AND INFORMATICS, 24(4), 415–426. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/387