Huerta-Muñoz, D.; Ríos-Mercado, RZ.; Ruiz García, R. (2017). An iterated greedy heuristic for a market segmentation problem with multiple attributes. European Journal of Operational Research. 261(1):75-87. https://doi.org/10.1016/j.ejor.2017.02.013
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/151054
Título:
|
An iterated greedy heuristic for a market segmentation problem with multiple attributes
|
Autor:
|
Huerta-Muñoz, D.L.
Ríos-Mercado, Roger Z.
Ruiz García, Rubén
|
Entidad UPV:
|
Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat
|
Fecha difusión:
|
|
Resumen:
|
[EN] A real-world customer segmentation problem from a beverage distribution firm is addressed. The firm wants to partition a set of customers, who share geographical and marketing attributes, into segments according to ...[+]
[EN] A real-world customer segmentation problem from a beverage distribution firm is addressed. The firm wants to partition a set of customers, who share geographical and marketing attributes, into segments according to certain requirements: (a) customers allocated to the same segment must have very similar attributes: type of contract, type of store and the average difference of purchase volume; and (b) compact segments are desired. The main reason for creating a partition with these features is because the firm wants to try different product marketing strategies. In this paper, a detailed attribute formulation and an iterated greedy heuristic that iteratively destroys and reconstructs a given partition are proposed. The initial partition is obtained by using a modified k-means algorithm that involves a GRASP philosophy to get the initial configuration of centers. The heuristic includes an improvement method that employs two local search procedures. Computational results and statistical analyses show the effectiveness of the proposed approach and its individual components. The proposed metaheuristic is also observed very competitive, faster, and more robust when compared to existing methods. (C) 2017 Elsevier B.V. All rights reserved.
[-]
|
Palabras clave:
|
Metaheuristics
,
Market segmentation
,
Iterated greedy heuristics
,
GRASP
,
Variable neighborhood search
|
Derechos de uso:
|
Reconocimiento - No comercial - Sin obra derivada (by-nc-nd)
|
Fuente:
|
European Journal of Operational Research. (issn:
0377-2217
)
|
DOI:
|
10.1016/j.ejor.2017.02.013
|
Editorial:
|
Elsevier
|
Versión del editor:
|
https://doi.org/10.1016/j.ejor.2017.02.013
|
Código del Proyecto:
|
info:eu-repo/grantAgreement/MINECO//DPI2015-65895-R/ES/OPTIMIZATION OF SCHEDULING PROBLEMS IN CONTAINER YARDS/
...[+]
info:eu-repo/grantAgreement/MINECO//DPI2015-65895-R/ES/OPTIMIZATION OF SCHEDULING PROBLEMS IN CONTAINER YARDS/
info:eu-repo/grantAgreement/CONACyT//CB-2005-01-48499Y/
info:eu-repo/grantAgreement/CONACyT//CB-2011-01-166397/
info:eu-repo/grantAgreement/UANL//CA1478-07/
info:eu-repo/grantAgreement/UANL//CE012-09/
info:eu-repo/grantAgreement/UANL//IT511-10/
info:eu-repo/grantAgreement/UANL//CE331-15/
[-]
|
Agradecimientos:
|
This research has been supported by the Mexican National Council for Science and Technology (CONACYT) through grants CB2005-01-48499Y and CB2011-01-166397, and a scholarship for graduate studies, and by the Universidad ...[+]
This research has been supported by the Mexican National Council for Science and Technology (CONACYT) through grants CB2005-01-48499Y and CB2011-01-166397, and a scholarship for graduate studies, and by the Universidad Autonoma de Nuevo Leon through its Scientific and Technological Research Support Program (PAICYT), grants CA1478-07, CE012-09, IT511-10, and CE331-15. Ruben Ruiz is partially supported by the Spanish Ministry of Economy and Competitiveness, under the project "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R) financed by FEDER funds. We would like to thank Rafael Frinhani, Richard Fuchshuber, and their corresponding research teams for providing us the source code of their algorithms to carry out the corresponding tests. Furthermore, we are grateful to the editor and the four anonymous reviewers for their careful reading of our manuscript and their constructive comments and suggestions which helped us improve its quality.
[-]
|
Tipo:
|
Artículo
|