One-stage product-line design heuristics: an empirical comparison. (English) Zbl 1542.90080
Summary: Selecting or adjusting attribute-levels (e.g. components, equipments, flavors, ingredients, prices, tastes) for multiple new and/or status quo products is an important task for a focal firm in a dynamic market. Usually, the goal is to maximize expected overall buyers’ welfare based on consumers’ partworths or expected revenue, market share, and profit under given assumptions. However, in general, these so-called product-line design problems cannot be solved exactly in acceptable computing time. Therefore, heuristics have been proposed: Two-stage heuristics select promising candidates for single products and evaluate sets of them as product-lines. One-stage heuristics directly search for multiple attribute-level combinations. In this paper, Ant Colony Optimization, Genetic Algorithms, Particle Swarm Optimization, Simulated Annealing and, firstly, Cluster-based Genetic Algorithm and Max-Min Ant Systems are applied to 78 small- to large-size product-line design problem instances. In contrast to former comparisons, data is generated according to a large sample of commercial conjoint analysis applications \((n = 2,089)\). The results are promising: The firstly applied heuristics outperform the established ones.
MSC:
| 90B30 | Production models |
| 90C59 | Approximation methods and heuristics in mathematical programming |
| 90B60 | Marketing, advertising |
| 62P20 | Applications of statistics to economics |
| 90B50 | Management decision making, including multiple objectives |
References:
| [1] | Aarts, E.; Korst, J., Simulated annealing and Boltzmann machines, 1989, New York, NY: Wiley, New York, NY · Zbl 0674.90059 |
| [2] | Albers, S.; Brockhoff, K., A procedure for new positioning in an attribute space, Eur J Oper Res, 1, 4, 230-238, 1977 · Zbl 0366.90038 · doi:10.1016/0377-2217(77)90092-3 |
| [3] | Albritton, MD; McMullen, PR, Optimal product design using a colony of virtual ants, Eur J Oper Res, 176, 1, 498-520, 2007 · Zbl 1137.90720 · doi:10.1016/j.ejor.2005.06.042 |
| [4] | Alexouda, G.; Paparizzos, K., A genetic algorithm approach to the product line design problem using the seller’s return criterion: An extensive comparative computional study, Eur J Oper Res, 134, 1, 165-178, 2001 · Zbl 0990.90580 · doi:10.1016/S0377-2217(00)00246-0 |
| [5] | Allenby, GM; Rossi, PE, Marketing models of consumer heterogeneity, J Econom, 89, 1-2, 57-78, 1998 · Zbl 0959.62116 · doi:10.1016/S0304-4076(98)00055-4 |
| [6] | Baier, D.; Gaul, W., Optimal product positioning based on paired comparison data, J Econom, 89, 1-2, 365-392, 1999 · Zbl 0936.62128 |
| [7] | Baier, D.; Kurz, P.; Baier, D.; Brusch, M., Conjointanalyse: verbreitung und validität kommerzieller anwendungen im zeitvergleich, Conjointanalyse: methoden - anwendungen - praxisbeispiele, 35-49, 2021, Berlin Heidelberg, Deutschland: Springer, Berlin Heidelberg, Deutschland · doi:10.1007/978-3-662-63364-9_2 |
| [8] | Baier, D.; Polasek, W.; Schwaiger, M.; Opitz, O., Market simulation using Bayesian procedures in conjoint analysis, Exploratory data analysis in empirical research, 413-421, 2003, Berlin: Springer, Berlin · doi:10.1007/978-3-642-55721-7_42 |
| [9] | Baker JE (1987) Reducing bias and inefficiency in the selection algorithm. In: Grefenstette JJ (ed) Proceedings of the 2nd International Conference on Genetic Algorithms, vol 206. L. Erlbaum Associates Inc., Hillsdale, NJ, pp 14-21 |
| [10] | Balakrishnan, PV; Jacob, VS, Triangulation in decision support systems: algorithms for product design, Decis Support Syst, 14, 4, 313-327, 1995 · doi:10.1016/0167-9236(94)00026-O |
| [11] | Balakrishnan, PV; Jacob, VS, Genetic algorithms for product design, Manage Sci, 42, 8, 1105-1117, 1996 · Zbl 0880.90084 · doi:10.1287/mnsc.42.8.1105 |
| [12] | Balakrishnan, PV; Gupta, R.; Jacob, VS, Development of hybrid genetic algorithms for product line designs, IEEE Trans Syst Man Cybern, 34, 1, 468-483, 2004 · doi:10.1109/TSMCB.2003.817051 |
| [13] | Belloni, A.; Freund, R.; Selove, M., Optimizing product line designs: Efficient methods and comparisons, Manage Sci, 54, 9, 1544-1552, 2008 · Zbl 1232.90168 · doi:10.1287/mnsc.1080.0864 |
| [14] | Belloni, A.; Freund, R.; Selove, M., Optimizing product line designs: efficient methods and comparisons: an electronic companion, Manag Sci, 2008 · Zbl 1232.90168 · doi:10.1287/mnsc.1080.0864 |
| [15] | Bertsimas, D.; Misic, V., Exact first-choice product line optimization, Oper Res, 67, 3, 651-670, 2019 · Zbl 1444.90071 · doi:10.1287/opre.2018.1825 |
| [16] | Bradley, R.; Terry, M., Rank analysis of incomplete block designs: I. the method of paired comparisons, Biometrika, 39, 324-345, 1952 · Zbl 0047.12903 |
| [17] | Camm, JD; Cochran, JJ; Curry, DJ, Conjoint optimization: an exact branch-and-bound algorithm for the share-of-choice problem, Manage Sci, 13, 435-447, 2006 · Zbl 1232.91419 · doi:10.1287/mnsc.1050.0461 |
| [18] | Carrasco, J.; García, S.; Rueda, M., Recent trends in the use of statistical tests for comparing swarm and evolutionary computing algorithms: practical guidelines and a critical review, Swarm Evol Comput, 54, 100, 665, 2020 |
| [19] | Chen, KD; Hausman, WH, Technical note: mathematical properties of the optimal product line selection problem using choice-based conjoint analysis, Manage Sci, 46, 2, 327-332, 2000 · Zbl 1231.90159 · doi:10.1287/mnsc.46.2.327.11931 |
| [20] | Choi, CS; DeSarbo, WS, Game theoretic derivations of competitive strategies in conjoint analysis, Mark Lett, 4, 4, 337-348, 1993 · doi:10.1007/BF00994352 |
| [21] | Choi, CS; DeSarbo, WS, A conjoint-based product designing procedure incorporating price competition, J Prod Innov Manag, 11, 5, 451-459, 1994 · doi:10.1111/1540-5885.1150451 |
| [22] | Debreu, G., Review of rd luce, individual choice behavior: a theoretical analysis, Am Econ Rev, 50, 1, 186-188, 1960 |
| [23] | Désir, A.; Goyal, V.; Zhang, J., Technical note-capacitated assortment optimization: hardness and approximation, Oper Res, 70, 2, 893-904, 2021 · Zbl 1494.90042 · doi:10.1287/opre.2021.2142 |
| [24] | Dobson, G.; Kalish, S., Positioning and pricing a product line, Mark Sci, 7, 2, 107-125, 1988 · doi:10.1287/mksc.7.2.107 |
| [25] | Dobson, G.; Kalish, S., Heuristics for pricing and positioning a product-line using conjoint and cost data, Manage Sci, 39, 2, 160-175, 1993 · doi:10.1287/mnsc.39.2.160 |
| [26] | Dorigo M (1992) Optimization, learning and natural algorithms. In: PhD Thesis, Politecnico di Milano, Dipartimento di Elettronica, Italia |
| [27] | Dorigo, M.; Stützle, T.; Glover, F.; Kochenberger, GA, The ant colony optimization metaheuristic: algorithms, applications, and advances, Handbook of metaheuristics, 250-285, 2003, Boston, MA: Springer, Boston, MA · Zbl 1102.90378 · doi:10.1007/0-306-48056-5_9 |
| [28] | Dorigo, M.; Di Caro, G.; Gambardella, L., Ant algorithms for discrete optimization, Artif Life, 5, 2, 137-172, 1999 · doi:10.1162/106454699568728 |
| [29] | Fruchter, G.; Fligler, A.; Winer, R., Optimal product line design: genetic algorithm approach to mitigate cannibalization, J Optim Theory Appl, 131, 2, 227-244, 2006 · Zbl 1139.90433 · doi:10.1007/s10957-006-9135-3 |
| [30] | Gambardella, L.; Dorigo, M., Ant-q: a reinforcement learning approach to the traveling salesman problem, Machine learning proceedings 1995, 252-260, 1995, Morgan, Burlington, MA: Kaufmann, Morgan, Burlington, MA · doi:10.1016/B978-1-55860-377-6.50039-6 |
| [31] | Gambardella L, Dorigo M (1996) Solving symmetric and asymmetric tsps by ant colonies. In: Proceedings of the IEEE International Conference on Evolutionary Computation. IEEE International Conference on Evolutionary Computation, Nagoya, Japan, pp 622-627 |
| [32] | Gaul, W.; Baier, D.; Baier, D.; Brusch, M., Simulation und optimierung auf basis der conjointanalyse, Conjointanalyse: methoden - anwendungen-praxisbeispiele, 275-306, 2021, Berlin Heidelberg, Deutschland: Springer, Berlin Heidelberg, Deutschland · doi:10.1007/978-3-662-63364-9_12 |
| [33] | Gaul, W.; Aust, E.; Baier, D., Gewinnorientierte Produktliniengestaltung unter Berücksichtigung des Kundennutzens, Zeitschrift für Betriebswirtschaftslehre, 65, 8, 835-855, 1995 |
| [34] | Goldberg, DE; Deb, K., A comparative analysis of selection schemes used in genetic algorithms, Found Gen Algorithms, 1, 69-93, 1991 |
| [35] | Green PE, Rao VR (1969) Nonmetric approaches to multivariate analysis in marketing. In: Working paper, Wharton School, University of Pennsylvania, Philadelphia, PA |
| [36] | Green, P.; Krieger, A., Models and heuristics for product line selection, Mark Sci, 4, 1, 1-19, 1985 · doi:10.1287/mksc.4.1.1 |
| [37] | Green, P.; Krieger, A., A consumer-based approach to designing product line extensions, J Prod Innov Manag, 4, 21-32, 1987 · doi:10.1111/1540-5885.410028 |
| [38] | Green, PE; Krieger, AM, Choice rules and sensitivity analysis in conjoint simulators, J Acad Mark Sci, 16, 1, 114-127, 1988 · doi:10.1007/BF02723330 |
| [39] | Green, PE; Krieger, AM, Recent contributions to optimal product positionig and buyer segmentation, Eur J Oper Res, 4, 1, 127-141, 1989 · doi:10.1016/0377-2217(89)90375-5 |
| [40] | Green, PE; Krieger, AM, An application of a product positioning model to pharmaceutical products, Mark Sci, 2, 1, 117-132, 1992 · doi:10.1287/mksc.11.2.117 |
| [41] | Green, PE; Carroll, JD; Goldberg, SM, A general approach to product design optimization via conjoint analysis, J Mark Res, 45, 3, 17-37, 1981 |
| [42] | Green, PE; Krieger, AM; Zelnio, RN, A componential segmentation model with optimal product design features, Decis Sci, 20, 2, 221-238, 1989 · doi:10.1111/j.1540-5915.1989.tb01874.x |
| [43] | Hein, M.; Goeken, N.; Kurz, P., Using Hierarchical Bayes draws for improving shares of choice predictions in conjoint simulations: A study based on conjoint choice data, Eur J Oper Res, 297, 2, 630-651, 2022 · Zbl 1487.90413 · doi:10.1016/j.ejor.2021.05.056 |
| [44] | Holland, JH, Adaptation in natural and artificial systems, 1975, Ann Arbor, MA: University of Michigan Press, Ann Arbor, MA · Zbl 0317.68006 |
| [45] | Kennedy J, Eberhart R (1995) Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks IV, Perth, Australia, pp 1942-1948 |
| [46] | Kirkpatrick, S.; Gelatt, CD Jr; Vecchi, MP, Optimization by simulated annealing. science, 220, 4598, 671-680, 1983 · Zbl 1225.90162 |
| [47] | Kohli, R.; Krishnamurti, R., A heuristic approach to product design, Manage Sci, 33, 12, 1523-1533, 1987 · doi:10.1287/mnsc.33.12.1523 |
| [48] | Kohli, R.; Krishnamurti, R., Optimal product design using conjoint analysis: computational complexity and algorithms, J Oper Res, 40, 2, 186-195, 1989 · Zbl 0663.90053 · doi:10.1016/0377-2217(89)90329-9 |
| [49] | Kohli, R.; Sukumar, R., Heuristics for product-line design using conjoint analysis, Manage Sci, 36, 12, 1464-1478, 1990 · doi:10.1287/mnsc.36.12.1464 |
| [50] | Louviere, J., Conjoint analysis modelling of stated preferences, JTEP, 22, 1, 93-119, 1988 |
| [51] | Luce, R., Individual choice behavior-a theoretical analysis, 1959, New York: Wiley & Sons, New York · Zbl 0093.31708 |
| [52] | Luce, R.; Tuckey, J., Simultaneous conjoint measurement: a new type of fundamental measuring, J Math Psychol, 1, 1-27, 1964 · Zbl 0166.42201 · doi:10.1016/0022-2496(64)90015-X |
| [53] | McFadden, D., Quantal choice analysis: a survey, Ann Econ Soc Meas, 5, 363-90, 1976 |
| [54] | Nair, SK; Thakur, LS; Wen, KW, Near optimal solutions for product line design and selection: Beam search heuristics, Manage Sci, 41, 5, 767-785, 1995 · Zbl 0843.90055 · doi:10.1287/mnsc.41.5.767 |
| [55] | Orme, B., Getting started with conjoint analysis, 2019, Manhattan Beach, CA: Research Publishers LLC, Manhattan Beach, CA |
| [56] | Pantourakis, M.; Tsafarakis, S.; Zervoudakis, K., Clonal selection algorithms for optimal product line design: a comparative study, Eur J Oper Res, 298, 2, 585-595, 2022 · Zbl 1490.90306 · doi:10.1016/j.ejor.2021.07.006 |
| [57] | Punj, G.; Staelin, R., The choice process for graduate business schools, J Mark Res, 15, 588-598, 1978 · doi:10.1177/002224377801500408 |
| [58] | Raman, N.; Chhajed, D., Simultaneous determination of product attributes and prices, and pproducti prozess in product-line design, J Oper Manag, 12, 3-4, 187-204, 1995 · doi:10.1016/0272-6963(95)00013-I |
| [59] | Reeves C (2003) Genetic algorithms. In: Kochenberger G (ed) Glover F. Kluwer Academic Publishers, Norwell, MA, Handbook of Metaheuristics. International Series in Operations Research & Management Science · Zbl 1029.90081 |
| [60] | Roberts, JH; Kayande, U.; Stremersch, S., From academic research to marketing practice: exploring the marketing science value chain, Int J Res Mark, 31, 2, 144-146, 2014 · doi:10.1016/j.ijresmar.2013.12.001 |
| [61] | Rusmevichientong, P.; Shmoys, D.; Tong, C., Assortment optimization under the multinomial logit model with random choice parameters, Prod Oper Manag, 23, 11, 2023-2039, 2014 · doi:10.1111/poms.12191 |
| [62] | Schön, C., On the optimal product selection problem with price discrimination, Manage Sci, 56, 5, 896-902, 2010 · Zbl 1232.90226 · doi:10.1287/mnsc.1100.1160 |
| [63] | Selka S (2013) Validität computergestützer Verfahren der Präferenzmessung. Dr, Kovac, Hamburg, Germany |
| [64] | Selka, S.; Baier, D., Kommerzielle anwendung auswahlbasierter verfahren der conjointanalyse: eine empirische untersuchung zur validitätsentwicklung, Mark ZFP, 36, 1, 54-64, 2014 · doi:10.15358/0344-1369_2014_1_54 |
| [65] | Selka S, Baier D, Kurz P (2014) The validity of conjoint analysis: An investigation of commercial studies over time. Data Anal Mach Lear Knowl Discov. Springer, pp 227-234 |
| [66] | Sen, A.; Atamtürk, A.; Kaminsky, P., A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model, Oper Res, 66, 4, 994-1003, 2018 · Zbl 1455.90109 · doi:10.1287/opre.2017.1703 |
| [67] | Shi, L.; Ólafsson, S.; Chen, Q., An optimization framework for product design, Manage Sci, 47, 12, 1681-1692, 2001 · Zbl 1232.90244 · doi:10.1287/mnsc.47.12.1681.10243 |
| [68] | Shi Y, Eberhart R (1998) A modified Particle Swarm Optimizer. In: IEEE International Conference on Evolutionary Computation Proceedings, pp 69-73 |
| [69] | Shocker, AD; Srinivasan, V., A consumer-based methodology for the identification of new product ideas, Manage Sci, 20, 6, 921-937, 1974 · doi:10.1287/mnsc.20.6.921 |
| [70] | Shugan S, Balachandran V (1977) A mathematical programming model for optimal product line structuring. In: Working paper, Series 7734 (October), Graduate School of Business, University of Rochester, Rochester, NY |
| [71] | Silk, AJ; Urban, GL, Pre-test-market evaluation of new packaged goods: A model and measurement methodology, J Mark Res, 15, 2, 171-191, 1978 · doi:10.1177/002224377801500201 |
| [72] | Skinderowicz, R., Implementing a GPU-based parallel MAX-MIN ant system, Futur Gener Comput Syst, 106, 277-295, 2020 · doi:10.1016/j.future.2020.01.011 |
| [73] | Steiner, W.; Hruschka, H., Conjoint-basierte Produkt(linien)gestaltung unter Berücksichtigung von Konkurrenzreaktionen, OR Spektrum, 22, 1, 71-95, 2000 · Zbl 0961.90029 · doi:10.1007/s002910050006 |
| [74] | Steiner, W.; Hruschka, H., Produktliniengestaltung mit genetischen Algorithmen, Schmalenbachs Zeitschrift für betriebswirtschaftliche Forschung, 54, 7, 575-601, 2002 · doi:10.1007/BF03372688 |
| [75] | Steiner, W.; Hruschka, H., Genetic algorithms for product design: how well do they really work?, Int J Mark Res, 45, 2, 229-240, 2003 · doi:10.1177/147078530304500202 |
| [76] | Stützle T, Hoos H (1997) MAX-MIN ant system and local search for the traveling salesman problem. In: Proceedings of 1997 IEEE International Conference on Evolutionary Computation, pp 309-314 |
| [77] | Tarasewich, P.; McMullen, PR, A pruning heuristic for use with multisource product design, Eur J Oper Res, 128, 1, 58-73, 2001 · Zbl 0982.90021 · doi:10.1016/S0377-2217(99)00350-1 |
| [78] | Thakur, L.; Nair, S.; Wen, KW, A new model and solution method for product line design with pricing, J Oper Res Soc, 51, 1, 90-101, 2000 · Zbl 1107.90349 · doi:10.1057/palgrave.jors.2600850 |
| [79] | Tsafarakis, S.; Marinakis, Y.; Matsatsinis, N., Particle swarm optimization for optimal product line design, Int J Res Mark, 28, 1, 13-22, 2011 · doi:10.1016/j.ijresmar.2010.05.002 |
| [80] | Tsafarakis, S.; Zervoudakis, K.; Andronikidis, A., Fuzzy self-tuning differential evolution for optimal product line design, Eur J Oper Res, 287, 3, 1161-1169, 2020 · Zbl 1487.90423 · doi:10.1016/j.ejor.2020.05.018 |
| [81] | Tsafarakis, S.; Zervoudakis, K.; Andronikidis, A., Optimal product line design using tabu search, J Oper Res Soc, 73, 9, 1-12, 2022 · doi:10.1080/01605682.2021.1954486 |
| [82] | Vermeulen, B.; Goos, P.; Vandebroek, M., Models and optimal designs for conjoint choice experiments including a no-choice option, Int J Res Mark, 25, 2, 94-103, 2008 · doi:10.1016/j.ijresmar.2007.12.004 |
| [83] | Vökler, S.; Krausche, D.; Baier, D.; Lausen, B.; Van den Poel, D.; Ultsch, A., Product design optimization using ant colony and bee algorithms: a comparison, Algorithms from and for nature and life, 491-498, 2013, Cham, Deutschland: Springer, Cham, Deutschland · doi:10.1007/978-3-319-00035-0_50 |
| [84] | Vökler S, Baier D (2020) Investigating machine learning techniques for solving product-line optimization problems. Arch Data Sci Series A 6(1-11) |
| [85] | Wang, X.; Curry, DJ, A robust approach to the share-of-choice product design problem, Omega, 40, 6, 818-826, 2012 · doi:10.1016/j.omega.2012.01.004 |
| [86] | Wang, X.; Camm, JD; Curry, DJ, A branch-and-price approach to the share-of-choice product line design problem, Manage Sci, 55, 10, 1718-1728, 2009 · Zbl 1232.90348 · doi:10.1287/mnsc.1090.1058 |
| [87] | Wittink, D.; Cattin, P., Commercial use of conjoint analysis: an update, J Mark, 53, 3, 91-96, 1989 · doi:10.1177/002224298905300310 |
| [88] | Zufryden, FS; Shocker, A., A conjoint measurement-based approach for optimal new product design and market segmentation, Analytic approaches to product and market planning, 100-114, 1977, Cambridge, MA: Marketing Science Institute, Cambridge, MA |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
