PSPablo Sartor

Pablo Sartor

*This is an algorithmically generated author record based on publicly available information.

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:


Latest Publications

  • Open Access

    Production Optimization in a Grain Facility through Mixed-Integer Linear Programming

    by Gabriel Bayá, Eduardo Canale, Sergio Nesmachnow, Franco Robledo, 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%.


  • A Case Study of Smart Industry in Uruguay: Grain Production Facility Optimization

    by Gabriel Bayá, Pablo Sartor, Franco Robledo, Eduardo Canale, Sergio Nesmachnow


  • Open Access

    Solving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach

    by Eduardo Canale, Franco Robledo, Pablo Sartor, Luis Stábile

    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.

  • On the reliability estimation of stochastic binary systems

    by Héctor Cancela, Leslie Murray, Franco Robledo, Pablo Romero, Pablo Sartor


  • Open Access

    A Survivable and Reliable Network Topological Design Model

    by Franco Robledo, Pablo Romero, Pablo Sartor, Luis Stabile, 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.


  • Open Access

    Topological Properties and Dynamic Programming Approach for Designing the Access Network

    by Franco Robledo, Pablo Romero, Pablo Sartor, Luis Stábile, Omar Viera

    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

    Diameter constrained reliability of ladders and Spanish fans

    by Héctor Cancela, Franco Robledo, Pablo Romero, Pablo Sartor

    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.


  • Full complexity analysis of the diameter-constrained reliability

    by Eduardo Canale, Héctor Cancela, Franco Robledo, Pablo Romero, Pablo Sartor