Transit System with Rectangular Service Zone

Abstract

We study a deterministic model of a transit system with a rectangular service area to develop a new solution approach. We first point out that sometimes the iterative algorithm may be convergent to a point that is not the wanted solution. We construct an upper bound and a lower bound to run the bisection method that will converge to the optimal solution. The same numerical example used in two previously published papers was adopted by us to demonstrate that our solution approach is effective and efficient. Our paper will help researchers develop their solution algorithms.