On-demand ridesharing might be an effective solution to reduce traffic congestion and, as a result, reduce emissions to mitigate environmental issues. However, travel times are more uncertain in ridesharing services compared to non-shared transit services due to their shared nature. For example, at one moment, the users are informed that the travel time takes five minutes, a moment later, a request is added to the trip and the users are now confronted with a travel time of ten minutes instead. This uncertainty in travel time is called unreliability. Unreliability is perceived as inconvenience by the users and it has a negative impact on the users' travel habits regarding ridesharing service. Therefore, this research provides a novel solution to deal with this problem while mitigating the negative effects on the other quality-of-service indices, e.g., waiting time, rejection rate, and delays. This is achieved by providing two indicators to each new user: (1) the possibility that an additional request will be added to the trip that negatively influences the trip duration of the user; and (2) a prediction of the magnitude of a possible delay for whenever the case occurs that a new request will be added to the trip. These indicators are based on predictions, created by shareability shadows which determine the number of requests that might be added to the trip, and implementing a simple time-series demand forecasting method named exponential smoothing. The shareability shadow makes predictions by confining the regions of ridesharing opportunities by analyzing the travel constraints of the involved users. The solution is validated using a state-of-the-art routing and assignment method and a test case of Manhattan, New York City. With the formulated measure, on average, 58% of the requests receive a correct prediction about the possibility of a negative change, 17% receive an indecisive prediction, i.e., a prediction stating that the possibility of a negative change is "medium", and 25% of the requests receive an incorrect prediction about the possibility of a negative change. Moreover, the measure successfully provides a predicted magnitude of the travel time increase with a 95% confidence interval. 

In recent years, Shared Mobility-on-Demand systems have emerged as a great method for door-to-door transportation. Studies have shown that it is possible to route vehicles and assign requests to vehicles efficiently in large-scale systems. These studies commonly report one-dimensional performance metrics such as average vehicle occupancy, service rate, or average waiting time. We repeated a case study using a state-of-the-art Fleet Management Framework and focused on the distribution of the service level over the operation area. We observed that the chance of receiving service in a low demand area was much higher than in a high demand area. Going from this observation, this research’s objective was to research how the state-of-the-art framework can be adjusted such that the rejection rates are more evenly spread over the operation area. We developed different methods that adjust the decision of which mobility requests are serviced or which trips are selected. The methods work such that a request located in an above-average rejection rate area has an increased chance of being serviced. Similarly, a trip that goes through an area of above-average rejection rate also has priority. We set up a Discrete Event Simulation that simulates a Shared Mobility-on-Demand system to research the effects of our added method compared to the original framework. We simulated an artificial city and New York City. The Gini index was used to measure how evenly the rejection rates were spread over the operation area. In many cases, our methods were able to lower both the average rejection rate and the Gini index. With this work, we showed that the state-of-the-art framework’s objective can be extended to a broader goal. This opens up new possibilities to tune the system to match specific transportation needs in different areas of a city.

With increasing urbanization and a need to reduce greenhouse gas emissions, new forms of urban mobility are studied worldwide. An interesting transportation method is ridesharing, where people can share parts of their rides with other passengers travelling in a similar direction in the same car. To im- prove the attraction of ridesharing systems, research into extensions to the existing ridesharing model formulation is required. The goal of this research is to make ridesharing more attractive to potential users by including the option to make reservations. In this work, the inclusion of reservations (pre-bookings) into the on-demand ridesharing problem is studied. The inclusion of ridesharing has to potential to make better assignments by having knowledge on part of the future demand. The main challenge from reservations is the increased computational load generated by having more available information. This thesis proposes multiple adjustments and different heuristics for a state-of-the-art on-demand ridesharing system to deal with the requirements and challenges brought by the incorporation of reservations. An additional consideration is a trade-off between providing benefits for reservations and serving on-demand requests. Numeric experiments are performed on the Manhattan street network with NYC taxicab request data. The results indicate that reservations can be included in on-demand ridesharing at a tolerable compu- tational cost with the proposed framework. Passengers that make reservations shortly in advance can be guaranteed service once initially accepted by the system. Having passengers make reservations in advance does increase the overall service the system can provide.

The simultaneous rapidly increasing demand for home delivery of goods and on-demand expectancy of customers over the past years leaves a tough challenge for the logistical branch. They have to keep up with this increasing demand and simultaneously they are obliged to satisfy consumer service level demands to preserve their customers. On the other hand, as economic goals drive these businesses, they are prompted to operate cost-effectively. As a result, the fleet, deployed to execute the last-mile delivery, should meet both the requirement of cost-efficiency as well as the requirement for meeting consumer service level demands. This raises the question of how to efficiently design a fleet for last-mile on-demand logistics. For a fleet to be able to operate cost-efficiently, the fleet design decisions are required to take both fixed and variable costs into account. As such, the fleet design decisions need to include the consideration of the size of the fleet as well as the distance the vehicles travel on daily basis. Therefore, the goal of this thesis is to develop a novel method for fleet design for last-mile on-demand logistics. This work contributes by being the first to investigate methods for doing fleet design specifically for last-mile on-demand logistics considering multiple depots and variable pick-up locations. The purpose of the method is to determine the operational plans of the individual vehicles, the number of vehicles needed throughout a certain time period, the pick-up locations for all orders and the total distance travelled by the full fleet of vehicles. The proposed method builds upon established fleet design methods for ride-sharing taxi problems. The optimization method is adapted for last-mile on-demand logistics, yielding the required number of vehicles and their individual operational plans. The input of the system is a set of trips, which represent a path of a single vehicle to deliver one or multiple orders from a depot. Connecting two trips, which is called chaining, has the benefit of reducing the number of vehicles used, as chained trips are served by a single vehicle. Additionally, from multiple available depots where orders can be picked up, the method determines the best depot per order. This part of the method is called depot re-assignment. Furthermore, the fleet design problem is modelled as a multi-objective optimisation problem to find the trade-off between fleet size and the total distance the vehicles travel. Three different modelled datasets, each containing 10.000 order requests in the city centre of Amsterdam, are used to prove the value of the given method. A comparison between the method with and without depot re-assignment is made, to prove the value of the given addition of depot re-assignment. It is proven that depot re-assignment is valuable as it decreases or retains the fleet size for all test cases. The experiments conducted show that a significant decrease of the required fleet size can be established by a minor increase in total travelled distance. Furthermore, the optimal trade-off between the fleet size and the total distance travelled can be determined for a specific operation with the knowledge of operational costs for that operation.