Reginald Ankrah email@example.com
Introducing the dynamic customer location-allocation problem.
Ankrah, Reginald; Lacroix, Benjamin; McCall, John; Hardwick, Andrew; Conway, Anthony
Doctor Benjamin Lacroix firstname.lastname@example.org
John McCall email@example.com
In this paper, we introduce a new stochastic Location-Allocation Problem which assumes the movement of customers over time. We call this new problem Dynamic Customer Location-Allocation Problem (DC-LAP). The problem is based on the idea that customers will change locations over a defined horizon and these changes have to be taken into account when establishing facilities to service customers demands. We generate 1440 problem instances by varying the problem parameters of movement rate which determines the possible number of times a customer will change locations over the defined period, the number of facilities and the number of customers. We propose to analyse the characteristics of the instances generated by testing a search algorithm using the stochastic dynamic evaluation (based on the replication of customer movement scenarios) and a deterministic static evaluation (based on the assumption that customer will not move over time). We show that the dynamic approach obtains globally better results, but the performances are highly related to the parameters of the problem. Moreover, the dynamic approach involves a significantly high computational overhead.
|Start Date||Jun 10, 2019|
|Publication Date||Aug 8, 2019|
|Publisher||Institute of Electrical and Electronics Engineers|
|Institution Citation||ANKRAH, R., LACROIX, B., MCCALL, J., HARDWICK, A. and CONWAY, A. 2019. Introducing the dynamic customer location-allocation problem. In Proceedings of the 2019 Institute of Electrical and Electronics Engineers (IEEE) Congress on evolutionary computation (IEEE CEC 2019), 10-13 June 2019, Wellington, NZ. Piscataway: IEEE [online], pages 3157-3164. Available from: https://doi.org/10.1109/CEC.2019.8790150|
|Keywords||Dynamic customer location-allocation problem; Static approach; Dynamic approach; Population-based incremental learning algorithm; Simulation model|
ANKRAH 2019 Introducing the dynamic
You might also like
Ensemble selection based on classifier prediction confidence.
Limitations of benchmark sets and landscape features for algorithm selection and performance prediction.
On the definition of dynamic permutation problems under landscape rotation.
Multi-label classification via incremental clustering on an evolving data stream.
A holistic metric approach to solving the dynamic location-allocation problem.