Week - 1 |
Facility Location Problem, Capacitated/Uncapacitated Facility Location problems, p-median, p-center and covering problems and mathematical models. |
Week - 2 |
Travelling Salesman Problem, Capacitated Vehicle Routing Problem, Time Windows Vehicle Routing Problem, Heterogenous VRP and mathematical models |
Week - 3 |
Clarke-Wright Savings Algorithm, Nearest Neighborhood Algorithm, Lin-Kernighan Heuristic, Iterated Tour Partitioning Heuristic, Hill-Climbing Heuristic |
Week - 4 |
Constructive Heuristics: Ant Colony Algorithm, Max-Min Ant Colony Algorithm, Ant Colony System Algorithm, Ant Colony Optimization Algorithm |
Week - 5 |
Improvement Algorithms: Simulated Annealing, Iterative Local Search, Variable Neighborhood Search |
Week - 6 |
Improvement Heuristics II: Large Neighborhood Search, Adaptive Large Neighborhood Search and its implementation of VRPs |
Week - 7 |
Evolutionary Algorithms: Genetic Algorithm and its implementation of scheduling problems |
Week - 8 |
Decomposition Matheuristics: Cluster first route second approaches, Two Phase Approaches in VRP variants |
Week - 9 |
Decomposition Matheuristics II: Partial Optimization Approaches, Rolling Horizon Approaches |
Week - 10 |
Improvement Matheuristics: One-Shot Approaches,Approaches with MILP models for local optimization |
Week - 11 |
Integrated Location Routing Problems and Decomposition Matheuristics; Multi Objective Decomposition based matheuristics |
Week - 12 |
Integrated Location Routing Problems and Improvement Matheuristics |
Week - 13 |
Matheuristics in scheduling problems |
Week - 14 |
Heuristics, Metaheuristics and matheuristics performans meausrements, computational complexity of the algorithms |