出版社:Publishing House of the University of Economics in Katowice
摘要:The current tough competition on the market is forcing companies to improve their processes in order to make them more efficient. Improved transportrelated logistics supports clients by improving satisfaction in terms of timing and cost. In the case of ceramic companies,this study is oriented toward the processes connected to the grouping of merchandises and customers orders. The lack of appropriate tools to support optimal logistics of such items at very volatile demand and supply has led to development of different techniques to facilitate both calculation and the implementation of these tasks. Our plan is to improve An approximate algorithm for optimal logistics of heavy and variable size items described by Ros-McDonnell et al. (2010). With the objective of picking up all orders from all clients on a certain date,we will run a Monte Carlo simulation aiming to find a new,more well-organized vehicle assignment solution,with lower costs than those calculated by mathematical model initially proposed by the cited authors,where the constraints of the loading capacity and time window for an individual vehicle could be slightly relaxed up to p%,if probability density function of this relaxation is supposed to be uniform on the interval (0,ε) and the maximal number of available trucks in a procedure is not fixed by logistic operator in advance,but could be stochastic variable.