Fig 1.
Trip situations.
Fig 2.
Final assignment algorithm.
Table 1.
Example with 4 requests (configuration).
Fig 3.
Feasible routes for the example.
Table 2.
Example with 4 requests (solutions).
Fig 4.
Network of Lyon.
Fig 5.
Central depot and local depots in a part of Lyon network.
Table 3.
Optimization time steps and rolling horizon values.
Fig 6.
Objective function for different optimization times steps.
Fig 7.
Simulation time for different optimization times steps.
Table 4.
Simulation results for different number of depots.
Table 5.
Clustering methods comparison.
Table 6.
Sum of Squares method for k-means clustering.
Fig 8.
Sum of squares method for finding the optimal size of clusters in k-means clustering.
Table 7.
Sum of squares method for hierarchical clustering.
Fig 9.
Sum of squares method for finding the optimal size of clusters in hierarchical clustering.
Fig 10.
Comparing clustering methods’ objective function (market-share = 50%).
Fig 11.
Comparing clustering methods’ computation time (market-share = 50%).