Simplified Shelf Problem as a Binary Linear Integer Programming Problem

dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.advisorViitanen, Tuomas
dc.contributor.authorKalkas, Sami
dc.contributor.schoolPerustieteiden korkeakoulufi
dc.contributor.supervisorPollari-Malmi, Kerttu
dc.date.accessioned2022-06-19T17:05:43Z
dc.date.available2022-06-19T17:05:43Z
dc.date.issued2022-06-13
dc.description.abstractA planogram is a visual representation of a merchandising plan for the display of the available products in a store. Having the ability to create the most optimal planogram, based on some predefined criterion, can cut the costs generated by the manual labour related to the unpacking and placement of goods. One possible method that can be utilised for placing products into a fixture is a heuristic approach called simulated annealing. This technique does not necessarily yield true optimal results without verifying every combination, requiring vast computational efforts. Thus, some alternative solving method is required in order to provide a better planogram layout in a shorter time period. One such method utilised in this work, is called linear programming. Linear programming is a mathematical modeling technique that is able to generate an optimal solution for a linear objective function subjected to various constraints, given that all are represented with linear relationships. Usually, this approach requires polynomial computational complexity, meaning that it could generate a global optimum faster than a heuristic approach. With the use of linear programming the presented problems could be formulated in such a way, that either an optimal result or one greater compared to the heuristic approach could be obtained in considerably less time. Many various models were tested, and it was deduced that presenting the problems with solely binary variables (utilising binary linear programming) was computationally too exhaustive and was not a feasible way of solving the most complex of problems. Since planograms contain such a large number of possible configurations for product placements, an iterative algorithm was designed, relaxing the initial restrictions, which could yield up to a $30\%$ result increase up to $70$ times more efficiently compared to the simulated annealing approach. Though the achieved results were not necessarily optimal, a considerable improvement was achieved, which could provide a competitive edge for any supply chain company taking it into use.en
dc.format.extent76
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/115201
dc.identifier.urnURN:NBN:fi:aalto-202206194042
dc.language.isoenen
dc.programmeMaster’s Programme in Computer, Communication and Information Sciencesfi
dc.programme.majorTietotekniikka (Macadamia)fi
dc.programme.mcodeSCI3042fi
dc.subject.keywordsimplexen
dc.subject.keywordoptimisationen
dc.subject.keywordplanogramen
dc.subject.keywordlinear programmingen
dc.titleSimplified Shelf Problem as a Binary Linear Integer Programming Problemen
dc.typeG2 Pro gradu, diplomityöfi
dc.type.ontasotMaster's thesisen
dc.type.ontasotDiplomityöfi
local.aalto.electroniconlyyes
local.aalto.openaccessyes
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
master_Kalkas_Sami_2022.pdf
Size:
838.63 KB
Format:
Adobe Portable Document Format