Answers are grounded in this paper and cite their sources.
In this paper we present new algorithms for processing a set of orders in automated warehousing systems. The proposed algorithms will process the orders by grouping some of them according to criteria developed by the authors. The travelling salesman algorithm is then utilized to determine the optimal distance travelled within the warehouse for every group of orders. Comparisons of the performance of the proposed algorithms are presented
No takes yet. Share an insight, caveat, or question.
Elsayed et al. (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: