No self-introduction
Loading
Profile
Follow
codes (9)
solving TSP using genetic algorithm
no vote
In the computer science field of artificial intelligence , a genetic algorithm (GA) is a search heuristic that mimics the process of natural selection . This heuristic (also sometimes called a metaheuristic ) is routinely used to generate useful solutions to optimization and 
waleed477913 2016-08-23
waleed477913 2 0
1
solving TSP using hopfield neuron network
no vote
The travelling salesman problem ( TSP ) asks the
following question: Given a list of cities and the distances between
each pair of cities, what is the shortest possible route that visits
each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization , important in operations research and theoretical computer science .
TSP is a special case of the travelling purchaser problem .
In the waleed477913 2016-08-23
waleed477913 1 0
1
solving TSP using tabu search algorithm
no vote
Tabu search , created by Fred W. Glover in 1986 [ 1 ] and formalized in 1989, [ 2 ] [ 3 ] is a metaheuristic search method employing local search methods used for waleed477913 2016-08-23
waleed477913 1 0
1
solving TSP using ant colony optimization
no vote
this is matlab code implementing optimization algorithm to solve traveling sales man problem TSP, we solve symmetric TSP , we use Ant Colony optimization algorithm to solve the TSP problem which has an advantage of get the nearest path between cites
waleed477913 1 0
1
Marquardt optimization algorithm
no vote
waleed477913 1 0
1
marquardt method
no vote
waleed477913 1 0
1
Bisection method
no vote
this is an implementation of bisection method for finding the optimum point minimum or maximum, using algorithm of bisection method, z= f(l) + f(R) / 2
minimum point of any derivative function that can be derivative once
The bisection method in mathematics is a root-finding method that repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing. It is a very simple and robust method,
but it is also relatively slow. Because of this, it is often used to
obtain a rough approximation to a solution which is the
waleed477913 1 0
1
newton method
no vote
waleed477913 1 0
1
solving TSP using PSO
no vote
solving tsp problem using pso algorithm, the tsp problem is man that want to visit many cities only once starting from location and ending with this location so that he must gain the minimum cost of the tour
waleed477913 1 0
1
No more~
Follows0
Fans0