A VNS-Based Matheuristic to Solve the Districting Problem in Bicycle-Sharing Systems

Guillermo Cabrera-Guerrero; Aníbal Álvarez; Joaquín Vásquez; Pablo A. Maya Duque; Lucas Villavicencio

doi:10.3390/math10224175

A VNS-Based Matheuristic to Solve the Districting Problem in Bicycle-Sharing Systems

Guillermo Cabrera-Guerrero, Aníbal Álvarez, Joaquín Vásquez, Pablo A. Maya Duque, Lucas Villavicencio

SCHOOL OF COMPUTER ENGINEERING

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

A matheuristic approach that combines a reduced variable neighbourhood search (rVNS) algorithm and a mathematical programming (MP) solver to solve a novel model for the districting problem in a public bicycle-sharing system is presented. The problem is modelled as an integer programming problem. While the rVNS algorithm aims to find a high-quality set of centres for the repositioning zones, the MP solver computes the optimal allocation network of the stations to the centres of the repositioning zones. We use a predefined grid to reduce the search space the rVNS needs to explore. The proposed approach obtains promising results for small and medium-sized instances, and is also able to handle large-sized models.

Original language	English
Article number	4175
Journal	Mathematics
Volume	10
Issue number	22
DOIs	https://doi.org/10.3390/math10224175
State	Published - Nov 2022

Keywords

balancing strategy
bicycle-sharing system
demand zone
mathematical programming
repositioning zone
variable neighbourhood search

Access to Document

10.3390/math10224175

Cite this

@article{31cbb88f966e47acb3786115841bc8b4,

title = "A VNS-Based Matheuristic to Solve the Districting Problem in Bicycle-Sharing Systems",

abstract = "A matheuristic approach that combines a reduced variable neighbourhood search (rVNS) algorithm and a mathematical programming (MP) solver to solve a novel model for the districting problem in a public bicycle-sharing system is presented. The problem is modelled as an integer programming problem. While the rVNS algorithm aims to find a high-quality set of centres for the repositioning zones, the MP solver computes the optimal allocation network of the stations to the centres of the repositioning zones. We use a predefined grid to reduce the search space the rVNS needs to explore. The proposed approach obtains promising results for small and medium-sized instances, and is also able to handle large-sized models.",

keywords = "balancing strategy, bicycle-sharing system, demand zone, mathematical programming, repositioning zone, variable neighbourhood search",

author = "Guillermo Cabrera-Guerrero and An{\'i}bal {\'A}lvarez and Joaqu{\'i}n V{\'a}squez and {Maya Duque}, {Pablo A.} and Lucas Villavicencio",

note = "Publisher Copyright: {\textcopyright} 2022 by the authors.",

year = "2022",

month = nov,

doi = "10.3390/math10224175",

language = "English",

volume = "10",

journal = "Mathematics",

issn = "2227-7390",

publisher = "MDPI AG",

number = "22",

}

TY - JOUR

T1 - A VNS-Based Matheuristic to Solve the Districting Problem in Bicycle-Sharing Systems

AU - Cabrera-Guerrero, Guillermo

AU - Álvarez, Aníbal

AU - Vásquez, Joaquín

AU - Maya Duque, Pablo A.

AU - Villavicencio, Lucas

PY - 2022/11

Y1 - 2022/11

N2 - A matheuristic approach that combines a reduced variable neighbourhood search (rVNS) algorithm and a mathematical programming (MP) solver to solve a novel model for the districting problem in a public bicycle-sharing system is presented. The problem is modelled as an integer programming problem. While the rVNS algorithm aims to find a high-quality set of centres for the repositioning zones, the MP solver computes the optimal allocation network of the stations to the centres of the repositioning zones. We use a predefined grid to reduce the search space the rVNS needs to explore. The proposed approach obtains promising results for small and medium-sized instances, and is also able to handle large-sized models.

AB - A matheuristic approach that combines a reduced variable neighbourhood search (rVNS) algorithm and a mathematical programming (MP) solver to solve a novel model for the districting problem in a public bicycle-sharing system is presented. The problem is modelled as an integer programming problem. While the rVNS algorithm aims to find a high-quality set of centres for the repositioning zones, the MP solver computes the optimal allocation network of the stations to the centres of the repositioning zones. We use a predefined grid to reduce the search space the rVNS needs to explore. The proposed approach obtains promising results for small and medium-sized instances, and is also able to handle large-sized models.

KW - balancing strategy

KW - bicycle-sharing system

KW - demand zone

KW - mathematical programming

KW - repositioning zone

KW - variable neighbourhood search

UR - http://www.scopus.com/inward/record.url?scp=85142493472&partnerID=8YFLogxK

U2 - 10.3390/math10224175

DO - 10.3390/math10224175

M3 - Article

AN - SCOPUS:85142493472

SN - 2227-7390

VL - 10

JO - Mathematics

JF - Mathematics

IS - 22

M1 - 4175

ER -

A VNS-Based Matheuristic to Solve the Districting Problem in Bicycle-Sharing Systems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this