14,653 research outputs found
Strategies for multiobjective genetic algorithm development: Application to optimal batch plant design in process systems engineering
This work deals with multiobjective optimization problems using Genetic Algorithms (GA). A MultiObjective GA (MOGA) is proposed to solve multiobjective problems combining both continuous and discrete variables. This kind of problem is commonly found in chemical engineering since process design and operability involve structural and decisional choices as well as the determination of operating conditions. In this paper, a design of a basic MOGA which copes successfully with a range of typical chemical engineering optimization problems is considered and the key points of its architecture described in detail. Several performance tests are presented, based on the influence of bit ranging encoding in a chromosome. Four mathematical functions were used as a test bench. The MOGA was able to find the optimal solution for each objective function, as well as an important number of Pareto optimal solutions. Then, the results of two multiobjective case studies in batch plant design and retrofit were presented, showing the flexibility and adaptability of the MOGA to deal with various engineering problems
Optimal advertising campaign generation for multiple brands using MOGA
The paper proposes a new modified multiobjective
genetic algorithm (MOGA) for the problem of optimal television (TV) advertising campaign generation for multiple brands. This NP-hard combinatorial optimization problem with numerous constraints is one of the key issues for an advertising agency when producing the optimal TV mediaplan. The classical approach to the solution of this problem is the greedy heuristic, which relies on the strength of the preceding commercial breaks when selecting
the next break to add to the campaign. While the greedy heuristic is capable of generating only a group of solutions that are closely related in the objective space, the proposed modified MOGA produces a Pareto-optimal set of chromosomes that: 1) outperform the greedy heuristic and 2) let the mediaplanner choose from a variety of uniformly distributed tradeoff solutions. To achieve these
results, the special problem-specific solution encoding, genetic operators, and original local optimization routine were developed for the algorithm. These techniques allow the algorithm to manipulate with only feasible individuals, thus, significantly improving its performance that is complicated by the problem constraints. The efficiency of the developed optimization method is verified using
the real data sets from the Canadian advertising industry
Properties of Nucleon Resonances by means of a Genetic Algorithm
We present an optimization scheme that employs a Genetic Algorithm (GA) to
determine the properties of low-lying nucleon excitations within a realistic
photo-pion production model based upon an effective Lagrangian. We show that
with this modern optimization technique it is possible to reliably assess the
parameters of the resonances and the associated error bars as well as to
identify weaknesses in the models. To illustrate the problems the optimization
process may encounter, we provide results obtained for the nucleon resonances
(1230) and (1700). The former can be easily isolated and thus
has been studied in depth, while the latter is not as well known
experimentally.Comment: 12 pages, 10 figures, 3 tables. Minor correction
Algorithms Applied to Global Optimisation – Visual Evaluation
Evaluation and assessment of various search and optimisation algorithms is subject of large research efforts. Particular interest of this study is global optimisation and presented approach is based on observation and visual evaluation of Real-Coded Genetic Algorithm, Particle Swarm Optimisation, Differential Evolution and Free Search, which are briefly described and used for experiments. 3D graphical views, generated by visualisation tool VOTASA, illustrate essential aspects of global search process such as divergence, convergence, dependence on initialisation and utilisation of accidental events. Discussion on potential benefits of visual analysis, supported with numerical results, which could be used for comparative assessment of other methods and directions for further research conclude presented study
Recommended from our members
Prediction of progression in idiopathic pulmonary fibrosis using CT scans atbaseline: A quantum particle swarm optimization - Random forest approach
Idiopathic pulmonary fibrosis (IPF) is a fatal lung disease characterized by an unpredictable progressive declinein lung function. Natural history of IPF is unknown and the prediction of disease progression at the time ofdiagnosis is notoriously difficult. High resolution computed tomography (HRCT) has been used for the diagnosisof IPF, but not generally for monitoring purpose. The objective of this work is to develop a novel predictivemodel for the radiological progression pattern at voxel-wise level using only baseline HRCT scans. Mainly, thereare two challenges: (a) obtaining a data set of features for region of interest (ROI) on baseline HRCT scans andtheir follow-up status; and (b) simultaneously selecting important features from high-dimensional space, andoptimizing the prediction performance. We resolved the first challenge by implementing a study design andhaving an expert radiologist contour ROIs at baseline scans, depending on its progression status in follow-upvisits. For the second challenge, we integrated the feature selection with prediction by developing an algorithmusing a wrapper method that combines quantum particle swarm optimization to select a small number of featureswith random forest to classify early patterns of progression. We applied our proposed algorithm to analyzeanonymized HRCT images from 50 IPF subjects from a multi-center clinical trial. We showed that it yields aparsimonious model with 81.8% sensitivity, 82.2% specificity and an overall accuracy rate of 82.1% at the ROIlevel. These results are superior to other popular feature selections and classification methods, in that ourmethod produces higher accuracy in prediction of progression and more balanced sensitivity and specificity witha smaller number of selected features. Our work is the first approach to show that it is possible to use onlybaseline HRCT scans to predict progressive ROIs at 6 months to 1year follow-ups using artificial intelligence
Analysis of some global optimization algorithms for space trajectory design
In this paper, we analyze the performance of some global search algorithms on a number of space trajectory design problems. A rigorous testing procedure is introduced to measure the ability of an algorithm to identify the set of ²-optimal solutions. From the analysis of the test results, a novel algorithm is derived. The development of the novel algorithm starts from the redefinition of some evolutionary heuristics in the form of a discrete dynamical system. The convergence properties of this discrete dynamical system are used to derive a hybrid evolutionary algorithm that displays very good performance on the particular class of problems presented in this paper
- …