A deterministic annealing local search for the electric autonomous dial-a-ride problem

DOI10.1016/j.ejor.2023.02.012arXiv2212.04167MaRDI QIDQ6167858

Nicolas Dupin, Jakob Puchinger, Yue Su

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.04167

zbMATH Keywords

metaheuristicdeterministic annealingdial-a-ride problemelectric autonomous vehicles

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems

Cites Work

• Routing a mixed fleet of electric and conventional vehicles
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• Typology and literature review for dial-a-ride problems
• Routing a mix of conventional, plug-in hybrid, and electric vehicles
• Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
• The dial-a-ride problem: Models and algorithms
• Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows

This page was built for publication: A deterministic annealing local search for the electric autonomous dial-a-ride problem