Using Traceless Genetic Programming for Solving Multiobjective Optimization Problems
원문 초록
Traceless Genetic Programming (TGP) is a Genetic Programming (GP) variant that is used in cases where the focus is rather the output of the program than the program itself. The main difference between TGP and other GP techniques is that TGP does not explicitly store the evolved computer programs. Two genetic operators are used in conjunction with TGP: crossover and insertion. In this paper, we shall focus on how to apply TGP for solving multi-objective optimization problems which are quite unusual for GP. Each TGP individual stores the output of a computer program (tree) representing a point in the search space. Numerical experiments show that TGP is able to solve very fast and very well the considered test problems.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Bridging Evolutionary Multiobjective Optimization and GPU Acceleration via Tensorization
Principal Orthogonal Latent Components Analysis (POLCA Net)
LibMOON: A Gradient-based MultiObjective OptimizatioN Library in PyTorch
SustainDC: Benchmarking for Sustainable Data Center Control
GPU-accelerated Evolutionary Multiobjective Optimization Using Tensorized RVEA
Explainable Bayesian Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.