{"graphSha256":"f29d7b1eedeb88387238d2abda347f810d2179c5fdbead47c3ef48507ab20ca5","node":{"id":"N1803","type":"ficha","title":"xSeil VRP","url":"https://dakleyer.github.io/perspective-beyond/sources/xseil-vrp-n1803/","original":"https://jubap.net/xseil-vrp/","aliases":[],"clusters":["net"],"tags":["casos","control-minimo","decision","memoria-territorio","movilidad","mundo-abierto"],"summary":"","commit":null,"sourcePath":null,"commitUrl":null,"documentId":"doc-1cffae9dc49a7982d0","tagWeights":{"casos":0.2758,"control-minimo":0.1379,"decision":0.069,"memoria-territorio":0.069,"movilidad":0.3793,"mundo-abierto":0.069},"reading":"xSeil was deployed in 2016-2017 to plan passenger transport for an integrated tourism operation in the Mexican Caribbean. A tourism sale made upstream became a transport commitment before the complete daily demand, fleet state, and network interactions were known. The resulting problem combined hard pickup promises, indivisible passenger groups, a heterogeneous owned-and-rented fleet, multiple trips per unit, direct and multi-leg service, typed transfer points, destination-capacity externalities, and a rigid planning deadline. This paper presents a single self-contained account of the operation, the vehicle-routing problem, and the deployed solution architecture.\n\nThe implementation did not solve a conventional static VRP by repeatedly constructing routes from scratch. It converted idle computation into operational latency reserve: feasible stop sequences, compatibility relations, and scenario-specific candidate structures were built and persisted offline; online planning retrieved those structures, added state-dependent scarcity and isolation prices, committed one passenger-group coalition at a time, repriced the remaining candidates, and invoked rollback or bounded search widening only on evidence of insufficiency. The code further shows that passenger groups were atomic rather than split-delivery quantities, that transfers could occur at typed non-central points, and that human scenario weights controlled both objective level and penalty curvature.\n\nThe paper makes four contributions. First, it classifies xSeil as an industrial rich-VRP with heterogeneous multi-trip routing, hard time commitments, atomic group demand, synchronized transfers, and destination resources. Second, it provides a code-auditable reconstruction while correcting earlier overstatements: the route builder is bounded level-wise enumeration rather than demonstrated dynamic programming; the allocator lacks a global optimality guarantee but does not necessarily produce a suboptimal solution; and route-library coverage is bounded by the configured topology and policies. Third, it proposes a modernization that preserves the offline-online doctrine while replacing exhaustive construction with modern candidate generation and bounded improvement. Fourth, because real demand days can be recovered, it specifies a paired historical replay comparing legacy-faithful, semantically repaired, modern, and hybrid solvers under the same time limits, scenarios, and raw KPI vectors. No superiority claim is made before that replay.\n\nKeywords: rich vehicle routing; multi-trip VRP; time windows; synchronized transfers; passenger transport; atomic demand; route pools; human-in-the-loop optimization; historical replay; xSeil.","readingSource":{"url":"https://jubap.net/xseil-vrp/","section":"Abstract","observed":"2026-11-04","sourceSha256":"c5e86bff36591d757152de6439aabd177e7f00c12b87941c7a9ba29d23537133"},"readingSummary":"xSeil was deployed in 2016-2017 to plan passenger transport for an integrated tourism operation in the Mexican Caribbean.","contextTokens":571},"relations":[["apoyo:N1803:C05","N1803","C05","documenta el concepto","",null,"apoyo",""],["apoyo:N1803:C06","N1803","C06","documenta el concepto","",null,"apoyo",""],["apoyo:N1803:C22","N1803","C22","documenta el concepto","",null,"apoyo",""],["apoyo:N1803:C25","N1803","C25","documenta el concepto","",null,"apoyo",""],["apoyo:N1803:C29","N1803","C29","documenta el concepto","",null,"apoyo",""],["apoyo:N1803:C99","N1803","C99","documenta el concepto","",null,"apoyo",""],["apoyo:N1803:C111","N1803","C111","documenta el concepto","",null,"apoyo",""],["documento:D003","N1803","E1563","analogy only","The atomic-group distinction in transport offers a useful lens for defining indivisible commitments in luxury events.",null,"documento","Una analogía de agrupación no demuestra que toda familia o invitación deba ser indivisible; el contrato de servicio fija la granularidad."],["documento:D016","N2082","N1803","documented use","In the reconstructed xSeil planner, scenario choice precedes state-dependent scoring and sequential commitment.",null,"documento","Son dos reconstrucciones del mismo sistema, no replicaciones independientes. El score ponderado no demuestra un frente Pareto calculado."],["documento:A012","U1494","N1803","analogy only","Analog pooling can inspire a routing model, but xSeil's fully committed demand requires preserving service obligations rather than selecting only the easiest demand to serve.",null,"documento","La semejanza funcional no convierte el sistema informal en antecedente implementado del algoritmo de xSeil."],["documento:G008","GH008","N1803","analogy only","A finite routing run can be valid within its declared frame without certifying all future operating conditions; open-world limits do not make every bounded VRP undecidable.",null,"documento","Comparación retrospectiva de alcance; el mini-paper de octubre de 2026 no describe una técnica usada en xSeil en 2016."],["documento:R090","N1247","N1803","editorial comparison","For a complementary reading, see [Vehicle routing under fully committed demand](https://jubap.net/xseil-vrp/).",null,"documento",""],["documento:R093","N1801","N1803","editorial comparison","For a complementary reading, see [The exact industrial routing problem](https://jubap.net/xseil-vrp/).",null,"documento",""],["documento:R094","N1803","N2082","editorial comparison","For a complementary reading, see [How human scenarios steer the planner](https://jubap.net/xseil-scenario-based-planning-human-governed-computation/).",null,"documento",""],["documento:R095","N1803","E1958","editorial comparison","For a complementary reading, see [Grouping and bounded repair: the paired exhibits](https://jubap.eu/mobility/evidence/case-01-02-valencia/).",null,"documento",""],["documento:R103","N1817","N1803","editorial comparison","For a complementary reading, see [The classical routing problem and baselines](https://jubap.net/xseil-vrp/).",null,"documento",""],["documento:R148","E1958","N1803","editorial comparison","For a complementary reading, see [The routing and grouping constraints behind the exhibit](https://jubap.net/xseil-vrp/).",null,"documento",""],["documento:R151","E1956","N1803","editorial comparison","For a complementary reading, see [The industrial rich-VRP problem definition](https://jubap.net/xseil-vrp/).",null,"documento",""],["documento:sac-rel-3afa4e5e2940df","GH001","N1803","referencia de la fuente","La fuente enlaza esta lectura en «xSeil» con el rótulo «xSeil — Vehicle Routing Under Fully Committed Tourism Demand».","https://github.com/dakleyer/structural-awareness-contributions/blob/3b4bd71d7f013b6c461d6fc75331008998d65bfb/README.md","documento",""]]}