Now showing 1 - 10 of 33
No Thumbnail Available
Publication

A capacitated lot-sizing problem in the industrial fashion sector under uncertainty: a conditional value-at-risk framework

2022 , Yajaira Cardona-Valdés , Nucamendi-Guillén, Samuel , Luis Ricardez-Sandoval

No Thumbnail Available
Publication

The Cumulative Capacitated Vehicle Routing Problem with Profits Under Uncertainty

2019 , M. E. Bruni , Nucamendi-Guillén, Samuel , S. Khodaparasti , P. Beraldi

No Thumbnail Available
Publication

A Capacitated Vehicle Routing Model for Distribution and Repair with a Service Center

2025 , Irma-delia Rojas-cuevas , Olivares-Benitez, Elias , Ramos , Alfredo S , Nucamendi-Guillén, Samuel

Background: Distribution systems often face the dual challenge of delivering products to customers and retrieving damaged items for repair, especially when the service center is separate from the depot. An optimized solution to this logistics problem produces benefits in terms of costs, greenhouse gas emissions, and disposal reduction. Methods: This research proposes a Capacitated Vehicle Routing Problem with Service Center (CVRPwSC) model to determine optimal routes involving customers, the depot, and the service center. AMPL-Gurobi was used to solve the model on adapted instances and new instances developed for the CVRPwSC. Additionally, a Variable Neighborhood Search (VNS) algorithm was implemented and compared with AMPL-Gurobi. Results: The model was applied to a real-world case study, achieving a 40% reduction in fuel costs, a reduction from 5 to 3 routes, and a sustainable logistics operations model with potential reductions of greenhouse gas emissions and item disposals. Conclusions: The main contribution of the proposal is a minimum-cost routing model integrating item returns for repair with customer deliveries, while the limitation is the exclusion of scenarios where return items exceed vehicle capacity. Finally, future research will enhance the CVRPwSC model by incorporating additional constraints and decision variables to address such scenarios.

No Thumbnail Available
Publication

An improved LINMAP for multicriteria decision: designing customized incentive portfolios in an organization

2022 , Jessica Rubiano-Moreno , Nucamendi-Guillén, Samuel , Alvaro Cordero-Franco , Alejandro Rodríguez-Magaña

AbstractThis 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.

No Thumbnail Available
Publication

A Bi-Level Vaccination Points Location Problem That Aims at Social Distancing and Equity for the Inhabitants

2023 , Edith Salinas , José-Fernando Camacho-Vallejo , Nucamendi-Guillén, Samuel

Designing efficient vaccination programs that consider the needs of the population is very relevant to prevent reoccurrence of the COVID-19 pandemic. The government needs to provide vaccination points to give out vaccine doses to the population. In this paper, the authors analyze the location of vaccination points whilst addressing the inhabitants’ preferences. Two objectives that prevent crowding of inhabitants are considered. The government aims for the minimum distance between located vaccination points is maximized, and for the number of inhabitants that attend the different vaccination points to be equitable. One of the key aspects of this problem is the assumption that inhabitants freely choose the located vaccination point to go. That decision affects the objectives of the government, since crowding at vaccination points may appear due to the inhabitants’ decisions. This problem is modeled as a bi-objective, bi-level program, in which the upper level is associated to the government and the lower level to the inhabitants. To approximate the Pareto front of this problem, a cross-entropy metaheuristic is proposed. The algorithm incorporates criteria to handle two objective functions in a simultaneous manner, and optimally solve the lower-level problem for each government decision. The proposed algorithm is tested over an adapted set of benchmark instances and pertinent analysis of the results is included. An important managerial insight is that locating far vaccination points does not lead us to a more equitable allocation of inhabitants.

No Thumbnail Available
Publication

An optimization framework for the distribution process of a manufacturing company balancing deliverymen workload and customer’s waiting times

2019 , José-Fernando Camacho-Vallejo , Nucamendi-Guillén, Samuel , Rosa G. González-Ramírez

No Thumbnail Available
Publication

A Formulation for the Stochastic Multi-Mode Resource-Constrained Project Scheduling Problem Solved with a Multi-Start Iterated Local Search Metaheuristic

2023 , Ramos , Alfredo S , Pablo A. Miranda-gonzalez , Nucamendi-Guillén, Samuel , Olivares-Benitez, Elias

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.

No Thumbnail Available
Publication

A methodology for increasing revenue in fashion retail industry

2018 , Nucamendi-Guillén, Samuel , Moreno, Miguel A. , Mendoza, Abraham

Purpose Fashion retail companies typically exhibit short life-cycles, high volatility and low predictability. Therefore, their success is largely determined by the organisation’s flexibility and responsiveness. The purpose of this paper is to present a methodology to facilitate inventory control to minimise both shortages and excess inventory for a multi-product, multi-period finite time horizon inventory problem by using statistical and stochastic analysis. Design/methodology/approach The proposed methodology operates in two phases: the first phase consists on determining an aggregate plan (AP) that will be used for monitoring the behaviour of the items during the time horizon. This plan is obtained by statistically analysing historical data related to sales and inventory shortages and is used to determine a demand forecast during the time horizon that allows to handle with potential disruptions derived from real demand variations. Finally, supply replenishment policies are defined to facilitate the monitoring process during the second phase. For the second phase, the behaviour of real demand for every item is captured into a database and compared against its projected demand (from the AP). If needed, adjustments are made in the procurement of future deliveries to reduce the probability of having shortages and/or excess inventory. Findings A case study in a Mexican fashion retail company was conducted to assess the performance of the methodology. Results indicate that shortage in early periods can be reduced totally for certain products while, for others, the reduction is about 90.5 per cent. In addition, the incomes of the company were increased over 57 per cent. Research limitations/implications Even when the success of the methodology has been shown, cultural and behavioural factors were not considered. An extensive study is suggested to determine if these factors should be included to enhance the performance of the methodology. Practical implications A case study of a Mexican fashion retail company was conducted to assess the performance of the proposed methodology. The methodology is easy to implement and effectively and quickly responds to disruptions in the demand and it also significantly reduces the level of shortages while increasing sales and revenue for the company. Originality/value This paper proposes a methodology that is able to anticipate product’s behaviour from early weeks. Additionally, replenishment policies allow to quickly adjust future orders to guarantee the availability of items and minimise overstock.

No Thumbnail Available
Publication

New formulations and solution approaches for the latency location routing problem

2022 , Nucamendi-Guillén, Samuel , Iris Martínez-Salazar , Sara Khodaparasti , Maria Elena Bruni

No Thumbnail Available
Publication

The Cumulative Capacitated Vehicle Routing Problem Including Priority Indexes

2020 , Karina Corona-Gutiérrez , Cruz, Maria-Luisa , Nucamendi-Guillén, Samuel , Olivares-Benitez, Elias