How pengguansheng09/toptw works
This repository implements an exact Branch-Price-Cuts solver for the Team Orienteering Problem with Time Windows (TOPTW). The user-facing workflow is a console run selecting an instance, loading and preprocessing its vertices and arcs, and solving it to produce routes and result files. Internally, the documented algorithm combines branch-and-bound, a restricted master problem, column generation with exact and heuristic pricing, and cuts; a primal heuristic can seek integer solutions. The excerpts show instance loading, labeling-based pricing, branching, and heuristic behavior. Some solver-to-subsystem links are dashed because the relevant call sites were not excerpted.
Main entry points: BranchNBound.cs Branch and bound · ColumnGeneration.cs Column generation · GlobalVar.cs Solver state · OPTW.cs OPTW solver
Components 20
Run and input
- Console runner
Program.cs - Instance loader
LoadData.cs - TOPTW instances
Data - Solution results
Results
Exact search
- OPTW solver
OPTW.cs - Branch and bound
BranchNBound.cs - Branch rules
BranchScheme.cs - Primal heuristic
PrimalHeuristic.cs - Search stack
Stack.cs
Column optimization
- Column generation
ColumnGeneration.cs - Master problem
MasterProblem.cs - Exact pricing
Pricing.cs - Heuristic pricing
HeuristicPricing.cs - SRI cuts
SRIcuts.cs - Algorithm model
ClassAlgorithm.cs - Problem model
ClassProblem.cs
Shared solver state
- Solver state
GlobalVar.cs - Label queue
Queue.cs - Priority queue
PriorityQueue.cs
Other components
- Solver user
Connections 24
- Solver user → Console runner: starts
README.md - Console runner → Instance loader: loads instances
Program.cs - Instance loader → TOPTW instances: reads
LoadData.cs - Console runner → OPTW solver: starts solve
Program.cs - OPTW solver → Solution results: writes output
- Console runner → Solution results: writes results
Program.cs - OPTW solver → Solver state: uses state
OPTW.cs - OPTW solver → Label queue: uses queue
OPTW.cs - OPTW solver → Branch and bound: runs exact search
- Branch and bound → Search stack: stores nodes
BranchNBound.cs - Branch and bound → Primal heuristic: seeks incumbent
BranchNBound.cs - Branch and bound → Branch rules: creates children
- Branch and bound → Column generation: solves node LP
- Column generation → Master problem: optimizes relaxation
- Column generation → Exact pricing: prices routes
- Column generation → Heuristic pricing: prices heuristically
- Column generation → SRI cuts: separates cuts
- Exact pricing → Label queue: extends labels
Pricing.cs - Exact pricing → Solver state: uses state
Pricing.cs - Heuristic pricing → Solver state: uses state
HeuristicPricing.cs - Primal heuristic → Solver state: uses state
PrimalHeuristic.cs - Branch and bound → Solver state: uses state
BranchNBound.cs - Column generation → Solver state: uses state
ColumnGeneration.cs - Algorithm model → Solver state: uses parameters
ClassAlgorithm.cs