Multi-period, multi-product production planning in an uncertain manufacturing environment

Les travaux de cette thèse portent sur la planification de la production multi-produits, multi-périodes avec des incertitudes de la qualité de la matière première et de la demande. Un modèle de programmation stochastique à deux étapes avec recours est tout d'abord proposé pour la prise en compte de la non-homogénéité de la matière première, et par conséquent, de l'aspect aléatoire des rendements de processus. Ces derniers sont modélisés sous forme de scénarios décrits par une distribution de probabilité stationnaire. La méthodologie adoptée est basée sur la méthode d'approximation par moyenne d'échantillonnage. L'approche est appliquée pour planifier la production dans une unité de sciage de bois et le modèle stochastique est validé par simulation de Monte Carlo. Les résultats numériques obtenus dans le cas d'une scierie de capacité moyenne montrent la viabilité de notre modèle stochastique, en comparaison au modèle équivalent déterministe. Ensuite, pour répondre aux préoccupations du preneur de décision en matière de robustesse, nous proposons deux modèles d'optimisation robuste utilisant chacun une mesure de variabilité du niveau de service différente. Un cadre de décision est développé pour choisir parmi les deux modèles d'optimisation robuste, en tenant compte du niveau du risque jugé acceptable quand à la variabilité du niveau de service. La supériorité de l'approche d'optimisation robuste, par rapport à la programmation stochastique, est confirmée dans le cas d'une usine de sciage de bois. Finalement, nous proposons un modèle de programmation stochastique qui tient compte à la fois du caractère aléatoire de la demande et du rendement. L'incertitude de la demande est modélisée par un processus stochastique dynamique qui est représenté par un arbre de scénarios. Des scénarios de rendement sont ensuite intégrés dans chaque noeud de l'arbre de scénarios de la demande, constituant ainsi un arbre hybride de scénarios. Nous proposons un modèle de programmation stochastique multi-étapes qui utilise un recours complet pour les scénarios de la demande et un recours simple pour les scénarios du rendement. Ce modèle est également appliqué au cas industriel d'une scierie et les résultats numériques obtenus montrent la supériorité du modèle stochastique multi- étapes, en comparaison avec le modèle équivalent déterministe et le modèle stochastique à deux étapes

Multi-objective optimisation under deep uncertainty

