Abstract
In an Automated Storage and Retrieval System (AS/RS), a location assignment of products is important to improve the picking efficiency. In this paper, the optimization of shelf location assignment with a quantum annealing is investigated. Product pairs are considered in order of picking frequency and are assigned to empty shelves in order of distance from an outlet. Then swapping the position of product in the pair is considered as the decision variable. This reduces the number of required qubits and guarantees the feasibility of solution. The efficiency of quantum algorithm is evaluated by comparing with mixed integer programming (MIP).
Published Version (
Free)
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.
