Course Course Name L-T-P- Year of

code Credits Introduction

HEURISTIC SOLUTION TECHNIQUES
IE403 3-0-0-3 2016
Prerequisite : Nil 3
Course Objectives
 To provide basic understanding of various meta-heuristic solution algorithms.
 To apply these algorithms to solve optimization problems.
Syllabus
Introduction to Non-traditional optimization; Computational Complexity; Classification of
heuristic solution techniques; Metaheuristics; Introduction to evolutionary computation; Genetic
Algorithms: Concepts, Algorithm, variants of GA. Scatter Search-Components, Algorithm,
Applications. Multi objective evolutionary optimization; Greedy Randomized Adaptive Search
Procedure, Ant Colony Algorithms: Overview, Basic algorithm, Variants; Particle Swarm
Optimization: Overview, Basic algorithm; Local Search Algorithms; Tabu Search; Simulated
Annealing, Components, Variants of Simulated Annealing; Artificial Neural Networks-
Biological and Artificial Neural Networks, Basic Concepts, Generic Algorithm, Lagrangean
Relaxation; Constraint Programming- Problem Formulation in Constraint Programming, Basic
Search and Constraint Propagation; Applications of the above mentioned heuristic methods to solve
different types of optimization problems.
Expected Outcome
After the completion of course, the students
i. The students will gain knowledge in various metaheuristic solution algorithms and
their applications.
ii. The students will have the skill to model real life problems and will be able to apply
proper heuristic techniques to solve them.
References
1. Colin R. Reeves, “Modern Heuristic Techniques for Combinatorial Problems”, John Wiley
and Sons.
2. GüntherZäpfel , Roland Braune, Michael Bögl, “Metaheuristic Search Concepts-A
Tutorial with Applications to Production and Logistics”, Springer.
3. J.Dreo,A.Petrowski, EricTaillard , “Metaheuristics for Hard Optimization:Methods and
case studies”, Springer.
4. Michalewicz Z, “Genetic Algorithms + Data Structures = Evolution Programms”, Springer-
Verlag,Berlin.

COURSE PLAN
End Sem.
Module Contents Hours
Exam
marks
Introduction to Non-traditional optimization, Computational
Complexity; Heuristics – classification: Construction Heuristics, 4
I Local Search, Multi-Start Procedures; Assessing the Quality of 10%
Heuristics.
Metaheuristics- Definition, Classification. Introduction to
evolutionary computation 2
 Genetic Algorithm - Genetic Algorithms: Basic concepts, Types
of Encoding, Selection, Crossover and Mutation; Binary GA,
Continuous GA, Hybrid GA, Parallel GA-Application of GA in
4
solving Constrained and Combinatorial Optimization problems,
Sequencing and Scheduling problems and Transportation problem.
II 20%
Scatter Search-Components, Algorithm, Applications. 1
Multi objective evolutionary optimization: Pareto optimality,
Multi- objective evolutionary algorithms. 3

FIRST INTERNAL
EXAM
Greedy Randomized Adaptive Search Procedure 1
Ant Colony Algorithms: Overview, Basic algorithm, Variants,
Formalization and properties of ant colony optimization,
4
Applications in Scheduling and VRP.
III 20%
Particle Swarm Optimization – Basic Concepts, Swarm Intelligence
Principles, Computational Characteristics; PSO in Real Number
Space: Velocity Updating, Topology of the Particle Swarm, 3
Parameter Selection; Discrete PSO; PSO Variants; PSO
Applications in TSP, Knapsack Problems, Quadratic Assignment
Problem etc. Relaxation: Basic Methodology, Lagrangean heuristic
Lagrangean
IV and problem reduction, Lagrangean multipliers, Applications of
Lagrangean Relaxation and Lagrangean heuristic methods in 6 10%
solving location-allocation problems, Inventory Problems etc.
SECOND INTERNAL EXAM
Local Search Algorithms, Tabu Search –Tabu Search Principles,
Neighborhood, Candidate list, Short term and Long term memory,
Threshold Accepting, Application of TS in Planning and
5
Scheduling, Telecommunications, Portfolio management, Facility
layout, Transportation, Routing and Network Design.
V 20%
Simulated Annealing -Main Components of Simulated
Annealing, Homogenous vs. Inhomogenous Simulated Annealing,
Annealing Schedules, Applications in sequencing and scheduling, 3
Travelling salesman problem etc. Variants of Simulated Annealing.
Artificial Neural Networks- Biological and Artificial Neural
Networks, Basic Concepts, Generic Algorithm, Application Areas, 3
Application of ANN to solve TSP, Knapsack Problems etc.
VI Constraint Programming- Problem Formulation in Constraint 20%
Programming, Basic Search and Constraint Propagation, Constraint
Programming vs Mathematical Programming, Application of 3
Constraint Programming in Bin Packing, Scheduling, Sequencing
and Facility Location problems.
END SEMESTER
EXAM
End Semester Examination Question Paper Pattern:

Examination duration: 3 hours Maximum Marks: 100

Part A (Modules I and II):

Candidates have to answer any 2 questions from a choice of 3 questions. Each full question carries a
total of 15 marks and can have a maximum of 4 sub questions (a, b, c, d). No two questions shall be
exclusively from a single module. All three questions shall preferably have components from both
modules. Marks for each question/sub question shall be clearly specified. Total percentage of marks for
the two modules put together as specified in the curriculum shall be adhered to for all combinations of
any two questions.

Part B (Modules III and IV):

(Same as for part A )

Part C (Modules V and VI):

(Same as for part A, except that each full question carries 20 marks)

Note: If use of tables and charts are permitted for the university examination for this course, proper
direction of the same should be provided on the facing sheet of the question paper.