Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/137992
Title: Intelligent order matching for uber-like shareable vehicle systems
Authors: Wong, Harrison Jun Yong
Keywords: Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
Engineering::Computer science and engineering::Computing methodologies::Simulation and modeling
Issue Date: 2020
Publisher: Nanyang Technological University
Project: SCSE19-0357
Abstract: We present a novel order dispatch algorithm in large-scale on-demand ride-hailing platforms that take account of the dynamic characteristics associated with workers. Although most traditional order dispatch approaches generally focus on providing a better user experience for passengers and maximizing revenue by optimizing resource utilization, the proposed algorithm is designed to take into an account of the collective productivity of all workers and maximizing it opportunistically in response to stochastic changes in situational factors. This is also accompanied by a Multi-Agent Simulation to simulate the complex action and interactions of the drivers and passengers, and to analyze the effects of change in factors. After the implementation of the algorithm and simulation, we evaluated the effects in earnings, reputation and fatigue. In the most recent outbreak of the disease on COVID-19, the simulation also has a few mechanisms in showing how it spread among the drivers and passengers through the use of the proposed algorithm.
URI: https://hdl.handle.net/10356/137992
Schools: School of Computer Science and Engineering 
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
SCSE19-0357_HarrisonWongJunYong_amended_v3.pdf
  Restricted Access
2.47 MBAdobe PDFView/Open

Page view(s)

421
Updated on Mar 14, 2025

Download(s) 50

25
Updated on Mar 14, 2025

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.