523 research outputs found

    Trim Loss Optimization by an Improved Differential Evolution

    Get PDF
    The “trim loss problem” (TLP) is one of the most challenging problems in context of optimization research. It aims at determining the optimal cutting pattern of a number of items of various lengths from a stock of standard size material to meet the customers’ demands that the wastage due to trim loss is minimized. The resulting mathematical model is highly nonconvex in nature accompanied with several constraints with added restrictions of binary variables. This prevents the application of conventional optimization methods. In this paper we use synergetic differential evolution (SDE) for the solution of this type of problems. Four hypothetical but relevant cases of trim loss problem arising in paper industry are taken for the experiment. The experimental results compared with those of the other techniques show the competence of the SDE to solve the problem

    Trim Loss Optimization by an Improved Differential Evolution

    Get PDF
    The "trim loss problem" (TLP) is one of the most challenging problems in context of optimization research. It aims at determining the optimal cutting pattern of a number of items of various lengths from a stock of standard size material to meet the customers' demands that the wastage due to trim loss is minimized. The resulting mathematical model is highly nonconvex in nature accompanied with several constraints with added restrictions of binary variables. This prevents the application of conventional optimization methods. In this paper we use synergetic differential evolution (SDE) for the solution of this type of problems. Four hypothetical but relevant cases of trim loss problem arising in paper industry are taken for the experiment. The experimental results compared with those of the other techniques show the competence of the SDE to solve the problem

    Shadow Price Guided Genetic Algorithms

    Get PDF
    The Genetic Algorithm (GA) is a popular global search algorithm. Although it has been used successfully in many fields, there are still performance challenges that prevent GA’s further success. The performance challenges include: difficult to reach optimal solutions for complex problems and take a very long time to solve difficult problems. This dissertation is to research new ways to improve GA’s performance on solution quality and convergence speed. The main focus is to present the concept of shadow price and propose a two-measurement GA. The new algorithm uses the fitness value to measure solutions and shadow price to evaluate components. New shadow price Guided operators are used to achieve good measurable evolutions. Simulation results have shown that the new shadow price Guided genetic algorithm (SGA) is effective in terms of performance and efficient in terms of speed

    Experimental Investigations on Machining of CFRP Composites: Study of Parametric Influence and Machining Performance Optimization

    Get PDF
    Carbon Fiber Reinforced Polymer (CFRP) composites are characterized by their excellent mechanical properties (high specific strength and stiffness, light weight, high damping capacity etc.) as compared to conventional metals, which results in their increased utilization especially for aircraft and aerospace applications, automotive, defense as well as sporting industries. With increasing applications of CFRP composites, determining economical techniques of production is very important. However, as compared to conventional metals, machining behavior of composites is somewhat different. This is mainly because these materials behave extremely abrasive during machining operations. Machining of CFRP appears difficult due to their material discontinuity, inhomogeneity and anisotropic nature. Moreover, the machining behavior of composites largely depends on the fiber form, the fiber content, fiber orientations of composites and the variability of matrix material. Difficulties are faced during machining of composites due to occurrence of various modes of damages like fiber breakage, matrix cracking, fiber–matrix debonding and delamination. Hence, adequate knowledge and in-depth understanding of the process behavior is indeed necessary to identify the most favorable machining environment in view of various requirements of process performance yields. In this context, present work attempts to investigate aspects of machining performance optimization during machining (turning and drilling) of CFRP composites. In case of turning experiments, the following parameters viz. cutting force, Material Removal Rate (MRR), roughness average (Ra) and maximum tool-tip temperature generated during machining have been considered as process output responses. In case of drilling, the following process performance features viz. load (thrust), torque, roughness average (of the drilled hole) and delamination factor (entry and exit both) have been considered. Attempt has been made to determine the optimal machining parameters setting that can simultaneously satisfy aforesaid response features up to the desired extent. Using Fuzzy Inference System (FIS), multiple response features have been aggregated to obtain an equivalent single performance index called Multi-Performance Characteristic Index (MPCI). A nonlinear regression model has been established in which MPCI has been represented as a function of the machining parameters under consideration. The aforesaid regression model has been considered as the fitness function, and finally optimized by evolutionary algorithms like Harmony Search (HS), Teaching-Learning Based Optimization (TLBO), and Imperialist Competitive Algorithm (ICA) etc. However, the limitation of these algorithms is that they assume a continuous search within parametric domain. These algorithms can give global optima; but the predicted optimal setting may not be possible to adjust in the machine/setup. Since, in most of the machines/setups, provision is given only to adjust factors (process input parameters) at some discrete levels. On the contrary, Taguchi method is based on discrete search philosophy in which predicted optimal setting can easily be achieved in reality.However, Taguchi method fails to solve multi-response optimization problems. Another important aspect that comes into picture while dealing with multi-response optimization problems is the existence of response correlation. Existing Taguchi based integrated optimization approaches (grey-Taguchi, utility-Taguchi, desirability function based Taguchi, TOPSIS, MOORA etc.) may provide erroneous outcome unless response correlation is eliminated. To get rid of that, the present work proposes a PCA-FuzzyTaguchi integrated optimization approach for correlated multi-response optimization in the context of machining CFRP composites. Application potential of aforementioned approach has been compared over various evolutionary algorithms

    Production Scheduling in Integrated Steel Manufacturing

    Get PDF
    Steel manufacturing is both energy and capital intensive, and it includes multiple production stages, such as iron-making, steelmaking, and rolling. This dissertation investigates the order schedule coordination problem in a multi-stage manufacturing context. A mixed-integer linear programming model is proposed to generate operational (up to the minute) schedules for the steelmaking and rolling stages simultaneously. The proposed multi-stage scheduling model in integrated steel manufacturing can provide a broader view of the cost impact on the individual stages. It also extends the current order scheduling literature in steel manufacturing from a single-stage focus to the coordinated multi-stage focus. Experiments are introduced to study the impact of problem size (number of order batches), order due time and demand pattern on solution performance. Preliminary results from small data instances are reported. A novel heuristic algorithm, Wind Driven Algorithm (WDO), is explained in detail, and numerical parameter study is presented. Another well-known and effective heuristic approach based on Particle Swarm Optimization (PSO) is used as a benchmark for performance comparison. Both algorithms are implemented to solve the scheduling model. Results show that WDO outperforms PSO for the proposed model on solving large sample data instances. Novel contributions and future research areas are highlighted in the conclusion

    Algorithms for Geometric Optimization and Enrichment in Industrialized Building Construction

    Get PDF
    The burgeoning use of industrialized building construction, coupled with advances in digital technologies, is unlocking new opportunities to improve the status quo of construction projects being over-budget, delayed and having undesirable quality. Yet there are still several objective barriers that need to be overcome in order to fully realize the full potential of these innovations. Analysis of literature and examples from industry reveal the following notable barriers: (1) geometric optimization methods need to be developed for the stricter dimensional requirements in industrialized construction, (2) methods are needed to preserve model semantics during the process of generating an updated as-built model, (3) semantic enrichment methods are required for the end-of-life stage of industrialized buildings, and (4) there is a need to develop pragmatic approaches for algorithms to ensure they achieve required computational efficiency. The common thread across these examples is the need for developing algorithms to optimize and enrich geometric models. To date, a comprehensive approach paired with pragmatic solutions remains elusive. This research fills this gap by presenting a new approach for algorithm development along with pragmatic implementations for the industrialized building construction sector. Computational algorithms are effective for driving the design, analysis, and optimization of geometric models. As such, this thesis develops new computational algorithms for design, fabrication and assembly, onsite construction, and end-of-life stages of industrialized buildings. A common theme throughout this work is the development and comparison of varied algorithmic approaches (i.e., exact vs. approximate solutions) to see which is optimal for a given process. This is implemented in the following ways. First, a probabilistic method is used to simulate the accumulation of dimensional tolerances in order to optimize geometric models during design. Second, a series of exact and approximate algorithms are used to optimize the topology of 2D panelized assemblies to minimize material use during fabrication and assembly. Third, a new approach to automatically update geometric models is developed whereby initial model semantics are preserved during the process of generating an as-built model. Finally, a series of algorithms are developed to semantically enrich geometric models to enable industrialized buildings to be disassembled and reused. The developments made in this research form a rational and pragmatic approach to addressing the existing challenges faced in industrialized building construction. Such developments are shown not only to be effective in improving the status quo in the industry (i.e., improving cost, reducing project duration, and improving quality), but also for facilitating continuous innovation in construction. By way of assessing the potential impact of this work, the proposed algorithms can reduce rework risk during fabrication and assembly (65% rework reduction in the case study for the new tolerance simulation algorithm), reduce waste during manufacturing (11% waste reduction in the case study for the new panel unfolding and nesting algorithms), improve accuracy and automation of as-built model generation (model error reduction from 50.4 mm to 5.7 mm in the case study for the new parametric BIM updating algorithms), reduce lifecycle cost for adapting industrialized buildings (15% reduction in capital costs in the computational building configurator) and reducing lifecycle impacts for reusing structural systems from industrialized buildings (between 54% to 95% reduction in average lifecycle impacts for the approach illustrated in Appendix B). From a computational standpoint, the novelty of the algorithms developed in this research can be described as follows. Complex geometric processes can be codified solely on the innate properties of geometry – that is, by parameterizing geometry and using methods such as combinatorial optimization, topology can be optimized and semantics can be automatically enriched for building assemblies. Employing the use of functional discretization (whereby continuous variable domains are converted into discrete variable domains) is shown to be highly effective for complex geometric optimization approaches. Finally, the algorithms encapsulate and balance the benefits posed by both parametric and non-parametric schemas, resulting in the ability to achieve both high representational accuracy and semantically rich information (which has previously not been achieved or demonstrated). In summary, this thesis makes several key improvements to industrialized building construction. One of the key findings is that rather than pre-emptively determining the best suited algorithm for a given process or problem, it is often more pragmatic to derive both an exact and approximate solution and then decide which is optimal to use for a given process. Generally, most tasks related to optimizing or enriching geometric models is best solved using approximate methods. To this end, this research presents a series of key techniques that can be followed to improve the temporal performance of algorithms. The new approach for developing computational algorithms and the pragmatic demonstrations for geometric optimization and enrichment are expected to bring the industry forward and solve many of the current barriers it faces

    Determination of Cost-Effective Range in Surface Finish for Single Pass Turning

    Get PDF
    Surface finish is considered a critical characteristic for manufacturing components when manufacturers strive to produce components with high-quality characteristics predefined by design engineers. The objective of this research is to provide a cost-effective range in surface finish for single pass turning that enables the design engineers to explore a wider spectrum of alternative solutions without significantly affecting the functionality of the part. Apart from the one optimal solution, the proposed methodology, which is based on Geometric Programming, would provide a range of cutting conditions solutions that satisfy the economic and functional needs for the designer. This can be achieved by switching cost reduction focus from tooling to labor cost, particularly by adjusting variables values such as spindle speed and feed. An algorithm has been developed to find the new variables values. In addition, a sensitivity analysis model, based on metaheuristic techniques, will also be developed to further give a set of possible solutions that are practically preferable to the practitioners. In addition, the developed methodology can be applied to other engineering applications. The proposed methodology will provide a tool that enhances the design for manufacturability for companies to become more competitive

    Structural optimization in steel structures, algorithms and applications

    Get PDF
    L'abstract è presente nell'allegato / the abstract is in the attachmen

    Planning and Scheduling Optimization

    Get PDF
    Although planning and scheduling optimization have been explored in the literature for many years now, it still remains a hot topic in the current scientific research. The changing market trends, globalization, technical and technological progress, and sustainability considerations make it necessary to deal with new optimization challenges in modern manufacturing, engineering, and healthcare systems. This book provides an overview of the recent advances in different areas connected with operations research models and other applications of intelligent computing techniques used for planning and scheduling optimization. The wide range of theoretical and practical research findings reported in this book confirms that the planning and scheduling problem is a complex issue that is present in different industrial sectors and organizations and opens promising and dynamic perspectives of research and development

    Integrated process planning and scheduling for common prismatic parts in a 5-axis CNC environment

    Get PDF
    EThOS - Electronic Theses Online ServiceGBUnited Kingdo
    corecore