1. The algorithmic flowchart for the ‘‘direct solution” in Step 9 is
shown in Fig. 8. The detailed steps are as follows:
9.1. Search the route data that includes the feasible route set
SG1{} for each station in the stg{} and etg{} sets.
9.2. If SG1{} is an empty set, this implies that the route cannot
be determined; skip to Step 9.9. Otherwise, proceed to the
next step.
9.3. Take route R from the set SG1{}.
9.4. Take the sequence seq1 of station rs1 from the route R that
conforms to stg{}, and take the sequence seq2 of station
rs2 from the route R that conforms to etg{}.
9.5. If seq1 < seq2, this indicates that the travel direction of
this route conforms to the start and end points requirement;
proceed to the next step. Otherwise, jump to Step
9.8.
9.6. Determine whether the start and end stations are the
embark and disembark stations or not. If yes, this indicates
that passengers can embark at rs1 and disembark at rs2;
proceed to the next step. Otherwise, go to Step 9.8.
9.7. Consider the time that is needed from the departure point
to the start station or the destination station to the end
point in order to determine if the proposed route schedule
satisfies the required departure time and/or arrival time. If
so, it is a feasible route and is added into the feasible solution
set SG{}. Otherwise, the proposed route does not meet
requirements; return to Step 9.2.
9.8. Remove route R from the set SG1{}, and return to Step 9.2.
9.9. Complete the direct solution and go to Step 10.
2. Step 11, the one-transfer planning process, is illustrated in
Fig. 9, and the detailed steps are as follows:
11.1. Use stg{} as the starting point for this route, and utilize the
direct solution module to search the feasible set SG1{}.
11.2. Take etg{} as the end point of the route, and utilize the
direct solution module to search the feasible set SG2{}.
11.3. Take R1 from SG1.
11.4. Take R2 from SG2.
11.5. When the travel time associated with the destination
station in route R1 is greater than the run time of the origin
station in route R2, this suggests that within the run
time of route R1, there is no feasible transfer to route
R1. Jump to Step 11.10. Otherwise, proceed to the next
step.
11.6. Check the transfer time formula [(arrival time at the destination
station in route R1 + time required to travel from
R1’s destination station to R2’s departure station
+ reserved waiting time) > the departure time from
route R2’s departure station]. If this suggests that after disembarking
at R1’s designation station, the passenger is
unable to arrive at R2’s departure station, and then jump
to Step 11.10. Otherwise if the transfer distance requirement
is met, proceed to the next step.
11.7. Determine whether routes R1 and R2 involve forwardpath
transfers; if so, proceed to the next step. Otherwise,
jump to Step 11.9.
11.8. When routes R1 and R2 meet the forward-path transfer
condition, this indicates that the transfer from route R1
to route R2 is a feasible solution that can be added into
the set SG{}. Otherwise, this is not a feasible solution;
jump to Step 11.10.
11.9. When routes R1 and R2 meet the backward-path condition,
this indicates that the transfer from route R1 to route
R2 is a feasible solution and it can be added into SG{}.
Otherwise, the solution is infeasible, in which case proceed
to the next step.
11.10. Determine whether the set SG2{} is complete. If complete,
conduct a search process over set SG2{} and proceed to the
next step. Otherwise, return to Step 11.4.