Homogeneous grouping of non-prime steel products for online auctions: a case study
Open Access
- 5 April 2022
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 315 (1) , 591-621
Abstract
Not all products meet customers’ quality expectations after the steelmaking process. Some of them, labelled as ‘non-prime’ products, are sold in a periodic online auction. These products need to be grouped into the smallest feasible number of bundles as homogeneous as possible, as this increases the attractiveness of the bundles and hence their selling prices. This results in a highly complex optimisation problem, also conditioned by other requirements, with large economic implications. It may be interpreted as a variant of the well-known bin packing problem. In this article, we formalise it mathematically by studying the real problem faced by a multinational in the steel industry. We also propose a structured, three-stage solution procedure: (i) initial division of the products according to their characteristics; (ii) cluster analysis; and (iii) allocation of products to bundles via optimisation methods. In the last stage, we implement three heuristic algorithms: FIFO, greedy, and distance-based. Building on previous works, we develop 80 test instances, which we use to compare the heuristics. We observe that the greedy algorithm generally outperforms its competitors; however, the distance-based one proves to be more appropriate for large sets of products. Last, we apply the proposed solution procedure to real-world datasets and discuss the benefits obtained by the organisation.Keywords
Funding Information
- Universidad de Oviedo
This publication has 82 references indexed in Scilit:
- Linear programming formulation of the vertex colouring problemInternational Journal of Mathematics in Operational Research, 2010
- The energy benefit of stainless steel recyclingEnergy Policy, 2008
- Fair versus Unrestricted Bin PackingAlgorithmica, 2002
- Bounded Space On-Line Bin Packing: Best Is Better than FirstAlgorithmica, 2001
- A new heuristic algorithm for the one-dimensional bin-packing problemProduction Planning & Control, 1999
- Chameleon: hierarchical clustering using dynamic modelingComputer, 1999
- On-line packing and covering problems1998
- A new proof for the first-fit decreasing bin-packing algorithmJournal of Algorithms, 1985
- New Algorithms for Bin PackingJournal of the ACM, 1980
- Fast algorithms for bin packingJournal of Computer and System Sciences, 1974