摘要
整数规划是NP困难(Non-deterministic Polynomial-time hard,NP-hard)的经典问题之一。整数规划的花授粉算法(Integer Flower Pollination Algorithm,IFPA)是采用截断取整的方法,将最近开发的花授粉算法(Flower Pollination Algorithm,FPA)扩展到求解整数规划问题。通过对测试函数集进行仿真实验,结果表明IFPA拥有很好的性能和很强的全局寻优能力,可以作为一种实用方法用于求解无约束整数规划和有约束整数规划问题。
Integer programming is a famous NP-hard problem. Integer flower pollination algorithm（IFPA）is the use of rounding off method. It extends the recently developed flower pollination algorithm（FPA）to solve integer programming. The results of simulation experiments on a set of test functions show that IFPA has good performance and strong global optimization ability and can be used as a practical way to solve integer programming problems.
出处
《微型机与应用》
2015年第3期82-85,共4页
Microcomputer & Its Applications
关键词
无约束整数规划
约束整数规划
测试函数
花授粉算法
最优化
unconstrained integer programming
constrained integer programming
benchmark
flower pollination algorithm
optimization
