{"course":{"id":"112262700O01","name":"最佳化方法","enroll_type":"必修","general_type":"","dept":"人工智慧學程","grade":2,"class_group":"甲","teacher":"高黃江","credit":3,"hour":3,"time":[{"day":5,"section":[5,6,7]}],"classroom":"","max":56,"min":10,"remark":"English-taught course","alt_for":"","courses":""},"detail":[["指定教材","None"],["參考教材","1. An Introduction to Optimization Algorithms,Thomas Weise,  2020\n2. An Introduction to Optimization, Edwin K. P. Chong, Stanislaw H. Żak, 2013"],["成績評量標準","Homework: 60%\nMidterm: 20%\nFinal exam: 20%\n(Optional): group project"],["教學方法","理論講授,實務講授"],["教學目標","1. Fundamentals of Optimization: basics of setting objectives and constraints and understanding the structure of optimization problems.\n\n2. Understand the metaheuristic algorithms and their practical applications.\n\n3. Understand simple optimization techniques, such as brute force, random search, hill climbing\n\n4. Understand advanced metaheuristics methods: tabu search, evolutionary algorithms, simulated annealing, ant colony optimization, and particle swarm optimization.\n\n5. Solving practical problems using the learned optimization techniques."]],"office_time":[["高黃江","Office: AI Center, Innovation Building | 3F\nOffice hours: Thursday, Morning, 9:00 - 12:00"]],"schedule":[["2024/01/19","5","7","3","高黃江","Introduction to Optimization","","Introduction to the course",""],["2024/01/26","5","7","3","高黃江","The Structure of Optimization","","Understanding the components and structure of optimization problems.",""],["2024/02/02","5","7","3","高黃江","Introduction to  Metaheuristic Optimization Algorithms","","Overview of metaheuristic algorithms and their applications.",""],["2024/02/23","5","7","3","高黃江","Brute Force - Random Search","","Basic brute force and random search methods for optimization.",""],["2024/03/01","5","7","3","高黃江","Hill Climbing","","Local search algorithm that iteratively moves towards the direction of increasing elevation.",""],["2024/03/08","5","7","3","高黃江","Hill Climbing Revisited","","Further exploration or refinement of hill climbing techniques.",""],["2024/03/15","5","7","3","高黃江","Tabu search","","Introduce Tabu search, an algorithm that uses memory to avoid revisiting previously explored solutions.",""],["2024/03/22","5","7","3","高黃江","Tabu search","","Implementating and practice on Tabu search",""],["2024/03/29","5","7","3","高黃江","Midterm","","Midterm",""],["2024/04/05","5","7","3","高黃江","Evolutionary Algorithms","","Optimization algorithms inspired by biological evolution, such as genetic algorithms.",""],["2024/04/12","5","7","3","高黃江","Genetic Algorithm","","Introduce genetic algorithm, workflow",""],["2024/04/19","5","7","3","高黃江","Genetic Algorithm","","Implementation of genetic algorithm",""],["2024/04/26","5","7","3","高黃江","Simulated Annealing","","A probabilistic optimization algorithm inspired by the annealing process in metallurgy.",""],["2024/05/03","5","7","3","高黃江","Ant Colony Optimization","","An optimization algorithm inspired by the foraging behavior of ants.",""],["2024/05/10","5","7","3","高黃江","Particle swarm optimization","","An optimization algorithm inspired by the social behavior of birds and fish.",""],["2024/05/17","5","7","3","高黃江","Simple Neural Network","","Introduce simple neural network (feed forward)",""],["2024/05/24","5","7","3","高黃江","Simple Neural Network","","Introduce simple neural network (backpropagation)",""],["2024/05/31","5","7","3","高黃江","Final Exam","","Final Exam",""]]}