A Two-Phase Combined Gradient-Tunneling Based Algorithm for Constrained Integer Programming Problems
We propose a gradient-based optimization procedure consisting of two distinct phases for locating the global optimum of integer problems with a linear or non-linear objective function subject to linear or non-linear constraints. In the first phase a local minimum of the function is found using the g...
Uloženo v:
| Vydáno v: | Journal of information & optimization sciences Ročník 36; číslo 4; s. 339 - 365 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Taylor & Francis
04.07.2015
|
| Témata: | |
| ISSN: | 0252-2667, 2169-0103 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | We propose a gradient-based optimization procedure consisting of two distinct phases for locating the global optimum of integer problems with a linear or non-linear objective function subject to linear or non-linear constraints. In the first phase a local minimum of the function is found using the gradient approach coupled with hemstitching moves when a constraint is violated in order to return the search to a feasible region. In the second phase a tunneling function is constructed at this local minimum in order to find another point on the other side of the barrier where the function value is approximately the same. In the next cycle the search for the global optimum commences again using this new found point as the starting state. The search continues until no improvement in function the result is found. Results from the proposed optimization method are presented and compared with those from the gradient method involving 3
n
enumeration proposed earlier, as well as with other published results. |
|---|---|
| ISSN: | 0252-2667 2169-0103 |
| DOI: | 10.1080/02522667.2014.932092 |