Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks

DOI10.1016/j.cor.2023.106460MaRDI QIDQ6551058

Francisco A. Ortega, Ramón Piedra-de-la-Cuadra

Publication date: 6 June 2024

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

knapsack problembilevel optimizationelectric vehiclesconditional coverage problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Optimal deployment of alternative fueling stations on transportation networks considering deviation paths
• Traffic equilibrium and charging facility locations for electric vehicles
• Efficient algorithms for the conditional covering problem
• Conditional covering: greedy heuristics and computational results
• Facility location on a tree with maximum distance constraints
• A well-solvable special case of the bounded knapsack problem
• Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
• An Analysis of Network Location Problems with Distance Constraints
• A Minimal Algorithm for the Bounded Knapsack Problem
• Algorithms for solving the conditional covering problem on paths
• Dynamic programming algorithms for the conditional covering problem on path and extended star graphs

This page was built for publication: Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks