Management Science · 1995 · 146 citations · 15 references
Natural SciencesDecision SciencesIndustrial EngineeringDesign OptimizationOptimizationProduct DesignCombinatorial OptimizationHeuristic OptimizationMetaheuristic OptimizationProduct PlanningConjoint AnalysisHeuristic AlgorithmsMetaheuristic SearchOptimal Product Line DesignProduct Line Optimization
Many 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.
15
Commercial Use of Conjoint Analysis: An Update
Dick R. Wittink, Philippe C. Cattin · Journal of Marketing · 1989 · 689 citations
Filtered beam search in scheduling†
Peng Si Ow, Thomas E. Morton · International Journal of Production Research · 1988 · 386 citations
Models and Heuristics for Product Line Selection
Paul E. Green, Abba Μ. Krieger · Marketing Science · 1985 · 337 citations