Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
About

About

Sou Ana Maria Rodrigues, natural da Maia, distrito do Porto, licenciada em Matemática Aplicada e Computação pela Universidade de Aveiro, Mestre em Métodos Quantitativos Aplicados à Gestão pela Escola de Gestão do Porto da Universidade do Porto (UP) e Doutorada, desde 2014, em Engenharia Industrial e Gestão pela Faculdade de Engenharia da UP com a tese intitulada “Sectores e Rotas na Recolha de Resíduos Sólidos Urbanos”.

Presentemente, sou Professora Adjunta no Instituto Superior de Contabilidade e Administração do Porto do Instituto Politécnico do Porto (ISCAP-PPorto), onde exerço funções desde Dezembro de 1998, e investigadora no INESC TEC – CESE.

Tenho especial interesse de investigação em problemas de otimização combinatória em particular problemas de setorização e problemas de localização e rotas. 

Interest
Topics
Details

Details

  • Name

    Ana Maria Rodrigues
  • Since

    01st November 2000
002
Publications

2023

A Resectorization of Fire Brigades in the North of Portugal

Authors
Lima, MM; de Sousa, FS; Öztürk, EG; Rocha, PF; Rodrigues, AM; Ferreira, JS; Nunes, AC; Lopes, IC; Oliveira, CT;

Publication
Springer Proceedings in Mathematics and Statistics

Abstract
Sectorization consists of grouping the basic units of a large territory to deal with a complex problem involving different criteria. Resectorization rearranges a current sectorization avoiding substantial changes, given a set of conditions. The paper considers the case of the distribution of geographic areas of fire brigades in the north of Portugal so that they can protect and rescue the population surrounding the fire stations. Starting from a current sectorization, assuming the geographic and population characteristics of the areas and the fire brigades’ response capacity, we provide an optimized resectorization considering two objectives: to reduce the rescue time by maximizing the compactness criterion, and to avoid overload situations by maximizing the equilibrium criterion. The solution method is based on the Non-dominated Sorting Genetic Algorithm (NSGA-II). Finally, computational results are presented and discussed. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

2023

Sectorization of a Parcel Delivery Service

Authors
Mostardinha, M; Escobar, P; Lopes, C; Rodrigues, AM;

Publication
Lecture Notes in Mechanical Engineering

Abstract
This paper explores the problem of sectorization of a parcel delivery service that wants to assign an action region to each of its teams, regarding the number of deliveries scheduled for each zone, so that there is a balanced service amongst sectors, covering contiguous zones, and considering limited capacities for the teams. Besides being relatively easy to model, the available optimization tools and software provide poor results when dimension increases in these types of problems, with computational capacity exceeding. In this paper an integer programming model, combined with an heuristic to return a faster solution, was implemented to solve a sectorization problem in two different situations. The main advantage of the strategy proposed, compared to previous ones, is its simplicity and easy implementation while still returning an optimal solution. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

2023

Developing a System for Sectorization: An Overview

Authors
Göksu Öztürk, E; Soares de Sousa, F; Margarida Lima, M; Filipe Rocha, P; Maria Rodrigues, A; Soeiro Ferreira, J; Catarina Nunes, A; Cristina Lopes, I; Teles Oliveira, C;

Publication
Operational Research

Abstract

2023

Dynamic Sectorization - Conceptualization and Application

Authors
de Sousa, FS; Lima, MM; Öztürk, EG; Rocha, PF; Rodrigues, AM; Ferreira, JS; Nunes, AC; Oliveira, C;

Publication
Lecture Notes in Mechanical Engineering

Abstract
Sectorization is the division of a large area, territory or network into smaller parts considering one or more objectives. Dynamic sectorization deals with situations where it is convenient to discretize the time horizon in a certain number of periods. The decisions will not be isolated, and they will consider the past. The application areas are diverse and increasing due to uncertain times. This work proposes a conceptualization of dynamic sectorization and applies it to a distribution problem with variable demand. Furthermore, Genetic Algorithm is used to obtain solutions for the problem since it has several criteria; Analytical Hierarchy Process is used for the weighting procedure. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

2023

Divide and Conquer: A Location-Allocation Approach to Sectorization

Authors
Lopes, C; Rodrigues, AM; Romanciuc, V; Ferreira, JS; Ozturk, EG; Oliveira, C;

Publication
MATHEMATICS

Abstract
Sectorization is concerned with dividing a large territory into smaller areas, also known as sectors. This process usually simplifies a complex problem, leading to easier solution approaches to solving the resulting subproblems. Sectors are built with several criteria in mind, such as equilibrium, compactness, contiguity, and desirability, which vary with the applications. Sectorization appears in different contexts: sales territory design, political districting, healthcare logistics, and vehicle routing problems (agrifood distribution, winter road maintenance, parcel delivery). Environmental problems can also be tackled with a sectorization approach; for example, in municipal waste collection, water distribution networks, and even in finding more sustainable transportation routes. This work focuses on sectorization concerning the location of the area's centers and allocating basic units to each sector. Integer programming models address the location-allocation problems, and various formulations implementing different criteria are compared. Methods to deal with multiobjective optimization problems, such as the e-constraint, the lexicographic, and the weighted sum methods, are applied and compared. Computational results obtained for a set of benchmarking instances of sectorization problems are also presented.

Supervised
thesis

2020

Apoio à Decisão em Projetos de Solidariedade Social - Redução do Desperdício Alimentar

Author
João Gil Costa Ramos Pereira

Institution
UP-FEUP

2019

Planeamento de Rotas no Transporte de Alimentos em Projetos de Solidariedade Social

Author
Henrique Daniel Martins Correia

Institution
UP-FEUP

2019

Setorização no Desenho de Rotas - aplicação ao transporte de utentes não urgentes entre as suas residências e um centro hospitalar

Author
Tiago Gaspar Pereira

Institution
UP-FEUP

2015

Problemas de rotas em recolha de resíduos urbanos: uma abordagem heurística

Author
Hugo Miguel Rodrigues Rego

Institution
UP-FEUP