Abstract: The current researches on travelling planning problem hardly consider both utility and time varying.So this paper proposes a time varying travelling planning problem,which 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 maximal travelling time is limited.The tavelling networks are represented by time aggregated graphs(TAG) firstly.Then,a mathmatical planning model for the problem is proposed,and a label method is designed.Finally,an example is demonst rated and the application is discussed.Compared to time expanded graph(TEG),the approach may has suboptimal solution,but it reduces the computational cost significantly.

Key words: time varying, utility, time aggregated graph, label method