A biobjective Dijkstra algorithm

•Finding all non-dominated points of the biobjective shortest path problem.•Generalization of Dijkstra's algorithm for the biobjective case.•The proposed algorithms include pruning strategies and use bidirectional search.•Computational experiments indicate very stable running times of the new algorithm.•Computational experiments show clear superiority in real/synthetic networks.