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

A similarity-based cooperative co-evolutionary algorithm for dynamic interval multi-objective optimization problems

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Dynamic interval multi-objective optimization problems (DI-MOPs) are very common in real-world applications. However, there are few evolutionary algorithms that are suitable for tackling DI-MOPs up to date. A framework of dynamic interval multi-objective cooperative co-evolutionary optimization based on the interval similarity is presented in this paper to handle DI-MOPs. In the framework, a strategy for decomposing decision variables is first proposed, through which all the decision variables are divided into two groups according to the interval similarity between each decision variable and interval parameters. Following that, two sub-populations are utilized to cooperatively optimize decision variables in the two groups. Furthermore, two response strategies, rgb0.00,0.00,0.00i.e., a strategy based on the change intensity and a random mutation strategy, are employed to rapidly track the changing Pareto front of the optimization problem. The proposed algorithm is applied to eight benchmark optimization instances rgb0.00,0.00,0.00as well as a multi-period portfolio selection problem and compared with five state-of-the-art evolutionary algorithms. The experimental results reveal that the proposed algorithm is very competitive on most optimization instances

Numerical and Evolutionary Optimization 2020

This book was established after the 8th International Workshop on Numerical and Evolutionary Optimization (NEO), representing a collection of papers on the intersection of the two research areas covered at this workshop: numerical optimization and evolutionary search techniques. While focusing on the design of fast and reliable methods lying across these two paradigms, the resulting techniques are strongly applicable to a broad class of real-world problems, such as pattern recognition, routing, energy, lines of production, prediction, and modeling, among others. This volume is intended to serve as a useful reference for mathematicians, engineers, and computer scientists to explore current issues and solutions emerging from these mathematical and computational methods and their applications

Forecasting Cryptocurrency Value by Sentiment Analysis: An HPC-Oriented Survey of the State-of-the-Art in the Cloud Era

This chapter surveys the state-of-the-art in forecasting cryptocurrency value by Sentiment Analysis. Key compounding perspectives of current challenges are addressed, including blockchains, data collection, annotation, and filtering, and sentiment analysis metrics using data streams and cloud platforms. We have explored the domain based on this problem-solving metric perspective, i.e., as technical analysis, forecasting, and estimation using a standardized ledger-based technology. The envisioned tools based on forecasting are then suggested, i.e., ranking Initial Coin Offering (ICO) values for incoming cryptocurrencies, trading strategies employing the new Sentiment Analysis metrics, and risk aversion in cryptocurrencies trading through a multi-objective portfolio selection. Our perspective is rationalized on the perspective on elastic demand of computational resources for cloud infrastructures

Optimization of a dynamic supply portfolio considering risks and discount’s constraints

Purpose: Nowadays finding reliable suppliers in the global supply chains has become so important for success, because reliable suppliers would lead to a reliable supply and besides that orders of customer are met effectively . Yet, there is little empirical evidence to support this view, hence the purpose of this paper is to fill this need by considering risk in order to find the optimum supply portfolio. Design/methodology/approach: This paper proposes a multi objective model for the supplier selection portfolio problem that uses conditional value at risk (CVaR) criteria to control the risks of delayed, disrupted and defected supplies via scenario analysis. Also we consider discount’s constraints which are common assumptions in supplier selection problems. The proposed approach is capable of determining the optimal supply portfolio by calculating value-at-risk and minimizing conditional value-at-risk. In this study the Reservation Level driven Tchebycheff Procedure (RLTP) which is one of the reference point methods, is used to solve small size of our model through coding in GAMS. As our model is NP-hard; a meta-heuristic approach, Non-dominated Sorting Genetic Algorithm (NSGA) which is one of the most efficient methods for optimizing multi objective models, is applied to solve large scales of our model. Findings and Originality/value: In order to find a dynamic supply portfolio, we developed a Mixed Integer Linear Programming (MILP) model which contains two objectives. One objective minimizes the cost and the other minimizes the risks of delayed, disrupted and defected supplies. CVaR is used as the risk controlling method which emphases on low-probability, high-consequence events. Discount option as a common offer from suppliers is also implanted in the proposed model. Our findings show that the proposed model can help in optimization of a dynamic supplier selection portfolio with controlling the corresponding risks for large scales of real word problems. Practical implications: To approve the capability of our model various numerical examples are made and non-dominated solutions are generated. Sensitive analysis is made for determination of the most important factors. The results shows that how a dynamic supply portfolio would disperse the allocation of orders among the suppliers combined with the allocation of orders among the planning periods, in order to hedge against the risks of delayed, disrupted and defected supplies. Originality/value: This paper provides a novel multi objective model for supplier selection portfolio problem that is capable of controlling delayed, disrupted and defected supplies via scenario analysis. Also discounts, as an option offered from suppliers, are embedded in the model. Due to the large size of the real problems in the field of supplier selection portfolio a meta-heuristic method, NSGA II, is presented for solving the multi objective model. The chromosome represented for the proposed solving methodology is unique and is another contribution of this paper which showed to be adaptive with the essence of supplier selection portfolio problemPeer Reviewe

