A genetic algorithm for the uncapacitated single allocation planar hub location problem

Date

2015-10-01

Author

Damgacioglu, Haluk
DİNLER, DERYA
Özdemirel, Nur Evin
İyigün, Cem

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

18
views

0
downloads

Cite This

Given a set of n interacting points in a network, the hub location problem determines location of the hubs (transfer points) and assigns spokes (origin and destination points) to hubs so as to minimize the total transportation cost. In this study, we deal with the uncapacitated single allocation planar hub location problem (PHLP). In this problem, all flow between pairs of spokes goes through hubs, capacities of hubs are infinite, they can be located anywhere on the plane and are fully connected, and each spoke must be assigned to only one hub. We propose a mathematical formulation and a genetic algorithm (PHLGA) to solve PHLP in reasonable time. We test PHLGA on simulated and real life data sets. We compare our results with optimal solution and analyze results for special cases of PHLP for which the solution behavior can be predicted. Moreover, PHLGA results for the AP and CAB data set are compared with other heuristics.

Subject Keywords

Genetic algorithms, Hub location problems, Planar hub location problems

URI

https://hdl.handle.net/11511/48941

Collections

Department of Industrial Engineering, Article