| 注册
首页|期刊导航|计算机与数字工程|0-1非线性规划问题改进的教与学优化算法

0-1非线性规划问题改进的教与学优化算法

张林 李会荣

计算机与数字工程2017,Vol.45Issue(5):835-838,4.
计算机与数字工程2017,Vol.45Issue(5):835-838,4.DOI:10.3969/j.issn.1672-9722.2017.05.010

0-1非线性规划问题改进的教与学优化算法

Improved Teaching-learning-based Optimization Algorithm for Solving Zero-one Nonlinear Programming Problems

张林 1李会荣1

作者信息

  • 1. 商洛学院数学与计算机应用学院 商洛 726000
  • 折叠

摘要

Abstract

The zero-one nonlinear programming problems is converted constrained optimization problems,an improved teach?ing-learning-based optimization(ITLBO)for solving the zero-one nonlinear programming is proposed using dynamic bi-objection constraint-handling method and modifying the iterative equation of TLBO algorithm. Simulation results show that ITLBO is effective?ness in terms of convergence speed and global optimization ability.

关键词

0-1非线性规划/约束优化/教与学优化算法

Key words

zero-one nonlinear programming/constrained optimization/teaching-learning-based optimization

分类

信息技术与安全科学

引用本文复制引用

张林,李会荣..0-1非线性规划问题改进的教与学优化算法[J].计算机与数字工程,2017,45(5):835-838,4.

计算机与数字工程

OACSTPCD

1672-9722

访问量0
|
下载量0
段落导航相关论文