Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

To resolve issues starting MATLAB on Mac OS X 10.10 (Yosemite) visit: http://www.mathworks.com/matlabcentral/answers/159016

Using PSO with Munkres Algorithm.

Asked by Nirmal on 25 May 2013
 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
   1 [inf  8   8   5   2   8;
   2   8  inf  6   3   9   3;
   3   8   6  inf  6   8   3;
   4   5   3   6  inf  6   4;
   5   2   9   8   6  inf  8;
   6   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 Comments

Walter Roberson on 25 May 2013

What do the elements in the matrix represent?

Nirmal on 26 May 2013

The elements give the pair wise distance of the points.

Walter Roberson on 26 May 2013

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.

Nirmal

Products

No products are associated with this question.

0 Answers

Contact us