A heuristic genetic algorithm for product portfolio planning

DOI10.1016/j.cor.2005.05.033zbMath1159.90371OpenAlexW2084341364MaRDI QIDQ858285

Jianxin Jiao, Yi Wang, Yiyang Zhang

Publication date: 9 January 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.033

zbMATH Keywords

genetic algorithmmass customizationproduct portfoliocustomer decision makingvariety management

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (6)

Optimal versioning strategy for information products with behavior-based utility function of heterogeneous customers ⋮ Coupling a memetic algorithm to simulation models for promising multi-period asset allocations ⋮ Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ An efficient solution method to design the cost-minimizing platform portfolio ⋮ Order acceptance using genetic algorithms ⋮ Objective comparisons of the optimal portfolios corresponding to different utility functions

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic algorithm for the generalised assignment problem
• An evolutionary algorithm approach to the share of choices problem in the product line design
• Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
• A user's guide to tabu search
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Genetic Algorithms for Product Design
• Near Optimal Solutions for Product Line Design and Selection: Beam Search Heuristics

This page was built for publication: A heuristic genetic algorithm for product portfolio planning