Generating Highly Constrained Warehouse Layouts Using Answer Set Programming

Authors

  • Pascal Kaiser Chair of Materials Handling and Warehousing, Faculty of Mechanical Engineering, TU Dortmund University
  • Andre Thevapalan Chair of Logic in Computer Science, Information Engineering Department of Computer Science, TU Dortmund University
  • Christopher Reining Chair of Materials Handling and Warehousing, Faculty of Mechanical Engineering, TU Dortmund University
  • Gabriele Kern-Isberner Chair of Logic in Computer Science, Information Engineering Department of Computer Science, TU Dortmund University
  • Michael ten Hompel Chair of Materials Handling and Warehousing, Faculty of Mechanical Engineering, TU Dortmund University

DOI:

https://doi.org/10.2195/lj_Proc_kaiser_en_202112_01

Keywords:

Antwortmengenprogrammierung, Kommissionierlager, Layoutplanung, Logische Programmierung, answer set programming, layout planning, logic programming, picking, warehousing

Abstract

Generating highly constrained warehouse layouts is a challenging task for layout planners. Those experts create feasible layouts analytically based on their knowledge and experience. The presented paper proposes an AI-based approach to generate feasible warehouse layouts automatically by using answer set programming. The developed implementation is able to generate all feasible combinations for positioning racks inside a given layout while satisfying all the applicable constraints. This sup-ports layout planners by generating solutions for highly constrained problems.

Downloads

Published

2021-12-13

How to Cite

Kaiser, P., Thevapalan, A., Reining, C., Kern-Isberner, G., & ten Hompel, M. (2021). Generating Highly Constrained Warehouse Layouts Using Answer Set Programming. Logistics Journal: Proceedings, (17). https://doi.org/10.2195/lj_Proc_kaiser_en_202112_01