Online stochastic assignment problem with feature-based demand learning

• Main Author: Kwok, Jackie Jing Kai
• Other Authors: Yan Zhenzhen
• Format: Final Year Project
• Language: English
• Published: Nanyang Technological University 2024
• Subjects: Mathematical Sciences; Feature-based demand learning; Online stochastic assignment
• Online Access: https://hdl.handle.net/10356/175539
• Institution: Nanyang Technological University

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.