Roland Yap is an associate professor in the School of Computing, National University of Singapore. He obtained his PhD from Monash University, Australia. His research interests are in Artificial Intelligence, Big Data, Constraints, Programming Languages, Security. He is well known for his work on Constraint Logic Programming and the CLP(R) programming language which is one of the first programming languages where constraints are first class. CLP(R) has led to many developments in Constraint Programming (CP) and Logic Programming.
| Venue | Innovation 4.0 Building, level 1, Seminar Room (next to the level 1 café)
|
| Link to Register
(Via Zoom) |
https://nus-sg.zoom.us/meeting/register/tZYqd-mhrTopHtSTBPnJnbgrD4SqeGsCmMJz |
| Title | A Bus Routing Problem with Multiple Stop Preferences and Tradeoffs
|
| Abstract | We present a variant of the School Bus Routing Problem. In this variant, there multiple stop locations per passenger with preferences on the stops. There is a multimodal transportation aspect. There is also a tradeoff between route cost and passenger preferences. For the realistic scenario, a real-time requirement that the route be obtained quickly. This necessitates efficient solution which can give good solutions. We discuss one instance of this problem with real datasets in the Singapore context. |
