A labeling algorithm to solve the shortest path problem with additional constraints

Abstract

In this paper, we propose a labeling algorithm to deal with the shortest path problem with additional constraints take the forms of node Y must be included in or excluded from the shortest path if node X is passed through. We use a three dimensional label for each node in the network and define domination condition to delete unpromising paths so that the algorithm can quickly find the optimal path satisfying all the constraints.