A bi-level framework for heterogeneous fleet sizing of ride-hailing services considering an approximated mixed equilibrium between automated and non-automated traffic

Cites Work

The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
The electric fleet size and mix vehicle routing problem with time windows and recharging stations
A hybrid algorithm for large-scale service network design considering a heterogeneous fleet
A sweep-based algorithm for the fleet size and mix vehicle routing problem
A review of urban transportation network design problems
A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
Traffic assignment problem for a general network
An algorithm for finding shortest routes from all source nodes to a given destination in general networks

This page was built for publication: A bi-level framework for heterogeneous fleet sizing of ride-hailing services considering an approximated mixed equilibrium between automated and non-automated traffic