[HTML][HTML] Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions
M Ostermeier, T Henke, A Hübner… - European Journal of …, 2021 - Elsevier
Among the many extensions of the classical capacitated vehicle routing problem, multi-
compartment vehicle routing problems have been studied extensively only in recent years …
compartment vehicle routing problems have been studied extensively only in recent years …
Fleet operational policies for automated mobility: A simulation assessment for Zurich
We evaluate performance of four different operational policies to control an automated
mobility-on-demand system with sequential vehicle-sharing in one public open-source …
mobility-on-demand system with sequential vehicle-sharing in one public open-source …
Vehicle routing: Review of benchmark datasets
Abstract The Vehicle Routing Problem (VRP) was formally presented to the scientific
literature in 1959 by Dantzig and Ramser (DOI: 10.1287/mnsc. 6.1. 80). Sixty years on, the …
literature in 1959 by Dantzig and Ramser (DOI: 10.1287/mnsc. 6.1. 80). Sixty years on, the …
A large neighborhood search approach to the vehicle routing problem with delivery options
To reduce delivery failures in last mile delivery, several types of delivery options have been
proposed in the past twenty years. Still, customer satisfaction is a challenge because a …
proposed in the past twenty years. Still, customer satisfaction is a challenge because a …
Prediction-failure-risk-aware online dial-a-ride scheduling considering spatial demand correlation via approximate dynamic programming and scenario approach
The dial-a-ride (DAR) service is a precursor to emerging shared mobility. Service providers
expect efficient management of fleet resources to improve service quality without degrading …
expect efficient management of fleet resources to improve service quality without degrading …
Zonal-based flexible bus service under elastic stochastic demand
This study investigates flexible bus that provides door-to-door service with multiple
passengers sharing the vehicle, which reduces congestion on the urban network. The …
passengers sharing the vehicle, which reduces congestion on the urban network. The …
Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search
Research on metaheuristics has focused on (novel) algorithmic development and on
competitive testing, both of which have been frequently argued to yield little generalizable …
competitive testing, both of which have been frequently argued to yield little generalizable …
Customized bus routing problem with time window restrictions: model and case study
Considering that, in reality, passengers usually hold preferred time windows when waiting
for a bus at a station, this study develops a mixed integer programming model for the …
for a bus at a station, this study develops a mixed integer programming model for the …
[HTML][HTML] A graph reinforcement learning framework for neural adaptive large neighbourhood search
Abstract Adaptive Large Neighbourhood Search (ALNS) is a popular metaheuristic with
renowned efficiency in solving combinatorial optimisation problems. However, despite 18 …
renowned efficiency in solving combinatorial optimisation problems. However, despite 18 …
The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment
L Melis, K Sörensen - International Transactions in Operational …, 2022 - Wiley Online Library
We introduce a novel optimization problem to support the planning and routing of on‐
demand buses in an urban context. We call this problem the on‐demand bus routing …
demand buses in an urban context. We call this problem the on‐demand bus routing …