How adzen/vrptw works
Project type and purpose
• This is a single‐process C++ command‐line application (“VRPTW”) for solving Vehicle Routing Problems with Time Windows, using benchmark data sets (Solomon’s and Gehring & Homberger’s).
• It reads text files, builds in‐memory problem representations, runs an evolutionary (or heuristic) algorithm, and writes/validates solutions.
File structure
• Top‐level: VRPTW.sln / .vcxproj files (Visual Studio solution).
• Core source files:
• main.cpp – entry point, CLI orchestration
• customer.{cpp,h}, problem.{cpp,h} – domain model for customers & problem instance
• route.{cpp,h}, solution.{cpp,h} – representation of a candidate solution (routes)
• evolution.{cpp,h} – algorithm engine (e.g., genetic operators, fitness evaluation)
• utility modules under problems/ (import.cpp, runner.cpp, checkInput.cpp, checkSol.cpp, transform.cpp, sumOfTimeWindow.cpp) – data import, input validation, output checking, and transformations.
• Data folder: problems/ – contains all benchmark text files used as input, plus support tools.
README for additional insights
• Confirms the input format, lists the benchmark sources, and clarifies that the goal is to minimize fleet size and travel distance under capacity/time constraints.
Elements
• Rectangles for modules (parsers, domain, algorithm)