A SIMULATION MODEL THAT CONTAINS SUCH INPUTS AS NUMBER, CAPACITY, AND VELOCITY OF VEHICLES; TIME DISTRIBUTION OF DEMANDS; SPATIAL DISTRIBUTION OF ORIGINS, DESTINATIONS, AND INTERMEDIATE POINTS; AND OUTPUT OPTIONS HAS BEEN EXERCISED ON AN IBM 360/67 TO EVALUATE THE EFFECTIVENESS OF A REAL-TIME ROUTING ALGORITHM FOR A DEMAND-RESPONSE TAXI SERVICE NAMED CARS (COMPUTER-AIDED ROUTING SYSTEM) DEVELOPED AT M.I.T. THE ALGORITHM IS HERUISTIC BECAUSE OF THE INAPPLICABILITY OF EXISTING OPTIMIZATION TECHNIQUES. THE MODEL, WRITTEN IN FORTRAN AND COMPOSED OF 40 SUBPROGRAMS ABOUT 100,000 BYTES LONG, WAS DESIGNED TO EVALUATE VARIOUS HERUISTICS BASED ON TIME-VERSUS-COST TRADEOFFS. THE OPERATING VARIABLES AND INTERACTIVE CHARACTERISTICS OF THE MODEL ARE DESCRIBED AND ILLUSTRATED. FURTHER INVESTIGATION IS PLANNED TO SIMULATE THE SYSTEM INSTEAD OF MERELY THE ALGORITHM.
Stored only when both papers are in the corpus — 33 citations exist upstream.