Algorithm 1

Simple model (the less the average travel time, the better the accessibility)  for i = 0, 1, 2, …, 85   high=0, low=0   for j = 0, 1, 2, …, 85    if $D_{ij}$ < 0.05 & $a_0$ < $a_j$     high=high+1     else ($D_{ij}$ < 0.05)     low=low+1 Gravity model (the higher the accessibility score, the better the accessibility)  for i = 0, 1, 2, …, 85   high=0, low=0   for j = 0, 1, 2, …, 85    if $D_{ij}$ < 0.05 & $a_0$ > $a_j$      high=high+1    else ($D_{ij}$ < 0.05)     low=low+1