Research map / Learning theory and algorithms / Combinatorial and search optimization
A Fast Heuristic Search Approach for Energy-Optimal Profile Routing for Electric Vehicles
Saman Ahmadi, Mahdi Jalili
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use A* with potential heuristic instead of Dijkstra | energy-optimal search · DIMACS maps, all ranges | average runtime: 27.6 -> 15.6 ms (0-20 kWh) | Improved |
| support unknown initial SoC via profile search (Pr-A*fw) instead of A* with known SoC | A* · DIMACS maps | average runtime: at most 30% slower (15.6 -> 20.6 ms) | Hurt |
| use forward profile A* instead of Dijkstra | Pr-A*fw · DIMACS maps | speedup: 1.51 to 1.77 | Improved |
| use backward instead of forward profile search | Pr-A*bw · DIMACS maps, 0-20 kWh | average runtime: 20.6 -> 19.6 ms | Improved |
| add bidirectional search to profile A* | Pr-A* · DIMACS maps | average runtime: 20.6 -> 43.8 ms (0-20 kWh) | Hurt |
| parallelize bidirectional search across two threads | Pr-BA* · DIMACS maps | average runtime: 43.8 -> 30.9 ms (0-20 kWh) | Improved |
| add bidirectional search to profile A* | Pr-A* · DIMACS maps | node expansions: 44 -> 62 (x10^3) | Hurt |
| use this method instead of prior label-correcting profile A* | Pr-A* · energy profile queries | runtime vs A*: order of magnitude slower -> less than 30% slower | Improved |
Closest papers by meaning
- A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem (AAAI 2021 · similarity 0.83)
- Resource Constrained Pathfinding with Enhanced Bidirectional A* Search (AAAI 2025 · similarity 0.82)
- A Complexity-theoretic Analysis of Green Pickup-and-Delivery Problems (AAAI 2021 · similarity 0.81)
- Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks (AAAI 2018 · similarity 0.81)
- Constraint-aware Pareto Optimization for Tree-Structured Networks: Addressing Decarbonization Targets with Hydropower Expansion (AAAI 2025 · similarity 0.80)
- Hybrid-Balance GFlowNet for Solving Vehicle Routing Problems (NeurIPS 2025 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
