A modified discrete filled function algorithm for solving nonlinear discrete optimization problems
The discrete filled function method is a global optimization tool for searching for best solution amongst multiple local optima.This method has proven useful for solving large-scale discrete optimization problems.In this paper, we consider a standard discrete filled function algorithm in the literat...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://repo.uum.edu.my/8951/1/A.pdf http://repo.uum.edu.my/8951/ http://science.cup.edu.cn/mathweb/icoca2012/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The discrete filled function method is a global optimization tool for searching for best solution amongst multiple local optima.This method has proven useful for solving large-scale discrete optimization problems.In this paper, we consider a standard discrete filled function algorithm in the literature and then propose a modification to increase its efficiency. |
|---|