Using PSO with Munkres Algorithm.

2 次查看（过去 30 天）

Nirmal 2013-5-25

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/76966-using-pso-with-munkres-algorithm

编辑： Walter Roberson 2016-1-8

The following matrix is the input for my problem for which i have to find the order which incurs minimum cost

       1   2   3   4   5   6
[inf  8   8   5   2   8;
 8  inf  6   3   9   3;
 8   6  inf  6   8   3;
 5   3   6  inf  6   4;
 2   9   8   6  inf  8;
 8   3   3   4   8  inf]
 I have found the output as cost=16 and the order to be 5-4-6-2-1-3 using munkres algorithm.

Now my problem is that i have to do this using PSO. Either i can implement it along with munkres algorithm or with PSO alone.

I have no clue as how to do it with PSO. Pls help friends. thanks in advance.

3 个评论
显示 1更早的评论隐藏 1更早的评论

Nirmal 2013-5-26

The elements give the pair wise distance of the points.

Walter Roberson 2013-5-26

Are you sure this is an "assignment" calculation and not a shortest-path problem? The Munkres algorithm is polynomial but is for the "assignment" problem, whereas shortest path is an example of the class of problem that has no known polynomial time algorithm and yet has not been proven to take exponential time.

请先登录，再进行评论。

请先登录，再回答此问题。