.
Shortest Path Problems: An Introduction to ENS208
What is Shortest Path Problem?
Terminology
Travelling Salesman Problem (Enumeration / Nearest Neighbor Algorithm)
Problem Definition
Solving Problem
Enumeration
Example 1
Nearest Neighbor Algorithm
Example 2
Example 3
Example 4
Example 5
Exam Like Question 1
Exam Like Question 2
Exam Like Question 3
Travelling Salesman Problem (Savings / 2-opt Heuristics)
Savings Matrix
Savings Heuristic
Example 1
Example 2
Exam Like Question 1
Exam Like Question 2
Two-Opt Swap
Important Note on Two-Opt Swaps
Two-Opt Heuristic
Example 3
Example 4
Exam Like Question 3
Exam Like Question 4
Exam Like Question 5
Vehicle Routing Problem
Problem Definition
Solution Space of VRP
Example 1
Solving Problem
Cluster-First Route-Second (CFRS)
Example 2
Example 3
Exam Like Question 1
Exam Like Question 2
Route-First Cluster-Second (RFCS)
Example 4
Example 5
Exam Like Question 3
Exam Like Question 4
Inter-Route Swap Operation
A Side Note on Inter-Route Swaps
Example 6
Exam Like Question 5
Coding
Part 1
Part 2
2011 yılında Endüstri Mühendisliği okumak için başladığım Sabancı Üniversitesi'nden 2018 yılında Bilgisayar Mühendisi olarak mezun oldum. Şu anda UALR'da Information Science doktora eğitimimi sürdürüyorum. 7 yıldır Altun ismiyle başta Sabancı Üniversitesi olmak üzere çeşitli okullarda Endüstri ve Bilgisayar Mühendisliği alanlarında ders vermekteyim.
₺699.99