An approximate algorithm for optimal logistics of heavy and variable size items

Abstract

The objective of this article is to show the improvement reached by a ceramic logistics operator using an approximate algorithm for cargo of logistics of many different products with different weights and volumes. This algorithm, which has been used successfully for efficient assignment in logistics industry, where many different products in small but heavy items have to be distributed, can improve road transport efficiency for clients’ orders in the minimum time and with the least possible costs. The paper describes how it could increase efficiency in logistics in a ceramic industry (from the initiation of activities and over several days to the end of the job cycle) and similar heavy and small items production when time and costs play the role in function criterion. The algorithm is based on several priority rules. Real life application of the algorithm developed here has been running on a time horizon of more than one week. Though the results of the first steps (initial solution) of algorithm are not as good as the results of already known algorithms for transportation assignments, the algorithm is improving the value of criterion function rapidly, during further iterations dealing with the sequences of daily assignments, which is a major improvement in applications for such types of algorithms, known up until now. The algorithm was a well accepted development and seen as very beneficial to the ceramics industry.