PérezEscobedo, José Luis. Multiobjective optimization of New Product Development in the pharmaceutical industry. PhD, Institut National Polytechnique de Toulouse, 2010

(Document in English)
PDF  Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 8MB 
Official URL: http://ethesis.inptoulouse.fr/archive/00001381/
Abstract
New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline, namely, the presence of uncertainty, the high level of the involved capital costs, the interdependency between projects, the limited availability of resources, the overwhelming number of decisions due to the length of the time horizon (about 10 years) and the combinatorial nature of a portfolio. Formally, the NPD problem can be stated as follows: select a set of R and D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while copying with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGA II type, NonSorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. An objectoriented model previously developed for batch plant scheduling and design is then extended to embed the case of new product management, which is particularly adequate for reuse of both structure and logic. Two case studies illustrate and validate the approach. From this simulation study, three performance evaluation criteria must be considered for decision making: the Net Present Value (NPV) of a sequence, its associated risk defined as the number of positive occurrences of NPV among the samples and the time to market. Theyv have been used in the multiobjective optimization formulation of the problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the socalled Pareto front and to account for the combinatorial aspect. NSGA II has been adapted to the treated case for taking into account both the number of products in a sequence and the drug release order. From an analysis performed for a representative case study on the different pairs of criteria both for the bi and tricriteria optimization, the optimization strategy turns out to be efficient and particularly elitist to detect the sequences which can be considered by the decision makers. Only a few sequences are detected. Among theses sequences, large portfolios cause resource queues and delays time to launch and are eliminated by the bicriteria optimization strategy. Small portfolio reduces queuing and time to launch appear as good candidates. The optimization strategy is interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems.
Item Type:  PhD Thesis 

Uncontrolled Keywords:  
Institution:  Université de Toulouse > Institut National Polytechnique de Toulouse  INPT (FRANCE) 
Laboratory name:  
Research Director:  AzzaroPantel, Catherine 
Statistics:  download 
Deposited By:  admin admin 
Deposited On:  21 Nov 2012 13:07 
Repository Staff Only: item control page