Welcome to Modeling Frameworks for Discrete Optimization Problems
Description: The course will address topics of optimization of discrete problems. Special emphasis will be given to transportation and scheduling problems and their formulation as Constraint Logic Programming problems. The students will also be introduced to a solution approach in Oz Mozart or similar software and various solution strategies for solving small and large optimization problems. The practical examples will focus on autonomous automated systems e.g. AGVs and mobile robots. The course is for students who would like a deeper insight into discrete problems and their solution or for students looking for a greater insight into solving transportation or scheduling problems.
Prerequisites: Master’s degree in Industrial Engineering, Operations Research, Applied Operations Research, Computer Science, Mathematics or similar.
Specifically a background in linear algebra and basic programming skills are required.
Learning objectives:
- Be able to model discrete transportation and scheduling problems,
- Understanding and formulating problems using Constraint Logic Programming,
- Formulating and solving simple problems in Oz Mozart,
- Understanding search strategies and their various advantages and disadvantages and be able to choose an appropriate strategy,
- Understanding NP hard vs. NP complete problems and challenges associated with solving these types of problems,
- Gain insight and be introduced to different kinds of distribution networks while providing insights on how to manage supply chains and logistics networks,
- Understanding Discrete-Event Systems driven Decision Support Systems used in modern management, industrial engineering, and computer science,
- Understanding and formulating production flow problems in the framework of Petri nets.
- Understanding robustness and strategies for investigating this.
Teaching methods: The course will be structured around lectures with dedicated exercise workshops to formulate and solve problem instances.
Criteria for assessment: The students will be evaluated based on the handed in exercises as completed as part of the course. We expect the finished exercises will require some additional work and that they will be handed in one week after the final lecture.
Key literature:
- Bocewicz, G., Nielsen, I., Banaszak, Z., Iterative multimodal processes scheduling (2014) Annual Reviews in Control, 38 (1), pp. 113-122.
- Dolgui A., Proth J-M., Supply Chain Engineering (Useful Methods and Techniques), Springer-Verlag, London, 2010, ISBN 978-1-84996-017-5, 541 pp.
- Van Roy P., Haridi S., Concepts, Techniques, and Models of Computer Programming, MIT Press 2004, 900 pp.
- Schulte CH., Smolka G., Wurtz J.: Finite Domain Constraint Programming in Oz, DFKI OZ documentation series, German Research Center for Artificial Intelligence, Stuhlsaltzenhausweg 3, D-66123 Saarbrucken, Germany, 1998.
- Józefowska J., Węglarz J., (Eds.) Perspectives in Modern Project Scheduling, Springer Science+Buisness Media, LLC, USA, 2006, ISBN-10 0-387-33643-5 (HB), 444 pp.
- Banaszak Z., Bocewicz G., Decision Support Driven Models and Algorithms of Artificial Intelligence, Management Sciences Series, vol. 1, WUT, Warsaw, 2011, ISBN 978-83-63370-00-8, 235 pp.
- Banasza,k Z., Bocewicz G., Declarative Modeling Driven Approach to Production Orders Portfolio Prototyping, w: New Frontiers in Information and Production Systems Modelling and Analysis / Różewski Przemysław [i in.] , Intelligent Systems Reference Library, vol. 98, 2016, Springer International Publishing, ISBN 978-3-319-23337-6, pp. 141-168.
Organizer: Associate Professor Peter Nielsen, email: peter@m-tech.aau.dk
Lecturers: Grzegorz Bocewicz, Dr. Tech. Professor, Dean Koszalin University of Technology, Gang Chen, AAU, M-tech, Peter Nielsen, AAU, M-tech, and Zbigniew Banaszak, Dr. Tech. Professor, Warsaw University of Technology
ECTS: 4
Time: 4. - 7. September 2017
Place:
Zip code:
City:
Number of seats: 12
Deadline: 14. August 2017
Important information concerning PhD courses: We have over some time experienced problems with no-show for both project and general courses. It has now reached a point where we are forced to take action. Therefore, the Doctoral School has decided to introduce a no-show fee of DKK 5,000 for each course where the student does not show up. Cancellations are accepted no later than 2 weeks before start of the course. Registered illness is of course an acceptable reason for not showing up on those days. Furthermore, all courses open for registration approximately three months before start. This can hopefully also provide new students a chance to register for courses during the year. We look forward to your registrations.
- Teacher: Peter Nielsen