برنامه ریزی پویا تقریبی برای مشکلات حمل و نقل جانبی در سیستم های موجود در چند مکان

Finally, we conduct an extensive numerical study to gauge the performance of our transshipment policy. For small size instances, we compare our policy to the optimal one. For larger scale instances, we consider other practically oriented heuristics. Our numerical experiments show that our proposed algorithm performs very well compared to state-of-the-art methods in the literature.