Most of the decisions in real-life problems need to be made in the absence of complete knowledge about the consequences of the decision. Furthermore, in some of these problems, the probability and/or the number of different outcomes are also unknown (named deep uncertainty). Therefore, all the probability-based approaches (such as stochastic programming) are unable to address these problems. On the other hand, involving various stakeholders with different (possibly conflicting) criteria in the problems brings additional complexity. The main aim and primary motivation for writing this thesis have been to deal with deep uncertainty in Multi-Criteria Decision-Making (MCDM) problems, especially with long-term decision-making processes such as strategic planning problems. To achieve these aims, we first introduced a two-stage scenario-based structure for dealing with deep uncertainty in Multi-Objective Optimisation (MOO)/MCDM problems. The proposed method extends the concept of two-stage stochastic programming with recourse to address the capability of dealing with deep uncertainty through the use of scenario planning rather than statistical expectation. In this research, scenarios are used as a dimension of preference (a component of what we term the meta-criteria) to avoid problems relating to the assessment and use of probabilities under deep uncertainty. Such scenario-based thinking involved a multi-objective representation of performance under different future conditions as an alternative to expectation, which fitted naturally into the broader multi-objective problem context. To aggregate these objectives of the problem, the Generalised Goal Programming (GGP) approach is used. Due to the capability of this approach to handle large numbers of objective functions/criteria, the GGP is significantly useful in the proposed framework. Identifying the goals for each criterion is the only action that the Decision Maker (DM) needs to take without needing to investigate the trade-offs between different criteria. Moreover, the proposed two-stage framework has been expanded to a three-stage structure and a moving horizon concept to handle the existing deep uncertainty in more complex problems, such as strategic planning. As strategic planning problems will deal with more than two stages and real processes are continuous, it follows that more scenarios will continuously be unfolded that may or may not be periodic. "Stages", in this study, are artificial constructs to structure thinking of an indefinite future. A suitable length of the planning window and stages in the proposed methodology are also investigated. Philosophically, the proposed two-stage structure always plans and looks one step ahead while the three-stage structure considers the conditions and consequences of two upcoming steps in advance, which fits well with our primary objective. Ignoring long-term consequences of decisions as well as likely conditions could not be a robust strategic approach. Therefore, generally, by utilising the three-stage structure, we may expect a more robust decision than with a two-stage representation. Modelling time preferences in multi-stage problems have also been introduced to solve the fundamental problem of comparability of the two proposed methodologies because of the different time horizon, as the two-stage model is ignorant of the third stage. This concept has been applied by a differential weighting in models. Importance weights, then, are primarily used to make the two- and three-stage models more directly comparable, and only secondarily as a measure of risk preference. Differential weighting can help us apply further preferences in the model and lead it to generate more preferred solutions. Expanding the proposed structure to the problems with more than three stages which usually have too many meta-scenarios may lead us to a computationally expensive model that cannot easily be solved, if it all. Moreover, extension to a planning horizon that too long will not result in an exact plan, as nothing in nature is predictable to this level of detail, and we are always surprised by new events. Therefore, beyond the expensive computation in a multi-stage structure for more than three stages, defining plausible scenarios for far stages is not logical and even impossible. Therefore, the moving horizon models in a T-stage planning window has been introduced. To be able to run and evaluate the proposed two- and three-stage moving horizon frameworks in longer planning horizons, we need to identify all plausible meta-scenarios. However, with the assumption of deep uncertainty, this identification is almost impossible. On the other hand, even with a finite set of plausible meta-scenarios, comparing and computing the results in all plausible meta-scenarios are hardly possible, because the size of the model grows exponentially by raising the length of the planning horizon. Furthermore, analysis of the solutions requires hundreds or thousands of multi-objective comparisons that are not easily conceivable, if it all. These issues motivated us to perform a Simulation-Optimisation study to simulate the reasonable number of meta-scenarios and enable evaluation, comparison and analysis of the proposed methods for the problems with a T-stage planning horizon. In this Simulation-Optimisation study, we started by setting the current scenario, the scenario that we were facing it at the beginning of the period. Then, the optimisation model was run to get the first-stage decisions which can implement immediately. Thereafter, the next scenario was randomly generated by using Monte Carlo simulation methods. In deep uncertainty, we do not have enough knowledge about the likelihood of plausible scenarios nor the probability space; therefore, to simulate the deep uncertainty we shall not use anything of scenario likelihoods in the decision models. The two- and three-stage Simulation-Optimisation algorithms were also proposed. A comparison of these algorithms showed that the solutions to the two-stage moving horizon model are feasible to the other pattern (three-stage). Also, the optimal solution to the three-stage moving horizon model is not dominated by any solutions of the other model. So, with no doubt, it must find better, or at least the same, goal achievement compared to the two-stage moving horizon model. Accordingly, the three-stage moving horizon model evaluates and compares the optimal solution of the corresponding two-stage moving horizon model to the other feasible solutions, then, if it selects anything else it must either be better in goal achievement or be robust in some future scenarios or a combination of both. However, the cost of these supremacies must be considered (as it may lead us to a computationally expensive problem), and the efficiency of applying this structure needs to be approved. Obviously, using the three-stage structure in comparison with the two-stage approach brings more complexity and calculations to the models. It is also shown that the solutions to the three-stage model would be preferred to the solutions provided by the two-stage model under most circumstances. However, by the "efficiency" of the three-stage framework in our context, we want to know that whether utilising this approach and its solutions is worth the expense of the additional complexity and computation. The experiments in this study showed that the three-stage model has advantages under most circumstances(meta-scenarios), but that the gains are quite modest. This issue is frequently observed when comparing these methods in problems with a short-term (say less than five stages) planning window. Nevertheless, analysis of the length of the planning horizon and its effects on the solutions to the proposed frameworks indicate that utilising the three-stage models is more efficient for longer periods because the differences between the solutions of the two proposed structures increase by any iteration of the algorithms in moving horizon models. Moreover, during the long-term calculations, we noticed that the two-stage algorithm failed to find the optimal solutions for some iterations while the three-stage algorithm found the optimal value in all cases. Thus, it seems that for the planning horizons with more than ten stages, the efficiency of the three-stage model be may worth the expenses of the complexity and computation. Nevertheless, if the DM prefers to not use the three-stage structure because of the complexity and/or calculations, the two-stage moving horizon model can provide us with some reasonable solutions, although they might not be as good as the solutions generated by a three-stage framework. Finally, to examine the power of the proposed methodology in real cases, the proposed two-stage structure was applied in the sugarcane industry to analyse the whole infrastructure of the sugar and bioethanol Supply Chain (SC) in such a way that all economics (Max profit), environmental (Min CO₂), and social benefits (Max job-creations) were optimised under six key uncertainties, namely sugarcane yield, ethanol and refined sugar demands and prices, and the exchange rate. Moreover, one of the critical design questions - that is, to design the optimal number and technologies as well as the best place(s) for setting up the ethanol plant(s) - was also addressed in this study. The general model for the strategic planning of sugar- bioethanol supply chains (SC) under deep uncertainty was formulated and also examined in a case study based on the South African Sugar Industry. This problem is formulated as a Scenario-Based Mixed-Integer Two-Stage Multi-Objective Optimisation problem and solved by utilising the Generalised Goal Programming Approach. To sum up, the proposed methodology is, to the best of our knowledge, a novel approach that can successfully handle the deep uncertainty in MCDM/MOO problems with both short- and long-term planning horizons. It is generic enough to use in all MCDM problems under deep uncertainty. However, in this thesis, the proposed structure only applied in Linear Problems (LP). Non-linear problems would be an important direction for future research. Different solution methods may also need to be examined to solve the non-linear problems. Moreover, many other real-world optimisation and decision-making applications can be considered to examine the proposed method in the future

