A bibliometric analysis of the product line design problem

In the product design problem, firms aim to find suitable configurations of product attributes with the objective of increasing their participation in the marketplace. This problem belongs to the field of quantitative marketing and is considered a NP-Hard problem, due to its wide search space for an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Inquietud empresarial 2021-05, Vol.21 (1), p.11-33
Hauptverfasser: Romero-Serrano, Alma Montserrat, Ahumada-Valenzuela, Omar, Leyva-Lopez, Juan Carlos, Velazquez-Cazares, Marlenne Gisela
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In the product design problem, firms aim to find suitable configurations of product attributes with the objective of increasing their participation in the marketplace. This problem belongs to the field of quantitative marketing and is considered a NP-Hard problem, due to its wide search space for an optimal solution. Among the related literature, there are different methodologies to address this problem, gaining ground those that apply metaheuristics, with an emphasis in Genetic Algorithms. The main aim of this work is to present an overview of the most significant contributions in this area using a bibliometric analysis approach. The paper uses Scopus database and Web of Science Core Collection, in order to obtain leading and the most influential articles, conferences papers, journals, authors, institutions and countries. The results highlight Kwong, C.K. as the most productive author while Nagamachi M. is the most influential author. Furthermore, China is the leading country in this research field. The use of Genetic Algorithms in the solutions of the Product Design Problem is a growing area of study with important development of methodologies and approaches.  JEL Codes: C00, C02 Received: 07/10/2020.  Accepted: 20/02/2021.  Published: 01/06/2021. 
ISSN:0121-1048
2422-3220
DOI:10.19053/01211048.11411