Papers › Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle...

Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time Windows

3 Apr 2023arXiv:2304.00789archive 2025-07-28

Léo Baty, Kai Jungel, Patrick S. Klein, Axel Parmentier, Maximilian Schiffer

With the rise of e-commerce and increasing customer requirements, logistics service providers face a new complexity in their daily planning, mainly due to efficiently handling same day deliveries. Existing multi-stage stochastic optimization approaches that allow to solve the underlying dynamic vehicle routing problem are either computationally too expensive for an application in online settings, or -- in the case of reinforcement learning -- struggle to perform well on high-dimensional combinatorial problems. To mitigate these drawbacks, we propose a novel machine learning pipeline that incorporates a combinatorial optimization layer. We apply this general pipeline to a dynamic vehicle routing problem with dispatching waves, which was recently promoted in the EURO Meets NeurIPS Vehicle Routing Competition at NeurIPS 2022. Our methodology ranked first in this competition, outperforming all other approaches in solving the proposed dynamic vehicle routing problem. With this work, we provide a comprehensive numerical study that further highlights the efficacy and benefits of the proposed pipeline beyond the results achieved in the competition, e.g., by showcasing the robustness of the encoded policy against unseen instances and scenarios.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 21 code samples harvested from 1 repository linked to this paper: 14 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 5 honoured, 0 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified. Where Syntology's instrument failed: 3 where our contract draft was wrong; 2 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 21 samples from 1 repository, 14 ran (9 with no instrument failure; 5 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 2 of the 14 samples that ran have no recorded date.

tumbais/euro-meets-neurips-2022 officialmentioned in papermentioned on GitHubMITSyntology: 21 samples, 14 ran (5 instrument-failed) · 7 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

21 samples harvested: 14 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 5 honoured, 0 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

5ran · honoured contract
3ran · our draft was wrong
2ran; the contract check could not run
4ran
7unverified

Licence: 0 of the 21 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from tumbais/euro-meets-neurips-2022. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

