最短路径问题
All Colors Shortest Path Problem
摘要:
无向图上的所有颜色最短路径问题(All Colors Shortest Path Problem)是一个无向图上的问题,它的目标是找到一条最短的,可能是非简单的路径,其中每个颜色至少出现一次,假设图中的每个顶点都与预先已知的颜色相关联。据我们所知,本文是第一个定义和研究这个问题。尽管该问题在计算上类似于广义最小生成树和广义旅行商问题,但考虑到节点可能被多次访问的非简单路径,使得All Colors Shortest Path问题新颖且计算上独特。本文证明了全色最短路问题是NP-困难的,并且不适合于常数因子近似。我们还提出了几个启发式解决方案,这个问题的基础上LP松弛,模拟退火,蚁群优化,和遗传算法,并提供了广泛的模拟进行比较分析。提出的启发式算法不是众所周知的启发式算法的标准实现,而是为手头的问题量身定制的复杂模型。报告的非常有希望的结果承认了这一事实。
英文摘要:
All Colors Shortest Path problem defined on an undirected graph aims at finding a shortest, possibly non-simple, path where every color occurs at least once, assuming that each vertex in the graph is associated with a color known in advance. To the best of our knowledge, this paper is the first to define and investigate this problem. Even though the problem is computationally similar to generalized minimum spanning tree, and the generalized traveling salesman problems, allowing for non-simple paths where a node may be visited multiple times makes All Colors Shortest Path problem novel and computationally unique. In this paper we prove that All Colors Shortest Path problem is NP-hard, and does not lend itself to a constant factor approximation. We also propose several heuristic solutions for this problem based on LP-relaxation, simulated annealing, ant colony optimization, and genetic algorithm, and provide extensive simulations for a comparative analysis of them. The heuristics presented are not the standard implementations of the well known heuristic algorithms, but rather sophisticated models tailored for the problem in hand. This fact is acknowledged by the very promising results reported.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。