A literature review on the application of evolutionary computing to credit scoring

The last years have seen the development of many credit scoring models for assessing the creditworthiness of loan applicants. Traditional credit scoring methodology has involved the use of statistical and mathematical programming techniques such as discriminant analysis, linear and logistic regression, linear and quadratic programming, or decision trees. However, the importance of credit grant decisions for financial institutions has caused growing interest in using a variety of computational intelligence techniques. This paper concentrates on evolutionary computing, which is viewed as one of the most promising paradigms of computational intelligence. Taking into account the synergistic relationship between the communities of Economics and Computer Science, the aim of this paper is to summarize the most recent developments in the application of evolutionary algorithms to credit scoring by means of a thorough review of scientific articles published during the period 2000–2012.This work has partially been supported by the Spanish Ministry of Education and Science under grant TIN2009-14205 and the Generalitat Valenciana under grant PROMETEO/2010/028

Robust Multi-Objective Sustainable Reverse Supply Chain Planning: An Application in the Steel Industry

In the design of the supply chain, the use of the returned products and their recycling in the production and consumption network is called reverse logistics. The proposed model aims to optimize the flow of materials in the supply chain network (SCN), and determine the amount and location of facilities and the planning of transportation in conditions of demand uncertainty. Thus, maximizing the total profit of operation, minimizing adverse environmental effects, and maximizing customer and supplier service levels have been considered as the main objectives. Accordingly, finding symmetry (balance) among the profit of operation, the environmental effects and customer and supplier service levels is considered in this research. To deal with the uncertainty of the model, scenario-based robust planning is employed alongside a meta-heuristic algorithm (NSGA-II) to solve the model with actual data from a case study of the steel industry in Iran. The results obtained from the model, solving and validating, compared with actual data indicated that the model could optimize the objectives seamlessly and determine the amount and location of the necessary facilities for the steel industry more appropriately.This article belongs to the Special Issue Uncertain Multi-Criteria Optimization Problem

A DECISION SUPPORT TOOL ON DERELICT BUILDINGS FOR URBAN REGENERATION

Abstract. We present a decision suppport tool for the comparison and selection of projects of integrated renovation of derelict buildings and areas for the purpose of urban regeneration. Each project is defined as a subset of derelict properties to renovate together with their respective designated use, and is scored by the decision support tool on two criteria: expected effort and estimated effectiveness in terms of improved urban capabilities in the urban area of interest. The expected effort is estimated as a global transformation cost, factoring in legal and management overhead costs as well as possible economies of scale. The effectiveness in evaluated in terms of extension of urban capabilities centred on walkable distances. We have implemented a bi-objective evolutionary search algorithm to address the computational complexity of the problem of search for efficient (non-dominated) projects over the two criteria. For the purpose of illustration, we present an example case-study application on the historical core of the city of Sassari, Italy.</p