ARAna Maria Rodrigues
Ana Maria Rodrigues
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ana Maria Rodrigues has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- José Soeiro Ferreira
INESCTEC - Technology and Science
7 shared publications - Cristina Lopes
CEOS.PP, ISCAP, Polytechnic of Porto
5 shared publications - Elif Göksu Öztürk
INESCTEC - Technology and Science
5 shared publications - Cristina Oliveira
CEOS.PP, ISCAP, Polytechnic of Porto, 4465-004 Porto, Portugal
3 shared publications - Pedro Rocha
Polytechnic of Porto
3 shared publications - Ana Catarina Nunes
ISCTE - University Institute of Lisbon
2 shared publications
Latest Publications
- 4 July 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 255
Many-objective sectorization for last-mile delivery optimization: A decision support system
- 4 July 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 255
Many-objective sectorization for last-mile delivery optimization: A decision support system
- Open Access
- 2 June 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (11) , 2553
Divide and Conquer: A Location-Allocation Approach to Sectorization
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 -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.- 2 June 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (11) , 2553
Open AccessDivide and Conquer: A Location-Allocation Approach to Sectorization
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 -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. - 21 June 2022
- Published by Springer Nature
- p. 257-268
An Application of Preference-Inspired Co-Evolutionary Algorithm to Sectorization
- 21 June 2022
- Published by Springer Nature
- p. 257-268
An Application of Preference-Inspired Co-Evolutionary Algorithm to Sectorization
- 18 June 2022
- Published by Springer Nature
- p. 162-174
Sectorization of a Parcel Delivery Service
- 18 June 2022
- Published by Springer Nature
- p. 293-304
Dynamic Sectorization - Conceptualization and Application
- 18 June 2022
- Published by Springer Nature
- p. 293-304
Dynamic Sectorization - Conceptualization and Application
- 8 December 2021
- Published by Springer Nature
- p. 40-50
A Comparison Between Optimization Tools to Solve Sectorization Problem
- 8 December 2021
- Published by Springer Nature
- p. 40-50
A Comparison Between Optimization Tools to Solve Sectorization Problem
- 24 June 2021
- Published by Springer Nature
- p. 185-196
An Integer Programming Approach to Sectorization with Compactness and Equilibrium Constraints
- 24 June 2021
- Published by Springer Nature
- p. 185-196
An Integer Programming Approach to Sectorization with Compactness and Equilibrium Constraints