A Single Component Mutation Evolutionary Programming |
| |
Authors: | Mingjun Ji Hualong Yang Yongzhi Yang Zhihong Jin |
| |
Institution: | Transportation Management College, Dalian Maritime University, Dalian 116026, People’s Republic of China |
| |
Abstract: | In this paper, a novel evolutionary programming is proposed for solving the upper and lower bound optimization problems as well as the linear constrained optimization problems. There are two characteristics of the algorithm: first, only one component of the current solution is mutated in each iteration; second, it can solve the linear constrained optimization problems directly without converting it into unconstrained problems. By solving two kinds of the optimization problems, the algorithm can not only effectively find optimal or close to optimal solutions but also reduce the number of function evolutions compared with the other heuristic algorithms. |
| |
Keywords: | Global optimization Constrained optimization problems Heuristic Evolutionary programming Genetic algorithms |
本文献已被 ScienceDirect 等数据库收录! |