EconPapers    
Economics at your fingertips  
 

A Matheuristic Approach Based on Variable Neighborhood Search for the Static Repositioning Problem in Station-Based Bike-Sharing Systems

Julio Mario Daza-Escorcia () and David Álvarez-Martínez
Additional contact information
Julio Mario Daza-Escorcia: Grupo PyLO Producción y Logística, Industrial Engineering Department, Universidad de los Andes, Cra. 1 No 18a–12 Edif. Mario Laserna Pinzón, Bogota 111711, Colombia
David Álvarez-Martínez: Grupo PyLO Producción y Logística, Industrial Engineering Department, Universidad de los Andes, Cra. 1 No 18a–12 Edif. Mario Laserna Pinzón, Bogota 111711, Colombia

Mathematics, 2024, vol. 12, issue 22, 1-30

Abstract: In this paper, we study a novel static bike-sharing repositioning problem . There is a set of stations spread over a given area, each containing a number of operative bikes, damaged bikes, and free slots. The customers may pick up an operative bike from a station, use it, and return it to another station. Each station should have a target number of operative bikes to make it likely to meet customer demands. Furthermore, the damaged bikes should be removed from the stations. Given a fleet of available vehicles, the repositioning problem consists of designing the vehicles’ routes and calculating the number of operative (usable) and damaged (unusable) bikes that will be moved (loading instructions/loading policy) between stations and/or the depot. The objective is to minimize the weighted sum of the deviation from the target number of bikes for each station, the number of damaged bikes not removed, and the total time used by vehicles. To solve this problem, we propose a matheuristic based on a variable neighborhood search combined with several improving algorithms, including an integer linear programming model to optimize loading instructions. The algorithm was tested in instances based on real-world data and could find good solutions in reasonable computing times.

Keywords: vehicle routing problem; static bike-sharing repositioning problem; matheuristic based on variable neighborhood search (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/22/3573/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/22/3573/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:22:p:3573-:d:1521917

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().

 
Page updated 2025-03-19
Handle: RePEc:gam:jmathe:v:12:y:2024:i:22:p:3573-:d:1521917