Simultaneous Optimal Uncertainty Apportionment and Robust Design Optimization of Systems Governed by Ordinary Differential Equations

The inclusion of uncertainty in design is of paramount practical importance because all real-life systems are affected by it. Designs that ignore uncertainty often lead to poor robustness, suboptimal performance, and higher build costs. Treatment of small geometric uncertainty in the context of manufacturing tolerances is a well studied topic. Traditional sequential design methodologies have recently been replaced by concurrent optimal design methodologies where optimal system parameters are simultaneously determined along with optimally allocated tolerances; this allows to reduce manufacturing costs while increasing performance. However, the state of the art approaches remain limited in that they can only treat geometric related uncertainties restricted to be small in magnitude. This work proposes a novel framework to perform robust design optimization concurrently with optimal uncertainty apportionment for dynamical systems governed by ordinary differential equations. The proposed framework considerably expands the capabilities of contemporary methods by enabling the treatment of both geometric and non-geometric uncertainties in a unified manner. Additionally, uncertainties are allowed to be large in magnitude and the governing constitutive relations may be highly nonlinear. In the proposed framework, uncertainties are modeled using Generalized Polynomial Chaos and are solved quantitatively using a least-square collocation method. The computational efficiency of this approach allows statistical moments of the uncertain system to be explicitly included in the optimization-based design process. The framework formulates design problems as constrained multi-objective optimization problems, thus enabling the characterization of a Pareto optimal trade-off curve that is off-set from the traditional deterministic optimal trade-off curve. The Pareto off-set is shown to be a result of the additional statistical moment information formulated in the objective and constraint relations that account for the system uncertainties. Therefore, the Pareto trade-off curve from the new framework characterizes the entire family of systems within the probability space; consequently, designers are able to produce robust and optimally performing systems at an optimal manufacturing cost. A kinematic tolerance analysis case-study is presented first to illustrate how the proposed methodology can be applied to treat geometric tolerances. A nonlinear vehicle suspension design problem, subject to parametric uncertainty, illustrates the capability of the new framework to produce an optimal design at an optimal manufacturing cost, accounting for the entire family of systems within the associated probability space. This case-study highlights the general nature of the new framework which is capable of optimally allocating uncertainties of multiple types and with large magnitudes in a single calculation

AI and OR in management of operations: history and trends

The last decade has seen a considerable growth in the use of Artificial Intelligence (AI) for operations management with the aim of finding solutions to problems that are increasing in complexity and scale. This paper begins by setting the context for the survey through a historical perspective of OR and AI. An extensive survey of applications of AI techniques for operations management, covering a total of over 1200 papers published from 1995 to 2004 is then presented. The survey utilizes Elsevier's ScienceDirect database as a source. Hence, the survey may not cover all the relevant journals but includes a sufficiently wide range of publications to make it representative of the research in the field. The papers are categorized into four areas of operations management: (a) design, (b) scheduling, (c) process planning and control and (d) quality, maintenance and fault diagnosis. Each of the four areas is categorized in terms of the AI techniques used: genetic algorithms, case-based reasoning, knowledge-based systems, fuzzy logic and hybrid techniques. The trends over the last decade are identified, discussed with respect to expected trends and directions for future work suggested

Optimum Allocation of Inspection Stations in Multistage Manufacturing Processes by Using Max-Min Ant System

In multistage manufacturing processes it is common to locate inspection stations after some or all of the processing workstations. The purpose of the inspection is to reduce the total manufacturing cost, resulted from unidentified defective items being processed unnecessarily through subsequent manufacturing operations. This total cost is the sum of the costs of production, inspection and failures (during production and after shipment). Introducing inspection stations into a serial multistage manufacturing process, although constituting an additional cost, is expected to be a profitable course of action. Specifically, at some positions the associated inspection costs will be recovered from the benefits realised through the detection of defective items, before wasting additional cost by continuing to process them. In this research, a novel general cost modelling for allocating a limited number of inspection stations in serial multistage manufacturing processes is formulated. In allocation of inspection station (AOIS) problem, as the number of workstations increases, the number of inspection station allocation possibilities increases exponentially. To identify the appropriate approach for the AOIS problem, different optimisation methods are investigated. The MAX-MIN Ant System (MMAS) algorithm is proposed as a novel approach to explore AOIS in serial multistage manufacturing processes. MMAS is an ant colony optimisation algorithm that was designed originally to begin an explorative search phase and, subsequently, to make a slow transition to the intensive exploitation of the best solutions found during the search, by allowing only one ant to update the pheromone trails. Two novel heuristics information for the MMAS algorithm are created. The heuristic information for the MMAS algorithm is exploited as a novel means to guide ants to build reasonably good solutions from the very beginning of the search. To improve the performance of the MMAS algorithm, six local search methods which are well-known and suitable for the AOIS problem are used. Selecting relevant parameter values for the MMAS algorithm can have a great impact on the algorithm’s performance. As a result, a method for tuning the most influential parameter values for the MMAS algorithm is developed. The contribution of this research is, for the first time, a methodology using MMAS to solve the AOIS problem in serial multistage manufacturing processes has been developed. The methodology takes into account the constraints on inspection resources, in terms of a limited number of inspection stations. As a result, the total manufacturing cost of a product can be reduced, while maintaining the quality of the product. Four numerical experiments are conducted to assess the MMAS algorithm for the AOIS problem. The performance of the MMAS algorithm is compared with a number of other methods this includes the complete enumeration method (CEM), rule of thumb, a pure random search algorithm, particle swarm optimisation, simulated annealing and genetic algorithm. The experimental results show that the effectiveness of the MMAS algorithm lies in its considerably shorter execution time and robustness. Further, in certain conditions results obtained by the MMAS algorithm are identical to the CEM. In addition, the results show that applying local search to the MMAS algorithm has significantly improved the performance of the algorithm. Also the results demonstrate that it is essential to use heuristic information with the MMAS algorithm for the AOIS problem, in order to obtain a high quality solution. It was found that the main parameters of MMAS include the pheromone trail intensity, heuristic information and evaporation of pheromone are less sensitive within the specified range as the number of workstations is significantly increased

A review of asset management literature on multi-asset systems

This article gives an overview of the literature on asset management for multi-unit systems with an emphasis on two multi-asset categories: fleet (a system of homogeneous assets) and portfolio (a system of heterogeneous assets). As asset systems become more complicated, researchers have employed different terms to refer to their specific problems. With an objective to facilitate readers in searching conducive studies to their interests, this paper establishes a novel classification scheme for multi-unit systems in accordance with essential features such as diversity of assets and intervention options. Moreover, discerning differences in characteristics between cross-component and cross-asset interactions, we select three types of potential multi-component dependencies (performance, stochastic, and resource) and extend their notions to be applicable to multi-asset systems. The investigation into these dependencies enables the identification of problems that could exist in real industrial settings but are yet to be determined in academia. Ultimately, we delve into modelling approaches adopted by previous researchers. This comprehensive information allows us to offer the insights into the current trends in multi-asset maintenance. We expect that the output of this review paper will not only stress research gaps on multi-asset systems, but more importantly help systematise future studies on this aspect

Modelling and optimisation of a product recovery network

An appropriate logistics network is an important element of the infrastructure of any product recovery company. Small and medium enterprises (SMEs) constitute a major fraction of the product recovery industry with a different business objective and scale of operation from those of original equipment manufacturers. This paper addresses the network design issues for SMEs involved in product recovery activities. A mathematical formulation is presented in an SME context and a subsequent simulation model is developed. A genetic algorithm approach is presented for optimising the network for a single product scenario

Selection of return channels and recovery options for used products

Due to legal, economic and socio-environmental factors, reverse logistics practices and extended producer responsibility have developed into a necessity in many countries. The end results and expectations may differ, but the motivation remains the same. Two significant components in a reverse logistics system -product recovery options and return channels - are the focus of this thesis. The two main issues examined are allocation of the returned products to recovery options, and selection of the collection methods for product returns. The initial segment of this thesis involves the formulation of a linear programming model to determine the optimal allocation of returned products differing in quality to specific recovery options. This model paves the way for a study on the effects of flexibility on product recovery allocation. A computational example utilising experimental data was presented to demonstrate the viability of the proposed model. The results revealed that in comparison to a fixed match between product qualities and recovery options, the product recovery operation appeared to be more profitable with a flexible allocation. The second segment of this thesis addresses the methods employed for the initial collection of returned products. A mixed integer nonlinear programming model was developed to facilitate the selection of optimal collection methods for these products. This integrated model takes three different initial collection methods into consideration. The model is used to solve an illustrative example optimally. However, as the complexity of the issue renders this process ineffective in the face of larger problems, the Lagrangian relaxation method was proposed to generate feasible solutions within reasonable computational times. This method was put to the test and the results were found to be encouraging

A Development Of Optimal Buffer Allocation Determination Method For Μ-Unbalanced Unpaced Production Line

This research deals with a buffer allocation problem in an unpaced (asynchronous) μ-unbalanced production line. Kajian ini membincangkan masalah peruntukan pemampan di dalam talian pengeluaran tidak melangkah dengan ketidakseimbangan-μ