Planning and Scheduling Interrelated Road Network Projects by Integrating Cell Transmission Model and Genetic Algorithm

In systems with interrelated alternatives, the benefits or costs of each alternative depend on which other alternatives are selected and when they are implemented. System interrelations and uncertainties in various elements of transportation systems such as future demand, make it difficult to evaluate project impacts with analytical methods. This study proposes a general and modular framework for planning and scheduling interrelated infrastructure projects under uncertainties. The method should be general enough to address the planning problem for any interrelated system in a wide range of applications. The goal is to determine which projects should be selected and when they should be implemented to minimize the present value of total system cost, subject to a cumulative budget flow constraint. For this purpose, the scheduling problem is formulated as a non-linear integer optimization problem that minimizes the present value of system cost over a planning horizon. The first part of this dissertation employs a simple traffic assignment model to evaluate improvement alternatives. The algorithm identifies potential locations within a network that needs improvements and considers multiple improvement alternatives at each location. Accordingly, a probabilistic procedure is introduced to select the optimal improvement type for the candidate locations. The traffic assignment model is used to evaluate the objective function and implicitly compute project interrelations, with a Genetic Algorithm (GA) developed to solve the optimization problem. In the second part of the dissertation, the traffic assignment model is replaced with a more detailed evaluation model, namely a Cell Transmission Model (CTM). The use of CTM significantly improves the model by tracking queues and predicating queue build-up and dissipation, as well as backward propagation of congestion waves. Finally, since GA does not guarantee global optimum, a statistical test is employed to test the optimality of the GA solution by estimating the probability of arriving at a better solution. In effect, it is shown that the probability of finding a better solution is negligible, thus demonstrating the soundness of the GA solution

Evolution of clustering techniques in designing cellular manufacturing systems: A state-of-art review

This paper presents a review of clustering and mathematical programming methods and their impacts on cell forming (CF) and scheduling problems. In-depth analysis is carried out by reviewing 105 dominant research papers from 1972 to 2017 available in the literature. Advantages, limitations and drawbacks of 11 clustering methods in addition to 8 meta-heuristics are also discussed. The domains of studied methods include cell forming, material transferring, voids, exceptional elements, bottleneck machines and uncertain product demands. Since most of the studied models are NP-hard, in each section of this research, a deep research on heuristics and metaheuristics beside the exact methods are provided. Outcomes of this work could determine some existing gaps in the knowledge base and provide directives for objectives of this research as well as future research which would help in clarifying many related questions in cellular manufacturing systems (CMS)

A Note on Liu-Iwamura's Dependent-Chance Programming

Sometimes a complex stochastic decision system undertakes multiple tasks called events, and the decision-maker wishes to maximize the chance functions which are defined as the probabilities of satisfying these events. Originally introduced by Liu and Iwamura [B. Liu, K. Iwamura, Modelling stochastic decision systems using dependent-chance programming, European Journal of Operational Research 101 (1997) 193¿203], dependent-chance programming is aimed at maximizing some chance functions of events in an uncertain environment. In this work, we show that the original dependent chance-programming framework needs to be extended in order to capture an exact reliability measure for a given pla

Performance Modelling, and Adaptive Control for Linked Sequential Systems

This thesis investigates the dynamics of linked sequential systems of machines in industrial laundries. Two aspects are considered: firstly the control of such systems and in particular the decision making point when a batch to be processed can be sent to one of many identical machines, and secondly the modelling of the whole system of linked machines. The decision making point in the control of these systems is frequently implemented in a sub-optimal manner, or a manner which becomes sub-optimal as conditions change. An adaptive system is preferable and an Evolutionary Artificial Neural Network approach (EANN) is proposed. The EANN is tested on simulations of real laundry systems and shown to be effective. Then it is applied to two abstract game playing problems in order to better understand its limitations. Limitations are found to include the fact that if learning does not appear to take place, it is not possible to determine if this is a failure of the Evolutionary approach or the Artificial Neural Network parameters. The dynamics and performance of Linked Sequential Systems in Industrial Laundries are not well understood or covered by theory in the literature. The theory of the performance of these systems is outlined, and an Agent Based Model (ABM) simulation presented. The ABM simulation is explained and then the simulation is compared to a real world system in an existing laundry. The performance of the existing system is measured and compared to the prediction of the ABM simulation. The ABM simulation is shown to offer a better understanding of the system than the previous static calculation. Finally the ABM is used in a design exercise to show how it could be used to specify a system more accurately than the static calculation at design stage

