Operational Research Applied to Logistics an Retailing Management

Scholar Year: 2023/2024 - 1S

Courses

Head Teacher Responsability Maria da Graça Rodrigues Gomes da Costa Head

Weekly workload Hours/week T TP P PL L TC E OT OT/PL TPL O S Type of classes 2 2 Lectures Type Teacher Classes Hours Theoretical Totals 1 2,00 Graça Costa   2,00 Practices Totals 2 4,00 Francisca Souza   4,00

Teaching language

Portuguese

Intended learning outcomes (Knowledges, skills and competencies to be developed by the students)

•To identify and formulate problems with integer variables, with emphasis on problems with binary variables;
•To solve integer programming models;
•To identify, formulate and propose solutions for the binary knapsack problem;
•To express some problems by using network models;
•To propose solutions for some problems expressed by a network model;
•To identify, formulate and propose solutions for some routing problems.

Syllabus

1.INTEGER PROGRAMING
1.1 Introduction
1.2 Problem formulation using binary variables
1.3 Location problems
1.4 The Branch and Bound procedure

2.FUNDAMENTALS OF CUTTING AND PACKING PROBLEMS
2.1 Introduction
2.2 Formulations and applications
2.3 Heuristics for solving the binary knapsack problem
2.4 Optimal solution for the binary knapsack problem
2.5 The knapsack problem with a minimization criterion

3.NETWORK OPTIMIZATION
3.1 Introduction
3.2 The shortest path problem
3.3 The minimum spanning tree problem
3.4 The maximum flow problem
3.5 The minimum cost flow problem

4.FUNDAMENTALS OF DISTRIBUTION PROBLEMS WITH DEMAND ON THE NODES
4.1 Introduction
4.2 Formulations and applications
4.3 Heuristics for the travelling salesman problem
4.4 Lower limits for the travelling salesman problem

5.FUNDAMENTALS OF DISTRIBUTION PROBLEMS WITH DEMAND ON THE ARCS
5.1 Introduction
5.2 The Chinese postman problem
5.3 The rural postman problem
5.4 The postman problem with capacity constraints