Abstract
The Order Processing in Picking Workstations is a real problem derived from the industry in the context of supply chain management. It looks for an efficient way to process orders arriving to a warehouse by minimizing the number of movements of goods, stored in containers in the warehouse, from their storage location to the processing zone. In this paper, we tackle this real optimization problem by providing a new Integer Linear Programming (ILP) formulation for the problem. Due to the $$\mathcal {NP}$$ -Hardness of the problem we have also designed several heuristic procedures, to find high-quality solutions in a reasonable amount of time, which is mandatory for handling real instances. Particularly, the heuristics proposed were combined into a General Variable Neighborhood Search algorithm. Finally, we have performed an extensive experimentation indicating an increased performance of our proposals (ILP and heuristic) over previous approaches in the state of the art, using both synthetic and real datasets of instances.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
