6th European International Conference on Industrial Engineering and Operations Management


0 Paper Citations
Track: Senior Design Competition / FYP Competition

The subject of our senior design project with Xxx Logistics is e-commerce optimized packaging. Companies may generally have trouble packing goods of various types, sizes, and volumes. The amount of waste produced by the use of cardboard and the precise arrangement and dimensions of the boxes to be used in order packaging are the two most significant issues related to the packaging issue. Random packaging, the use of parcels, and the absence of a set packaging sequence or rule result in wasteful cardboard usage, transportation space consumption, and financial loss because each parcel utilized has a cost. The boundaries and restrictions of the challenge were established after an analysis of potential packaging problems faced by the company. Before modeling, there has been literature research. A heuristic is required since the real data set is so large. The optimized box packing algorithm is developed and its output data is used to decide the packaging orders into boxes. The algorithm uses greedy search, local search and iterative improvement to find the most near optimal solution of the packaging orders into boxes. The main purpose of the model is to minimize the total volume of the orders which will be placed in a restricted amount of different sized boxes. While the model minimizes the volume, it will provide the information about which order should be placed on which box and in which order. Also, leading to a potential saving in transportation and storage costs is another aim of this project. The techniques that are used in this project are explained in detail. To solve the problem, data was analyzed. The algorithm is coded in Java.

Published in: 6th European International Conference on Industrial Engineering and Operations Management, Lisbon, Portugal

Publisher: IEOM Society International
Date of Conference: July 18-20, 2023

ISBN: 979-8-3507-0547-8
ISSN/E-ISSN: 2169-8767