Cover Image

Where to Split and When to Charge: Optimal Route Construction from Customer Permutations in Electric Vehicle Routing

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Uroić, Leon Stjepan, Đurasević, Marko
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Trilevel Memetic Algorithm for the Electric Vehicle Routing Problem
by: Milinović, Ivan, et al.
Published: (2025)

Optimal Electrical Oblivious Routing on Expanders
by: Florescu, Cella, et al.
Published: (2024)

Faster All-Pairs Optimal Electric Car Routing
by: Dorfman, Dani, et al.
Published: (2025)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
by: Zhao, Jingyang, et al.
Published: (2026)

Split Algorithm in Linear Time for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows
by: Gibbons, Ethan, et al.
Published: (2026)

Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem
by: Zhao, Jingyang, et al.
Published: (2026)

Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
by: Zhao, Jingyang, et al.
Published: (2023)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
by: Zhao, Jingyang, et al.
Published: (2022)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
by: Zhao, Jingyang, et al.
Published: (2025)

Parameterized Complexity of Vehicle Routing
by: Döring, Michelle, et al.
Published: (2025)

Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
by: Blauth, Jannis, et al.
Published: (2022)

Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding
by: Friggstad, Zachary, et al.
Published: (2025)

Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
by: Courtney, Joshua M.
Published: (2026)

Why is My Route Different Today? An Algorithm for Explaining Route Selection
by: Schild, Aaron, et al.
Published: (2025)

Routing-Controlled Spanners
by: Grigorescu, Elena, et al.
Published: (2024)

Optimal Distance Labeling for Permutation Graphs
by: Gawrychowski, Paweł, et al.
Published: (2024)

Permutation Routing on Ramanujan Hypergraphs with Applications to Neutral Atom Quantum Architectures
by: Courtney, Joshua M.
Published: (2026)

The En Route Truck-Drone Delivery Problem
by: Krizanc, Danny, et al.
Published: (2024)

A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem
by: Xie, Ningyi, et al.
Published: (2023)

Temporal Routing in Static Networks: The Schedule Completion Problem
by: Döring, Michelle, et al.
Published: (2026)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
by: Zhao, Jingyang, et al.
Published: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
by: Zhao, Jingyang, et al.
Published: (2025)

Cost-Distance Steiner Trees for Timing-Constrained Global Routing
by: Held, Stephan, et al.
Published: (2025)

Optimized Customizable Route Planning in Large Road Networks with Batch Processing
by: Farhan, Muhammad, et al.
Published: (2026)

Complexity of Perfect and Ideal Resilience Verification in Fast Re-Route Networks
by: Bentert, Matthias, et al.
Published: (2026)

FLASH-TB: Integrating Arc-Flags and Trip-Based Public Transit Routing
by: Großmann, Ernestine, et al.
Published: (2023)

Efficient Stochastic Routing in Path-Centric Uncertain Road Networks -- Extended Version
by: Guo, Chenjuan, et al.
Published: (2024)

Simple Construction of Greedy Trees and Greedy Permutations
by: Chubet, Oliver, et al.
Published: (2024)

Smooth Routing in Decaying Trees
by: Fluschnik, Till, et al.
Published: (2026)

Permutation patterns in streams
by: Berendsohn, Benjamin Aram
Published: (2025)

Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
by: O'Hara, Patrick, et al.
Published: (2024)

Random-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings
by: Kyng, Rasmus, et al.
Published: (2025)

Inapproximability of Counting Permutation Patterns
by: Opler, Michal
Published: (2026)

Optimal-Time Move Structure Construction
by: Brown, Nathaniel K., et al.
Published: (2026)

Local Routing on Ordered $Θ$-graphs
by: van Renssen, André, et al.
Published: (2025)

Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams
by: Ta, Hoang, et al.
Published: (2026)

Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
by: Chekuri, Chandra, et al.
Published: (2024)

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs
by: Chang, Hsien-Chih, et al.
Published: (2025)

Greedy BST on Permutation Initial Tree
by: Pareek, Akash
Published: (2024)

Time-Optimal Construction of String Synchronizing Sets
by: Ellert, Jonas, et al.
Published: (2026)