Checking date: 25/05/2022


Course: 2022/2023

Quantitative models and methods in management II
(15725)
Study: Bachelor in Industrial Technologies Engineering (256)


Coordinating teacher: GARCIA GUTIERREZ, ISABEL

Department assigned to the subject: Department of Mechanical Engineering

Type: Electives
ECTS Credits: 6.0 ECTS

Course:
Semester:




Requirements (Subjects that are assumed to be known)
No previous courses are required.
Objectives
- Knowledge and understanding of the fundamentals of quantitative algorithms and techniques for solving complex problems in industrial organization. - Being able to identify the most appropriate quantitative technique according to the nature of the problem being treated. - Being able to create an original simulation model in order to improve a real system, making modeling decisions in collaboration with other colleagues. Being able to apply the statistical techniques necessary to develop valid models and obtain results. - Being able to identify non-polynomial problems that require the use of heuristic approximations for their resolution. - Knowing the fundamentals and dynamics of heuristic search algorithms and algorithms inspired by nature. - Being able to present and defend the suitability of the decisions made in the context of applying quantitative techniques and algorithms to solve complex problems in industrial organization.
Skills and learning outcomes
Description of contents: programme
-Productive and logistic system analysis by means of discrete event simulation. -Design of simulation models of real systems. Definition of objectives and adoption of simplifying hypotheses. -Implementation of simulation models. Programming in Witness (simulation software) for the development of a model of a real system. -Application of the necessary statistical techniques in the different stages of development and exploitation of the model. -Result analysis and configuration comparison in simulation. -Introduction to NP problems. Review of the classical NP problems: the salesman problem, the knapsack problem, task programming with limited resources. -Heuristic search algorithms.
Learning activities and methodology
Lectures, exercises, practical sessions, cases and assignments to be carried out by the students and discussed during the sessions, autonomous student work, individual and group toutoring. Practical sessions in the laboratory. Participation in the partial and final evaluation sessions.
Assessment System
  • % end-of-term-examination 40
  • % of continuous assessment (assigments, laboratory, practicals...) 60
Calendar of Continuous assessment
Basic Bibliography
  • Adenso Díaz. Optimización heurística y redes neuronales. Paraninfo. 1996 (Capítulos 1 y 3)
  • Goldberg. Genetic algorithms in search, optimization, and machine learning. Addison-Wesley. 1989 (Capítulos 1 y 2)
  • Haupt and Haupt. Practical genetic algorithms. John Wiley & Sons. 1998
  • Law and Kelton. Simulation modeling and analysis . McGraw-Hill. 2007
  • Rich and Knight. Inteligencia artificial. McGraw-Hill. 1994 (Capítulos 2 y 3)
  • Taha, H.. Investigación de operaciones. Pearson. 2004

The course syllabus may change due academic events or other reasons.