Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
DOI10.1016/J.COR.2022.105870OpenAlexW4280615951MaRDI QIDQ2147168FDOQ2147168
Peter J. Stuckey, Edward Lam, Guy Desaulniers
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105870
Recommendations
- A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies
- Partial linear recharging strategy for the electric fleet size and mix vehicle routing problem with time windows and recharging stations
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations
- Electric vehicle routing problem with time-dependent waiting times at recharging stations
- The electric location routing problem with time windows and partial recharging
- A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
- A variable neighborhood search branching for the electric vehicle routing problem with time windows
- A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
- A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model
schedulingsynchronizationlogic-based Benders decompositionvehicle routing problemDantzig-Wolfe decompositionconflict-driven clause learning
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Title not available (Why is that?)
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- Logic-based Benders decomposition
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A hybrid constraint programming approach to the log-truck scheduling problem
- Propagation via lazy clause generation
- Explaining the \texttt{cumulative} propagator
- Column Generation
- 2-path cuts for the vehicle routing problem with time windows
- New route relaxation and pricing strategies for the vehicle routing problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Cutting planes for branch-and-price algorithms
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Optimal Routing under Capacity and Distance Restrictions
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- The green vehicle routing problem with capacitated alternative fuel stations
- Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions
- Electric vehicle routing problem with time-dependent waiting times at recharging stations
- Core-guided and core-boosted search for CP
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
- A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations
Cited In (2)
Uses Software
This page was built for publication: Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147168)
