View article

Maximal covering location problems have efficiently been solved using evolutionary computation. The multi-stage placement of charging stations for electric cars is an instance of this problem which is addressed in this study. It is particularly challenging, because a final solution is constructed in multiple steps, stations cannot be relocated easily and intermediate solutions should be optimal with respect to certain objectives. This paper is an extended version of work published in Spieker et al. (Innovations in intelligent systems and applications (INISTA), 2015 international symposium on. IEEE, pp 1–7, 2015). In this work, it was shown that through problem decomposition, an incremental genetic algorithm benefits from having multiple intermediate stages. On the other hand, a decremental strategy does not profit from reduced computational complexity. We extend our previous work by including multi-objective …