An iterated greedy heuristic for a market segmentation problem with multiple attributes

DOI10.1016/J.EJOR.2017.02.013MaRDI QIDQ1753559zbMATH OpenOpenAlexFDO

Authors Diana L. Huerta-Muñoz, Roger Z. Ríos-Mercado, Rubén Ruiz

Publication date 29 May 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2017.02.013

zbMATH Keywords

GRASPiterated greedy heuristicsmarket segmentationmetaheuristicsvariable neighborhood search

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Marketing, advertising (90B60) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A mixed-integer programming approach to the clustering problem with an application in customer segmentation
• Clustering of objects and attributes for manufacturing and marketing applications
• Research of multicriteria theoretical segmentation tasks on bipartite graphs
• Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods
• A scatter search heuristic for the capacitated clustering problem

Cites work

• -Means: A new generalized k-means clustering algorithm
• A comparison of \(p\)-dispersion heuristics
• A hybrid data mining metaheuristic for the p‐median problem
• A model for clustering data from heterogeneous dissimilarities
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Algorithm AS 136: A K-Means Clustering Algorithm
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Clusterwise linear regression
• Greedy randomized adaptive search procedures
• How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
• scientific article; zbMATH DE number 3617544 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• scientific article; zbMATH DE number 2231543 (Why is no real title available?)
• Iterated greedy for the maximum diversity problem
• Iterated greedy local search methods for unrelated parallel machine scheduling
• Iterated maxima search for the maximally diverse grouping problem
• Note: A local-search heuristic for large set-covering problems
• NP-hardness of Euclidean sum-of-squares clustering
• ROCK
• Shifting representation search for hybrid flexible flowline problems
• The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach

Cited in

(2)

• A mixed-integer programming approach to the clustering problem with an application in customer segmentation
• Efficient iterated greedy for the two-dimensional bandwidth minimization problem

Describes a project that uses

Uses Software

• ROCK

This page was built for publication: An iterated greedy heuristic for a market segmentation problem with multiple attributes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753559)