Electric vehicle routing problem with time-dependent waiting times at recharging stations
From MaRDI portal
Publication:1738821
DOI10.1016/j.cor.2019.02.014zbMath1458.90106OpenAlexW2898596225WikidataQ128284260 ScholiaQ128284260MaRDI QIDQ1738821
Merve Keskin, Gilbert Laporte, Bülent Çatay
Publication date: 18 April 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://research.sabanciuniv.edu/34883/2/2018_Odysseus_KeskinLaporte%C3%87atay.pdf
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Coordinated routing of electric commercial vehicles with intra-route recharging and en-route battery swapping, A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations, Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations, A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations, A survey of adaptive large neighborhood search algorithms and applications, An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping, A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows, Routing electric vehicles with a single recharge per route, Electric vehicles fast charger location-routing problem under ambient temperature, A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows, A survey of attended home delivery and service problems with a focus on applications, Estimating energy consumption and charging duration of electric vehicle in multigraph, A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies, A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations, A matheuristic for AGV scheduling with battery constraints, The green vehicle routing problem with capacitated alternative fuel stations
Uses Software
Cites Work
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
- Routing a mixed fleet of electric and conventional vehicles
- The traveling salesman problem with time-dependent service times
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations
- Battery swap station location-routing problem with capacitated electric vehicles
- Minimum cost VRP with time-dependent speed data and congestion charge
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- Time-dependent routing problems: a review
- An adaptive large neighborhood search for an E-grocery delivery routing problem
- An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
- A new mathematical programming model for the green vehicle routing problem
- A unified heuristic for a large class of vehicle routing problems with backhauls
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- A way to optimally solve a time-dependent vehicle routing problem with time windows
- The green mixed fleet vehicle routing problem with partial battery recharging and time windows
- A path-based solution approach for the green vehicle routing problem
- The electric two-echelon vehicle routing problem
- Mathematical models for green vehicle routing problems with pickup and delivery: a case of semiconductor supply chain
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints
- A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
- Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions
- Solving the stochastic time-dependent orienteering problem with time windows
- A metaheuristic for the time-dependent pollution-routing problem
- The electric location routing problem with time windows and partial recharging
- A dynamic vehicle routing problem with time-dependent travel times
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
- Vehicle dispatching with time-dependent travel times
- Routing a mix of conventional, plug-in hybrid, and electric vehicles
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- The green vehicle routing problem with capacitated alternative fuel stations
- A fast solution method for the time-dependent orienteering problem
- Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption
- Vehicle routing with dynamic travel times: a queueing approach
- A survey on matheuristics for routing problems
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- Vehicle routing and scheduling with dynamic travel times
- A variable neighborhood search branching for the electric vehicle routing problem with time windows
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
