Research Article
The Impact of Fleet Coordination on Taxi Operations
Algorithm 1
Taxi Trip Network Calibration.
| | input Tolerance , maximum iterations , , , sampling time , set of taxi trips | | initialize links , discrete times , iteration | | initialize a data structure that sorts trips according to how often they were randomly selected and records at selection time for each trip | | initialize a data structure that sorts trips according to | | while and do | | with probability: select a trip randomly from the | | set of least randomly selected trips in , otherwise | | select the trip with highest from | | compute path time using , origin | | and destination of ; if a random trip was selected | | update | | compute with recorded duration of | | compute | | scale all in path with for | | compute path time using updated , origin | | and destination of to update | | compute the cost using and the last randomly | | selected trips | | | | end while | | output |
|