Firepower Assignment of Ship-to-Air Missile System

2014 ◽  
Vol 905 ◽  
pp. 702-705
Author(s):  
Yong Hong Lu ◽  
Ji Hua Dou ◽  
Xing Bao Yang ◽  
Chuan Wei Zhu

Hybrid genetic algorithm has been proposed in this paper, which is proposed by combining standard genetic algorithm with hill climbing to solve the unconstrained optimization problem, which can get global optimization results of the firepower assignment, and provide decision support for the firepower assignment.

2015 ◽  
Vol 3 (5) ◽  
pp. 398-410 ◽  
Author(s):  
Xiaodan Zhang ◽  
Ang Li ◽  
Pan Ran

AbstractThe standard semi-supervised support vector machine (S3VM) is an unconstrained optimization problem of non-convex and non-smooth, so many smooth methods are applied for smoothing S3VM. In this paper, a new smooth semi-supervised support vector machine (SS3VM) model , which is based on the biquadratic spline function, is proposed. And, a hybrid Genetic Algorithm (GA)/ SS3VM approach is presented to optimize the parameters of the model. The numerical experiments are performed to test the efficiency of the model. Experimental results show that generally our optimal SS3VM model outperforms other optimal SS3VM models mentioned in this paper.


2021 ◽  
Author(s):  
Ovidiu Cosma ◽  
Petrică C Pop ◽  
Cosmin Sabo

Abstract In this paper we investigate a particular two-stage supply chain network design problem with fixed costs. In order to solve this complex optimization problem, we propose an efficient hybrid algorithm, which was obtained by incorporating a linear programming optimization problem within the framework of a genetic algorithm. In addition, we integrated within our proposed algorithm a powerful local search procedure able to perform a fine tuning of the global search. We evaluate our proposed solution approach on a set of large size instances. The achieved computational results prove the efficiency of our hybrid genetic algorithm in providing high-quality solutions within reasonable running-times and its superiority against other existing methods from the literature.


Author(s):  
Shuiwei Xie ◽  
Warren F. Smith

In contributing to the body of knowledge for decision-based design, the work reported in this paper has involved steps towards building a hybrid genetic algorithm to address systems design. Highlighted is a work in progress at the Australian Defence Force Academy (ADFA). A genetic algorithm (GA) is proposed to deal with discrete aspects of a design model (e.g., allocation of space to function) and a sequential linear programming (SLP) method for the continuous aspects (e.g., sizing). Our historical Decision Based Design (DBD) tool has been the code DSIDES (Decision Support In the Design of Engineering Systems). The original functionality of DSIDES was to solve linear and non-linear goal programming styled problems using linear programming (LP) and sequential (adaptive) linear programming (SLP/ALP). We seek to enhance DSIDES’s solver capability by the addition of genetic algorithms. We will also develop the appropriate tools to deal with the decomposition and synthesis implied. The foundational paradigm for DSIDES, which remains unchanged, is the Decision Support Problem Technique (DSPT). Through introducing genetic algorithms as solvers in DSIDES, the intention is to improve the likelihood of finding the global minimum (for the formulated model) as well as the ability of dealing more effectively with nonlinear problems which have discrete variables, undifferentiable objective functions or undifferentiable constraints. Using some numerical examples and a practical ship design case study, the proposed GA based method is demonstrated to be better in maintaining diversity of populations, preventing premature convergence, compared with other similar GAs. It also has similar effectiveness in finding the solutions as the original ALP DSIDES solver.


2019 ◽  
Vol 12 (4) ◽  
pp. 153-170 ◽  
Author(s):  
Guefrouchi Ryma ◽  
Kholladi Mohamed-Khireddine

Meta-heuristics are used as a tool for ontology mapping process in order to improve their performance in mapping quality and computational time. In this article, ontology mapping is resolved as an optimization problem. It aims at optimizing correspondences discovery between similar concepts of source and target ontologies. For better guiding and accelerating the concepts correspondences discovery, the article proposes a meta-heuristic hybridization which incorporates the Hill Climbing method within the mutation operator in the genetic algorithm. For test concerns, syntactic and lexical similarities are used to validate correspondences in candidate mappings. The obtained results show the effectiveness of the proposition for improving mapping performances in quality and computational time even for large OAEI ontologies.


1997 ◽  
Vol 30 (7) ◽  
pp. 4529-4538 ◽  
Author(s):  
D.G. Sotiropoulos ◽  
E.C. Stavropoulos ◽  
M.N. Vrahatis

Sign in / Sign up

Export Citation Format

Share Document