An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations
From MaRDI portal
Publication:6586222
DOI10.1016/j.ejor.2023.12.019MaRDI QIDQ6586222
Publication date: 13 August 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- A branch and price approach for routing and refueling station location model
- On a multicriteria shortest path problem
- Partitioning procedures for solving mixed-variables programming problems
- The Benders decomposition algorithm: a literature review
- The electric location routing problem with time windows and partial recharging
- An elastic demand model for locating electric vehicle charging stations
- A linear-time algorithm for finding optimal vehicle refueling policies
- A multiple server location-allocation model for service system design
- The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach
- A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
- frvcpy: An Open-Source Solver for the Fixed Route Vehicle Charging Problem
- Location Science
- Shortest Path Problems with Resource Constraints
- Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
This page was built for publication: An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations