Fleet Route Optimizer

Capacitated vehicle routing with time windows over the real Redlands street network — Clarke-Wright savings construction followed by 2-opt and Or-opt local search, in a native C++ kernel.

C++ VRP Solver
Fleet Controls
Routes

					

				

			

			

				

					
Dispatch Plan

					

						

							
–
Vehicles Used

							
–
Total Distance

							
–
Longest Route

							
–
Improvement

						


						

							Routes follow real streets. The depot is the square marker; stops are numbered in visit order and coloured by vehicle. Unserved stops are grey.
						

						


						

							Convergence — objective (distance plus a fixed cost per vehicle) after construction and after each local-search pass.
						

						

							
						


						

							Schedule — one bar per vehicle across the shift. The light band behind each block is the customer's time window; the block is the actual arrival and service.