Assignment

Run the ILP solver to optimally assign doctors to clinics.

Run Solver

100 doctors, 50 clinics, 95 total seats

Method: Integer Linear Programming (ILP) via scipy.optimize.milp / HiGHS

Objective: Minimize total Haversine distance

Constraints: 1 clinic per doctor, capacity limits, history exclusion

Run History

RunStatusAssignedTotal DistAvg DistTimeDate
#60004completed5/516.4 km3.27 km7 ms3/9/2026, 11:47:03 AM
#60003completed1/10.8 km0.80 km30 ms3/9/2026, 11:40:47 AM
#60002pending2/24.5 km2.23 km17 ms3/9/2026, 11:34:04 AM
#60001pending100/100368.4 km3.68 km21 ms3/9/2026, 11:25:19 AM
#30003failed0/10— km— km— ms3/6/2026, 12:31:42 PM
#30002failed0/100— km— km— ms3/6/2026, 12:31:20 PM
#30001failed0/100— km— km— ms3/6/2026, 12:31:11 PM
#4completed100/100348.5 km3.48 km146 ms3/5/2026, 2:59:05 PM
#3failed0/100— km— km— ms3/5/2026, 2:56:50 PM
#2failed0/100— km— km— ms3/5/2026, 2:55:04 PM
#1failed0/20— km— km— ms3/5/2026, 2:36:46 PM

Generate Mock Data

Generate random doctors and clinics in the Riyadh area for testing.

Chance each doctor visited each clinic before