Time varying travelling planning model and algorithm for maximal utility

A time varying travelling planning problem is proposed. The problem considers three constraints: (1) node´s residing time and edge´s travelling time are time dependent in networks; (2) the traveller has different preference for each node; (3) the available maximal travelling time is limited. The travelling networks are represented by time aggregated graphs (TAG) firstly. Then, a label method is designed to solve the problem. Finally, an example is demonstrated and the application is discussed. Compared to time expanded graph (TEG), the approach has suboptimal solution, but it reduces the computational cost significantly.