| Abstract: |  This work describes and designs the solution of an algorithm for the Multiagent route planning problem in heterogeneous transport networks. The main task being solved is to find a complete route plan through a heterogeneous transport network for each traveller according to his or her journey request and then optimize all the plans found into one complete plan, where the lowest final price is used as an optimality criterion. The algorithm solves the first-mile problem defined as the path between the requested origin and the PT network. In the first mile part of the route, the passengers can share a taxi.
The algorithm uses the A* algorithm for searching paths through a timedependent graph. The first mile problem is solved by clustering of the passengers and by the VRP (Vehicle routing problem) solver. The algorithm was tested in a real-world scenario with different parametres. The complete price of the transport was decreased using a taxi sharing system.
|
|---|