Pablo Sartor
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pablo Sartor has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Franco Robledo
Facultad de Ingenieria, Universidad de la Republica, Montevideo 11300, Uruguay
9 shared publications - Pablo Romero
Facultad de Ingeniería Universidad de la República Montevideo Uruguay
5 shared publications - Eduardo Canale
Instituto de Matemática y Estadística Facultad de Ingeniería Universidad de la República Montevideo Uruguay
3 shared publications - Héctor Cancela
Universidad de la Repblica, Montevideo, Uruguay
3 shared publications - Gabriel Bayá
Universidad de la República
2 shared publications - Luis Stábile
Universidad de la República
2 shared publications
Latest Publications
- Open Access
- 17 August 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (16) , 8212
Production Optimization in a Grain Facility through Mixed-Integer Linear Programming
This article introduces a Mixed-Integer Linear Programming model for cost optimization in multi-product multi-line production scheduling. This model considers discrete time windows and includes realistic constraints. The NP completeness of the problem is proven. A novel scheme based on embedding bounds is applied to speed up convergence. The model is tested on 16 input configurations of a real case study from the top Uruguayan grain production facility. The numerical results show that the model significantly improves the outcome of the current ad hoc heuristic planning, reducing on average 10% the overall production costs; and that the introduction of the embedded bounds-based scheme reduces significantly the elapsed time, on average by 22%.
- 17 August 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (16) , 8212
Open AccessProduction Optimization in a Grain Facility through Mixed-Integer Linear Programming
This article introduces a Mixed-Integer Linear Programming model for cost optimization in multi-product multi-line production scheduling. This model considers discrete time windows and includes realistic constraints. The NP completeness of the problem is proven. A novel scheme based on embedding bounds is applied to speed up convergence. The model is tested on 16 input configurations of a real case study from the top Uruguayan grain production facility. The numerical results show that the model significantly improves the outcome of the current ad hoc heuristic planning, reducing on average 10% the overall production costs; and that the introduction of the embedded bounds-based scheme reduces significantly the elapsed time, on average by 22%.
- 26 February 2022
- Published by Springer Nature
- p. 101-115
A Case Study of Smart Industry in Uruguay: Grain Production Facility Optimization
- 26 February 2022
- Published by Springer Nature
- p. 101-115
A Case Study of Smart Industry in Uruguay: Grain Production Facility Optimization
- Open Access
Solving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach
Students from Master of Business Administration (MBA) programs are usually split into teams. In light of the generalistic nature of MBA programs, diversity within every team is desirable in terms of gender, major, age and other criteria. Many schools rotate the teams at the beginning of every term so that each student works with a different set of peers during every term, thus training his or her adaptation skills and expanding the peer network. Achieving diverse teams while avoiding–or minimizing—the repetition of student pairs is a complex and time-consuming task for MBA Directors. We introduce the Max-Diversity Orthogonal Regrouping (MDOR) problem to manage the challenge of splitting a group of people into teams several times, pursuing the goals of high diversity and few repetitions. We propose a hybrid Greedy Randomized Adaptive Search Procedure/Variable Neighborhood Descent (GRASP/VND) heuristic combined with tabu search and path relinking for its resolution, as well as an Integer Linear Programming (ILP) formulation. We compare both approaches through a set of real MBA cohorts, and the results show that, in all cases, the heuristic approach significantly outperforms the ILP and manually formed teams in terms of both diversity and repetition levels.
Open AccessSolving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach
Students from Master of Business Administration (MBA) programs are usually split into teams. In light of the generalistic nature of MBA programs, diversity within every team is desirable in terms of gender, major, age and other criteria. Many schools rotate the teams at the beginning of every term so that each student works with a different set of peers during every term, thus training his or her adaptation skills and expanding the peer network. Achieving diverse teams while avoiding–or minimizing—the repetition of student pairs is a complex and time-consuming task for MBA Directors. We introduce the Max-Diversity Orthogonal Regrouping (MDOR) problem to manage the challenge of splitting a group of people into teams several times, pursuing the goals of high diversity and few repetitions. We propose a hybrid Greedy Randomized Adaptive Search Procedure/Variable Neighborhood Descent (GRASP/VND) heuristic combined with tabu search and path relinking for its resolution, as well as an Integer Linear Programming (ILP) formulation. We compare both approaches through a set of real MBA cohorts, and the results show that, in all cases, the heuristic approach significantly outperforms the ILP and manually formed teams in terms of both diversity and repetition levels.
- 28 July 2021
- Published by Wiley in International Transactions in Operational Research
- Vol. 29 (3) , 1688-1722
On the reliability estimation of stochastic binary systems
- 28 July 2021
- Published by Wiley in International Transactions in Operational Research
- Vol. 29 (3) , 1688-1722
On the reliability estimation of stochastic binary systems
- Open Access
- 1 July 2020
- Published by IntechOpen
A Survivable and Reliable Network Topological Design Model
This work is focused on the resolution of a mixed model for the design of large-sized networks. An algorithm is introduced, whose initial outcomes are promising in terms of topological robustness regarding connectivity and reliability. The algorithm combines the network survivability and the network reliability approaches. The problem of the topological design has been modeled based on the generalized Steiner problem with node-connectivity constraints (GSPNC), which is NP-hard. The aim of this study is to heuristically solve the GSP-NC model by designing low-cost highly connected topologies and to measure the reliability of such solutions with respect to a certain prefixed lower threshold. This research introduces a greedy randomized algorithm for the construction of feasible solutions for the GSP-NC and a local search algorithm based on the variable neighborhood search (VNS) method, customized for the GSP-NC. In order to compute the built network reliabilities, this work adapts the recursive variance reduction (RVR) technique, as a simulation method since the exact evaluation of this measurement is also NP-hard. The experimental tests were performed over a wide set of testing cases, which contained heterogeneous topologies, including instances of more than 200 nodes. The computational results showed highly competitive execution times, achieving minimal local optimal solutions of good quality fulfilling the imposed survivability and reliability conditions.
- 1 July 2020
- Published by IntechOpen
Open AccessA Survivable and Reliable Network Topological Design Model
This work is focused on the resolution of a mixed model for the design of large-sized networks. An algorithm is introduced, whose initial outcomes are promising in terms of topological robustness regarding connectivity and reliability. The algorithm combines the network survivability and the network reliability approaches. The problem of the topological design has been modeled based on the generalized Steiner problem with node-connectivity constraints (GSPNC), which is NP-hard. The aim of this study is to heuristically solve the GSP-NC model by designing low-cost highly connected topologies and to measure the reliability of such solutions with respect to a certain prefixed lower threshold. This research introduces a greedy randomized algorithm for the construction of feasible solutions for the GSP-NC and a local search algorithm based on the variable neighborhood search (VNS) method, customized for the GSP-NC. In order to compute the built network reliabilities, this work adapts the recursive variance reduction (RVR) technique, as a simulation method since the exact evaluation of this measurement is also NP-hard. The experimental tests were performed over a wide set of testing cases, which contained heterogeneous topologies, including instances of more than 200 nodes. The computational results showed highly competitive execution times, achieving minimal local optimal solutions of good quality fulfilling the imposed survivability and reliability conditions.
- Open Access
- 25 September 2019
- Published by IntechOpen
Topological Properties and Dynamic Programming Approach for Designing the Access Network
A wide area network (WAN) can be considered as a set of sites and a set of communication lines that interconnect the sites. Topologically a WAN is organized in two levels: the backbone network and the access network composed of a certain number of local access networks. Each local access network usually has a treelike structure, rooted at a single site of the backbone and connected users (terminal sites) either directly to this backbone site or to a hierarchy of intermediate concentrator sites which are connected to the backbone site. The backbone network has usually a meshed topology, and this purpose is to allow efficient and reliable communication between the switch sites that act as connection points for the local access networks. This work tackled the problem of designing the Access Network Design Problem (ANDP). Only the construction costs, e.g., the costs of digging trenches and placing a fiber cable into service, are considered here. Different results related to the topological structure of the ANDP solutions are studied. Given the complexity of the ANDP (the problem belongs to the NP-hard class), recurrences to solve it are proposed which are based on Dynamic Programming and Dynamic Programming with State-Space Relaxation methodology.
- 25 September 2019
- Published by IntechOpen
Open AccessTopological Properties and Dynamic Programming Approach for Designing the Access Network
A wide area network (WAN) can be considered as a set of sites and a set of communication lines that interconnect the sites. Topologically a WAN is organized in two levels: the backbone network and the access network composed of a certain number of local access networks. Each local access network usually has a treelike structure, rooted at a single site of the backbone and connected users (terminal sites) either directly to this backbone site or to a hierarchy of intermediate concentrator sites which are connected to the backbone site. The backbone network has usually a meshed topology, and this purpose is to allow efficient and reliable communication between the switch sites that act as connection points for the local access networks. This work tackled the problem of designing the Access Network Design Problem (ANDP). Only the construction costs, e.g., the costs of digging trenches and placing a fiber cable into service, are considered here. Different results related to the topological structure of the ANDP solutions are studied. Given the complexity of the ANDP (the problem belongs to the NP-hard class), recurrences to solve it are proposed which are based on Dynamic Programming and Dynamic Programming with State-Space Relaxation methodology.
- Open Access
- 1 January 2016
- Published by National Library of Serbia in Yugoslav Journal of Operations Research
- Vol. 26 (1) , 17-32
Diameter constrained reliability of ladders and Spanish fans
We are given a graph G = (V, E), terminal set K V and diameter d > 0. Links fail stochastically and independently with known probabilities. The diameter-constrained reliability (DCR for short), is the probability that the K-diameter is not greater than d in the subgraph induced by non-failed links. The contributions of this paper are two-fold. First, the computational complexity of DCR-subproblems is discussed in terms of the number of terminals k = jKj and diameter d. Here, we prove that when d > 2 the problem is NP-Hard when K = V. Second, we compute the DCR efficiently for Ladders and Spanish Fans. Open problems and trends for future work are discussed in the conclusions.
- 1 January 2016
- Published by National Library of Serbia in Yugoslav Journal of Operations Research
- Vol. 26 (1) , 17-32
Open AccessDiameter constrained reliability of ladders and Spanish fans
We are given a graph G = (V, E), terminal set K V and diameter d > 0. Links fail stochastically and independently with known probabilities. The diameter-constrained reliability (DCR for short), is the probability that the K-diameter is not greater than d in the subgraph induced by non-failed links. The contributions of this paper are two-fold. First, the computational complexity of DCR-subproblems is discussed in terms of the number of terminals k = jKj and diameter d. Here, we prove that when d > 2 the problem is NP-Hard when K = V. Second, we compute the DCR efficiently for Ladders and Spanish Fans. Open problems and trends for future work are discussed in the conclusions.
- 27 March 2015
- Published by Wiley in International Transactions in Operational Research
- Vol. 22 (5) , 811-821
Full complexity analysis of the diameter-constrained reliability
- 27 March 2015
- Published by Wiley in International Transactions in Operational Research
- Vol. 22 (5) , 811-821
Full complexity analysis of the diameter-constrained reliability
- Open Access
- 13 June 2013
- Published by IntechOpen
Optimal Design of a Multi-Layer Network an IP/MPLS Over DWDM Application Case
- 13 June 2013
- Published by IntechOpen
Open AccessOptimal Design of a Multi-Layer Network an IP/MPLS Over DWDM Application Case