| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Liu, Alison | |
| dc.contributor.author | Hoofs, Luc | |
| dc.date.accessioned | 2022-06-16T23:00:42Z | |
| dc.date.available | 2022-06-16T23:00:42Z | |
| dc.date.issued | 2022 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/41654 | |
| dc.description.abstract | Expanding upon previous work done upon the online car sharing problem, we explore the consequences of variable booking times on the problem with two servers and two locations. We focus on the special instance that mandates that each request is released alongside an identical request starting from the same location and same time, released at the same time. | |
| dc.description.sponsorship | Utrecht University | |
| dc.language.iso | EN | |
| dc.subject | The online car sharing problem is a problem in which one attempts to make as much profit as possible - compared to an optimum solution - by accepting and rejecting the right requests. We focus on the problem with two servers and two locations, in which the time at which request is booked, and the time a request needs to be served vary between requests. | |
| dc.title | On the Power of Greedy Approaches: Online Car Sharing with
two servers on Two Locations, with varying booking times and
paired requests | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | online car sharing; 2S2L-V; paired requests; Greedy approaches; Variable booking times | |
| dc.subject.courseuu | Computing Science | |
| dc.thesis.id | 4500 | |
