A heuristic approach to product design
Management Science
Heuristics for product-line design using conjoint analysis
Management Science
Journal of Computational and Applied Mathematics - Special issue in honor of Professor Dr. F. Broeckx
Individualized hybrid models for conjoint analysis
Management Science
A model and algorithm of fuzzy product positioning
Information Sciences—Informatics and Computer Science: An International Journal
Tabu Search
Cluster analysis in industrial market segmentation through artificial neural network
Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
Optimizing Product Line Designs: Efficient Methods and Comparisons
Management Science
A dynamic decision support system to predict the value of customer for new product development
Decision Support Systems
Development of hybrid genetic algorithms for product line designs
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
In most studies related to product positioning, probabilistic consumer choice rules assume that a product always gains some market share no matter how small a product's utility value is or even if the utility value is negative. Some researchers have considered this problem in multidimensional-scaling-based model or share-of-surplus choice rule. In this study, we consider this problem for multinomial logit rule by introducing a piecewise function and establishing a conjoint-analysis-based one-step optimization model for product positioning. Interval analysis is applied to obtain the optimal price of the new product from the model, and the mathematical properties of the profit-maximizing model are analyzed. An interval-analysis-embedded Tabu Search (TS) algorithm is developed for solving the model. An industrial application employing the proposed model and the interval-analysis-based enumeration method is presented and sensitivity analysis is performed. An experiment for randomly created large-scale product positioning problems is carried out to evaluate the feasibility of the proposed TS algorithm.