Optimal Product Line Design: Genetic Algorithm Approach to Mitigate Cannibalization

被引:0
|
作者
G. E. Fruchter
A. Fligler
R. S. Winer
机构
[1] Bar-Ilan University,Graduate School of Business Administration
[2] Product Management,Stern School of Business
[3] Olista,undefined
[4] New York University,undefined
关键词
Genetic algorithms; heuristics; product line design; cannibalization; pricing; marketing;
D O I
暂无
中图分类号
学科分类号
摘要
In this marketing-oriented era where manufacturers maximize profits through customer satisfaction, there is an increasing need to design a product line rather than a single product. By offering a product line, the manufacturer can customize his or her products to the needs of a variety of segments in order to maximize profits by satisfying more customers than a single product would. When the amount of data on customer preferences or possible product configurations is large and no analytical relations can be established, the problem of an optimal product line design becomes very difficult and there are no traditional methods to solve it. In this paper, we show that the usage of genetic algorithms, a mathematical heuristics mimicking the process of biological evolution, can solve efficiently the problem. Special domain operators were developed to help the genetic algorithm mitigate cannibalization and enhance the algorithm’s local search abilities. Using manufacturer’s profits as the criteria for fitness in evaluating chromosomes, the usage of domain specific operators was found to be highly beneficial with better final results. Also, we have hybridized the genetic algorithm with a linear programming postprocessing step to fine tune the prices of products in the product line. Attacking the core difficulty of cannibalization in the algorithm, the operators introduced in this work are unique.
引用
收藏
页码:227 / 244
页数:17
相关论文
共 50 条
  • [31] Optimal Compensator Design using Genetic Algorithm
    Penchalaiah, D.
    Kumar, G. Naresh
    Gade, Murali Mohan
    Talole, S. E.
    IFAC PAPERSONLINE, 2018, 51 (01): : 518 - 523
  • [32] Process optimal design in forging by genetic algorithm
    Chung, JS
    Hwang, SM
    JOURNAL OF MANUFACTURING SCIENCE AND ENGINEERING-TRANSACTIONS OF THE ASME, 2002, 124 (02): : 397 - 408
  • [33] Optimal design of a furnace transformer by genetic algorithm
    Rao, K. S. Rama
    Raju, M. Ramalinga
    FIRST INTERNATIONAL POWER & ENERGY CONFERENCE (PECON 2006), PROCEEDINGS, 2006, : 531 - 536
  • [34] A genetic algorithm for the optimal design of microwave filters
    Hsu, HM
    Tsai, SP
    Wu, MC
    Tzuang, CK
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 1999, 6 (04): : 282 - 288
  • [35] Optimal multivariate mixture: a genetic algorithm approach
    Sgarro, Giacinto Angelo
    Grilli, Luca
    Santoro, Domenico
    ANNALS OF OPERATIONS RESEARCH, 2024,
  • [36] Optimal Design of an N-Stage Nonlinear Transmission Line Based on Genetic Algorithm and LTspice
    Baginski, Michael E.
    Lu, Hai
    Caudle, Byron T.
    Kirkici, Huyla
    IEEE TRANSACTIONS ON PLASMA SCIENCE, 2013, 41 (08) : 2408 - 2414
  • [37] An approach to the design of optimal test scheduling for system-on-chip based on genetic algorithm
    Sakthivel, P.
    Narayanasamy, P.
    INNOVATIONS AND ADVANCED TECHNIQUES IN COMPUTER AND INFORMATION SCIENCES AND ENGINEERING, 2007, : 25 - +
  • [38] A response modeling approach to experimental design for optimal product design
    Rutherford, B
    ISUMA 2003: FOURTH INTERNATIONAL SYMPOSIUM ON UNCERTAINTY MODELING AND ANALYSIS, 2003, : 392 - 397
  • [39] Product line production planning model based on genetic algorithm
    Jiang, Guozhang
    Gu, Yuesheng
    Kong, Jianyi
    Li, Gongfa
    Xie, Liangxi
    International Review on Computers and Software, 2011, 6 (06) : 1023 - 1027
  • [40] Product platform planning: an approach using Genetic Algorithm
    Song, Haitao
    Zhang, Ying
    Song, Yunli
    Wang, Zikai
    Zhen, Lu
    PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, VOLS 1 AND 2, 2008, : 1621 - 1625