A simulated annealing heuristic for a bicriterion partitioning problem in market segmentation

被引:31
|
作者
Brusco, MJ [1 ]
Cradit, JD [1 ]
Stahl, S [1 ]
机构
[1] Florida State Univ, Coll Business, Tallahassee, FL 32306 USA
关键词
D O I
10.1509/jmkr.39.1.99.18932
中图分类号
F [经济];
学科分类号
02 ;
摘要
K-means clustering procedures are frequently used to identify homogeneous market segments on the basis of a set of descriptor variables. In practice, however, market research analysts often desire both homogeneous market segments and good explanation of an exogenous response variable. Unfortunately, the relationship between these two objective criteria can be antagonistic, and it is often difficult to find clustering solutions that yield adequate levels for both criteria. The authors present a simulated annealing heuristic for solving bicriterion partitioning problems related to these objectives. A large computational study and an empirical demonstration reveal the effectiveness of the methodology. The authors also discuss limitations and extensions of the method.
引用
收藏
页码:99 / 109
页数:11
相关论文
共 50 条
  • [21] A Simulated Annealing-based Heuristic for Logistics UAV Scheduling Problem
    Li, Yixuan
    Zhang, Jiazhen
    Meng, Ran
    Zhu, Jie
    Huang, Haiping
    14TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND EDUCATION (ICCSE 2019), 2019, : 385 - 390
  • [22] Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic
    Yu, Vincent F.
    Lin, Shih-Wei
    Jodiawan, Panca
    Lai, Yu-Chi
    MATHEMATICS, 2023, 11 (20)
  • [23] A simulated annealing heuristic for the one-dimensional cutting stock problem
    Chen, CLS
    Hart, SM
    Tham, WM
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (03) : 522 - 535
  • [24] ON FAST LOAD PARTITIONING BY SIMULATED ANNEALING AND HEURISTIC ALGORITHMS FOR GENERAL-CLASS OF PROBLEMS
    SINGH, GS
    DESHPANDE, KR
    ADVANCES IN ENGINEERING SOFTWARE, 1993, 16 (01) : 23 - 29
  • [25] An improved simulated annealing heuristic for static partitioning of task graphs onto heterogeneous architectures
    Vasudevan, Aravind
    Malik, Avinash
    Gregg, David
    2014 20TH IEEE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2014, : 95 - 102
  • [26] An iterated greedy heuristic for a market segmentation problem with multiple attributes
    Huerta-Munoz, Diana L.
    Rios-Mercado, Roger Z.
    Ruiz, Ruben
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 261 (01) : 75 - 87
  • [27] Segmentation and simulated annealing
    Cook, R
    McConnell, I
    Stewart, D
    Oliver, C
    MICROWAVE SENSING AND SYNTHETIC APERTURE RADAR, 1996, 2958 : 30 - 37
  • [28] Simulated annealing for edge partitioning
    Université Côte d'Azur, Inria, Sophia Antipolis
    06902, France
    不详
    06902, France
    IEEE Conf. Comput. Commun. Workshops, INFOCOM WKSHPS, 2017, (54-59):
  • [29] Simulated Annealing for Edge Partitioning
    Mykhailenko, Hlib
    Neglia, Giovanni
    Huet, Fabrice
    2017 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2017, : 54 - 59
  • [30] Heuristic and simulated annealing algorithms for wireless ATM backbone network design problem
    Din, Der-Rong
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2008, 24 (02) : 483 - 501