HAL (France)
open access
Study of robust features in formulating guidance for heuristic algorithms for solving the vehicle routing problem
The Vehicle Routing Problem (VRP) is an important NP-hard optimization problem for which metaheuristic algorithms are widely used to obtain high-quality solutions. Recent studies have shown that machine learning can leverage structural characteristics of VRP solutions to improve heuristic search. Th
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
- Customizable and Jointly Optimized Route Planning: A Deep Architecture Enabling Differentiable Shortest-Path Search#1033778
- TRCM: Topology-Aware Route-Consistency Modeling for Robust Neural Vehicle Routing#1403364
- Black-start path planning with a two-stage optimization approach#275838
- A hybrid quantum-classical neural network for learning to route#819933
- Global Optimization Framework for Automated Low-Thrust Gravity-Assist Trajectory Design#987254
Record · ID 1399620
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