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

seen from China
seen from United States
seen from China

seen from Malaysia

seen from Czechia

seen from United Kingdom
seen from South Africa
seen from Russia

seen from United States
seen from Netherlands
seen from China
seen from United Kingdom
seen from China
seen from United States

seen from United States
seen from Germany
seen from United States
seen from Puerto Rico
seen from Poland
seen from Puerto Rico
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