COIN · PERMUTATION ROUTING · TIME WINDOWS

TSP with Time Windows
Research Lab

Reuse the verified permutation experiment frame on routing with arrival windows, waiting, lateness and Pareto trade-offs.

01 · REPRESENTATION

Customer permutation

The depot is fixed outside the chromosome; every customer appears exactly once.

02 · TIME WINDOWS

Hard / soft semantics

Hard mode penalizes infeasible tours. Soft mode exposes tardiness as a decision objective.

03 · BENCHMARK PROVENANCE

López-Ibáñez collection

Canonical Solomon–Potvin–Bengio and Dumas matrices are loaded without reconstructing their distances. Source ↗

StatusReady
Algorithm × seed runs0 / 0
Evaluations / seed4,000
Selected solution

Customer locations and time windows

Learning progress

Objective trade-offs

Selected route and service timeline

Final solution sets