Multistage scenario-based interval-stochastic programming for planning water resources allocation

In this study, a multistage scenario-based interval-stochastic programming (MSISP) method is developed for water-resources allocation under uncertainty. MSISP improves upon the existing multistage optimization methods with advantages in uncertainty reflection, dynamics facilitation, and risk analysis. It can directly handle uncertainties presented as both interval numbers and probability distributions, and can support the assessment of the reliability of satisfying (or the risk of violating) system constraints within a multistage context. It can also reflect the dynamics of system uncertainties and decision processes under a representative set of scenarios. The developed MSISP method is then applied to a case of water resources management planning within a multi-reservoir system associated with joint probabilities. A range of violation levels for capacity and environment constraints are analyzed under uncertainty. Solutions associated different risk levels of constraint violation have been obtained. They can be used for generating decision alternatives and thus help water managers to identify desired policies under various economic, environmental and system-reliability conditions. Besides, sensitivity analyses demonstrate that the violation of the environmental constraint has a significant effect on the system benefit

A two-stage stochastic mixed-integer program modelling and hybrid solution approach to portfolio selection problems

In this paper, we investigate a multi-period portfolio selection problem with a comprehensive set of real-world trading constraints as well as market random uncertainty in terms of asset prices. We formulate the problem into a two-stage stochastic mixed-integer program (SMIP) with recourse. The set of constraints is modelled as mixed-integer program, while a set of decision variables to rebalance the portfolio in multiple periods is explicitly introduced as the recourse variables in the second stage of stochastic program. Although the combination of stochastic program and mixed-integer program leads to computational challenges in finding solutions to the problem, the proposed SMIP model provides an insightful and flexible description of the problem. The model also enables the investors to make decisions subject to real-world trading constraints and market uncertainty. To deal with the computational difficulty of the proposed model, a simplification and hybrid solution method is applied in the paper. The simplification method aims to eliminate the difficult constraints in the model, resulting into easier sub-problems compared to the original one. The hybrid method is developed to integrate local search with Branch-and-Bound (B&B) to solve the problem heuristically. We present computational results of the hybrid approach to analyse the performance of the proposed method. The results illustrate that the hybrid method can generate good solutions in a reasonable amount of computational time. We also compare the obtained portfolio values against an index value to illustrate the performance and strengths of the proposed SMIP model. Implications of the model and future work are also discussed

Optimal Distribution Reconfiguration and Demand Management within Practical Operational Constraints

