Ant Colony algorithm for routing
2016-08-23
3 0 0
no vote
Other
Earn points
This code is based on Ant Colony Metaheuristic, in order to find the shortest three paths for a three demand nodes in a graph of N nodes.
- The nodes and the form of the graph are defined by user, with the use of matrices.
- The algorithm delivers the length of the tree paths.
- This code was used to solve the WRA (wavelength and routing assigment) problem for a static traffic.
matlab
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment