Olivares-Benitez, Elias
Main Affiliation
Preferred name
Olivares-Benitez, Elias
Official Name
Olivares Benítez, Elias
ORCID
0000-0001-7943-3869
Researcher ID
R-7075-2018
Scopus Author ID
55574580400
50 results
Now showing 1 - 10 of 50
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Sustainable Closed-Loop Supply Chains: A Systematic Literature Review(SCITEPRESS - Science and Technology Publications, 2026); ; 18 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Flexible shift scheduling for a call centre using column generation(2021); 2 6 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, An Airline Profit Management Model with Overbooking and No-Shows(SCITEPRESS - Science and Technology Publications, 2025); ; Catya Zuniga37 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Design of a Logistics Nonlinear System for a Complex, Multiechelon, Supply Chain Network with Uncertain Demands(2018); Scopus© Citations 11 1 17 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Circular Economy Modeling: A Multiobjective Closed-Loop Sustainable Supply Chain Problem Solved by Kernel Search(MDPI AG, 2026-02-25); ; ; Drzymalski, Julie25 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, A Formulation for the Stochastic Multi-Mode Resource-Constrained Project Scheduling Problem Solved with a Multi-Start Iterated Local Search Metaheuristic(MDPI, 2023); ; <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 yourconsent settings
Item type:Publication, A multi‐objective sustainable closed‐loop supply chain network problem with hybrid facilities(2024); ; ; Julie Drzymalski<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 yourconsent settings
Item type:Publication, Matheuristics for the Design of a Multi-Step, Multi-Product Supply Chain with Multimodal Transport<jats:p>Supply-chain network design is a complex task because there are many decisions involved, and presently, global networks involve many actors and variables, for example, in the automotive, pharmaceutical, and electronics industries. This research addresses a supply-chain network design problem with four levels: suppliers, factories, warehouses, and customers. The problem considered decides on the number, locations, and capacities of factories and warehouses and the transportation between levels in the supply chain. The problem is modeled as a mixed-integer linear program. The main contribution of this work is the proposal of two matheuristic algorithms to solve the problem. Matheuristics are algorithms that combine exact methods and heuristics, attracting interest in the literature because of their fast execution and high-quality solutions. The matheuristics proposed to select the warehouses and their capacities following heuristic rules. Once the warehouses and their capacities are fixed, the algorithms solve reduced models using commercial optimization software. Medium and large instances were generated based on a procedure described in the literature. A comparison is made between the algorithms and the results obtained, solving the model with a time limit. The algorithms proposed are successful in obtaining better results for the largest instances in shorter execution times.</jats:p>Scopus© Citations 4 3 7 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Production Planning for a Company in the Industry of Compact Discs Mass Replications(Springer International Publishing, 2017-06-17); ; ; 16 - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Multiobjective model to optimize charging station location for the decarbonization process in Mexico(2025); 37