Introduces an exact forward-labeling DP algorithm for optimal decoding of fixed customer permutations into electric vehicle routes, plus restricted variants, with experiments showing tractability and quality gains over heuristics.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Where to Split and When to Charge: Optimal Route Construction from Customer Permutations in Electric Vehicle Routing
Introduces an exact forward-labeling DP algorithm for optimal decoding of fixed customer permutations into electric vehicle routes, plus restricted variants, with experiments showing tractability and quality gains over heuristics.