Now showing 1 - 10 of 39
  • Some of the metrics are blocked by your 
    Item type:Publication,
      13
  • Some of the metrics are blocked by your 
    Item type:Publication,
    An improved LINMAP for multicriteria decision: designing customized incentive portfolios in an organization
    (2022)
    Jessica Rubiano-Moreno
    ;
    ;
    Alvaro Cordero-Franco
    ;
    Alejandro Rodríguez-Magaña
    <jats:title>Abstract</jats:title><jats:p>This study proposes three new versions of the well-known linear programming technique for multidimensional preference analysis (LINMAP). LINMAP addresses the multi-criteria decision problem by analyzing individual differences in preferences in relation to a set of prespecified incentives in multidimensional attribute space. The proposed models satisfy the decision-maker’s specific needs, such as determining a fixed number of incentives to be active or assigning a minimum/maximum weight for the active incentives. The performance of the developed models is assessed using information from a case study in which a decision-maker desires to determine an optimal portfolio of incentives based on the preferences of individuals surveyed. Experimental results confirm that the proposed models could obtain solutions according to the decision-maker’s needs, yielding a better selection of incentives to activate and their corresponding distribution of the weights than those of the original LINMAP model. Moreover, the consistency of the proposed models is evaluated by performing a sensitivity analysis over database variations of the case study and comparing the outcomes with the results provided in the original case study. Overall, this work is promising when creating a design portfolio, considering individuals’ different preferences.</jats:p>
      1  1Scopus© Citations 8
  • Some of the metrics are blocked by your 
    Item type:Publication,
    A Formulation for the Stochastic Multi-Mode Resource-Constrained Project Scheduling Problem Solved with a Multi-Start Iterated Local Search Metaheuristic
    <jats:p>This research introduces a stochastic version of the multi-mode resource-constrained project scheduling problem (MRCPSP) and its mathematical model. In addition, an efficient multi-start iterated local search (MS-ILS) algorithm, capable of solving the deterministic MRCPSP, is adapted to deal with the proposed stochastic version of the problem. For its deterministic version, the MRCPSP is an NP-hard optimization problem that has been widely studied. The problem deals with a trade-off between the amount of resources that each project activity requires and its duration. In the case of the proposed stochastic formulation, the execution times of the activities are uncertain. Benchmark instances of projects with 10, 20, 30, and 50 activities from well-known public libraries were adapted to create test instances. The adapted algorithm proved to be capable and efficient for solving the proposed stochastic problem.</jats:p>
      11
  • Some of the metrics are blocked by your 
    Item type:Publication,
    A multi‐objective sustainable closed‐loop supply chain network problem with hybrid facilities
    <jats:title>Abstract</jats:title><jats:p>A sustainable closed‐loop supply chain network requires conjunctive implementation of reverse logistics in the supply chain, with decisions that consider economic, environmental, and social factors. In real life, the problem needs to be addressed by prioritizing targets or interacting between them to give a range of solutions to the decision maker. In this context, this work proposes a novel multi‐objective sustainable closed‐loop supply chain network problem based on the revised network design model with hybrid recovery centers minimizing (1) the total economic cost, (2) the CO<jats:sub>2</jats:sub> emission of vehicles used, and (3) the total obnoxious distance. The latter objective is a novel implementation of the social dimension of a sustainable model. A sensitivity analysis of the multi‐objective model is developed through ANOVA. A dataset of instances was generated to test the model and the solution methods, which are configured with AUGMECON2, a linear programming relaxation implemented to improve the CPU time, and AUGMECON2‐EXTENDED to obtain more solutions to avoid exploring all space of the solution. The results show that an AUGMECON2‐EXTENDED implementation outperforms all the selected performance metrics. These performance metrics include NPS, CPU time, RPOS, QM, and HV. The results show an improvement on average of at least , , , , and , respectively, in those metrics, in comparison to other implementations.</jats:p>
    Scopus© Citations 11  29
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Exact and Metaheuristic Approaches for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setups and Shared Resources
    (SCITEPRESS - Science and Technology Publications, 2026) ;
    G.-de-Alba, Héctor
    ;
    Avalos-Rosales, Oliver
    ;
    Ángel-Bello, Francisco
      22
  • Some of the metrics are blocked by your 
    Item type:Publication,
    A discrete bilevel brain storm algorithm for solving a sales territory design problem: a case study
    (2018) ;
    Dámaris Dávila
    ;
    José-Fernando Camacho-Vallejo
    ;
    Rosa G. González-Ramírez
      1Scopus© Citations 8  2
  • Some of the metrics are blocked by your 
    Item type:Publication,
      1  12Scopus© Citations 8
  • Some of the metrics are blocked by your 
    Item type:Publication,
    The latency location routing problem with split deliveries: mathematical formulation and metaheuristic algorithm
    (2024) ;
    José Emmanuel Gómez‐Rocha
    ;
    José‐Fernando Camacho‐Vallejo
    ;
    Javier A. Moraga Pardo
    ;
    Rosa G. González‐Ramírez
    <jats:title>Abstract</jats:title><jats:p>Integrating location and routing into a unified decision‐making framework offers a more comprehensive reflection of real‐world scenarios where different facility layouts directly influence routing plans. Consequently, addressing the issue holistically becomes imperative, especially when considering service level metrics like customer waiting times. In this paper, we address the latency location routing problem with opening costs and split deliveries (LLRP‐OCSD). This complex problem involves optimizing the design of a supply chain network by determining depot locations, assigning vehicles and demand nodes to these depots, and designing routes. This must be done while accommodating split deliveries and prioritizing minimizing waiting times for demand nodes. We formulate a mathematical model and propose an iterated local search (ILS) algorithm to solve the problem. To validate the performance of our approach, we adapted a set of benchmark instances previously used for LLRP‐OC without considering split deliveries. Computational results demonstrate that the proposed model is able to optimally solve only 2 out of the 38 tested instances within a 2‐hour timeframe. On the other hand, the proposed ILS algorithm is able to find good‐quality solutions in significantly less computational time for the LLRP‐OCSD. Extensive experimentation on larger instances (up to 200 nodes) yields consistent results within reasonable computational limits. In summary, our findings highlight how split deliveries enhance vehicle utilization, enabling the use of smaller vehicles and creating balanced routes with minimal increases in latency costs.</jats:p>
      5
  • Some of the metrics are blocked by your 
    Item type:Publication,
    A location-routing problem for local supply chains
    (2023)
    Valeria Soto-Mendoza
    ;
    Efraín Ruiz-y-Ruiz
    ;
    Irma García-Calvillo
    ;
    ;
    Yajaira Cardona-Valdés
    Scopus© Citations 5  1  22