Hub location problem is an NP-hard problem that frequently arises in the
design of transportation and distribution systems, postal delivery networks, and
airline passenger flow. This work focuses on the Single Allocation Hub Location Problem (SAHLP). Genetic Algorithms (GAs) for the capacitated and uncapacitated variants of the SAHLP based on new chromosome representations and
crossover operators are explored. The GAs is tested on two well-known sets of
real-world problems with up to 200 nodes. The obtained results are very promising. For most of the test problems the GA obtains improved or best-known solutions and the computational time remains low. The proposed GAs can easily be
extended to other variants of location problems arising in network design planning
in transportation systems
