Back to search

Clemson University

METAHEURISTICS FOR HUB LOCATION MODELS

Abstract

dc:description.abstract

In this research, we propose metaheuristics for solving two p-hub median problems.. The first p-hub median problem, which is NP-hard, is the uncapacitated single p-hub median problem (USApHMP). In this problem, metaheuristics such as genetic algorithms, simulated annealing and tabu search, are applied in different types of representations. Caching is also applied to speed up computational time of the algorithms. The results clearly demonstrate that tabu search with a permutation solution representation, augmented with caching is the highest performing method, both in terms of solution quality and computational time among these algorithms for the USApHMP. We also investigate the performance of hybrid metaheuristics, formed by path-relinking augmentation of the three base algorithms (genetic algorithms, simulated annealing and tabu search). The results indicate that hybridrization with path-relinking improvees the performance of base algorithms except tabu search since a good base metaheuristic does not require path-relinking. For the second p-hub median problem, the NP-hard uncapacitated multiple p-hub median problem (UMApHMP), we proposed Multiple TS. We identify multiple nodes using the convex hull and methods derived from the tabu search for the USApMHP. We find optimal allocations using the Single Reallocation Exchange procedure, developed for the USApHMP. The results show that implementing tabu search with a geometric interpretation allows nearly all optimal solutions to be found.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (PhD)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Industrial Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sangsawang, Ornurai
Contributors dc:contributor
  • Kurz, Mary E
  • Cho , Byung R
  • Ferrell , William G
  • Mason , Scott J

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_dissertations/804

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Sangsawang, Ornurai. METAHEURISTICS FOR HUB LOCATION MODELS. Dissertation thesis, https://open.clemson.edu/all_dissertations/804