Smell Detection Agent Optimization Algorithm
SDA Optimization Algorithm (2014)
Smell Detection Agent (SDA) is an algorithm proposed by Vinod that employs canine (dogs) trained behavior. The algorithm creates a cartion space over a search space using smell trails and iterates the agents in resolving a path. The method can be applied to problems that incorporate path-based problems which are NP-hard.
Applications
* The algorithm is an intelligent multi agent algorithm that can be used in any optimal path identification. This path should be a shortest path among all paths.
* Multi-objective optimization: Multiple SDAs with different smell capacity (modify the data structure) can be used to solve multi-objective optimization problems. Here the data structure plays an important role for recording the objectives. A multiple source-destination group can be handled by allowing more SDAs to solve the problem.
* Computer networking: The shortest path identification in a WAN link is possible by SDA algorithm. Using SDA algorithm an optimised path is obtained in a multi hop environment.
* SDN controllers: An SDA based algorithm can be implemented in controller for Software Defined Networking(SDN) with a method to identify multiple disjoint paths between source and destination nodes. SDN separates the control intelligence from the data packet transmission and uses the controller to dynamically recompute the network state based on availability.
* Subgraph networks: Subgraph identification is an important application in many sciences. SDA algorithm is used for sub graph identification from a large complex network. This is especially in social media applications, drug discovery, protein-protein interaction and communication networks.
Bibliography
*
*
Smell Detection Agent (SDA) is an algorithm proposed by Vinod that employs canine (dogs) trained behavior. The algorithm creates a cartion space over a search space using smell trails and iterates the agents in resolving a path. The method can be applied to problems that incorporate path-based problems which are NP-hard.
Applications
* The algorithm is an intelligent multi agent algorithm that can be used in any optimal path identification. This path should be a shortest path among all paths.
* Multi-objective optimization: Multiple SDAs with different smell capacity (modify the data structure) can be used to solve multi-objective optimization problems. Here the data structure plays an important role for recording the objectives. A multiple source-destination group can be handled by allowing more SDAs to solve the problem.
* Computer networking: The shortest path identification in a WAN link is possible by SDA algorithm. Using SDA algorithm an optimised path is obtained in a multi hop environment.
* SDN controllers: An SDA based algorithm can be implemented in controller for Software Defined Networking(SDN) with a method to identify multiple disjoint paths between source and destination nodes. SDN separates the control intelligence from the data packet transmission and uses the controller to dynamically recompute the network state based on availability.
* Subgraph networks: Subgraph identification is an important application in many sciences. SDA algorithm is used for sub graph identification from a large complex network. This is especially in social media applications, drug discovery, protein-protein interaction and communication networks.
Bibliography
*
*
Comments