Pablo Sartor

Dr. Pablo Sartor

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 March 2015 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
ECEduardo Canale
Eduardo Canale
HCHéctor Cancela
Héctor Cancela
FRFranco Robledo
Franco Robledo
PRPablo Romero
Pablo Romero
PSPablo Sartor
Pablo Sartor

28 July 2021 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
HCHéctor Cancela
Héctor Cancela
LMLeslie Murray
Leslie Murray
FRFranco Robledo
Franco Robledo
PRPablo Romero
Pablo Romero
PSPablo Sartor
Pablo Sartor

17 August 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
GBGabriel Bayá
Gabriel Bayá
ECEduardo Canale
Eduardo Canale
Sergio NesmachnowSergio Nesmachnow
Sergio Nesmachnow
FRFranco Robledo
Franco Robledo
PSPablo Sartor
Pablo Sartor
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%.

1 July 2020
Verified
Book Chapter
Open access
PDF file
FRFranco Robledo
Franco Robledo
PRPablo Romero
Pablo Romero
PSPablo Sartor
Pablo Sartor
LSLuis Stábile
Luis Stábile
OVOmar Viera
Omar Viera
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.


26 February 2022
Verified
Book Chapter
Closed access
PDF file
GBGabriel Bayá
Gabriel Bayá
PSPablo Sartor
Pablo Sartor
FRFranco Robledo
Franco Robledo
ECEduardo Canale
Eduardo Canale
Sergio NesmachnowSergio Nesmachnow
Sergio Nesmachnow