Download Traveling Salesman Problem

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project

page
1
page
2
page
3
page
4
page
5
page
6
page
7
page
8
Document related concepts
no text concepts found
Transcript 
Mid-term Presentation for TSP
- 2016-2. AI Team Project. CAUCSE. Member : 김재형/김해천/이성훈/이재형/조영준
Index.
•
•
•
•
•
•
Project Process
Greedy
Tree search
Simulated Annealing
Genetic Algorithm
Q&A
Project Process
-
Develop Environment
How to
How done
Test data
Greedy
-
Trade-off
Traditional NN.
Traditional 2opt.
Traditional 3opt.
Modified 2opt.
Tree Search
-
Trade-off
A* algorithm
NN. approach
Make constraints
heuristic function: NN. of NN.
Simulated Annealing
-
Trade-off
Traditional SA.
Cooling function
Hammering: once vs. N times with P%
Genetic Algorithm
-
Trade-off
Initialization
Selection
Crossover
Mutation
:
:
:
:
Random vs. NN.
Use probability or not
Random size PMX.
Random size mutation
with SA.
Q&A
Related documents