A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems

•We consider the vehicles scheduling problem in bicycle sharing systems.•We define and formulate a mathematical model to minimize both the operational cost and the waiting times of the stations in disequilibrium states.•Several lower and upper bounds were proposed and incorporated in a branch-and-bo...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & industrial engineering Ročník 95; s. 41 - 52
Hlavní autoři:	Kadri, Ahmed Abdelmoumene, Kacem, Imed, Labadi, Karim
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.05.2016 Pergamon Press Inc Elsevier
Témata:	Algorithms Availability Bicycle-sharing systems Bicycles Branch & bound algorithms Branch-and-bound algorithm Computer Science Dynamical Systems Genetic algorithm Greedy search Lagrangian relaxation Mathematics Modeling and Simulation Nearest neighbor search Optimization Optimization and Control Production scheduling Quality of service Scheduling Stations Studies Transfer stations Traveling salesman problem Vehicles Nearest neighbor search Greedy search Branch-and-bound algorithm Bicycle-sharing systems Genetic algorithm Lagrangian relaxation
ISSN:	0360-8352, 1879-0550
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!