arXiv (All)
open access
JAMPR+/L2D: scalable neural heuristic for constrained vehicle routing problems in dynamic environment
The vehicle routing problems with real-world constraints (we consider vehicles capacity limits, time windows constrains, pickup-and-delivery multi-depo --- CPDPTW) pose significant computational challenges. While classical exact and heuristic methods remain effective to solve problems of small/mediu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Depot-Closed Multi-Component Construction for Neural Vehicle Routing#1129668
- Graph4BiLO: Graph Neural Network Approximation for Bilevel Mixed-Integer Linear Optimization#799333
- Graph4BiLO: Graph Neural Network Approximation for Bilevel Mixed-Integer Linear Optimization#797910
- Machine learning-assisted high-speed combinatorial optimization with Ising machines for dynamically changing problems.#288670
- A hybrid quantum-classical neural network for learning to route#819933
Record · ID 1062174
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive