Search

This work presents efficient solution approaches for a new complex NP-hard combinatorial optimization problem, the Pollution Location Inventory Routing problem (PLIRP), which considers both economic and environmental issues. A mixed-integer linear programming model is proposed and first, small problem instances are solved using the CPLEX solver. Due to its computational complexity, General Variable Neighborhood Search-based metaheuristic algorithms are developed for the solution of medium and large instances. The proposed approaches are tested on 30 new randomly generated PLIRP instances. Parameter estimation has been performed for determining the most suitable perturbation strength. An extended numerical analysis illustrates the effectiveness and efficiency of the underlying methods, leading to high-quality solutions with limited computational effort. Furthermore, the impact of holding cost variations to the total cost is studied.

This work presents a novel framework to simultaneously address the optimal planning of COVID-19 vaccine supply chains and the optimal planning of daily vaccinations in the available vaccination centres. A new mixed integer linear programming (MILP) model is developed to generate optimal decisions regarding the transferred quantities between locations, the inventory profiles of central hubs and vaccination centres and the daily vaccination plans in the vaccination centres of the supply chain network. Specific COVID-19 characteristics, such as special cold storage technologies, limited shelf-life of mRNA vaccines in refrigerated conditions and demanding vaccination targets under extreme time pressure, are aptly modelled. The goal of the model is the minimization of total costs, including storage and transportation costs, costs related to fleet and staff requirements, as well as, indirect costs imposed by wasted doses. A two-step decomposition strategy based on a divide-and-conquer and an aggregation approach is proposed for the solution of large-scale problems. The applicability and efficiency of the proposed optimization-based framework is illustrated on a study case that simulates the Greek nationwide vaccination program. Finally, a rolling horizon technique is employed to reactively deal with possible disturbances in the vaccination plans. The proposed mathematical framework facilitates the decision-making process in COVID-19 vaccine supply chains into minimizing the underlying costs and the number of doses lost. As a result, the efficiency of the distribution network is improved, thus assisting the mass vaccination campaigns against COVID-19.

This work presents a Mixed Integer Programing (MIP) formulation for a new complex NP-hard combinatorial optimization problem, the Location Inventory Routing with Distribution Outsourcing (LIRPDO). Due to its computational complexity, only small problem instances can be solved by exact solvers. Therefore, a General Variable Neighborhood Search (GVNS)-based metaheuristic algorithm for solving large LIRPDO instances is presented. The proposed approach has been tested on 20 new randomly generated LIRPDO instances, 20 existing benchmark LIRP instances from the literature and 30 new large-scale random generated LIRP instances. An extended numerical analysis illustrates the efficiency of the underlying method, leading to acceptable solutions requiring limited computational effort.

This work, based on Stackelberg hypothesis, considers a conventional power producer exercising their dominant position in an electricity pool with high penetration of wind power production. A bi-level optimization model is used to provide optimal offer strategies for the aforementioned producer in a jointly cleared energy and reserve pool settled through an hourly auction process. The upper-level problem illustrates the expected profit optimization of the strategic producer while the lower-level problem represents the energy-only market clearing process through a two-stage stochastic program. The first stage clears the day ahead market, and the second stage presents the system operation in balancing time though a set of plausible wind power production realizations. The bi-level problem is recast into a mathematical program with equilibrium constraints which is then reformulated into a mixed integer linear program. These transformations occur using the Karush-Kuhn-Tucker optimality conditions and the strong duality theory. The suggested model provides optimal strategic offers and local marginal prices under different levels of wind penetration and network line transmission capacities.

This work considers the scheduling problem of continuous make-and-pack industries, including flexible intermediate storage vessels, aiming to provide better synchronisation of the production stages. A novel continuous-time, precedence-based, MILP model is developed for the problem under consideration. Mass balance constraints are cleverly satisfied using a continuous-time representation. Extending previously proposed precedence-based frameworks, flexible vessels are used for storing multiple intermediates of the same recipe. Furthermore, new efficient resource-constraints, related to generation and recycling of byproduct waste are introduced to consider additional benefits by their utilisation in the plant. A two-stage MILP-based solution strategy is proposed for the solution of real-life, large-scale industrial problem instances. Several case studies, inspired by consumer goods industries, are used to illustrate the applicability of the proposed framework. Results illustrate that the utilisation of intermediate buffers leads to a better synchronisation of the production stages and increased productivity, as unnecessary idle times, total waste and total plant costs are reduced.

