Speed-up fractal image compression with a fuzzy classifier

This paper presents a fractal image compression scheme incorporated with a fuzzy classifier that is optimized by a genetic algorithm. The fractal image compression scheme requires to find matching range blocks to domain blocks from all the possible division of an image into subblocks. With suitable classification of the subblocks by a fuzzy classifier we can reduce the search time for this matching process so as to speedup the encoding process in the scheme. Implementation results show that by introducing three image classes and using fuzzy classifier optimized by a genetic algorithm the encoding process can be speedup by about 40% of an unclassified encoding system.     

Mesh Simplification Based on Super-Face and Genetic Algorithm in Reverse Engineering

Mesh simplification is one of the most important links in the context of reverse engineering. It is also an important consideration in computer graphics. This paper presents a novel and original method of triangular mesh reduction. A new concept of super-face is defined. In order to construct a super-face, a way to calculate the scattered point curvature is discussed. The growth of a seed point and the combination of different regions are also necessary for the construction of a super-face. When the hole left by the deletion of super-face is retriangulated a genetic algorithm is used that has been modified for our specific problem. Then the different weights to balance the optimisation of the new triangular mesh can be adjusted.     

A new formulation for web crippling strength of cold-formed steel sheeting using genetic programming

This study presents Genetic programming (GP) as a new tool for the formulation of web crippling strength of cold-formed steel decks for various loading cases. There is no well established analytical solution of the problem due to complex plastic behaviour. The objective of this study is to provide an alternative robust formulation to related design codes and to verify the robustness of GP for the formulation of such structural engineering problems. The training and testing patterns of the proposed GP formulation are based on well established experimental results from the literature. The GP based formulation results are compared with experimental results and current design codes and found to be more accurate.     

A cell-based robust optimal coordinated control on urban arterial road

Process of optimizing coordinated control is divided into two stages.At the first stage,the study improves a robust optimal control model of single-point intersection to optimize cycle and split.At the second stage,the study combines all links with intersections of arterial road as a complete system,and applies cell transmission model to simulate traffic flow on urban signalized arterial road.We propose a coordinated control model based on the platform to optimize offset between adjacent intersections.Genetic algorithm is executed by MATLAB to solve the model.The performance evaluations show that the model not only effectively reduces average delay and stopping rate of vehicles on arterial road and largely enhances traffic capacity of arterial road,but also lowers the sensitivity of signal control for flow fluctuations.     

Personalized course generation and evolution based on genetic algorithms

Online learners are individuals,and their learning abilities,knowledge,and learning performance differ substantially and are ever changing.These individual characteristics pose considerable challenges to online learning courses.In this paper,we propose an online course generation and evolution approach based on genetic algorithms to provide personalized learning.The courses generated consider not only the difficulty level of a concept and the time spent by an individual learner on the concept,but also the changing learning performance of the individual learner during the learning process.We present a layered topological sort algorithm,which converges towards an optimal solution while considering multiple objectives.Our general approach makes use of the stochastic convergence of genetic algorithms.Experimental results show that the proposed algorithm is superior to the free browsing learning mode typically enabled by online learning environments because of the precise selection of learning content relevant to the individual learner,which results in good learning performance.     

智能优化算法的应用研究

优化问题广泛存在于各个领域,对该问题的求解问题从没停止过.自从优化问题提出以来,人们提出了各种各样的智能优化算法.文中简要介绍了遗传算法、蚁群算法、模拟退火算法3种智能优化算法,并简述其优缺点及应用研究的使用情况.     

用于多峰函数优化的小生境差分演化算法

针对监控视频图像的特点,提出了一种有效的实时视频降噪算法。首先结合多帧图像采用基于Non—localmeans的运动检测方法自适应地区分图像的运动区域和静止区域,对静止区域采用时域加权均值滤波,对运动区域采用空域ANL滤波。充分利用了视频的时域、空域信息,在去除视频序列噪声的同时很好地保护了图像的细节。实验结果表明,提出的算法在不造成运动拖影的前提下,能够显著提高视频的信噪比和图像的主观质量。     

A novel data-driven approach to support decision-making during production scale-up of assembly systems

In today's manufacturing settings, a sudden increase in the customer demand may enforce manufacturers to alter their manufacturing systems either by adding new resources or changing the layout within a restricted time frame. Without an appropriate strategy to handle this transition to higher volume, manufacturers risk losing their market competitiveness. The subjective experience-based ad-hoc procedures existing in the industrial domain are insufficient to support the transition to a higher volume, thereby necessitating a new approach where the scale-up can be realised in a timely, systematic manner. This research study aims to fulfill this gap by proposing a novel Data-Driven Scale-up Model, known as DDSM, that builds upon kinematic and Discrete-Event Simulation (DES) models. These models are further enhanced by historical production data and knowledge representation techniques. The DDSM approach identifies the near-optimal production system configurations that meet the new customer demand using an iterative design process across two distinct levels, namely the workstation and system levels. At the workstation level, a set of potential workstation configurations are identified by utilising the knowledge mapping between product, process, resource and resource attribute domains. Workstation design data of selected configurations are streamlined into a common data model that is accessed at the system level where DES software and a multi-objective Genetic Algorithm (GA) are used to support decision-making activities by identifying potential system configurations that provide optimum scale-up Key Performance Indicators (KPIs). For the optimisation study, two conflicting objectives: scale-up cost and production throughput are considered. The approach is employed in a battery module assembly pilot line that requires structural modifications to meet the surge in the demand of electric vehicle powertrains. The pilot line is located at the Warwick Manufacturing Group, University of Warwick, where the production data is captured to initiate and validate the workstation models. Conclusively, it is ascertained by experts that the approach is found useful to support the selection of suitable system configuration and design with significant savings in time, cost and effort.     

Simultaneous solving of balancing and sequencing problems with station-dependent assembly times for mixed-model assembly lines

In spite of many studies, investigating balancing and sequencing problems in Mixed-Model Assembly Line (MMAL) individually, this paper solves them simultaneously aiming to minimize total utility work. A new Mixed-Integer Linear Programming (MILP) model is developed to provide the exact solution of the problem with station-dependent assembly times. Because of NP-hardness, a Simulated Annealing (SA) is applied and compared to the Co-evolutionary Genetic Algorithm (Co-GA) from the literature. To strengthen the search process, two main hypotheses, namely simultaneous search and feasible search, are developed contrasting Co-GA. Various parameters of SA are reviewed to calibrate the algorithm by means of Taguchi design of experiments. Numerical results statistically show the efficiency and effectiveness of the proposed SA in terms of both the quality of solution and the time of achieving the best solution. Finally, the contribution of each hypothesis in this superiority is analyzed.