Multi-objective biopharma capacity planning under uncertainty using a flexible genetic algorithm approach

This paper presents a flexible genetic algorithm optimisation approach for multi-objective biopharmaceutical planning problems under uncertainty. The optimisation approach combines a continuous-time heuristic model of a biopharmaceutical manufacturing process, a variable-length multi-objective genetic algorithm, and Graphics Processing Unit (GPU)-accelerated Monte Carlo simulation. The proposed approach accounts for constraints and features such as rolling product sequence-dependent changeovers, multiple intermediate demand due dates, product QC/QA release times, and pressure to meet uncertain product demand on time. An industrially-relevant case study is used to illustrate the functionality of the approach. The case study focused on optimisation of conflicting objectives, production throughput, and product inventory levels, for a multi-product biopharmaceutical facility over a 3-year period with uncertain product demand. The advantages of the multi-objective GA with the embedded Monte Carlo simulation were demonstrated by comparison with a deterministic GA tested with Monte Carlo simulation post-optimisation

Analysis of dynamic traffic control and management strategies

Ph.DDOCTOR OF PHILOSOPH

Intelligent Energy-Savings and Process Improvement Strategies in Energy-Intensive Industries

S tím, jak se neustále vyvíjejí nové technologie pro energeticky náročná průmyslová odvětví, stávající zařízení postupně zaostávají v efektivitě a produktivitě. Tvrdá konkurence na trhu a legislativa v oblasti životního prostředí nutí tato tradiční zařízení k ukončení provozu a k odstavení. Zlepšování procesu a projekty modernizace jsou zásadní v udržování provozních výkonů těchto zařízení. Současné přístupy pro zlepšování procesů jsou hlavně: integrace procesů, optimalizace procesů a intenzifikace procesů. Obecně se v těchto oblastech využívá matematické optimalizace, zkušeností řešitele a provozní heuristiky. Tyto přístupy slouží jako základ pro zlepšování procesů. Avšak, jejich výkon lze dále zlepšit pomocí moderní výpočtové inteligence. Účelem této práce je tudíž aplikace pokročilých technik umělé inteligence a strojového učení za účelem zlepšování procesů v energeticky náročných průmyslových procesech. V této práci je využit přístup, který řeší tento problém simulací průmyslových systémů a přispívá následujícím: (i)Aplikace techniky strojového učení, která zahrnuje jednorázové učení a neuro-evoluci pro modelování a optimalizaci jednotlivých jednotek na základě dat. (ii) Aplikace redukce dimenze (např. Analýza hlavních komponent, autoendkodér) pro vícekriteriální optimalizaci procesu s více jednotkami. (iii) Návrh nového nástroje pro analýzu problematických částí systému za účelem jejich odstranění (bottleneck tree analysis – BOTA). Bylo také navrženo rozšíření nástroje, které umožňuje řešit vícerozměrné problémy pomocí přístupu založeného na datech. (iv) Prokázání účinnosti simulací Monte-Carlo, neuronové sítě a rozhodovacích stromů pro rozhodování při integraci nové technologie procesu do stávajících procesů. (v) Porovnání techniky HTM (Hierarchical Temporal Memory) a duální optimalizace s několika prediktivními nástroji pro podporu managementu provozu v reálném čase. (vi) Implementace umělé neuronové sítě v rámci rozhraní pro konvenční procesní graf (P-graf). (vii) Zdůraznění budoucnosti umělé inteligence a procesního inženýrství v biosystémech prostřednictvím komerčně založeného paradigmatu multi-omics.Zlepšení průmyslových procesů, Model založený na datech, Optimalizace procesu, Strojové učení, Průmyslové systémy, Energeticky náročná průmyslová odvětví, Umělá inteligence.