SOLVING INTEGER LINEAR PROGRAMMING using SPIRAL OPTIMIZATION METHOD
Integer linear programming is a linear programming of which the variables are restricted to integer values. Solving the integer linear programming is commonly carried out by applying the Simplex method combined with branch and bound technique or the Gomory cut technique. In this thesis, an alternati...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/35491 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Integer linear programming is a linear programming of which the variables are restricted to integer values. Solving the integer linear programming is commonly carried out by applying the Simplex method combined with branch and bound technique or the Gomory cut technique. In this thesis, an alternative method to replace the Simplex, called as spiral optimization method, is presented to solve Integer linear programming. The reliability of spiral optimization method is highly determined by two parameters: the radius of the exploration and the spiral rotation value. The present method is combined with the branch and bound technique as a hybrid method to solve a cutting stock problem. For a small scale problem, the hybrid method is capable to solve the problem. However, for the large one the method is not efficient. For this reason, the branch and bound technique is then replaced by round off technique in order to obtain integer values. |
|---|