How 0nyr/tdvrptw-solver works
TDVRPTW-solver is a research vehicle-routing optimizer, with a Python experiment runner around its C++ solver. The principal workflow is to select experiment instances, load a time-dependent routing instance, preprocess it, and solve it using branch-price-and-cut with labeling-based pricing; heuristic solutions are also supported. The runner records experiment results, and the repository includes a route-validity checker. The graph preserves documented capabilities and source-index-supported relationships; unsampled implementation details are not treated as inspected evidence.
Main entry points: main_bp_duration.cpp Solver entry · main.py Runner entry · experiment.py Experiment execution · bcp.cpp Branch-price-and-cut
Components 20
Experiment workflow
- Runner entry
runner/src/main.py - Instance selection
runner/src/running/experiment.py - Instance loading
runner/src/loading/load.py - Experiment execution
runner/src/running/experiment.py - Result output
runner/src/output/json_output.py - Route checker
checker/checker.py
Routing solver
- Solver entry
code/main/src/main_bp_duration.cpp - Instance preprocessing
code/main/src/preprocess - Branch-price-and-cut
code/main/src/bcp/bcp.cpp - Pricing problem
code/main/src/bcp/pricing_problem.cpp - Labeling algorithms
code/main/src/labeling/monodirectional_labeling.cpp - Route heuristics
code/main/src/heuristics
Routing domain
- VRP instance
code/nyr/src/vrp/instance.cpp - Routes and solutions
code/nyr/src/solutions/route.cpp - Solution objectives
code/nyr/src/solutions/objectives.cpp - Time-dependent costs
code/nyr/src/math/ndcpwlf.cpp
Optimization foundation
- Piecewise-linear functions
code/goc/src/math/pwl_function.cpp - LP solver interface
code/goc/src/linear_programming/cplex/cplex_solver.cpp - Enum reflection
code/magic_enum/include/magic_enum/magic_enum.hpp
Other components
- Experiment user
Connections 19
- Experiment user → Runner entry: runs experiments
README.md - Runner entry → Instance selection: loads runs
runner/src/main.py - Instance selection → Instance loading: selects instances
runner/src/loading/load.py - Instance loading → VRP instance: loads instance
runner/src/loading/load.py - Runner entry → Experiment execution: runs experiment
README.md - Experiment execution → Solver entry: invokes solver
- Experiment execution → Result output: records results
- Experiment user → Route checker: validates routes
README.md - Solver entry → Instance preprocessing: preprocesses instance
code/main/src/main_bp_duration.cpp - Solver entry → Labeling algorithms: runs labeling
code/main/src/main_bp_duration.cpp - Solver entry → Route heuristics: initializes solutions
code/main/src/main_bp_duration.cpp - Solver entry → Branch-price-and-cut: solves problem
- Branch-price-and-cut → Pricing problem: solves pricing
- Pricing problem → Labeling algorithms: generates routes
- Labeling algorithms → VRP instance: uses instance
- VRP instance → Time-dependent costs: uses travel costs
- Routes and solutions → Solution objectives: evaluates solutions
- Time-dependent costs → Piecewise-linear functions: uses functions
- Branch-price-and-cut → LP solver interface: solves relaxations