The production scheduling problem of a real-life food industry is addressed in this work. An efficient MILP-based solution strategy is developed to optimize weekly schedules for a Spanish canned fish production plant. The multi-stage, multi-product facility under study consists of both continuous and batch operations resulting in an extremely complex scheduling problem. In order to reduce its computational complexity, an aggregated approach is cleverly proposed, in which the continuous processes are explicitly modeled, while valid feasibility constraints are introduced for the batch stage. Based on this approach, two MILP models are developed, using a mixed discrete-continuous time representation. All technical, operating and design constraints of the facility are considered, while salient characteristics of the canned-food industry, such as assurance of the end products’ microbiological integrity, are aptly modeled. Both the minimization of makespan and changeovers is studied. In order to meet the computational limits imposed by the industry, an order-based decomposition algorithm is further investigated. The method is successfully applied to real-life case studies, generating near-optimal solutions in short CPU times. The suggested solution strategy can be easily extended to consider other real-life scheduling problems from the process industries sector that share similar production characteristics.

This work proposes Adaptive General Variable Neighborhood Search metaheuristic algorithms for the efficient solution of Pollution Location Inventory Routing Problems (PLIRPs). A comparative computational study, between the proposed methods and their corresponding classic General Variable Neighborhood Search versions, illustrates the effectiveness of the intelligent mechanism used for automating the re-ordering of the local search operators in the improvement step of each optimization method. Results on 20 PLIRP benchmark instances show the efficiency of the proposed metaheuristics.

This work considers a power producer with dominant position in electricity market. A bi-level model is constructed to derive optimal offering strategies for this producer. The bi-level model is reformed into a mathematical programming with equilibrium constraints (MPEC) model which is then recast into a mixed integer linear program using strong duality theorem and Karush-Kuhn-Tacker first order optimality conditions. The proposed algorithm results in optimal scheduled thermal and wind energy production as well as reserve deployments for the strategic producer. It also provides endogenous formation of local marginal prices and optimal offers under network constraints and wind generation uncertainty.

This work presents a Mixed Integer Linear Programming (MILP) model for the optimal interconnected power systems planning over a time horizon of one year. The power generation units include thermal units, hydroelectric units and renewable units (wind and solar power plants). Each system can produce power in order to satisfy its demand and/or supply energy to another system via interconnections. The time horizon of interest, consists of a representative day for each month of the year. The model considers the possibility of building new units selected from a set of proposed ones, as well as expanding the capacity of existing renewable energy units (generation expansion planning), stressing the flexibility that electricity trade provides to power systems. The possibility of expanding the existing interconnection capacity between systems is also considered (transmission expansion planning). The proposed optimization model relies on balance, design, operational and logical constraints. Environmental-related con...

This work presents a mathematical modeling framework for the simulation and optimization of pressure/vacuum swing adsorption (P/VSA) processes for post-combustion CO 2 capture. A single-stage P/VSA process for CO 2 capture from dry flue gas is considered using new zeolite 13X-based adsorbents resulting from perturbation on the 13X zeolite isotherm. A two-bed six-step P/VSA cycle configuration with light product pressurization is employed in systematic simulation and optimization studies. First a zeolite 13X, the current benchmark commercial adsorbent for CO 2 capture, is considered. Accordingly, the model is used to study and evaluate new zeolite 13X-based adsorbents for more efficient CO 2 capture. The results from systematic comparative simulation studies demonstrate that a modified zeolite 13X-based adsorbent appears to have better process performance compared with the original zeolite 13X. Furthermore, process optimization studies employing the above potential adsorbents are performed to minimize energy consumption for specified minimum requirements in CO 2 purity and recovery. The optimization results indicate that the minimum target of 95% in CO 2 purity and 90% in CO 2 recovery is easily met for the P/VSA process under consideration for both potential adsorbents under different operating conditions resulting in different energy requirements and CO 2 productivity.

This work presents a generic optimization framework to address the problem of the optimal design and operational scheduling of energy microgrids. The problem to be solved is formulated as a mixed-integer linear programming (MILP) model whose objective function concerns the total cost minimization of the energy microgrid. The energy generating units to be installed consist of technologies using fuel (natural gas) as a raw material (microturbines, fuel cells etc.), and renewable energy sources (wind and solar). The microgrid is divided into a certain number of zones, each of which is characterized by a given amount of electricity demand to be satisfied, while the system can exchange electrical energy with the main power grid by acquiring from and selling energy to the grid. The efficiency and applicability of the proposed model is illustrated using three case studies. The maximum allowable level of CO2 emissions, the price of electricity purchased from the main grid, and the price of electricity sold to the main grid constitute the parameters whose influences on the economic variables of the microgrid, on the quantities and the capacities of the installed technologies, as well as on the energy balance of the microgrid are investigated. The proposed model provides a systematic and analytical methodological framework for a detailed planning and scheduling of energy microgrids, highlighting potential risks and appropriate price signals on critical energy projects undertaken by investors and/or designed by policy makers at a national and/or regional level under realistic operating conditions.

The aim of this work is to demonstrate the response of advanced model-based predictive control (MPC) strategies for Polymer Electrolyte Membrane Fuel cell (PEMFC) systems. PEMFC are considered as an interesting alternative to conventional power generation and can be used in a wide range of stationary and mobile applications. An integrated and modular computer-aided Energy Management Framework (EMF) is developed and deployed online to an industrial automation system for monitoring and operation of a PEMFC testing unit at CERTH/CPERI. The operation objectives are to deliver the demanded power while operating at a safe region, avoiding starvation, and concurrently minimize the fuel consumption at stable temperature conditions. A dynamic model is utilized and different MPC strategies are online deployed (Nonlinear MPC, multiparametric MPC and explicit Nonlinear MPC). The response of the MPC strategies is assessed through a set of comparative experimental studies, illustrating that the control objectives are achieved and the fuel cell system operates economically and at a stable environment regardless of the varying operating conditions.

In recent years, the ever-increasing research interest in various aspects of the electricity pool-based markets has generated a plethora of complementarity-based approaches to determine participating agents’ optimal offering/bidding strategies and model players’ interactions. In particular, the integration of multiple and diversified market agents, such as conventional generation companies, renewable energy sources, electricity storage facilities and agents with a mixed generation portfolio has instigated significant competition, as each player attempts to establish their market dominance and realize substantial financial benefits. The employment of complementarity modelling approaches can also prove beneficial for the optimal coordination of the electricity and natural gas market coupling. Linear and nonlinear programming as well as complementarity modelling, mainly in the form of mathematical programs with equilibrium constraints (MPECs), equilibrium programs with equilibrium constraints (EPECs) and conjectural variations models (CV) have been widely employed to provide effective market clearing mechanisms, enhance agents’ decision-making process and allow them to exert market power, under perfect and imperfect competition and various market settlements. This work first introduces the theoretical concepts that regulate the majority of contemporary competitive electricity markets. It then presents a comprehensive review of recent advances related to complementarity-based modelling methodologies and their implementation in current competitive electricity pool-based markets applications.

This work investigates the interaction between power producers with conventional and wind generation portfolios participating in a network-constrained pool-based market. A stochastic bi-level problem is introduced to model the strategic behavior of each single producer. The upper-level problem maximizes the producers’ expected profits and the lower-level problem optimizes the jointly cleared energy and balancing market under economic dispatch. Market participants’ offers are modeled using linear stepwise curves, and the stochastic wind power generation is realized through a set of plausible wind scenarios. The bi-level problem is recast into a single-level mathematical problem with equilibrium constraints with primal-dual formulation using the Karush-Kuhn-Tacker first order optimality conditions and the strong duality theorem. The joint solution of all strategic producers’ problems constitutes an equilibrium problem with equilibrium constraints. The latter is reduced into an equivalent mixed integer linear program by using disjunctive constraints. Different objective functions are applied to the final program to define the range of market equilibria, and a single-iterate diagonalization process is used to justify those equilibria that are meaningful. The model addresses several cases considering different types of market competition, transmission line congestions, and different levels of wind power penetration and volatility.

Flexibility in supply chain networks dealing with uncertainty, has become a research challenge over the past years. This work proposes a flexible supply chain network design (SCND) model that uses generalized production/warehousing nodes instead of individual production plants and warehouses while conquers with demand uncertainty using a scenario-based approach. It also deals with inventory management and decisions on strategical and tactical level (facility location, production rate, warehouse capacity, demand allocation between generalized nodes, inventory levels, product flows, suppliers’ product availability and links between all facilities). The proposed Mixed-Integer Linear Programming (MILP) model allows intra-layer flows between generalized nodes and aims at minimizing total network cost. A case study is formed to test the applicability of the model for a medium sized European company. A comparison was made between a classic supply chain network and generalized network that deals with uncertainty. Results have revealed cost benefits for this model, making it not only applicable, but also cost effective for the company that will apply it. This decision support system, can help managers in taking strategic decisions such as facility location, with a higher level of accuracy.

The use of mesenchymal stem cells (MSCs) for artificial bone graft production can meet the increasing demands of the tissue engineering market and provide off-the-shelf, safe and high quality material for grafting procedures. Herein, we present an integrated-modelling approach to describe the osteogenic differentiation of MSCs based on gene expression, cell cycle dynamics, and population balance equations.

An integrated two-stage pressure/vacuum swing adsorption (P/VSA) process for postcombustion CO2 capture from dry flue gas has been simulated and optimized. In the first stage CO2 is concentrated to 40–60% at almost atmospheric pressure, and in the second stage it is further concentrated to 95%. A two-bed six-step cycle configuration was employed in the first stage, while a two-bed five-step cycle configuration was used in the second stage. All possible combinations of two different types of adsorbents (zeolite 13X and Mg-MOF-74) have been employed to study the effect of adsorbent type on key process performance indicators of the process under consideration. The results from systematic comparative simulations demonstrate that the combination of adsorbents zeolite 13X–Mg-MOF-74 has the best process performance, in terms of CO2 purity and CO2 recovery, followed by the use of zeolite 13X at both stages of the process. Furthermore, process optimization studies employing the above combinations of adsorbents hav...

Currently, there is an increasing clinical demand for bone implants for several orthopedic and maxillofacial surgical procedures. Meeting these demands can be achieved with stem cells differentiate...

This work considers the production scheduling of a real-life, consumer goods industry. The production facility consists of multiple continuous stages, and the packing stage constitutes the main pro...

This work presents a new variant of the Location Inventory Routing Problem (LIRP), called Pollution LIRP (PLIRP). The PLIRP considers both economic and environmental impacts. A Mixed Integer Programming (MIP) formulation is employed and experimental results on ten randomly generated small-sized instances using CPLEX are reported. Furthermore, it is shown that, CPLEX could not compute any feasible solution on another set of ten randomly generated medium-sized instances, with a time limit of five hours. Therefore, for solving more computationally challenging instances, two Basic Variable Neighborhood Search (BVNS) metaheuristic approaches are proposed. A comparative analysis between CPLEX and BVNS on these 20 problem instances is reported.

This work, based on Stackelberg hypothesis, considers a conventional power producer exercising their dominant position in an electricity pool with high penetration of wind power production. A bi-level optimization model is used to provide optimal offer strategies for the aforementioned producer in a jointly cleared energy and reserve pool settled through an hourly auction process. The upper-level problem illustrates the expected profit optimization of the strategic producer while the lower-level problem represents the energy-only market clearing process through a two-stage stochastic program. The first stage clears the day ahead market, and the second stage presents the system operation in balancing time though a set of plausible wind power production realizations. The bi-level problem is recast into mathematical programming with equilibrium constraints (MPEC) which is then reformulated into an MILP. These transformations occur using the Karush-Kuhn-Tucker optimality conditions and the strong duality theory. The suggested model provides optimal strategic offers and local marginal prices under different levels of wind penetration and network line transmission capacities.

This work presents the development and application of an efficient solution strategy for the optimal production scheduling of a real-life food industry. In particular, the case of a canned fish production facility for a large-scale Spanish industry is considered. Main goal is to develop an optimized weekly schedule, in order to minimize the total production makespan. The proposed solution strategy constitutes the basis to develop an efficient and robust approach for this complex scheduling problem. A general precedence Mixed-Integer Linear Programming (MILP) model is utilized for all scheduling-related decisions (unit allocation, timing and sequencing). To solve the scheduling problem in a computational time accepted by the industry, a two-step decomposition algorithm is employed. Salient characteristics of the canned fish industry are aptly modelled, while valid industry-specific heuristics are incorporated. The suggested solution strategy is successfully applied to a real study case, corresponding to the most demanding week of the plant under study.

This paper presents a generic Mixed Integer Linear Programming (MILP) model that integrates a Mid-term Energy Planning (MEP) model, which implements generation and transmission system planning at a yearly level, with a Unit Commitment (UC) model, which performs the simulation of the Day-Ahead Electricity Market. The applicability of the proposed model is illustrated in a case study of the Greek interconnected power system. The aim is to evaluate a critical project in the Ten Year Network Development Plan (TYNDP) of the Independent Power Transmission System Operator S.A. (ADMIE), namely the electric interconnection of the Crete Island with the mainland electric system. The proposed modeling framework identifies the implementation (or not) of the interconnection of the Crete Island with the mainland electric system, as well as the optimum interconnection capacity. It also quantifies the effects on the Day-Ahead electricity market and on the energy mix. The paper demonstrates that the model can provide useful insights into the strategic and challenging decisions to be determined by investors and/or policy makers at a national and/or regional level, by providing the optimal energy roadmap and management, as well as clear price signals on critical energy projects under real operating and design constraints.

