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 the 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 l...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
COC Publications, Curtin University
2012
|
| Online Access: | http://hdl.handle.net/20.500.11937/11073 |
| _version_ | 1848747707806515200 |
|---|---|
| author | Woon, S. Rehbock, Volker Loxton, Ryan |
| author2 | Honglei Xu |
| author_facet | Honglei Xu Woon, S. Rehbock, Volker Loxton, Ryan |
| author_sort | Woon, S. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | The discrete filled function method is a global optimization tool for searching for the 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. |
| first_indexed | 2025-11-14T06:53:26Z |
| format | Conference Paper |
| id | curtin-20.500.11937-11073 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T06:53:26Z |
| publishDate | 2012 |
| publisher | COC Publications, Curtin University |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-110732023-02-02T07:57:37Z A modified discrete filled function algorithm for solving nonlinear discrete optimization problems Woon, S. Rehbock, Volker Loxton, Ryan Honglei Xu Xinmin Yang Yi Zhang The discrete filled function method is a global optimization tool for searching for the 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. 2012 Conference Paper http://hdl.handle.net/20.500.11937/11073 COC Publications, Curtin University fulltext |
| spellingShingle | Woon, S. Rehbock, Volker Loxton, Ryan A modified discrete filled function algorithm for solving nonlinear discrete optimization problems |
| title | A modified discrete filled function algorithm for solving nonlinear discrete optimization problems |
| title_full | A modified discrete filled function algorithm for solving nonlinear discrete optimization problems |
| title_fullStr | A modified discrete filled function algorithm for solving nonlinear discrete optimization problems |
| title_full_unstemmed | A modified discrete filled function algorithm for solving nonlinear discrete optimization problems |
| title_short | A modified discrete filled function algorithm for solving nonlinear discrete optimization problems |
| title_sort | modified discrete filled function algorithm for solving nonlinear discrete optimization problems |
| url | http://hdl.handle.net/20.500.11937/11073 |