RT Journal Article
T1 A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies
A1 Ceselli, Alberto
A1 Felipe Ortega, Ángel
A1 Ortuño Sánchez, María Teresa
A1 Righini, Giovanni
A1 Tirado Domínguez, Gregorio
AB We provide an exact optimization algorithm for the electric vehicle routing problemwith multiple recharge technologies. Our branch-and-cut-and-price algorithm relies upon a path-based formulation, where each column in the master problem represents a sequence of customer visits between two recharge stations instead of a whole route. This allows for massive decomposition, and parallel implementation of the pricing phase, exploiting the large number of independent pricing sub-problems. The algorithm could solve instances with up to thirty customers, nine recharge stations, fve vehicles and three technologies to proven optimality. Near-optimal heuristic solutions were obtained with a general-purpose MIP solver from the columns generated at the root node.
SN 2662-2556
YR 2021
FD 2021
LK https://hdl.handle.net/20.500.14352/7402
UL https://hdl.handle.net/20.500.14352/7402
LA dan
NO Ceselli, A., Felipe, Á., Ortuño, M.T., Righini, G., Tirado, G.: A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies. SN Oper. Res. Forum. 2, 8 (2021). https://doi.org/10.1007/s43069-020-00052-x
NO Este artículo es parte de Topical Collection on Decomposition at 70
NO Comunidad de Madrid
NO Gobierno de España
DS Docta Complutense
RD 10 abr 2025