Article ID: | iaor20071640 |
Country: | United Kingdom |
Volume: | 33 |
Issue: | 3 |
Start Page Number: | 639 |
End Page Number: | 659 |
Publication Date: | Mar 2006 |
Journal: | Computers and Operations Research |
Authors: | Gupta Rakesh, Jacob Varghese S., Balakrishnan P.V. (Sundar) |
Keywords: | heuristics: genetic algorithms, programming: dynamic |
This research builds on prior work on developing near optimal solutions to the product line design problems within the conjoint analysis framework. In this research, we investigate and compare different genetic algorithm operators; in particular, we examine systematically the impact of employing alternative population maintenance strategies and mutation techniques within our problem context. Two alternative population maintenance methods, that we term ‘Emigration’ and ‘Malthusian’ strategies, are deployed to govern how individual product lines in one generation are carried over to the next generation. We also allow for two different types of reproduction methods termed ‘Equal Opportunity’ in which the parents to be paired for mating are selected with equal opportunity and a second based on always choosing the best string in the current generation as one of the parents which is referred to as the ‘Queen bee’, while the other parent is randomly selected from the set of parent strings. We also look at the impact of integrating the artificial intelligence approach with a traditional optimization approach by seeding the GA with solutions obtained from a Dynamic Programming heuristic proposed by others. A detailed statistical analysis is also carried out to determine the impact of various problem and technique aspects on multiple measures of performance through means of a Monte Carlo simulation study. Our results indicate that such proposed procedures are able to provide multiple ‘good’ solutions. This provides more flexibility for the decision makers as they now have the opportunity to select from a number of very good product lines. The results obtained using our approaches are encouraging, with statistically significant improvements averaging 5% or more, when compared to the traditional benchmark of the heuristic dynamic programming technique.