Abstract

In this paper the Capacitated Single Allocation p-Hub Median Problem (CSApHMP) is considered. This problem has a wide range of applications within the design of telecommunication and transportation systems. A heuristic method, based on a genetic algorithm (GA) approach, is proposed for solving the CSApHMP. The described algorithm uses binary encoding and modified genetic operators. The caching technique is also implemented in the GA in order to improve its effectiveness. Computational experiments demonstrate that the GA method quickly reaches optimal solutions for hub instances with up to 50 nodes. The algorithm is also benchmarked on large scale hub instances with up to 200 nodes that are not solved to optimality so far.

Keywords

Cite this article

@article{cai-1663,
  author  = {Zorica Stanimirović},
  title   = {A Genetic Algorithm Approach for the Capacitated Single Allocation P-Hub Median Problem},
  journal = {Computing and Informatics},
  volume  = {29},
  number  = {1},
  pages   = {117--132},
  year    = {2010},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2010/1/a-genetic-algorithm-approach-for-the-capacitated-single-allocation-p-hub-median-problem/}
}
Download .bib