A New Hybrid Firefly - Genetic Algorithm for the Optimal Product Line Design Problem

被引:4
作者
Zervoudakis, Konstantinos [1 ]
Tsafarakis, Stelios [1 ]
Paraskevi-Panagiota, Sovatzidi [1 ]
机构
[1] Tech Univ Crete, Sch Prod Engn & Management, Khania, Greece
来源
LEARNING AND INTELLIGENT OPTIMIZATION, LION | 2020年 / 11968卷
关键词
Product line design; Hybridization; Firefly algorithm; Genetic algorithm; OPTIMIZATION;
D O I
10.1007/978-3-030-38629-0_23
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The optimal product line design is one of the most critical decisions for a firm to stay competitive, since it is related to the sustainability and profitability of a company. It is classified as an NP-hard problem since no algorithm can certify in polynomial time that the optimum it identifies is the overall optimum of the problem. The focus of this research is to propose a new hybrid optimization method (FAGA) combining Firefly algorithm (FA) and Genetic algorithm (GA). The proposed hybrid method is applied to the product line design problem and its performance is compared to those of previous approaches, like genetic algorithm (GA) and simulated annealing (SA), by using both actual and artificial consumer-related data preferences for specific products. The comparison results demonstrate that the proposed hybrid method is superior to both genetic algorithm and simulated annealing in terms of accuracy, efficiency and convergence speed.
引用
收藏
页码:284 / 297
页数:14
相关论文
共 18 条
  • [1] Development of hybrid genetic algorithms for product line designs
    Balakrishnan, PV
    Gupta, R
    Jacob, VS
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2004, 34 (01): : 468 - 483
  • [2] Optimizing product line designs: Efficient methods and comparisons
    Belloni, Alexandre
    Freund, Robert
    Selove, Matthew
    Simester, Duncan
    [J]. MANAGEMENT SCIENCE, 2008, 54 (09) : 1544 - 1552
  • [3] Conjoint optimization: An exact branch-and-bound algorithm for the share-of-choice problem
    Camm, JD
    Cochran, JJ
    Curry, DJ
    Kaman, S
    [J]. MANAGEMENT SCIENCE, 2006, 52 (03) : 435 - 447
  • [4] Elkhechafi M., 2017, INT J MANAG APPL SCI, V3, P47
  • [5] THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS
    FISHER, ML
    [J]. MANAGEMENT SCIENCE, 1981, 27 (01) : 1 - 18
  • [6] Golberg DE., 1989, GENETIC ALGORITHMS S
  • [7] OPTIMIZATION BY SIMULATED ANNEALING
    KIRKPATRICK, S
    GELATT, CD
    VECCHI, MP
    [J]. SCIENCE, 1983, 220 (4598) : 671 - 680
  • [8] OPTIMAL PRODUCT DESIGN USING CONJOINT-ANALYSIS - COMPUTATIONAL-COMPLEXITY AND ALGORITHMS
    KOHLI, R
    KRISHNAMURTI, R
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 40 (02) : 186 - 195
  • [9] HEURISTICS FOR PRODUCT-LINE DESIGN USING CONJOINT-ANALYSIS
    KOHLI, R
    SUKUMAR, R
    [J]. MANAGEMENT SCIENCE, 1990, 36 (12) : 1464 - 1478
  • [10] Kotler P., 2012, Principles ofmarketing