Performance analysis of GA and PBIL variants for real-world location-allocation problems.
MetadataShow full item record
ANKRAH, R., REGNIER-COUDERT, O., MCCALL, J., CONWAY, A. and HARDWICK, A. 2018. Performance analysis of GA and PBIL variants for real-world location-allocation problems. To be presented at the IEEE world congress on computational intelligence; IEEE congress on evolutionary computation (IEEE CEC 2018), 8-13 July 2018, Rio de Janeiro, Brazil.
The Uncapacitated Location-Allocation problem (ULAP) is a major optimisation problem concerning the determination of the optimal location of facilities and the allocation of demand to them. In this paper, we present two novel problem variants of Non-Linear ULAP motivated by a real-world problem from the telecommunication industry: Uncapacitated Location-Allocation Resilience problem (ULARP) and Uncapacitated Location-Allocation Resilience problem with Restrictions (ULARPR). Problem sizes ranging from 16 to 100 facilities by 50 to 10000 demand points are considered. To solve the problems, we explore the components and configurations of four Genetic Algorithms , ,  and  selected from the ULAP literature. We aim to understand the contribution each choice makes to the GA performance and so hope to design an Optimal GA configuration for the novel problems.We also conduct comparative experiments with Population-Based Incremental Learning (PBIL) Algorithm on ULAP. We show the effectiveness of PBIL and GA with parameter set: random and heuristic initialisation, tournament and fined grained tournament selection, uniform crossover and bitflip mutation in solving the proposed problems.