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 条
  • [1] A simulated annealing heuristic for a crane sequencing problem
    McKendall, Alan R., Jr.
    Shang, Jin
    Noble, James S.
    Klein, Cerry M.
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2006, 13 (01): : 90 - 98
  • [2] A simulated annealing heuristic for a crane sequencing problem
    Department of Industrial and Management Systems Engineering, West Virginia University, 325A Mineral Resources Building, PO Box 6070, Morgantown, WV 26506, United States
    不详
    Int J Ind Eng Theory Appl Pract, 2006, 1 (90-98):
  • [3] Parallel simulated annealing for bicriterion optimization problems
    Czarnas, P
    Czech, ZJ
    Gocyla, P
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2004, 3019 : 233 - 240
  • [4] THE AFFORESTATION PROBLEM - A HEURISTIC METHOD BASED ON SIMULATED ANNEALING
    JORGENSEN, RM
    THOMSEN, H
    VIDAL, RVV
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 56 (02) : 184 - 191
  • [5] A SIMULATED ANNEALING HEURISTIC FOR THE DYNAMIC FACILITY LAYOUT PROBLEM
    Sahin, Ramazan
    JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, 2008, 23 (04): : 863 - 870
  • [6] A simulated annealing heuristic for the hybrid vehicle routing problem
    Yu, Vincent F.
    Redi, A. A. N. Perwira
    Hidayat, Yosi Agustina
    Wibowo, Oktaviyanto Jimat
    APPLIED SOFT COMPUTING, 2017, 53 : 119 - 132
  • [7] A heuristic simulated annealing algorithm for the circular packing problem
    Liu, Jingfa
    Zheng, Yu
    Liu, Wenjie
    THIRD INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTING, 2009, : 802 - 805
  • [8] A simulated annealing heuristic for the consistent vehicle routing problem
    Liu, Heng-Yu
    Ru, Yi-Hong
    Jiaotong Yunshu Xitong Gongcheng Yu Xinxi/Journal of Transportation Systems Engineering and Information Technology, 2015, 15 (06): : 177 - 183
  • [9] A simulated annealing heuristic for the capacitated location routing problem
    Yu, Vincent F.
    Lin, Shih-Wei
    Lee, Wenyih
    Ting, Ching-Jung
    COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (02) : 288 - 299
  • [10] Solving bicriterion optimization problems by parallel simulated annealing
    Czech, ZJ
    Wieczorek, B
    PROCEEDINGS OF THE 14TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING, 2005, : 7 - 14