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...

Full description

Bibliographic Details
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