Multistage population balances provide a more detailed mathematical description of cellular growth than lumped growth models, and can therefore describe better the physics of cell evolution through cycles. These balances can be formulated in terms of cell age, mass, size or cell protein content and they can be univariate or multivariate. A specific three stage population balance model based on cell protein content has been derived and used recently to simulate evolution of cell cultures for several applications. The behavior of the particular mathematical model is studied in detail here. A one equation analog of the multistage model is formulated and it is solved analytically in the self-similarity domain. The effect of the initial condition on the approach to self-similarity is studied numerically. The three equations model is examined then by using asymptotic and numerical techniques. It is shown that in the case of sharp interstage transition the discontinuities of the initial condition are preserved during cell growth leading to oscillating solutions whereas for distributed transition, the cell distribution converges to a self-similar (long time asymptote) shape. The closer is the initial condition to the self similar distribution the faster is the convergence to the self-similarity and the smaller the amplitude of oscillations of the total cell number. The findings of the present work lead to a better understanding of the multistage population balance model and to its more efficient use for description of experimental data by employing the expected solution behavior.

This work introduces the Fleet-size and Mix Pollution Location-Inventory-Routing Problem with Just-in-Time replenishment policy and Capacity Planning. This problem extends the strategic-level decisions of classic LIRP by considering capacity selection decisions and heterogeneous fleet composition. An MIP formulation of this new complex combinatorial optimization problem is proposed and small-sized problem instances are solved using the CPLEX solver. For the solution of more realistic-sized problem instances, a General Variable Neighborhood Search (GVNS)-based framework is adopted. Novel adaptive shaking methods are proposed as intelligent components of the developed GVNS algorithms to further improve their performance. To evaluate the proposed GVNS schemes, several problem instances are randomly generated by following specific instructions from the literature and adopting real vehicles’ parameters. Comparisons between these solutions and the corresponding ones achieved by CPLEX are made. The computational results indicate the efficiency of the proposed GVNS-based algorithms, with the best GVNS scheme to produce 7% better solutions than CPLEX for small problems. Finally, the economic and environmental impacts of using either homogeneous or heterogeneous fleet of vehicles are examined.

This work presents a new modelling framework and an efficient solution approach for the optimization of supply chain for CAR T-cell therapies. The proposed supply chain structure is patient-centric, as the administration of CAR T-cell therapies is performed in local treatment facilities located close to patients’ sites. Cells are re-engineered in a set of available manufacturing centres, the selection of which is to be decided. A limited number of specialized hospitals operate as coordinators of the overall therapy process. Mobile medical units are considered for delivering therapies from manufacturing centres to local treatment facilities. The underlying problem is formulated as a mixed-integer linear programming model. However, due to the computational complexity, solutions using state-of-the-art solvers such as CPLEX, are obtained only for small and rather unrealistic problem cases. To tackle more realistic-sized problem cases, a General Variable Neighborhood Search (GVNS) algorithm is proposed. The algorithm is tested on 20 new, randomly generated, large problem instances. Solutions were compared with those obtained by CPLEX. Finally, extensive numerical analyses were performed to derive useful insights for the key factors affecting design and operation of CAR T-cell therapies supply chains.

The production scheduling of a real-life multi-product, mixed batch and continuous food industrial facility is considered in this work. More specifically, the scheduling of canned fish production in a large-scale Spanish industry is studied in detail. The deployment of an efficient solution strategy is proposed to handle the computationally challenging scheduling problem. In particular, a Mixed-Integer Linear Programming (MILP) model is used, in parallel with a decomposition technique. The problem under consideration focuses on two important stages of the plant, the sterilization and the packaging. The proposed strategy takes into account the specific characteristics of the canned fish production facility resulting in interesting results. It should be noted that the same methodology can be used with appropriate modifications in other food process industries with similar production characteristics.

