Skip to content
AI News HubLIVE
Original source2 min read

A GPU-Accelerated Hybrid Method for a Class of Multi-Depot Vehicle Routing Problems

Summary

Researchers propose a GPU-accelerated hybrid algorithm for multi-depot vehicle routing problems, integrating learning-driven crossover and multi-penalty search. The method shows strong performance on large-scale benchmarks.

SourcearXiv RoboticsAuthor: Zhenyu Lei, Jin-Kao Hao
A GPU-Accelerated Hybrid Method for a Class of Multi-Depot Vehicle Routing Problems
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[2605.05208] A GPU-Accelerated Hybrid Method for a Class of Multi-Depot Vehicle Routing Problems

Skip to main content

Learn about arXiv becoming an independent nonprofit.

We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate

> cs > arXiv:2605.05208

Help | Advanced Search

All fields Title Author Abstract Comments Journal reference ACM classification MSC classification Report number arXiv identifier DOI ORCID arXiv author ID Help pages Full text

Search

GO

quick links

Login

Help Pages

About

-->

Computer Science > Robotics

arXiv:2605.05208 (cs)

[Submitted on 24 Feb 2026]

Title:A GPU-Accelerated Hybrid Method for a Class of Multi-Depot Vehicle Routing Problems

Authors:Zhenyu Lei, Jin-Kao Hao

View a PDF of the paper titled A GPU-Accelerated Hybrid Method for a Class of Multi-Depot Vehicle Routing Problems, by Zhenyu Lei and Jin-Kao Hao

View PDF HTML (experimental)

Abstract:Multi-depot vehicle routing problems (MDVRPs) are prevalent in a variety of practical applications. However, they are computationally challenging to solve due to their inherent complexity. This paper proposes an effective hybrid algorithm for a class of MDVRPs. The algorithm integrates a learning-driven, diversity-controlled route-exchange crossover and a multi-depot-supported feasible-and-infeasible search framework guided by a multi-penalty evaluation function. Two dedicated depot-related local search operators are incorporated to further strengthen the search capability in multi-depot settings. To improve computational efficiency and scalability, an enhanced version of the algorithm is developed that uses a tensor-based GPU acceleration combined with a novel multi-move update strategy. Extensive computational experiments on benchmark instances of three MDVRP variants show that the proposed algorithms are highly competitive with state-of-the-art methods, especially for large-scale instances.

Subjects:

Robotics (cs.RO); Distributed, Parallel, and Cluster Computing (cs.DC); Optimization and Control (math.OC)

Cite as: arXiv:2605.05208 [cs.RO]

(or arXiv:2605.05208v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2605.05208

Focus to learn more

arXiv-issued DOI via DataCite

Submission history

From: Jin-Kao Hao [view email] [v1] Tue, 24 Feb 2026 14:15:28 UTC (681 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled A GPU-Accelerated Hybrid Method for a Class of Multi-Depot Vehicle Routing Problems, by Zhenyu Lei and Jin-Kao Hao

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.RO

new | recent | 2026-05

Change to browse by:

cs cs.DC math math.OC

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

export BibTeX citation Loading...

BibTeX formatted citation

×

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

About

Help

contact arXivClick here to contact arXiv Contact

subscribe to arXiv mailingsClick here to subscribe Subscribe

Copyright

Privacy Policy

Web Accessibility Assistance

arXiv Operational Status

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • New hybrid algorithm combines machine learning with optimization for MDVRPs.
  • Uses tensor-based GPU acceleration and multi-move update for efficiency.
  • Outperforms state-of-the-art on large-scale instances of three MDVRP variants.

Highlights and analysis are generated automatically and may contain errors. Check the original source.