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

Authors Edward Lam, Guy Desaulniers, Peter J. Stuckey

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

zbMATH Keywords

schedulingsynchronizationlogic-based Benders decompositionvehicle routing problemDantzig-Wolfe decompositionconflict-driven clause learning

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

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

Cites work

• 2-path cuts for the vehicle routing problem with time windows
• A branch-and-price-and-check model for the vehicle routing problem with location congestion
• A hybrid constraint programming approach to the log-truck scheduling problem
• A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Column Generation
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Core-guided and core-boosted search for CP
• Cutting planes for branch-and-price algorithms
• Electric vehicle routing problem with time-dependent waiting times at recharging stations
• Exact algorithms for electric vehicle-routing problems with time windows
• Explaining the \texttt{cumulative} propagator
• Handbook of constraint programming.
• Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions
• Logic-based Benders decomposition
• New route relaxation and pricing strategies for the vehicle routing problem
• Nutmeg: a MIP and CP hybrid solver using branch-and-check
• Optimal Routing under Capacity and Distance Restrictions
• Propagation via lazy clause generation
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• The green vehicle routing problem with capacitated alternative fuel stations

Cited in

(18)

• A column generation tailored to electric vehicle routing problem with nonlinear battery depreciation
• A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
• Routing electric vehicles with a single recharge per route
• Exact algorithms for electric vehicle-routing problems with time windows
• Integrated service- and charge-scheduling for electric commercial vehicles
• Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions
• A survey of attended home delivery and service problems with a focus on applications
• A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations
• The consistent electric-vehicle routing problem with backhauls and charging management
• Electric vehicle routing problem with time-dependent waiting times at recharging stations
• A deterministic annealing local search for the electric autonomous dial-a-ride problem
• A branch\&cut approach to recharging and refueling infrastructure planning
• A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies
• Layered graph models for the electric vehicle routing problem with nonlinear charging functions
• A variable neighborhood search branching for the electric vehicle routing problem with time windows
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
• The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach

Describes a project that uses

Uses Software

• SCIP
• Mosek
• MiniZinc
• CVRPSP

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)