Dynamic optimization with restricted and unrestricted moves between changes: A study on the dynamic maximal covering location problem

JF Calderín, AD Masegosa… - 2016 IEEE Congress on …, 2016 - ieeexplore.ieee.org
2016 IEEE Congress on Evolutionary Computation (CEC), 2016ieeexplore.ieee.org
Adaptation to changes in real scenarios is not a “cost-free” operation. However, in general,
this is not considered in most of the studies done in dynamic optimization problems. Our
focus here is to analyse what happens when a relocation cost is added in the dynamic
maximal covering location problem, that is, when the adaptation to changes entails some
cost. Comparing two models with and without “cost-free” adaptation, respectively, we study
how much coverage is lost, how similar are the solutions obtained for both problems along …
Adaptation to changes in real scenarios is not a “cost-free” operation. However, in general, this is not considered in most of the studies done in dynamic optimization problems. Our focus here is to analyse what happens when a relocation cost is added in the dynamic maximal covering location problem, that is, when the adaptation to changes entails some cost. Comparing two models with and without “cost-free” adaptation, respectively, we study how much coverage is lost, how similar are the solutions obtained for both problems along the time and we preliminarily explore the relation between solution similarity and coverage differences.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果