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 QIDQ2147168

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

zbMATH Keywords

schedulingDantzig-Wolfe decompositionsynchronizationvehicle routing problemlogic-based Benders decompositionconflict-driven clause learning

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

A survey of attended home delivery and service problems with a focus on applications ⋮ A deterministic annealing local search for the electric autonomous dial-a-ride problem

Uses Software

• Unnamed Item
• Mosek
• MiniZinc
• CVRPSP

Cites Work

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

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