The travelling salesman problem is a popular optimization problem in computer-science and mathematics. All students of computer science will
seen from Malaysia

seen from Singapore
seen from China

seen from United States
seen from United Kingdom
seen from United States
seen from United States
seen from Germany
seen from Poland
seen from Malaysia
seen from China
seen from United States

seen from Singapore
seen from Singapore
seen from United States
seen from United States
seen from China
seen from United States
seen from United States
seen from China
The travelling salesman problem is a popular optimization problem in computer-science and mathematics. All students of computer science will
DEVELOPMENT OF A SMELL AGENT OPTIMIZATION ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS
DEVELOPMENT OF A SMELL AGENT OPTIMIZATION ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS
DEVELOPMENT OF A SMELL AGENT OPTIMIZATION ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS
Abstract:
This thesis presents the development of smell agent optimization (SAO) algorithm. The developed algorithm consists of three modes (sniffing, trailing and random modes). The evaporation of smell molecules from the smell source is modelled into sniffing mode using the concept of the hydrostatic…
View On WordPress