				-----------------

				RISE USERS GUIDE				

				-----------------



				Yupo Chan





RISE stands for Route Improvement Synthesis and Evaluation.  It is a 

scheduled-transportation location-routing model developed by Y. Chan at MIT 

and subsequently extended at Pennsylvania State University at University 

Park, Washington State University, and the Air Force Institute of Technology 

at Wright-Patterson AFB, Ohio.  The program is described in Chan (1974) and 

Chan (1979).  The model is most recently explained and expanded in Sections 

4.7 and 4.12 in the "Location-routing" Chapter of the Chan (2005) book, 

entitled LOCATION, TRANSPORT AND LAND-USE.



THE PROGRAM

***********



This directory, RISE, contains:

1)  the RISE Fortran source-program file - RISE.FOR

2)  RISE executable file - RISE.EXE

3)  three data set files - RISE1.DAT, RISE2.DAT, RISE3.DAT

4)  narrative on description and possible uses of the RISE program, File - 

USES.TXT

5)  Echo print on American-Airlines-case-study data-input-stream, File- 

CASE.TXT. While it needs to be encoded in the input format, this can serve as 

an additional dataset--beyond the demonstration dataset--if desired.

6)  technical information on output-interpretation subroutines contained in 

the RISE Program, File - SUBROUT.TXT



To run the RISE program:



1) Copy RISE.EXE and the three RISE?.DAT files to your operating directory.

2) Enter "rise" at the DOS prompt and answer prompts for data file and output 

file.

3) View the output file in an editor that can handle 132-character-wide 

lines.



SOFTWARE DESCRIPTION

********************



Inputs and Outputs



A package of programs has been developed for structuring scheduled-

transportation route networks. The following is a functional specification of 

the inputs, the variables and the outputs of the RISE program package:



Given



-- travel demand as a function of nonstop-, one-stop-, or two-stop-

routings

-- route specifications regarding intermediate stops and route geometry in 

general

-- specification of the minimal level-of-service for a origin-destination 

pair in order to face up to route competition

-- fleet specification (i.e., vehicle capacity, speed and range)

-- the network under study (i.e., the specification of terminals and 

inter-terminal distances)

-- revenues and cost functions.



Decision Variables



-- route acceptance or rejection

-- realized demand (i.e., that part of the potential demand actually 

served)

-- route (or segment) traffic-flow identified by origin and destination

-- assignment of vehicle type(s) to routes.



Solution



-- route-network structure

-- passenger or freight traffic-flow and routing

-- realized demand

-- route frequency

-- fleet-type assignment

-- fleet-size requirement.



INPUT SPECIFICATION

*******************



Here are some detailed guidelines for preparing the input data:



-- RISE1.DAT contains a test dataset intended to generate a star-shape route 

network

-- RISE2.DAT contains a test dataset intended to generate a two-loop route 

network

-- RISE3.DAT contains a test dataset intended to generate an open-loop route 

network



The data-input format can be summarized as follows, with examples drawn from 

RISE1.DAT:



Group 1 - Vehicle-Fleet Parameters

----------------------------------



line 1: 

Input-format specification, the example is (2I10,4F10.3) in FORTRAN.



line 2: 

-- Vehicle type 1, 2, 3 etc. (Only 1 type of vehicle allowed in the present 

version of the program)

-- Capacity of vehicle (30 seats in this case), 

-- Speed coefficients in the form of 

(time in min.) = (ground-time coeff) + (speed-coeff in min/mi)(distance) 

and the example is 

(minutes) = 50 + 0.3(dist in miles)



line 3: 

blank-line delimiter



Group 2 - System Run Parameters

-------------------------------



line 1: 

Input-format specification (4I10,2F10.5 in this example)



line 2: 

-- Vehicle type  (1 in this case)

-- No.-of-intermediate-stops in the longest route (2 in our case)

-- Degree-of-optimism in the demand forecast (0-least, 3-most); in the 

present version of the program the demand is taken exactly as input, the code 

in this case is therefore immaterial.

-- Type of origin-destination-pair market (0 means non-competitive, and 1 

means competitive); again, this program does not have this feature 

implemented, the nonfunctional entry of 1 is input in this example.

-- Ratio of effective-to-actual-capacity (0.83333333 entered here, suggesting 

only 83-percent of capacity is used for scheduling purposes, allowing for a 

"slack" of 17-percent, which accounts for all uncertainties such as 

Overbooking).

-- Profit-margin above direct-operating-cost; set here as 0-percent, meaning 

that we will schedule a dispatch as long as it is break-even.



Group 3 - Specification of Stops and Vehicle-Type that Serve Them

-----------------------------------------------------------------



line 1: 

Input-format specification (A4,6X,6I10)



line 2-?, where ? stands for the number of terminals in the network: 

--Alphanumeric code for a terminal (node), here we input Z01, Z02, etc.

which are short for zone 1, zone 2 ...

--Vehicle type(s) serving a stop; a "1" in column 20 means served by vehicle 

type 1, a "2" in column 30 means served by vehicle type 2, a "3" in column 40 

means served by vehicle type 3 etc.; in our case, this is nonfunctional since 

only one type of vehicle is allowed.



[line ?]+1:

A blank delimiter line.



Group 4 - Linear Yield-Data

---------------------------



line 1:

Input-format specification (2F10.5)



line 2:

Yield-formula coefficients in terms of 

(yield in $)=(intercept coeff)+(slope coeff)(distance); 

the example here is 

(yield)=0.35+(0.0)(distance), 

meaning a flat fare of 35 cents.



line 3:

Blank-line delimiter



Group 5 - Inter-Stop Network Data

---------------------------------



line 1:

Input format specification (3X,I5,2I1,6I4,I5A3,I1)



line 2-?:

--[Origin(O)-node-no.]-1 specification; here the alphanumeric code of Z01 is 

Input



line 3:

-- [Destination(D)-node-no.]-1 specification, the first destination is Z02 in 

this example;

-- O-D distance in tenths-of-a-mile, the distance between Z01 and Z02 is 1.8 

miles in this case;

-- Route-restriction code, which is 4, where 1 means operation unrestricted, 

nonstop service allowed, 2 means nonstop-service prohibited, 3 means 

operation prohibited, cannot offer single-vehicle service, 4 turnaround-

service prohibited, 5 means special route-restrictions;

-- maximum-no.-of-stops allowed, specified as 9;

-- O-D demand, 359 passengers in this example;

-- Intermediate-stop no. 1; intermediate stop no. 2 etc.; (a three-column 

blank between two stops means "or", while no blank between means "and"); for 

example, there are two intermediate-stop choices between Z01 and Z03: either 

stop by at Z02 or Z04;



[line ?]+1:

Origin-stop-2 specification etc., here after 6 destination nodes Z02 through 

Z07, origin node Z02 is now entered, and the input continues...



An echo print of the input data constitutes the first part of output. The 

echo print is a lot more readable and understandable than the instructions 

above. See RISE1.OUT for the echo print of the above set of DATA1.DAT data. 

In the event that a more realistic output is desirable, we have provided a 

text file of an echo print for an American-Airlines case-study in CASE.TXT.



