133,767 research outputs found
Manufacturing process planning optimisation in reconfigurable multiple parts flow lines
Purpose: This paper explores the capabilities of genetic algorithms in handling optimization of the critical issues mentioned above for the purpose of manufacturing process planning in reconfigurable manufacturing activities. Two modified genetic algorithms are devised and employed to provide the best approximate process planning solution. Modifications included adapting genetic operators to the problem specific knowledge and implementing application specific heuristics to enhance the search efficiency.
Design/methodology/approach: The genetic algorithm methodology implements a genetic algorithm that is augmented by application specific heuristics in order to guide the search for an optimal solution. The case study is based on the manufacturing system. Raw materials enter the system through an input stage and exit the system through an output stage. The system is composed of sixteen (16) processing modules that are arranged in four processing stages.
Findings: The results indicate that the two genetic algorithms are able to converge to optimal solutions in reasonable time. A computational study shows that improved solutions can be obtained by implementing a genetic algorithm with an extended diversity control mechanism.
Research limitations/implications: This paper has examined the issues of MPP optimization in a reconfigurable manufacturing framework with the help of a reconfigurable multiparts manufacturing flow line.
Originality/value: The results of the case illustration have demonstrated the practical use of diversity control
implemented in the MGATO technique. In comparison to MGAWTO, the implemented MGATO improves the
population diversity through a customized threshold operator. It was clear that the MGATO can obtain better
solution quality by foiling the tendency towards premature convergence
Sub-structural Niching in Estimation of Distribution Algorithms
We propose a sub-structural niching method that fully exploits the problem
decomposition capability of linkage-learning methods such as the estimation of
distribution algorithms and concentrate on maintaining diversity at the
sub-structural level. The proposed method consists of three key components: (1)
Problem decomposition and sub-structure identification, (2) sub-structure
fitness estimation, and (3) sub-structural niche preservation. The
sub-structural niching method is compared to restricted tournament selection
(RTS)--a niching method used in hierarchical Bayesian optimization
algorithm--with special emphasis on sustained preservation of multiple global
solutions of a class of boundedly-difficult, additively-separable multimodal
problems. The results show that sub-structural niching successfully maintains
multiple global optima over large number of generations and does so with
significantly less population than RTS. Additionally, the market share of each
of the niche is much closer to the expected level in sub-structural niching
when compared to RTS
A MOS-based Dynamic Memetic Differential Evolution Algorithm for Continuous Optimization: A Scalability Test
Continuous optimization is one of the areas with more activity in the field of heuristic optimization. Many algorithms have been proposed and compared on several benchmarks of functions, with different performance depending on the problems. For this reason, the combination of different search strategies seems desirable to obtain the best performance of each of these approaches. This contribution explores the use of a hybrid memetic algorithm based on the multiple offspring framework. The proposed algorithm combines the explorative/exploitative strength of two heuristic search methods that separately obtain very competitive results. This algorithm has been tested with the benchmark problems and conditions defined for the special issue of the Soft Computing Journal on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale Continuous Optimization Problems. The proposed algorithm obtained the best results compared with both its composing algorithms and a set of reference algorithms that were proposed for the special issue
Recommended from our members
ECEF Position Accuracy and Reliability: Inertial Navigation with GNSS Precise Point Positioning (PPP)
This report presents experimental results for a moving platform using GPS PPP data for state estimation. Results from two PPP GPS state estimation approaches are presented: point-wise least squares (LS) and aided inertial navigation (INS). The point-wise LS results provide information about the accuracy and reliability of PPP GPS information at each measurement epoch, independent of other epochs. The INS results show the performance that can be achieved by combining information across measurement epochs. INS results are included for two different grades of IMU: navigation grade and consumer grade.The report cites publications that contain more detailed expla- nations of the GNSS error sources, computation of PPP wide area correction, and the LS and aided INS estimation algorithms
SamACO: variable sampling ant colony optimization algorithm for continuous optimization
An ant colony optimization (ACO) algorithm offers
algorithmic techniques for optimization by simulating the foraging behavior of a group of ants to perform incremental solution
constructions and to realize a pheromone laying-and-following
mechanism. Although ACO is first designed for solving discrete
(combinatorial) optimization problems, the ACO procedure is
also applicable to continuous optimization. This paper presents
a new way of extending ACO to solving continuous optimization
problems by focusing on continuous variable sampling as a key
to transforming ACO from discrete optimization to continuous
optimization. The proposed SamACO algorithm consists of three
major steps, i.e., the generation of candidate variable values for
selection, the ants’ solution construction, and the pheromone
update process. The distinct characteristics of SamACO are the
cooperation of a novel sampling method for discretizing the
continuous search space and an efficient incremental solution
construction method based on the sampled values. The performance
of SamACO is tested using continuous numerical functions
with unimodal and multimodal features. Compared with some
state-of-the-art algorithms, including traditional ant-based algorithms
and representative computational intelligence algorithms
for continuous optimization, the performance of SamACO is seen
competitive and promising
Recommended from our members
An Empirical Study of the Effectiveness of 'Forcing Diversity' Based on a Large Population of Diverse Programs
Use of diverse software components is a viable defence against common-mode failures in redundant softwarebased systems. Various forms of "Diversity-Seeking Decisions" (“DSDs”) can be applied to the process of developing, or procuring, redundant components, to improve the chances of the resulting components not failing on the same demands. An open question is how effective these decisions, and their combinations, are for achieving large enough reliability gains. Using a large population of software programs, we studied experimentally the effectiveness of specific "DSDs" (and their combinations) mandating differences between redundant components. Some of these combinations produced much better improvements in system probability of failure per demand (PFD) than "uncontrolled" diversity did. Yet, our findings suggest that the gains from such "DSDs" vary significantly between them and between the application problems studied. The relationship between DSDs and system PFD is complex and does not allow for simple universal rules
(e.g. "the more diversity the better") to apply
A particle swarm optimization based memetic algorithm for dynamic optimization problems
Copyright @ Springer Science + Business Media B.V. 2010.Recently, there has been an increasing concern from the evolutionary computation community on dynamic optimization problems since many real-world optimization problems are dynamic. This paper investigates a particle swarm optimization (PSO) based memetic algorithm that hybridizes PSO with a local search technique for dynamic optimization problems. Within the framework of the proposed algorithm, a local version of PSO with a ring-shape topology structure is used as the global search operator and a fuzzy cognition local search method is proposed as the local search technique. In addition, a self-organized random immigrants scheme is extended into our proposed algorithm in order to further enhance its exploration capacity for new peaks in the search space. Experimental study over the moving peaks benchmark problem shows that the proposed PSO-based memetic algorithm is robust and adaptable in dynamic environments.This work was supported by the National Nature Science Foundation of China (NSFC) under Grant No. 70431003 and Grant No. 70671020, the National Innovation Research Community Science Foundation of China under
Grant No. 60521003, the National Support Plan of China under Grant No. 2006BAH02A09 and the Ministry of Education, science, and Technology in Korea through the Second-Phase of Brain Korea 21 Project in 2009, the Engineering and Physical Sciences Research
Council (EPSRC) of UK under Grant EP/E060722/01 and the Hong Kong Polytechnic University Research Grants under Grant G-YH60
Comparison of group recommendation algorithms
In recent years recommender systems have become the common tool to handle the information overload problem of educational and informative web sites, content delivery systems, and online shops. Although most recommender systems make suggestions for individual users, in many circumstances the selected items (e.g., movies) are not intended for personal usage but rather for consumption in groups. This paper investigates how effective group recommendations for movies can be generated by combining the group members' preferences (as expressed by ratings) or by combining the group members' recommendations. These two grouping strategies, which convert traditional recommendation algorithms into group recommendation algorithms, are combined with five commonly used recommendation algorithms to calculate group recommendations for different group compositions. The group recommendations are not only assessed in terms of accuracy, but also in terms of other qualitative aspects that are important for users such as diversity, coverage, and serendipity. In addition, the paper discusses the influence of the size and composition of the group on the quality of the recommendations. The results show that the grouping strategy which produces the most accurate results depends on the algorithm that is used for generating individual recommendations. Therefore, the paper proposes a combination of grouping strategies which outperforms each individual strategy in terms of accuracy. Besides, the results show that the accuracy of the group recommendations increases as the similarity between members of the group increases. Also the diversity, coverage, and serendipity of the group recommendations are to a large extent dependent on the used grouping strategy and recommendation algorithm. Consequently for (commercial) group recommender systems, the grouping strategy and algorithm have to be chosen carefully in order to optimize the desired quality metrics of the group recommendations. The conclusions of this paper can be used as guidelines for this selection process
An Experimental Study of Adaptive Control for Evolutionary Algorithms
The balance of exploration versus exploitation (EvE) is a key issue on
evolutionary computation. In this paper we will investigate how an adaptive
controller aimed to perform Operator Selection can be used to dynamically
manage the EvE balance required by the search, showing that the search
strategies determined by this control paradigm lead to an improvement of
solution quality found by the evolutionary algorithm
- …