Conveyor operations in distribution centers: modeling and optimization

• Published in: Optimization letters Vol. 17; no. 4; pp. 1049 - 1068
• Main Authors: Karami, Farzaneh, Fathi, Mahdi, Pardalos, Panos M.
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2023
• Subjects: Computational Intelligence; Mathematics; Mathematics and Statistics; Numerical and Computational Physics; Operations Research/Decision Theory; Optimization; Original Paper; Simulation; Conveyor operations; Quickest flows; Dynamic flows; Quickest path; Logistics; Matheuristics
• ISSN: 1862-4472; 1862-4480
• DOI: 10.1007/s11590-022-01912-7

The optimal operation of a conveyor used in distribution centers is critical to delivery service quality. Optimizing conveyor operations entails routing a given number of items from loading to unloading locations in the shortest possible time. Developing an efficient model for conveyor operations is necessary to aid in routing processes. This paper proposes two models while taking conveyor operational constraints into account. The first model determines the best single path-based routing for each distinct loading-unloading while avoiding operation interruptions. The second model with the same goal focuses on utilizing the conveyor’s full capacity by routing on multiple paths, thus requires the complete set of available paths for each loading-unloading. This model is solved using a heuristic algorithm given the requirement for high-quality solutions within a short computation time. The computational experience was conducted on benchmark instances to assess our original models’ quality and applicability. Results confirm both models’ effectiveness and resolution and provide evidence for how controlling the number of used paths improves routing. Therefore, an operational manager can weigh the gains against the model and operation complexity expense.