Abstract
This paper addresses the Blocks Relocation Problem with Operating Costs, whose main objective is to retrieve a set of blocks from a stacking facility while minimizing the operating cost. An integer programming model and a deterministic algorithm are developed to solve the problem from an exact standpoint. Both approaches are able to solve the problem optimally only for small size problem scenarios, requiring large amount of computational time and memory in medium and large size problem instances. On the other hand, a heuristic algorithm based on A∗ is also proposed with the goal of reducing considerably the computational resources, allowing to solve large problem instances. The computational results disclose this algorithm generates high-quality solutions in reasonable computational times.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.