Floyd-A^∗ Algorithm Solving the Least-Time Itinerary Planning Problem in Urban Scheduled Public Transport Network

Table 1

A timetable example.

𝑘

𝑛

𝑙1

𝑙2

𝑙3

𝑙4

𝑙5

𝑛1

𝑛2

𝑛3

𝑛4

𝑛1

𝑛2

𝑛4

𝑛5

𝑛6

𝑛7

𝑛1

𝑛7

1

6:02

6:14

6:25

6:05

6:18

6:30

6:05

6:15

6:02

6:16

6:00

6:12

2

6:08

6:21

6:31

6:15

6:29

6:40

6:10

6:20

6:10

6:23

6:03

6:15

3

6:13

6:25

6:36

6:25

6:39

6:51

6:15

6:24

6:18

6:32

6:06

6:17

4

6:18

6:29

6:39

6:33

6:46

6:58

6:20

6:30

6:26

6:40

6:09

6:20

5

6:22

6:34

6:44

6:41

6:54

7:07

6:23

6:33

6:30

6:45

6:12

6:24

⋮

⋮

⋮

⋮

⋮

⋮

⋮

⋮

⋮

⋮

⋮

⋮

⋮