Pamukkale University
University is the guide to life
Welcome to PAU;
Prospective Student
Our Students
Our Staff
TR
Information Package & Course Catalogue
Home Page
About University
Name And Address
Acedemic Authorities
General Discription
Academic Calendar
General Admission Requirements
Recognition of Prior Learning
General Registration Procedures
ECTS Credit Allocation
Academic Guidance
Information For Students
Cost Of Living
Accommodation
Meals
Medical Facilities
Facilities for Special Needs Students
Insurance
Financial Support for Students
Student Affairs
Learning Facilities
International Programs
Language Courses
Internships
Sports Facilities and Leisure Activities
Student Associations
Practical Information for Mobile Students
Degree Programmes
SECOND CYCLE - MASTER'S DEGREE
THE GRADUATE SCHOOL OF SOCIAL SCIENCES
MANAGEMENT INFORMATION SYSTEMS DEPARTMENT
2315 MANAGEMENT INFORMATION SYSTEMS
Course Information
Course Learning Outcomes
Course's Contribution To Program
ECTS Workload
Course Details
Print
COURSE INFORMATION
Course Code
Course Title
L+P Hour
Semester
ECTS
YOBS 554
HEURISTIC OPTIMIZATION ALGORITHMS
3 + 0
2nd Semester
7,5
COURSE DESCRIPTION
Course Level
Master's Degree
Course Type
Elective
Course Objective
Since most optimization problems in production and service systems have an NP-hard nature, it is necessary to use heuristic algorithms in the solution stage. It is aimed to apply heuristic algorithms to large optimization problems.
Course Content
Introduction to optimization problems, NP-Complete and NP-Hard problems, Lagrangian relexation, basic heuristics (Saving, Neighbor search, Greedy), improvement heuristics (K-opt, Lin–Kernighan), metaheuristics methods (Genetic Algorithms, Tabu Search, Simulated Annealing, Particle Swarm Optimization).
Prerequisites
No the prerequisite of lesson.
Corequisite
No the corequisite of lesson.
Mode of Delivery
Face to Face
COURSE LEARNING OUTCOMES
1
Learns the basic concepts of heuristic methods.
2
Gains the ability to define problems and develop solutions using mathematical models.
3
Gains the ability to adapt classical and improvement heuristics to solve NP-Hard problems.
4
Gains the ability to adapt metaheuristic methods for solving NP-Hard problems.
COURSE'S CONTRIBUTION TO PROGRAM
PO 01
PO 02
PO 03
PO 04
PO 05
PO 06
PO 07
PO 08
PO 09
PO 10
PO 11
PO 12
LO 001
LO 002
LO 003
LO 004
Sub Total
Contribution
0
0
0
0
0
0
0
0
0
0
0
0
ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
Activities
Quantity
Duration (Hour)
Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)
14
3
42
Hours for off-the-classroom study (Pre-study, practice)
14
3
42
Assignments
2
40
80
Mid-terms
1
13
13
Final examination
1
18
18
Total Work Load
ECTS Credit of the Course
195
7,5
COURSE DETAILS
Select Year
All Years
This course is not available in selected semester.
Print
L+P:
Lecture and Practice
PQ:
Program Learning Outcomes
LO:
Course Learning Outcomes
{1}
##LOC[OK]##
{1}
##LOC[OK]##
##LOC[Cancel]##
{1}
##LOC[OK]##
##LOC[Cancel]##
Home Page
About University
Name And Address
Acedemic Authorities
General Discription
Academic Calendar
General Admission Requirements
Recognition of Prior Learning
General Registration Procedures
ECTS Credit Allocation
Academic Guidance
Information For Students
Cost Of Living
Accommodation
Meals
Medical Facilities
Facilities for Special Needs Students
Insurance
Financial Support for Students
Student Affairs
Learning Facilities
International Programs
Language Courses
Internships
Sports Facilities and Leisure Activities
Student Associations
Practical Information for Mobile Students
Degree Programmes