Algorithm for optimal paths in multi-objective network

Many networks have been applied extensively in the real world, for example, route guiding system and scheduling of a production and distribution management system etc.. In this paper, we consider networks which consist of nodes and edges, and each edge has multi criteria. For such a multi-objective network, we obtain optimal paths. Extended Dijkstra's algorithm is effective in obtaining optimal path of multi-objective network. However, if we use this algorithm requires large memory area to obtain optimal paths of large networks which have multi-criteria. We consider effective properties in reducing search space, and propose a new algorithm which has less search space than extended Dijkstra's algorithm. By numerical experiments, we show our proposed algorithm is more efficient than the extended Dijkstra's algorithm.