Local Search Method for Multiple-Vehicle Bike Sharing System Routing Problem

To find the shortest tour of a transporting vehicle in a bike sharing system (BSS), a bike sharing system routing problem (BSSRP) has been proposed. In the BSSRP, a single vehicle restores the number of bicycles in stations. However, in a real system, the restoration of the number of the bicycles in...

Full description

Saved in:
Bibliographic Details
Published inJournal of Signal Processing Vol. 22; no. 4; pp. 157 - 160
Main Authors Tsushima, Honami, Matsuura, Takafumi, Jin'no, Kenya
Format Journal Article
LanguageEnglish
Published Tokyo Research Institute of Signal Processing, Japan 25.07.2018
Japan Science and Technology Agency
Subjects
Bicycles
Optimization
Restoration
Route planning
Routing
Search methods
Vehicles
Online AccessGet full text

Cover

More Information
Summary:To find the shortest tour of a transporting vehicle in a bike sharing system (BSS), a bike sharing system routing problem (BSSRP) has been proposed. In the BSSRP, a single vehicle restores the number of bicycles in stations. However, in a real system, the restoration of the number of the bicycles in each station is carried out by multiple vehicles. To decide the shortest tour of the multiple vehicles, we proposed a mathematical optimization model called the multiple-vehicles bike sharing system routing problem (mBSSRP). We present a construction method and local search methods to solve the large-size mBSSRP. The result of numerical experiments shows that the proposed method can find good solutions in a short time.
ISSN:1342-6230
1880-1013
DOI:10.2299/jsp.22.157