This dissertation focuses on specific aspects of the technical design and operation of a `smart\u27 distribution system incorporating new technology in the design process. The main purpose of this dissertation is to propose new algorithms in order to achieve a more reliable and economic distribution system. First, a general approach based on Mixed Integer Programming (MIP) is proposed to formulate the reconfiguration problem for a radial/weakly meshed distribution network or restoration following a fault. Two objectives considered in this study are to minimize the active power loss, and to minimize the number of switching operations with respect to operational constraints, such as power balance, line ow limits, voltage limit, and radiality of the network. The latter is the most challenging issue in solving the problem by MIP. A novel approach based on Depth-First Search (DFS) algorithm is implemented to avoid cycles and loops in the system. Due to insufficient measurements and high penetration of controllable loads and renewable resources, reconfiguration with deterministic optimization may not lead to an optimal/feasible result. Therefore, two different methods are proposed to solve the reconfiguration problem in presence of load uncertainty. Second, a new pricing algorithm for residential load participation in demand response program is proposed. The objective is to reduce the cost to the utility company while mitigating the impact on customer satisfaction. This is an iterative approach in which residents and energy supplier exchange information on consumption and price. The prices as well as appliance schedule for the residential customers will be achieved at the point of convergence. As an important contribution of this work, distribution network constraints such as voltage limits, equipment capacity limits, and phase balance constraints are considered in the pricing algorithm. Similar to the locational marginal price (LMP) at the transmission level, different prices for distribution nodes will be obtained. Primary consideration in the proposed approach, and frequently ignored in the literature, is to avoid overly sophisticated decision-making at the customer level. Most customers will have limited capacity or need for elaborate scheduling where actual energy cost savings will be modest

A critical review of the approaches to optimization problems under uncertainty

Ankara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2001.Thesis (Master's) -- Bilkent University, 2001.Includes bibliographical references leaves 58-72.In this study, the issue of uncertainty in optimization problems is studied. First of all, the meaning and sources of uncertainty are explained and then possible ways of its representation are analyzed. About the modelling process, different approaches as sensitivity analysis, parametric programming, robust optimization, stochastic programming, fuzzy programming, multiobjective programming and imprecise optimization are presented with advantages and disadvantages from different perspectives. Some extensions of the concepts of imprecise optimization are also presented.Gürtuna, FilizM.S

Constructive solution methodologies to the capacitated newsvendor problem and surrogate extension

The newsvendor problem is a single-period stochastic model used to determine the order quantity of perishable product that maximizes/minimizes the profit/cost of the vendor under uncertain demand. The goal is to fmd an initial order quantity that can offset the impact of backlog or shortage caused by mismatch between the procurement amount and uncertain demand. If there are multiple products and substitution between them is feasible, overstocking and understocking can be further reduced and hence, the vendor\u27s overall profit is improved compared to the standard problem. When there are one or more resource constraints, such as budget, volume or weight, it becomes a constrained newsvendor problem. In the past few decades, many researchers have proposed solution methods to solve the newsvendor problem. The literature is first reviewed where the performance of each of existing model is examined and its contribution is reported. To add to these works, it is complemented through developing constructive solution methods and extending the existing published works by introducing the product substitution models which so far has not received sufficient attention despite its importance to supply chain management decisions. To illustrate this dissertation provides an easy-to-use approach that utilizes the known network flow problem or knapsack problem. Then, a polynomial in fashion algorithm is developed to solve it. Extensive numerical experiments are conducted to compare the performance of the proposed method and some existing ones. Results show that the proposed approach though approximates, yet, it simplifies the solution steps without sacrificing accuracy. Further, this dissertation addresses the important arena of product substitute models. These models deal with two perishable products, a primary product and a surrogate one. The primary product yields higher profit than the surrogate. If the demand of the primary exceeds the available quantity and there is excess amount of the surrogate, this excess quantity can be utilized to fulfill the shortage. The objective is to find the optimal lot sizes of both products, that minimize the total cost (alternatively, maximize the profit). Simulation is utilized to validate the developed model. Since the analytical solutions are difficult to obtain, Mathematical software is employed to find the optimal results. Numerical experiments are also conducted to analyze the behavior of the optimal results versus the governing parameters. The results show the contribution of surrogate approach to the overall performance of the policy. From a practical perspective, this dissertation introduces the applications of the proposed models and methods in different industries such as inventory management, grocery retailing, fashion sector and hotel reservation