IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v41y1995i5p767-785.html
   My bibliography  Save this article

Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics

Author

Listed:
  • Suresh K. Nair

    (Department of Operations and Information Management, U41-1M, University of Connecticut, Storrs, Connecticut 06269-0241)

  • Lakshman S. Thakur

    (Department of Operations and Information Management, U41-1M, University of Connecticut, Storrs, Connecticut 06269-0241)

  • Kuang-Wei Wen

    (Department of Operations and Information Management, U41-1M, University of Connecticut, Storrs, Connecticut 06269-0241)

Abstract

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.

Suggested Citation

  • Suresh K. Nair & Lakshman S. Thakur & Kuang-Wei Wen, 1995. "Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics," Management Science, INFORMS, vol. 41(5), pages 767-785, May.
  • Handle: RePEc:inm:ormnsc:v:41:y:1995:i:5:p:767-785
    DOI: 10.1287/mnsc.41.5.767
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.41.5.767
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.41.5.767?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:41:y:1995:i:5:p:767-785. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.