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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.