University of Twente Student Theses
Solution quality analysis of a genetic algorithm on the carton set optimization problem using mixed-integer programming
Wullink, Milo (2025) Solution quality analysis of a genetic algorithm on the carton set optimization problem using mixed-integer programming.
|
PDF
9MB |
| Abstract: | The carton set optimization problem is about finding a variety of carton sizes that minimize the total shipping costs within a warehouse. In 2020, Singh and Ardjmand solved this problem using a genetic algorithm. A genetic algorithm is however not guaranteed to provide an optimal solution. In this paper, the solution quality of the genetic algorithm suggested by Singh and Ardjmand is analyzed. We compare the best-found solutions of the genetic algorithm using an exact mixed-integer programming approach to find the approximation error of the genetic algorithm. The approximation error of the genetic algorithm increases as the number of orders increases, but for order sizes where the mixed-integer program is unable to solve the problem, the genetic algorithm is a great alternative. |
| Item Type: | Essay (Bachelor) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 31 mathematics |
| Programme: | Applied Mathematics BSc (56965) |
| Link to this item: | https://purl.utwente.nl/essays/105109 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page