Optimasi Masalah Pemuatan Peti Kemas Pada PT. Trias Sentosa
(1) 
(2) 
(*) Corresponding Author
Abstract
PT. Trias Sentosa is a flexible packaging film manufacturing company. Customers who buy from PT. Trias Sentosa gives the demand in form of film type, length, width, thickness, and number of rolls for each type and dimension of the film. In loading the demand into containers, there are several steps to be taken.The first step is to calculate the dimensions of each roll from the length, width, and thickness of the film the customer requested. The rolls are then arranged into pallets according to the policy of the company, as well as searching pairs of pallet to be stacked but not exceeding the height of the container using Greedy Algorithm principle. The second step is to distribute each pallet group evenly into the container. The third step is to arrange the loading order of each container by using Simulated Annealing method and calculate the weight distribution of each container.
Keywords
Container Loading Problem; Greedy Algorithm; Simulated Annealing; Weight Distribution
Full Text:
PDFReferences
Curtis, S., The Classification of Greedy Algorithms, Science of Computer Programming, 2003, pp. 125-157.
Rere, L. R., Fanany, M. I., & Arymurthy, A. M., Simulated Annealing Algorithm for Deep Learning, Procedia Computer Science, 2015, pp. 137-144.
Widjaja, A.T., Optimasi Perencanaan Pemuatan Peti Kemas Pada PT. Trias Sentosa. (TA No. 01022032/IND/2017). Unpublished undergraduate thesis, Universitas Kristen Petra, Surabaya, 2017
Refbacks
- There are currently no refbacks.