Overview of a Modified Genetic Algorithm on Single Allocation Hub Location Problem Optimisation

The logical connections between multiple service receivers and a servicing hub equate to a single allocation hub location problem (SAHLP) of hub-spoke networks.Many relevant research works affirmed SAHLP optimisation as a non-deterministic polynomial (NP) problem.Hence, genetic algorithm (GA) was utilised in solving such NP optimisation problems.In this work, genetic algorithm (GA) was modified to optimise the number of hubs to be activated to provide demanded services for spokes in their proximity.The chromosome for the modified GA (MGA) model have a length equal to number of hubs in a sample space.Furthermore, the fitness function utilised for the evaluation of the solution of the MGA was the objective function for the SAHLP optimisation.The fitness function of the MGA-SAHLP model have two parts -the spoke's demand and hub setup cost functions -with their respective weights.The developed MGA-SAHLP model was implemented using Matlab 2023.The Simulations were carried out using randomly generated demands from spokes, setup cost of hubs, locations of hubs and spokes, and other required parameters by the model.The overview of the results obtained were presented.It was observed that the weight of the demand function has greater effect in determining the convergent time and the number of activated hubs.The MGA-SAHLP model is applicable in economical setting up of customer support service systems that considers magnitude of customer's demands, proximity of customers to service centers and cost of establishing the service centers as obtained in electronic telecommunication networks and customer support services.