A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times
From MaRDI portal
Publication:5232502
DOI10.2436/20.8080.02.77zbMath1421.90025OpenAlexW2967057689MaRDI QIDQ5232502
Angel A. Juan, Javier Faulin, Daniele Ferone, Lorena Reyes-Rubiano
Publication date: 12 September 2019
Full work available at URL: http://openaccess.uoc.edu/webapps/o2/bitstream/10609/94086/1/simheuristic.pdf
vehicle routing problemelectric vehiclessmart citiesbiased-randomized heuristicssimheuristicsgreen transport and logistics
Related Items (6)
Green hybrid fleets using electric vehicles: solving the heterogeneous vehicle routing problem with multiple driving ranges and loading capacities ⋮ A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times ⋮ A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems ⋮ A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics ⋮ A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands ⋮ Efficient GRASP solution approach for the prisoner transportation problem
Uses Software
Cites Work
- Unnamed Item
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- New benchmark instances for the capacitated vehicle routing problem
- An adaptive VNS algorithm for vehicle routing problems with intermediate stops
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Vehicle Routing
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- Horizontal collaboration in freight transport: concepts, benefits and environmental challenges
- Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
- A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
- A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
This page was built for publication: A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times
