This repository is a comprehensive Vehicle Routing Problem (VRP) solver implemented in Rust, organized as a multi-crate workspace. It provides a command-line interface (vrp-cli), a core optimization library (vrp-core), a hyper-heuristic framework (rosomaxa), and format-specific crates for pragmatic JSON and scientific benchmarks (Solomon, Li&Lim, TSPLIB). The solver supports a wide range of VRP variants including capacity, time windows, skills, breaks, reloads, recharges, multi-depot, multi-trip, and route balancing. It employs advanced metaheuristics: ruin-and-recreate, local search (including LKH and SWAP*), and a custom evolutionary algorithm called ROSOMAXA that uses Growing Self-Organizing Maps (GSOM) for population diversity and Thompson sampling for dynamic operator selection. The codebase is highly modular with a trait-based feature system for composing constraints and objectives, type-safe dimension macros, and extensive test coverage including property-based tests. While primarily an application/library, it also contains research experiments (heuristic visualization, GPT-based encoding) and scientific benchmark integration. The project is actively maintained but explicitly labeled as 'permanently experimental' with limited support, and the API may introduce breaking changes in minor versions.