Solving Multi-Objective Hierarchical Hub Facility Location Problem Using GA-Based Approaches

Authors:

Abstract
Single-Allocation Hub Median Problem is a special type of Hierarchical Hub Location Problem where a demand node can directly communicate with one hub/ central hub node only. In this paper a Multi-Objective version of the Single-Allocation Hub Median Problem is explored with an attempt to minimize the overhead cost associated with the hub and central hub nodes in addition to the minimization of the total communication cost of the network. Here Non-dominated Sorting Genetic Algorithm-II is used to solve the problem as well as classical Genetic Algorithm is applied on each objective separately. Also resultant chromosome of Genetic Algorithm-based approach is used to solve the other objective as well. The results of these three approaches are reported in this paper and it is found that Non-dominated Sorting Genetic Algorithm-II performs reasonably well and its result in more than 86% cases deviates by less than 5% from the direct application of Genetic Algorithm on each objective separately.

This publication has 14 references indexed in Scilit: