Racing strategy for the dynamic-customer location-allocation problem.
Ankrah, Reginald; Lacroix, Benjamin; McCall, John; Hardwick, Andrew; Conway, Anthony; Owusu, Gilbert
Professor John McCall email@example.com
In previous work, we proposed and studied a new dynamic formulation of the Location-allocation (LA) problem called the Dynamic-Customer Location-allocation (DC-LA) problem. DC-LA is based on the idea of changes in customer distribution over a defined period, and these changes have to be taken into account when establishing facilities to service changing customers distributions. This necessitated a dynamic stochastic evaluation function which came with a high computational cost due to a large number of simulations required in the evaluation process. In this paper, we investigate the use of racing, an approach used in model selection, to reduce the high computational cost by employing the minimum number of simulations for solution selection. Our adaptation of racing uses the Friedman test to compare solutions statistically. Racing allows simulations to be performed iteratively, ensuring that the minimum number of simulations is performed to detect a statistical difference. We present experiments using Population-Based Incremental Learning (PBIL) to explore the savings achievable from using racing in this way. Our results show that racing achieves improved cost savings over the dynamic stochastic evaluation function. We also observed that on average, the computational cost of racing was about 4.5 times lower than the computational cost of the full dynamic stochastic evaluation.
ANKRAH, R., LACROIX, B., MCCALL, J., HARDWICK, A., CONWAY, A. and OWUSU, G. 2020. Racing strategy for the dynamic-customer location-allocation problem. In Proceedings of 2020 Institute of Electrical and Electronics Engineers (IEEE) congress on evolutionary computation (IEEE CEC 2020), part of the 2020 (IEEE) World congress on computational intelligence (IEEE WCCI 2020) and co-located with the 2020 International joint conference on neural networks (IJCNN 2020) and the 2020 IEEE International fuzzy systems conference (FUZZ-IEEE 2020), 19-24 July 2020, Glasgow, UK [virtual conference]. Piscataway: IEEE [online], article 9185918. Available from: https://doi.org/10.1109/CEC48606.2020.9185918
|Conference Name||2020 Institute of Electrical and Electronics Engineers (IEEE) congress on evolutionary computation (IEEE CEC 2020), part of the 2020 (IEEE) World congress on computational intelligence (IEEE WCCI 2020) and co-located with the 2020 International joint conf|
|Conference Location||Glasgow, UK [virtual conference]|
|Start Date||Jul 19, 2020|
|End Date||Jul 24, 2020|
|Acceptance Date||Mar 20, 2020|
|Online Publication Date||Jul 24, 2020|
|Publication Date||Sep 3, 2020|
|Deposit Date||May 14, 2020|
|Publicly Available Date||May 14, 2020|
|Publisher||Institute of Electrical and Electronics Engineers|
|Keywords||Dynamic customer location-allocation (DCLA) problem; Robust optimisation over time (ROOT); Dynamic stochastic evaluation function; Population-based incremental learning algorithm (PBIL); Simulation model; Racing|
You might also like
Ensemble-based relationship discovery in relational databases.
Introducing the dynamic customer location-allocation problem.