A location-routing problem for the public bike-sharing system with service level

Yunfei Fang 1 Yan Song 1 Ding Chen 1 Peng Wu 1 Feng Chu 2
1 School of Economics Management
2 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
Abstract : This work studied a bike station location problem (BSLP) for the bike-sharing system. To promote the system, the problem aims at maximizing the service quality via optimal decision of locating the bike stations and design travel route for bike users. The service quality is evaluated by the satisfaction function which reflects the travel time of the bike journey. Then an integer programming model is formulated for the BSLP. To validate the proposed model, a commercial IP solver CPLEX is applied for solving it in extensive experiments. Computational results on sensitive analysis of parameters justify the correctness and effectiveness of the model. Moreover, useful remarks are drawn as suggestions for decision making of the location of bike-sharing system.
Keywords : Bike-sharing Integer programming Optimization Service quality Station location
Document type :
Conference papers
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-02471963
Contributor : Frédéric Davesne <>
Submitted on : Sunday, February 9, 2020 - 7:38:46 PM
Last modification on : Friday, February 14, 2020 - 1:33:06 AM

Identifiers

Collections

IBISC | IBISC-AROBAS | UNIV-PARIS-SACLAY | UNIV-EVRY

Citation

Yunfei Fang, Yan Song, Ding Chen, Peng Wu, Feng Chu. A location-routing problem for the public bike-sharing system with service level. International Conference on Industrial Engineering and Systems Management (IESM 2019 ), Sep 2019, Shanghai, China. pp.1--6, ⟨10.1109/IESM45758.2019.8948139⟩. ⟨hal-02471963⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

11

Contact

Informations

CCSD