Abstract
The problem under consideration is to find the smallest number and location of public transit (buses, P.R.T., etc.) stops, so that no passenger is further away than a preselected distance from a stop. An optimum algorithm is proposed and discussed for a general network in which the nodes are community locations (and therefore it is just an evaluation procedure) and the stops are to be located along the arcs or on nodes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
