摘要

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 oil a genetic algorithm (CA) approach, is proposed for solving the CSApHMP The described algorithm uses bunny encoding and modified genetic opt:micas The caching technique is also implemented in the GA in older to improve its effectiveness Computational experiments demolish ate that the GA method quickly leaches optimal solutions for hub instances with up to 50 nodes The algorithm also benchmarked on scale hub instances with up to 200 nodes that are not solved to optimality so fat.

  • 出版日期2010