Algorithm 1: Traffic Sensor Location Problem (TSLP)

Input: Network G((N, A, Ŵ), Maximum iterations (iter.max = 100), Tolerance probability (Tp = 0.05), Neighbor search fraction (Nfs = 0.5), Path time circuity threshold (ρ = 1.5) Initialize: -Generate shortest paths for each O/D pair using shortest path algorithm (Dijkstra) -T = Shortest path link-incident matrix -SensorSet = empty set While uncovered paths exist:    uncoveredPaths = Identify uncovered paths from T    For each iteration (up to iter.max):     CandidateLinks = empty set     randomly remove a fraction of previously selected sensors (based on Nfs)     While uncoveredPaths is not empty:       Evaluate coverage increment (ΔCoverage) for all links       Construct Candidate Selection List (CSL) from links with coverage close to a        maximum based on Tp       randomly select a link from CSL       add selected link to SensorSet       update uncoveredPaths by removing paths covered by the selected link     End While    End For    Check feasibility by recalculating shortest paths    Update T with new paths if needed End While Return SensorSet (final distribution of sensors)