Algorithm 1. Dynamic programming algorithm

Require: $L,T,A,P_{pickup},P_{dest},d_{seek},d_{driver},t_{seek},t_{driver},D_y,p_k$

Ensure: The optimal policy $\pi$

1: $p_k$ is a $\left|L\right|\times 1$ , V is a $\left|L\right|\times \left|T\right|$ matrix; $p_k\leftarrow 0,V\leftarrow 0$

2: for |L| to 1 do

3: $p_L\leftarrow p_k$

4: end for

5: for t = T − 1 to 1 do

6: for l = 1 to |L| do

7: for d in len(d) do

8: for $a\in A$ do

9: $a_{\max }\leftarrow$ find a $\max V^{\prime }\left(s,a\right)$ can be computed by Equation (4)

10: $\pi \leftarrow a_{\max }$

11: $V\left(s\right)\leftarrow \max V^{\prime }\left(s,a_{\max }\right)$

12: end for

13: end for

14: end for

15: end for

16: Return $\pi$