Publication
Title
The bike request scheduling problem
Author
Abstract
In this paper we introduce the bike request scheduling problem, a new approach to city bike repositioning problems. The rationale behind this approach is explained, and a mixed-integer programming formulation is given. We prove that the bike request scheduling problem is NP-hard and formulate recommendations for future research.
Language
English
Source (book)
Computer Aided Systems Theory : EUROCAST 2015, 15th International Conference, Las Palmas de Gran Canaria, Spain, February 8-13, 2015, revised selected papers / Moreno-Diaz, Roberto [edit.]; et al.
Source (series)
Lecture notes in computer science ; 9520
Publication
Cham : Springer int publishing ag, 2015
ISSN
0302-9743
Volume/pages
9520(2015), p. 294-301
ISI
000376687100037
Number
978-3-319-27339-6
978-3-319-27340-2
Full text (Publishers DOI)
Full text (open access)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 29.03.2016
Last edited 27.03.2017
To cite this reference