This paper is a commentary on the work of Butt and Cavalier (Socio-Econ. Plann. Sci. 31(2) (1997) 103), a paper that was published in an earlier issue of this journal. With the aid of an example problem, we demonstrate that the set of gridlines proposed by them to find the rectilinear least cost path between two points in the presence of convex polygonal congested regions is inadequate. We proceed to prove its adequacy for the case of rectangular congested regions in which the edges of the rectangles are parallel to the travel directions. In wake of the difficulties of the general problem, we consider a specific example of a convex quadrilateral congestion region and a pair of external origin and destination points. Finally, we revisit the example shown in Butt and Cavalier's paper and present a mixed integer linear programming formulation that determines the optimal locations of the entry and exit points for this example.
ASJC Scopus subject areas
- Geography, Planning and Development
- Economics and Econometrics
- Strategy and Management
- Statistics, Probability and Uncertainty
- Management Science and Operations Research