一种求解带附加约束的最短路径问题的标注算法

Third International Seminar on Artificial Intelligence, Networking, and Information Technology Pub Date : 2023-02-22 DOI:10.1117/12.2667230

Nan Xu, Xiang Wu

{"title":"一种求解带附加约束的最短路径问题的标注算法","authors":"Nan Xu, Xiang Wu","doi":"10.1117/12.2667230","DOIUrl":null,"url":null,"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.","PeriodicalId":128051,"journal":{"name":"Third International Seminar on Artificial Intelligence, Networking, and Information Technology","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A labeling algorithm to solve the shortest path problem with additional constraints\",\"authors\":\"Nan Xu, Xiang Wu\",\"doi\":\"10.1117/12.2667230\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":128051,\"journal\":{\"name\":\"Third International Seminar on Artificial Intelligence, Networking, and Information Technology\",\"volume\":\"108 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Seminar on Artificial Intelligence, Networking, and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2667230\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Seminar on Artificial Intelligence, Networking, and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2667230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们提出了一种标记算法来处理具有附加约束的最短路径问题，其形式为节点X经过时，节点Y必须包含在最短路径中或排除在最短路径之外。我们对网络中的每个节点使用三维标签，并定义控制条件来删除没有希望的路径，从而使算法能够快速找到满足所有约束的最优路径。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Third International Seminar on Artificial Intelligence, Networking, and Information Technology

自引率

0.00%

发文量