Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/37581
Title: Routing and planning for the last mile mobility system
Authors: NGUYEN VIET ANH
Keywords: Last Mile Problem, vehicle routing, tabu search, heterogeneous fleet, multiperiod problem, uncertain travelling time
Issue Date: 23-Aug-2012
Source: NGUYEN VIET ANH (2012-08-23). Routing and planning for the last mile mobility system. ScholarBank@NUS Repository.
Abstract: In this thesis, we consider a Last Mile mobility system which connects passengers from a transportation hub to their desired places and vice versa. This is an innovative approach to the transportation problems of urban cities. We propose a decision support system to assist the service provider in making good decisions at operational and strategic levels when the provider decides to offer the Last Mile service. At the operational level, we construct a heterogeneous fleet Last - First Mile tabu search algorithm for the daily routing problem. At the strategic level, the provider can use our system to choose the correct fleet size to invest in. We also study the routing problem under uncertain travelling time using the lateness index approach. Our system helps to ensure the profitability of the Last Mile mobility system, which is a critical factor to encourage the service provider to consider and offer the service.
URI: http://scholarbank.nus.edu.sg/handle/10635/37581
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
NguyenVA.pdf4.48 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

193
checked on Dec 11, 2017

Download(s)

186
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.