Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping 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 (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management 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 so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus 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

Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping 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 (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management 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 so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus 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

An integer linear programming model including time, cost, quality, and safety

Time, cost, quality and safety, are the four critical elements that contribute to project success. Traditionally, literature has focused on analysing only time and cost. Subsequently, other multi-objective optimization methods developed to optimize time, cost, quality or safety have been developed. New types of contracting methods designed by governments, included maximizing construction quality while minimizing its time and cost. Recently, due to the fact that the construction industry suffers from more accidents of greater severity than other industrial sectors, safety has become one of the four critical elements that contribute to project success. The project scheduling literature largely concentrates on the generation of a precedence and resource feasible schedule that optimizes the scheduling objective and that should serve as a baseline schedule for executing the project. However, these models do not allow to analyse alternative work plans that consider the trade-offs between time, cost, quality, and safety. In this paper, an integer linear programming problem is applied to a decision-CPM network in order to obtain an overall optimum including time, cost, quality and safety in a road building project. Using this type of model, the effects of alternative methods of performing the tasks can be considered and a greater degree of interaction between the planning and scheduling phases of a project is obtained

04461 Abstracts Collection -- Practical Approaches to Multi-Objective Optimization

From 07.11.04 to 12.11.04, the Dagstuhl Seminar 04461 ``Practical Approaches to Multi-Objective Optimization\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

A Multi-objective Model for Optimizing Construction Planning of Repetitive Infrastructure Projects

This paper presents the development of a model for optimizing resource utilization in repetitive infrastructure projects. The model provides the capability of simultaneous minimization of both project duration and work interruptions for construction crews. The model provides in a single run, a set of nondominated solutions that represent the tradeoff between these two objectives. The model incorporates a multiobjective genetic algorithm and scheduling algorithm. The model initially generates a randomly selected set of solutions that evolves to a near optimal set of tradeoff solutions in subsequent generations. Each solution represents a unique scheduling solution that is associated with certain project duration and a number of interruption days for utilized construction crews. As such, the model provides project planners with alternative schedules along with their expected duration and resource utilization efficiency

Multi-objective symbiotic organisms optimization for making time-cost tradeoffs in repetitive project scheduling problem

Time-cost problems that arise in repetitive construction projects are commonly encountered in project scheduling. Numerous time-cost trade-off approaches, such as mathematical, metaheuristic, and evolutionary methods, have been extensively studied in the construction community. Currently, the scheduling of a repetitive project is conducted using the traditional precedence diagramming method (PDM), which has two fundamental limitations: (1) progress is assumed to be linear from start to finish; and (2) activities in the schedule are connected each other only at the end points. This paper proposes a scheduling method that allows the use of continuous precedence relationships and piece-wise linear and nonlinear activity-time-production functions that are described by the use of singularity functions. This work further develops an adaptive multiple objective symbiotic organisms search (AMOSOS) algorithm that modifies benefit factors in the basic SOS to balance exploration and exploitation processes. Two case studies of its application are analyzed to validate the scheduling method, as well as to demonstrate the capabilities of AMOSOS in generating solutions that optimally trade-off minimizing project time with minimizing the cost of non-unit repetitive projects. The results thus obtained indicate that the proposed model is feasible and effective relative to the basic SOS algorithm and other state-of-the-art algorithms

Optimal management of bio-based energy supply chains under parametric uncertainty through a data-driven decision-support framework

This paper addresses the optimal management of a multi-objective bio-based energy supply chain network subjected to multiple sources of uncertainty. The complexity to obtain an optimal solution using traditional uncertainty management methods dramatically increases with the number of uncertain factors considered. Such a complexity produces that, if tractable, the problem is solved after a large computational effort. Therefore, in this work a data-driven decision-making framework is proposed to address this issue. Such a framework exploits machine learning techniques to efficiently approximate the optimal management decisions considering a set of uncertain parameters that continuously influence the process behavior as an input. A design of computer experiments technique is used in order to combine these parameters and produce a matrix of representative information. These data are used to optimize the deterministic multi-objective bio-based energy network problem through conventional optimization methods, leading to a detailed (but elementary) map of the optimal management decisions based on the uncertain parameters. Afterwards, the detailed data-driven relations are described/identified using an Ordinary Kriging meta-model. The result exhibits a very high accuracy of the parametric meta-models for predicting the optimal decision variables in comparison with the traditional stochastic approach. Besides, and more importantly, a dramatic reduction of the computational effort required to obtain these optimal values in response to the change of the uncertain parameters is achieved. Thus the use of the proposed data-driven decision tool promotes a time-effective optimal decision making, which represents a step forward to use data-driven strategy in large-scale/complex industrial problems.Peer ReviewedPostprint (published version

Electronic design: a new field of investigation for large scale optimization

International audienceMobile phones, music players, personal computers, set-top boxes and countless other digital electronics items are part of our daily life. These nomad devices offer more and more functionnality. For example, recent mobile phones allow to communicate, to take pictures, to play video, to listen to the music, to watch TV, to access to the Internet... Thus, the integrated circuit (IC) achieving all these functions become more and more complex. Designers aim at developping these products taking into account two main axes: - shorten the delay to reach the market - reduce the size of these devices For a long time, designers are using a lot of optimization techniques such as Integer Linear Programming, heuristics and metaheuristics. A two year observation of those behaviors has led to the following conclusions, even if the electronic community know these techniques, there is a great need for more formal techniques, more appropriate models and efficient soving approaches especially designed for their specific problems. The talk, after a global introduction will introduce several problems where the help from the metaheuristic is needed and for which collaborations are necessary. This talk will be the starting point of the creation of a network for long term collaborations

A survey of variants and extensions of the resource-constrained project scheduling problem

The resource-constrained project scheduling problem (RCPSP) consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is minimized. It has become a well-known standard problem in the context of project scheduling which has attracted numerous researchers who developed both exact and heuristic scheduling procedures. However, it is a rather basic model with assumptions that are too restrictive for many practical applications. Consequently, various extensions of the basic RCPSP have been developed. This paper gives an overview over these extensions. The extensions are classified according to the structure of the RCPSP. We summarize generalizations of the activity concept, of the precedence relations and of the resource constraints. Alternative objectives and approaches for scheduling multiple projects are discussed as well. In addition to popular variants and extensions such as multiple modes, minimal and maximal time lags, and net present value-based objectives, the paper also provides a survey of many less known concepts. --project scheduling,modeling,resource constraints,temporal constraints,networks