Greedy Nearest Neighbor Algorithm KOpt Search Simulated Annealing

구현한 알고리즘 • Greedy • Nearest Neighbor Algorithm • K-Opt Search • Simulated Annealing Search • Genetic Algorithm

Nearest Neighbor Algorithm Code

2 -opt Search Code

2 -opt Search Code

2 -opt Search Code

SA Code

SA Code

SA Code

SA Code

SA Code

GA Process • 1. Population 초기화 (Initialization) (Random or SA) • 2. 교배할 해들을 선택 (Selection) (Pseudo Tournament Selection) • 3. 선택된 해들을 교배 (Crossover) (PMX) • 4. 일부 해들에게 돌연변이 적용 (Mutation) (Swap Mutation) • 5. 2 ~ 4의 과정을 반복

GA Code

GA Code

GA Code

GA Code

GA Code

(Pseudo) Tournament Selection

PMX (Partially Mapped Crossover)

PMX Code

PMX Code

PMX Code

Swap Mutation Code

GA 참고자료 Youtube에 Noureddin Sadawi 검색

Project Demo

Q&A

• 휴대폰 번호 010 – 3481 – 4704 • E-mail 주소 seowangduk@gmail. com