Research Article
Floyd-A∗ Algorithm Solving the Least-Time Itinerary Planning Problem in Urban Scheduled Public Transport Network
Algorithm 1
Procedure of Itinerary Finder
.
| Step 0. (Initialization): | | Set OPEN list = and CLOSED list = | | Set and where | | Add to OPEN list, set | | Calculate where is pre-calculated by Cost-Estimator | | Step 1. (Expanding partial itinerary): | | while OPEN list do | | Select any node | | if then | | Go to Step 2 | | else | | Move from OPEN list to CLOSED list | | end if | | for all t-arc do | | if in CLOSED list then | | continue | | end if | | if then // Set previously | | continue | | end if | | if or where then | | continue | | end if | | Calculate by formula (2) or (4) | | if then | | continue | | else if not in OPEN list then | | Add to OPEN list | | end if | | Calculate corresponding by formula (3) or (6) | | Update with | | Calculate | | Record | | end for | | end while | | Step 2. (Reconstructing LT itinerary): | | Reconstruct LT itinerary by recursively recalling where | | Return |
|
