Ceselli, AlbertoFelipe Ortega, ÁngelOrtuño Sánchez, María TeresaRighini, GiovanniTirado Domínguez, Gregorio2023-06-172023-06-172021Ceselli, 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-x2662-255610.1007/s43069-020-00052-xhttps://hdl.handle.net/20.500.14352/7402Este artículo es parte de Topical Collection on Decomposition at 70We provide an exact optimization algorithm for the electric vehicle routing problem with 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.danAtribución 3.0 Españahttps://creativecommons.org/licenses/by/3.0/es/journal articlehttps://doi.org/10.1007/s43069-020-00052-xopen access51Electric vehicle routingColumn generationCutting planesDynamic programmingMatemáticas (Matemáticas)12 Matemáticas