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

Nan Xu; Xiang Wu

doi:10.1117/12.2667230

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

Nan Xu, Xiang Wu

Proceedings Volume 12587, Third International Seminar on Artificial Intelligence, Networking, and Information Technology (AINIT 2022); 125871O (2023) https://doi.org/10.1117/12.2667230
Event: Third International Seminar on Artificial Intelligence, Networking, and Information Technology (AINIT 2022), 2022, Shanghai, China

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.

Citation Download Citation

Nan Xu and Xiang Wu "A labeling algorithm to solve the shortest path problem with additional constraints", Proc. SPIE 12587, Third International Seminar on Artificial Intelligence, Networking, and Information Technology (AINIT 2022), 125871O (22 February 2023); https://doi.org/10.1117/12.2667230

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

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.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available