Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics
AbstractMany practical product line design problems have large numbers of attributes and levels. In this case, if most attribute level combinations define feasible products, constructing product lines directly from part-worths data is necessary. For three typical formulations of this important problem, Kohli and Sukumar (Kohli, R., R. Sukumar. 1990. Heuristics for product-line design using conjoint analysis. Management Sci. 36 1464--1478.) present state-of-the-art heuristics to find good solutions. In this paper, we develop improved heuristics based on a beam search approach for solving these problems. In our computations for 435 simulated problems, significant improvements occur in five important performance measures used. Our heuristic solutions are closer to the optimal, have smaller standard deviation over replicates, take less computation time, obtain optimal solutions more often and identify a number of "good" product lines explicitly. Computation times for these problems are no more than 22 seconds on a PC, small enough for adequate sensitivity analysis. We also apply the heuristics to a real data set and clarify computational steps by giving a detailed example.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 41 (1995)
Issue (Month): 5 (May)
product line design; product line selection; conjoint analysis; product profile; heuristics; beam search;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Winfried Steiner & Harald Hruschka, 2002. "A Probabilistic One-Step Approach to the Optimal Product Line Design Problem Using Conjoint and Cost Data," Review of Marketing Science Working Papers 1-4-1003, Berkeley Electronic Press.
- Tarasewich, Peter & McMullen, Patrick R., 2001. "A pruning heuristic for use with multisource product design," European Journal of Operational Research, Elsevier, vol. 128(1), pages 58-73, January.
- Nils Boysen & Armin Scholl, 2008.
"A general solution framework for component commonality problems,"
Jena Research Papers in Business and Economics - Working and Discussion Papers
12/2008, Friedrich-Schiller-University Jena, School of Economics and Business Administration.
- Nils Boysen & Armin Scholl, 2009. "A General Solution Framework for Component-Commonality Problems," BuR - Business Research, German Academic Association for Business Research, vol. 2(1), pages 86-106, May.
- Day, Jamison M. & Venkataramanan, M.A., 2006. "Profitability in product line pricing and composition with manufacturing commonalities," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1782-1797, December.
- McMullen, P.R. & Tarasewich, Peter, 2005. "A beam search heuristic method for mixed-model scheduling with setups," International Journal of Production Economics, Elsevier, vol. 96(2), pages 273-283, May.
- Albritton, M. David & McMullen, Patrick R., 2007. "Optimal product design using a colony of virtual ants," European Journal of Operational Research, Elsevier, vol. 176(1), pages 498-520, January.
- Nair, Suresh K. & Tarasewich, Peter, 2003. "A model and solution method for multi-period sales promotion design," European Journal of Operational Research, Elsevier, vol. 150(3), pages 672-687, November.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.