ALGORITHMS FOR ROUTING AND SCHEDULING IN DEMAND-RESPONSIVE TRANSPORTATION SYSTEMS

Abstract

ALGORITHMS DEVELOPED BY NORTHWESTERN UNIVERSITY, WESTINGHOUSE AIR BRAKE COMPANY, AND THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY FOR SIMULATING THE SCHEDULING AND ROUTING OF DEMAND-RESPONSIVE TRANSPORTATION SYSTEMS ARE EVALUATED. SOME ATTENTION IS ALSO GIVEN TO CURRENT WORK IN THE TRANSPORTATION RESEARCH DEPARTMENT AT GENERAL MOTORS RESEARCH LABORATORIES. ALL FOUR SYSTEMS UTILIZE BUSES. SIMILARITIES AND DIFFERENCES IN THE COMPUTER PROGRAMS AND ALGORITHMS ARE DISCUSSED FOR THE FOLLOWING ITEMS: SELECTION OF A VEHICLE FOR PICKUP AND DELIVERY OF PASSENGERS, METHOD OF SELECTING PRIORITIES FOR PICKUP AND DELIVERY, ABILITY TO HANDLE GROUPS OF PASSENGERS WITH COMMON ORIGINS AND WITH OR WITHOUT COMMON DESTINATIONS, METHOD OF CONTACT AND FREQUENCY OF COMMUNICATION WITH INDIVIDUAL VEHICLES, METHOD OF DESCRIBING THE STREET NETWORK CHARACTERISTICS OF THE AREA TO BE SERVED, LOCALE OF VEHICLE TERMINALS, DISPATCHING POLICIES, AND PROPOSED LEVELS OF SERVICE. IT IS CONCLUDED THAT CONSIDERABLE WORK NEEDS TO BE ACCOMPLISHED IN THE AREA OF DEMAND-BUS SYSTEMS.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 11 citations exist upstream.