JaLCDOI 10.18926/15389
FullText URL Mem_Fac_Eng_OU_30_1_121.pdf
Author Kuk Hun| Tanino, Tetsuzo| Tanaka, Masahiro|
Abstract In this paper we provide some theoretical results on stability and sensitivity analysis in convex vector optimization. Given a family of parametrized vector optimization problems, the perturbation maps are defined as the set-valued map which associates to each parameter value the set of minimal points (properly minimal points, weakly minimal points) of the perturbed feasible set with respect to an ordering convex cone. Sufficient conditions for the upper and lower semicontinuity of the perturbations map are obtained. We also provide quantitative properties of the perturbation maps under some convexity assumptions.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 1995-12-28
Volume volume30
Issue issue1
Start Page 121
End Page 131
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002307414
JaLCDOI 10.18926/15386
FullText URL Mem_Fac_Eng_OU_30_1_111.pdf
Author Ye Ju| Tanaka, Masahiro| Tanino, Tetsuzo|
Abstract Mutation is one of the important operators in genetic algorithm. In traditional genetic algorithm, mutation is activated stochastically. In this way it is unknown and cannot be controlled for which individuals to be mutated. Therefore, it is unavoidable that some good individuals are destroyed by mutation and then the evolutionary efficiency of the genetic algorithm is dampened. Owing to this kind of destructivity of mutation, the operator of mutation has to be limited within a very small probability, and the potentiality of mutation is consequently limited. In this paper, we present an evolutionary chain-based mutation and a control strategy of reasonable competition, in which the heuristic information provided by the evaluation function is well utilized. This method avoids the blindness of stochastic mutation. The performance improved in this method is shown by two examples, a fuzzy modeling for the identification of a nonlinear function and a typical combinatorial optimization problem-the traveling salesman problem.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 1995-12-28
Volume volume30
Issue issue1
Start Page 111
End Page 120
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002307635