Repository logo
Communities
Research Outputs
Projects
Researchers
Statistics
Feedback
  1. Home
  2. CRIS
  3. Publications
  4. An Improved Grey Wolf Optimizer for a Supplier Selection and Order Quantity Allocation Problem
Details

An Improved Grey Wolf Optimizer for a Supplier Selection and Order Quantity Allocation Problem

Journal
Mathematics
ISSN
2227-7390
Date Issued
2020
Author(s)
Alejo-Reyes, Avelina  
Facultad de Ingeniería - CampGDL  
Erik Cuevas
Mendoza, Abraham  
Facultad de Ingeniería - CampGDL  
Olivares-Benitez, Elias  
Facultad de Ingeniería - CampGDL  
Type
text::journal::journal article
DOI
10.3390/math8091457
URL
https://scripta.up.edu.mx/handle/20.500.12552/2942
Abstract
<jats:p>Supplier selection and order quantity allocation have a strong influence on a company’s profitability and the total cost of finished products. From an optimization perspective, the processes of selecting the right suppliers and allocating orders are modeled through a cost function that considers different elements, such as the price of raw materials, ordering costs, and holding costs. Obtaining the optimal solution for these models represents a complex problem due to their discontinuity, non-linearity, and high multi-modality. Under such conditions, it is not possible to use classical optimization methods. On the other hand, metaheuristic schemes have been extensively employed as alternative optimization techniques to solve difficult problems. Among the metaheuristic computation algorithms, the Grey Wolf Optimization (GWO) algorithm corresponds to a relatively new technique based on the hunting behavior of wolves. Even though GWO allows obtaining satisfying results, its limited exploration reduces its performance significantly when it faces high multi-modal and discontinuous cost functions. In this paper, a modified version of the GWO scheme is introduced to solve the complex optimization problems of supplier selection and order quantity allocation. The improved GWO method called iGWO includes weighted factors and a displacement vector to promote the exploration of the search strategy, avoiding the use of unfeasible solutions. In order to evaluate its performance, the proposed algorithm has been tested on a number of instances of a difficult problem found in the literature. The results show that the proposed algorithm not only obtains the optimal cost solutions, but also maintains a better search strategy, finding feasible solutions in all instances.</jats:p>

Creación y actualización de perfiles en Scripta+

Hosting & Support by

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify