A Matheuristic Approach Based on Variable Neighborhood Search for the Static Repositioning Problem in Station-Based Bike-Sharing Systems
In this paper, we study a novel <i>static bike-sharing repositioning problem</i>. 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 retur...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-11-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/12/22/3573 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850226781244620800 |
|---|---|
| author | Julio Mario Daza-Escorcia David Álvarez-Martínez |
| author_facet | Julio Mario Daza-Escorcia David Álvarez-Martínez |
| author_sort | Julio Mario Daza-Escorcia |
| collection | DOAJ |
| description | In this paper, we study a novel <i>static bike-sharing repositioning problem</i>. 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 <i>repositioning problem</i> 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 <i>matheuristic</i> based on a <i>variable neighborhood search</i> combined with several improving algorithms, including an <i>integer linear programming model</i> to optimize loading instructions. The algorithm was tested in instances based on real-world data and could find good solutions in reasonable computing times. |
| format | Article |
| id | doaj-art-c6f40f06e4c240b0bf9888ac6bdeea28 |
| institution | OA Journals |
| issn | 2227-7390 |
| language | English |
| publishDate | 2024-11-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj-art-c6f40f06e4c240b0bf9888ac6bdeea282025-08-20T02:04:58ZengMDPI AGMathematics2227-73902024-11-011222357310.3390/math12223573A Matheuristic Approach Based on Variable Neighborhood Search for the Static Repositioning Problem in Station-Based Bike-Sharing SystemsJulio Mario Daza-Escorcia0David Álvarez-Martínez1Grupo 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, ColombiaGrupo 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, ColombiaIn this paper, we study a novel <i>static bike-sharing repositioning problem</i>. 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 <i>repositioning problem</i> 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 <i>matheuristic</i> based on a <i>variable neighborhood search</i> combined with several improving algorithms, including an <i>integer linear programming model</i> to optimize loading instructions. The algorithm was tested in instances based on real-world data and could find good solutions in reasonable computing times.https://www.mdpi.com/2227-7390/12/22/3573vehicle routing problemstatic bike-sharing repositioning problemmatheuristic based on variable neighborhood search |
| spellingShingle | Julio Mario Daza-Escorcia David Álvarez-Martínez A Matheuristic Approach Based on Variable Neighborhood Search for the Static Repositioning Problem in Station-Based Bike-Sharing Systems Mathematics vehicle routing problem static bike-sharing repositioning problem matheuristic based on variable neighborhood search |
| title | A Matheuristic Approach Based on Variable Neighborhood Search for the Static Repositioning Problem in Station-Based Bike-Sharing Systems |
| title_full | A Matheuristic Approach Based on Variable Neighborhood Search for the Static Repositioning Problem in Station-Based Bike-Sharing Systems |
| title_fullStr | A Matheuristic Approach Based on Variable Neighborhood Search for the Static Repositioning Problem in Station-Based Bike-Sharing Systems |
| title_full_unstemmed | A Matheuristic Approach Based on Variable Neighborhood Search for the Static Repositioning Problem in Station-Based Bike-Sharing Systems |
| title_short | A Matheuristic Approach Based on Variable Neighborhood Search for the Static Repositioning Problem in Station-Based Bike-Sharing Systems |
| title_sort | matheuristic approach based on variable neighborhood search for the static repositioning problem in station based bike sharing systems |
| topic | vehicle routing problem static bike-sharing repositioning problem matheuristic based on variable neighborhood search |
| url | https://www.mdpi.com/2227-7390/12/22/3573 |
| work_keys_str_mv | AT juliomariodazaescorcia amatheuristicapproachbasedonvariableneighborhoodsearchforthestaticrepositioningprobleminstationbasedbikesharingsystems AT davidalvarezmartinez amatheuristicapproachbasedonvariableneighborhoodsearchforthestaticrepositioningprobleminstationbasedbikesharingsystems AT juliomariodazaescorcia matheuristicapproachbasedonvariableneighborhoodsearchforthestaticrepositioningprobleminstationbasedbikesharingsystems AT davidalvarezmartinez matheuristicapproachbasedonvariableneighborhoodsearchforthestaticrepositioningprobleminstationbasedbikesharingsystems |