TY - JOUR
T1 - Clonal Selection Algorithms for Optimal Product Line Design
T2 - A Comparative Study
AU - Pantourakis, Michail
AU - Tsafarakis, Stelios
AU - Zervoudakis, Konstantinos
AU - Altsitsiadis, Efthymios
AU - Andronikidis, Andreas
AU - Ntamadaki, Vasiliki
N1 - Published online: 10 July 2021.
PY - 2022/4
Y1 - 2022/4
N2 - Product design constitutes a critical process for a firm to stay competitive. Whilst the biologically inspired Clonal Selection Algorithms (CSA) have been applied to efficiently solve several combinatorial optimization problems, they have not yet been tested for optimal product lines. By adopting a previous comparative analysis with real and simulated conjoint data, we adapt and compare in this context 23 CSA variants. Our comparison demonstrates the efficiency of specific cloning, selection and somatic hypermutation operators against other optimization algorithms, such as Simulated Annealing and Genetic Algorithm. To further investigate the robustness of each method to combinatorial size, we extend the previous paradigm to larger product lines and different optimization objectives. The consequent performance variation elucidates how each operator shifts the search focus of CSAs. Collectively, our study demonstrates the importance of a fine balance between global and local search in such combinatorial problems, and the ability of CSAs to achieve it.
AB - Product design constitutes a critical process for a firm to stay competitive. Whilst the biologically inspired Clonal Selection Algorithms (CSA) have been applied to efficiently solve several combinatorial optimization problems, they have not yet been tested for optimal product lines. By adopting a previous comparative analysis with real and simulated conjoint data, we adapt and compare in this context 23 CSA variants. Our comparison demonstrates the efficiency of specific cloning, selection and somatic hypermutation operators against other optimization algorithms, such as Simulated Annealing and Genetic Algorithm. To further investigate the robustness of each method to combinatorial size, we extend the previous paradigm to larger product lines and different optimization objectives. The consequent performance variation elucidates how each operator shifts the search focus of CSAs. Collectively, our study demonstrates the importance of a fine balance between global and local search in such combinatorial problems, and the ability of CSAs to achieve it.
KW - Or in marketing
KW - Clonal selection algorithm
KW - Combinatorial optimization
KW - Product line design
KW - Or in marketing
KW - Clonal selection algorithm
KW - Combinatorial optimization
KW - Product line design
U2 - 10.1016/j.ejor.2021.07.006
DO - 10.1016/j.ejor.2021.07.006
M3 - Journal article
SN - 0377-2217
VL - 298
SP - 585
EP - 595
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 2
ER -