A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
Many real life problems can be modeled as nonlinear discrete optimization problems. Such problems often have multiple local minima and thus require global optimization methods. Due to high complexity of these problems, heuristic based global optimization techniques are usually required when solving...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
Elsevier Inc.
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/42716 |
| _version_ | 1848756496194600960 |
|---|---|
| author | Woon, Siew Fang Rehbock, Volker |
| author_facet | Woon, Siew Fang Rehbock, Volker |
| author_sort | Woon, Siew Fang |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Many real life problems can be modeled as nonlinear discrete optimization problems. Such problems often have multiple local minima and thus require global optimization methods. Due to high complexity of these problems, heuristic based global optimization techniques are usually required when solving large scale discrete optimization or mixed discrete optimization problems. One of the more recent global optimization tools is known as the discrete filled function method. Nine variations of the discrete filled function method in literature are identified and a review on theoretical properties of each method is given. Some of the most promising filled functions are tested on various benchmark problems. Numerical results are given for comparison. |
| first_indexed | 2025-11-14T09:13:07Z |
| format | Journal Article |
| id | curtin-20.500.11937-42716 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:13:07Z |
| publishDate | 2010 |
| publisher | Elsevier Inc. |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-427162019-02-19T04:28:07Z A critical review of discrete filled function methods in solving nonlinear discrete optimization problems Woon, Siew Fang Rehbock, Volker Nonlinear discrete optimization Heuristic Discrete filled function Discrete global optimization Many real life problems can be modeled as nonlinear discrete optimization problems. Such problems often have multiple local minima and thus require global optimization methods. Due to high complexity of these problems, heuristic based global optimization techniques are usually required when solving large scale discrete optimization or mixed discrete optimization problems. One of the more recent global optimization tools is known as the discrete filled function method. Nine variations of the discrete filled function method in literature are identified and a review on theoretical properties of each method is given. Some of the most promising filled functions are tested on various benchmark problems. Numerical results are given for comparison. 2010 Journal Article http://hdl.handle.net/20.500.11937/42716 10.1016/j.amc.2010.05.009 Elsevier Inc. fulltext |
| spellingShingle | Nonlinear discrete optimization Heuristic Discrete filled function Discrete global optimization Woon, Siew Fang Rehbock, Volker A critical review of discrete filled function methods in solving nonlinear discrete optimization problems |
| title | A critical review of discrete filled function methods in solving nonlinear discrete optimization problems |
| title_full | A critical review of discrete filled function methods in solving nonlinear discrete optimization problems |
| title_fullStr | A critical review of discrete filled function methods in solving nonlinear discrete optimization problems |
| title_full_unstemmed | A critical review of discrete filled function methods in solving nonlinear discrete optimization problems |
| title_short | A critical review of discrete filled function methods in solving nonlinear discrete optimization problems |
| title_sort | critical review of discrete filled function methods in solving nonlinear discrete optimization problems |
| topic | Nonlinear discrete optimization Heuristic Discrete filled function Discrete global optimization |
| url | http://hdl.handle.net/20.500.11937/42716 |