This work presents a generic Mixed-Integer Linear Programming model that integrates a Mid-term Energy Planning model for the optimal integration of power plants into interconnected power generation systems. The time horizon consists of a representative day for each month of the year. The Unit commitment problem is modelled in details to optimally determine the optimal operational strategy in order to meet the electricity demand at a minimum total cost by utilizing the optimal combination of a set of available power generation plants. Furthermore, the model considers the possibility of building new units selected from a set of proposed ones, as well as expanding the capacity of existing renewable energy units. The possibility of expanding the existing interconnection capacity between systems is also considered. Environmental-related constraints for the production of CO2, NOX, SOX and PMX emissions are also taken into account. The main objective is the minimization of the total annualized cost. The applicability of the proposed model is illustrated in a case study including two interconnected power systems. Finally, a sensitivity analysis is performed in order to investigate the effect of key process parameters on the final power generation policies.

Query personalization has emerged as a means to handle the issue of information volume growth, aiming to tailor query answer results to match the goals and interests of each user. Query personalization dynamically enhances queries, based on information regarding user preferences or other contextual information; typically enhancements relate to incorporation of conditions that filter out results that are deemed of low value to the user and/or ordering results so that data of high value are presented first. In the domain of personalization, social network information can prove valuable; users’ social networks profiles, including their interests, influence from social friends, etc. can be exploited to personalize queries. In this paper, we present a query personalization algorithm, which employs collaborative filtering techniques and takes into account influence factors between social network users, leading to personalized results that are better-targeted to the user. © 2017 Elsevier B.V.

This work presents a generic mixed integer linear programming (MILP) model that integrates the unit commitment problem (UCP), i.e., daily energy planning with the long-term generation expansion planning (GEP) framework. Typical daily constraints at an hourly level such as start-up and shut-down related decisions (start-up type, minimum up and down time, synchronization, soak and desynchronization time constraints), ramping limits, system reserve requirements are combined with representative yearly constraints such as power capacity additions, power generation bounds of each unit, peak reserve requirements, and energy policy issues (renewables penetration limits, CO 2 emissions cap and pricing). For modelling purposes, a representative day (24 h) of each month over a number of years has been employed in order to determine the optimal capacity additions, electricity market clearing prices, and daily operational planning of the studied power system. The model has been tested on an illustrative case study of the Greek power system. Our approach aims to provide useful insight into strategic and challenging decisions to be determined by investors and/or policy makers at a national and/or regional level by providing the optimal energy roadmap under real operating and design constraints.

This paper introduces a general mathematical programming framework that employs an innovative generalized supply chain network (SCN) composition coupled with forward and reverse logistics activities. Generalized echelon will have the ability to produce/distribute all forward materials/products and recover/redistribute simultaneously all the returned which are categorized with respect to their quality zone. The work addresses a multi-product, multi-echelon and multi-period Mixed-Integer Linear Programming (MILP) problem in a closed-loop supply chain network design solved to global optimality using standard branch-and-bound techniques. Further, the model aims to find the optimal structure of the network in order to satisfy market demand with the minimum overall capital and operational cost. Applicability and robustness of the proposed model are illustrated by using a medium real case study from a European consumer goods company whereas its benefits are valued through a comparison with a counterpart model that utilizes the mainstream fixed echelon network structure.

Supply chain network (SCN) design and operation is a strategic and value adding process for all synchronous companies. In the face of globalization, several issues should be contemplated and incorp...

The power sector faces a rapid transformation worldwide from a dominant fossil-fueled towards a low carbon electricity generation mix. Renewable energy technologies (RES) are steadily becoming a greater part of the global energy mix, in particular in regions that have put in place policies and measures to promote their utilization. This paper presents an optimization-based approach to address the generation expansion planning (GEP) problem of a large-scale, central power system in a highly uncertain and volatile electricity industry environment. A multi-regional, multi-period linear mixed-integer linear programming (MILP) model is presented, combining optimization techniques with a Monte Carlo (MCA) method and demand response concepts. The optimization goal concerns the minimization of the total discounted cost by determining optimal power capacity additions per time interval and region, and the power generation mix per technology and time period. The model is evaluated on the Greek power system (GPS), taking also into consideration the scheduled interconnection of the mainland power system with those of selected autonomous islands (Cyclades and Crete), and aims at providing full insight into the composition of the long-term energy roadmap at a national level.

Clinical chemotherapy dosage strategies for leukemia rely on weight/height calculations theoretically correlated to patient drug tolerance. However, over- and under- dosage still exist in clinical practice, which could be overcome by quantifying the actual fraction of cancer cells susceptible to be eradicated. In this work, we show how choosing models that are accurate enough in simulating the biological processes ultimately affecting drug efficacy is critical in order to disentangle patient to patient heterogeneity. Incorporating heterogeneity from measurable sources in such a manner brings us a step closer in our path towards the development of personalized rational therapies.