tumbais/euro-meets-neurips-2022 official repository 21 samples, 14 ran (5 instrument-failed) · 7 unverified
NeuralNetwork in 7 papers training/optimization.py ran MIT (permissive) · 23fbd12cb9ebd45b · report fixture: returned NeuralNetwork · level recorded 2026-09-22
NumpyJSONEncoder training/optimization.py ran MIT (permissive) · df2e0e8bac763335 · report fixture: returned NumpyJSONEncoder · level recorded 2026-09-22
apply_perturbation training/optimization.py ran · our draft was wrong MIT (permissive) · 37dc75bdb37e8331 · report fixture: signature args:Args/0/?, profits:ndarray/1/float · returned ndarray · level recorded 2026-09-22
calculate_accuracy_mean training/optimization.py ran · honoured contract fingerprinted MIT (permissive) · 17c7151f9a5817a8 · report fixture: signature n:ndarray/2/bool, n_hat:ndarray/2/bool · returned float64 · level recorded 2026-09-22
calculate_default_accuracy training/optimization.py ran · honoured contract MIT (permissive) · 232200b94d4c4a11 · report fixture: signature training_instances:list/1/dict · returned float64 · level recorded 2026-09-22
create_ffn_output training/optimization.py ran MIT (permissive) · f3d2c454c7122b15 · report fixture: returned Sequential · level recorded 2026-09-22
create_ffn_preprocess training/optimization.py ran MIT (permissive) · 12ad886a430d54de · report fixture: returned Sequential · level recorded 2026-09-22
create_solution_from_dynamic evaluation/solve_bound.py ran · our draft was wrong MIT (permissive) · 8028b74e11e83174 · report fixture: signature epoch_solution:list/1/list, cost:float/0/float, epoch:int/0/int, found_at_ns:int/0/int · returned Solution · level recorded, date not recorded
decode_solution training/optimization.py ran; the contract check could not run (RAISES) · metamorphic tier: deterministic MIT (permissive) · 4536b7b5b4e8fae9 · report fixture: signature solution:list/1/list, edges:list/1/list, nodes:list/1/int · returned tuple · level recorded 2026-09-22
format_pchgs_instance_as_json training/optimization.py ran; the contract check could not run (RAISES) · metamorphic tier: deterministic MIT (permissive) · 0eafde21a445f1e9 · report fixture: signature args:NoneType/0/?, instance:dict/0/?, profits:list/1/float · returned dict · level recorded 2026-09-22
get_edges_in_solution training/optimization.py ran · honoured contract MIT (permissive) · 5011071a64e93d22 · report fixture: signature solution:list/1/list · returned list · level recorded 2026-09-22
get_model_name in 34 papers training/run_training.py ran · our draft was wrong MIT (permissive) · 9153250275162f98 · report fixture: signature args:Args/0/? · returned Args · level recorded, date not recorded
get_nodes_in_solution training/optimization.py ran · honoured contract MIT (permissive) · a536b44435a29858 · report fixture: signature solution:list/1/list · returned list · level recorded 2026-09-22
make_to_ints training/optimization.py ran · honoured contract fingerprinted MIT (permissive) · b5090f3074119346 · report fixture: signature profits:ndarray/2/float · returned ndarray · level recorded 2026-09-22
GraphConvLayer in 6 papers training/optimization.py unverified MIT (permissive) · 29a904c381ea69eb · report
GraphNeuralNetwork training/optimization.py unverified MIT (permissive) · 9f6eaf73d42e09f1 · report
GraphNeuralNetwork_sparse training/optimization.py unverified MIT (permissive) · 6a821ffa842d04e8 · report
Linear in 127 papers training/optimization.py unverified MIT (permissive) · a0f31bdd1ab03cbe · report
Optimizer in 18 papers training/optimization.py unverified MIT (permissive) · f71c69c65ce31fe1 · report
loss_for_perturbation training/optimization.py unverified MIT (permissive) · b4b96fb57ac8bc15 · report
solve_pchgs training/optimization.py unverified MIT (permissive) · 88a8624dad9dd20b · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for Combinatorial Optimization enriched Machine Learning pipeline (graph method: Combinatorial Optimization enriched Machine Learning pipeline). 19 bricks; individually on a fixture: 12 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 5 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified. The assembly has not been run end-to-end.

  1. Optimizer entry · level 0 · unverified · f71c69c65ce31fe1
  2. GraphNeuralNetwork helper · level 0 · unverified · 9f6eaf73d42e09f1
  3. GraphNeuralNetwork_sparse helper · level 0 · unverified · 6a821ffa842d04e8
  4. Linear helper · level 0 · unverified · a0f31bdd1ab03cbe
  5. NeuralNetwork model · level 1 · ran · 23fbd12cb9ebd45b
  6. calculate_accuracy_mean helper · level 1 · ran · honoured contract · 17c7151f9a5817a8
  7. calculate_default_accuracy helper · level 1 · ran · honoured contract · 232200b94d4c4a11
  8. decode_solution helper · level 1 · ran; the contract check could not run (RAISES) · 4536b7b5b4e8fae9
  9. loss_for_perturbation loss · level 0 · unverified · b4b96fb57ac8bc15
  10. make_to_ints data_transform · level 1 · ran · honoured contract · b5090f3074119346
  11. GraphConvLayer helper · level 0 · unverified · 29a904c381ea69eb
  12. create_ffn_output helper · level 1 · ran · f3d2c454c7122b15
  13. create_ffn_preprocess helper · level 1 · ran · 12ad886a430d54de
  14. get_edges_in_solution helper · level 1 · ran · honoured contract · 5011071a64e93d22
  15. get_nodes_in_solution helper · level 1 · ran · honoured contract · a536b44435a29858
  16. apply_perturbation data_transform · level 1 · ran · our draft was wrong · 37dc75bdb37e8331
  17. format_pchgs_instance_as_json helper · level 1 · ran; the contract check could not run (RAISES) · 0eafde21a445f1e9
  18. solve_pchgs helper · level 0 · unverified · 88a8624dad9dd20b
  19. NumpyJSONEncoder helper · level 1 · ran · df2e0e8bac763335

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2304.00789") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Combinatorial OptimizationStochastic Optimization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections