A branch-and-cut method for the Vehicle Relocation Problem in the One-Way Car-Sharing
The purpose of this thesis is to develop an algorithm which solves the Vehicle Relocation Problem in the One-Way Car-Sharing (VRLPOWCS) as fast as possible. The problem describes the task of relocating the cars to areas with the largest demand. The chauffeurs who relocate the cars are transported by...
Main Author: | Albinski, Szymon Janusz |
---|---|
Format: | Others |
Language: | English |
Published: |
KTH, Optimeringslära och systemteori
2015
|
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166720 |
Similar Items
-
Multiobjective car relocation problem in one-way carsharing system
by: Rabih Zakaria, et al.
Published: (2018-11-01) -
Optimization of the car relocation operations in one-way carsharing systems
by: Zakaria, Rabih
Published: (2015) -
A Vehicle Relocation Model for One-way Carsharing Systems
by: Chia-LungChiang, et al.
Published: (2018) -
NETWORK FLOW ORIENTED APPROACHES FOR VEHICLE SHARING RELOCATION PROBLEMS
by: Alain Quilliot, et al. -
Increasing the Value of Shared Vehicles: Insights from an Implementation of User-Based Relocation in Station-Based One-Way Carsharing
by: Alfred Benedikt Brendel, et al.
Published: (2020-10-01)