Abstract: The shortest path problem between two points in time-dependent network was solved by using artificial bee colony algorithm. According to the characteristics of the first in first out network in time-dependent network, the path selection strategy in the original algorithm was improved to optimize the quality of generated individuals. The strategy of the algorithm added a Hash table for each individual (i.e. each path) to record the segments encountered in searching for paths. By looking up the table, we could find the better solution of the current individual. The experimental results show that the improved method can effectively improve the quality of the final solution and greatly shorten the running time.

Key words: the shortest path, time-dependent network, traffic network, artificial bee colony algorithm