Using metaheuristics for the location of bicycle stations
<|reference_start|>Using metaheuristics for the location of bicycle stations: In this work, we solve the problem of finding the best locations to place stations for depositing/collecting shared bicycles. To do this, we model the problem as the p-median problem, that is a major existing localization problem in optimization. The p-median problem seeks to place a set of facilities (bicycle stations) in a way that minimizes the distance between a set of clients (citizens) and their closest facility (bike station). We have used a genetic algorithm, iterated local search, particle swarm optimization, simulated annealing, and variable neighbourhood search, to find the best locations for the bicycle stations and study their comparative advantages. We use irace to parameterize each algorithm automatically, to contribute with a methodology to fine-tune algorithms automatically. We have also studied different real data (distance and weights) from diverse open data sources from a real city, Malaga (Spain), hopefully leading to a final smart city application. We have compared our results with the implemented solution in Malaga. Finally, we have analyzed how we can use our proposal to improve the existing system in the city by adding more stations.<|reference_end|>
@article{cintrano2024using,
    title={Using metaheuristics for the location of bicycle stations},
    author={Christian Cintrano, Francisco Chicano, Enrique Alba},
    journal={Expert Syst. Appl. 161: 113684 (2020)},
    year={2024},
    doi={10.1016/j.eswa.2020.113684},
    archivePrefix={arXiv},
    eprint={2402.03945},
    primaryClass={cs.NE}
}