Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/175539
Title: Online stochastic assignment problem with feature-based demand learning
Authors: Kwok, Jackie Jing Kai
Keywords: Mathematical Sciences
Issue Date: 2024
Publisher: Nanyang Technological University
Source: Kwok, J. J. K. (2024). Online stochastic assignment problem with feature-based demand learning. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/175539
Abstract: This paper focuses on demand learning through the utilisation of unknown features to optimise resource allocations. The performance of Greedy, Simulate-Optimize- Assign-Repeat (SOAR) and Random algorithms are compared with synthetic and real-world private-hire car data. Through the control testing with synthetic data, SOAR outperforms the other algorithms. Additionally, the findings also highlights the impact of input parameter variability on algorithm performance. Furthermore, the examination of real-world data are in consistent with these findings, emphasiz- ing the practical relevance of the study’s outcomes. Acknowledging these variations enables better decision-making, tailoring algorithms to specific complexities, and enhancing overall outcomes.
URI: https://hdl.handle.net/10356/175539
Schools: School of Physical and Mathematical Sciences 
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
FYP.pdf
  Restricted Access
1.44 MBAdobe PDFView/Open

Page view(s)

166
Updated on May 7, 2025

Download(s) 50

35
Updated on May 7, 2025

Google ScholarTM

Check

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