Module constructive 

Constructive heuristics for building initial VRP solutions.

• nearest_neighbor() — Greedy nearest-neighbor insertion, O(n²)
• nearest_neighbor_tw() — Time-window-aware nearest-neighbor (Solomon, 1987), O(n²)
• clarke_wright_savings() — Clarke-Wright savings algorithm (1964), O(n² log n)
• sweep() — Polar-angle sweep clustering (Gillett & Miller, 1974), O(n log n)
• solomon_i1() — Solomon’s I1 sequential insertion for VRPTW (1987), O(n²m)

Functions

clarke_wright_savings

Constructs a VRP solution using the Clarke-Wright savings algorithm.

nearest_neighbor

Constructs a VRP solution using the nearest-neighbor heuristic.

nearest_neighbor_tw

Constructs a VRPTW solution using a time-window-aware nearest-neighbor.

solomon_i1

Constructs a VRPTW solution using Solomon’s I1 insertion heuristic.

sweep

Constructs a VRP solution using the sweep heuristic.