You are here: Home → Proceedings
Document Actions

Citation and metadata

Back to the article.

Recommended citation

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, Vol. 2021. (urn:nbn:de:0009-14-54219)

Download Citation

Endnote

%0 Journal Article
%T Generating Highly Constrained Warehouse Layouts Using Answer Set Programming
%A Kaiser, Pascal
%A Thevapalan, Andre
%A Reining, Christopher
%A Kern-Isberner, Gabriele
%A ten Hompel, Michael
%J Logistics Journal : Proceedings
%D 2021
%V 2021
%N 17
%@ 2192-9084
%F kaiser2021
%X 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.
%L 620
%K Antwortmengenprogrammierung
%K Kommissionierlager
%K Layoutplanung
%K Logische Programmierung
%K answer set programming
%K layout planning
%K logic programming
%K picking
%K warehousing
%R 10.2195/lj_Proc_kaiser_en_202112_01
%U http://nbn-resolving.de/urn:nbn:de:0009-14-54219
%U http://dx.doi.org/10.2195/lj_Proc_kaiser_en_202112_01
Download

Bibtex

@Article{kaiser2021,
  author = 	"Kaiser, Pascal
		and Thevapalan, Andre
		and Reining, Christopher
		and Kern-Isberner, Gabriele
		and ten Hompel, Michael",
  title = 	"Generating Highly Constrained Warehouse Layouts Using Answer Set Programming",
  journal = 	"Logistics Journal : Proceedings",
  year = 	"2021",
  volume = 	"2021",
  number = 	"17",
  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.",
  issn = 	"2192-9084",
  doi = 	"10.2195/lj_Proc_kaiser_en_202112_01",
  url = 	"http://nbn-resolving.de/urn:nbn:de:0009-14-54219"
}
Download

RIS

TY  - JOUR
AU  - Kaiser, Pascal
AU  - Thevapalan, Andre
AU  - Reining, Christopher
AU  - Kern-Isberner, Gabriele
AU  - ten Hompel, Michael
PY  - 2021
DA  - 2021//
TI  - Generating Highly Constrained Warehouse Layouts Using Answer Set Programming
JO  - Logistics Journal : Proceedings
VL  - 2021
IS  - 17
KW  - Antwortmengenprogrammierung
KW  - Kommissionierlager
KW  - Layoutplanung
KW  - Logische Programmierung
KW  - answer set programming
KW  - layout planning
KW  - logic programming
KW  - picking
KW  - warehousing
AB  - 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.
SN  - 2192-9084
UR  - http://nbn-resolving.de/urn:nbn:de:0009-14-54219
DO  - 10.2195/lj_Proc_kaiser_en_202112_01
ID  - kaiser2021
ER  -
Download

Wordbib

<?xml version="1.0" encoding="UTF-8"?>
<b:Sources SelectedStyle="" xmlns:b="http://schemas.openxmlformats.org/officeDocument/2006/bibliography"  xmlns="http://schemas.openxmlformats.org/officeDocument/2006/bibliography" >
<b:Source>
<b:Tag>kaiser2021</b:Tag>
<b:SourceType>ArticleInAPeriodical</b:SourceType>
<b:Year>2021</b:Year>
<b:PeriodicalTitle>Logistics Journal : Proceedings</b:PeriodicalTitle>
<b:Volume>2021</b:Volume>
<b:Issue>17</b:Issue>
<b:Url>http://nbn-resolving.de/urn:nbn:de:0009-14-54219</b:Url>
<b:Url>http://dx.doi.org/10.2195/lj_Proc_kaiser_en_202112_01</b:Url>
<b:Author>
<b:Author><b:NameList>
<b:Person><b:Last>Kaiser</b:Last><b:First>Pascal</b:First></b:Person>
<b:Person><b:Last>Thevapalan</b:Last><b:First>Andre</b:First></b:Person>
<b:Person><b:Last>Reining</b:Last><b:First>Christopher</b:First></b:Person>
<b:Person><b:Last>Kern-Isberner</b:Last><b:First>Gabriele</b:First></b:Person>
<b:Person><b:Last>ten Hompel</b:Last><b:First>Michael</b:First></b:Person>
</b:NameList></b:Author>
</b:Author>
<b:Title>Generating Highly Constrained Warehouse Layouts Using Answer Set Programming</b:Title>
<b:Comments>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.</b:Comments>
</b:Source>
</b:Sources>
Download

ISI

PT Journal
AU Kaiser, P
   Thevapalan, A
   Reining, C
   Kern-Isberner, G
   ten Hompel, M
TI Generating Highly Constrained Warehouse Layouts Using Answer Set Programming
SO Logistics Journal : Proceedings
PY 2021
VL 2021
IS 17
DI 10.2195/lj_Proc_kaiser_en_202112_01
DE Antwortmengenprogrammierung; Kommissionierlager; Layoutplanung; Logische Programmierung; answer set programming; layout planning; logic programming; picking; warehousing
AB 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.
ER
Download

Mods

<mods>
  <titleInfo>
    <title>Generating Highly Constrained Warehouse Layouts Using Answer Set Programming</title>
  </titleInfo>
  <name type="personal">
    <namePart type="family">Kaiser</namePart>
    <namePart type="given">Pascal</namePart>
  </name>
  <name type="personal">
    <namePart type="family">Thevapalan</namePart>
    <namePart type="given">Andre</namePart>
  </name>
  <name type="personal">
    <namePart type="family">Reining</namePart>
    <namePart type="given">Christopher</namePart>
  </name>
  <name type="personal">
    <namePart type="family">Kern-Isberner</namePart>
    <namePart type="given">Gabriele</namePart>
  </name>
  <name type="personal">
    <namePart type="family">ten Hompel</namePart>
    <namePart type="given">Michael</namePart>
  </name>
  <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.</abstract>
  <subject>
    <topic>Antwortmengenprogrammierung</topic>
    <topic>Kommissionierlager</topic>
    <topic>Layoutplanung</topic>
    <topic>Logische Programmierung</topic>
    <topic>answer set programming</topic>
    <topic>layout planning</topic>
    <topic>logic programming</topic>
    <topic>picking</topic>
    <topic>warehousing</topic>
  </subject>
  <classification authority="ddc">620</classification>
  <relatedItem type="host">
    <genre authority="marcgt">periodical</genre>
    <genre>academic journal</genre>
    <titleInfo>
      <title>Logistics Journal : Proceedings</title>
    </titleInfo>
    <part>
      <detail type="volume">
        <number>2021</number>
      </detail>
      <detail type="issue">
        <number>17</number>
      </detail>
      <date>2021</date>
    </part>
  </relatedItem>
  <identifier type="issn">2192-9084</identifier>
  <identifier type="urn">urn:nbn:de:0009-14-54219</identifier>
  <identifier type="doi">10.2195/lj_Proc_kaiser_en_202112_01</identifier>
  <identifier type="uri">http://nbn-resolving.de/urn:nbn:de:0009-14-54219</identifier>
  <identifier type="citekey">kaiser2021</identifier>
</mods>
Download

Full Metadata

Bibliographic Citation Logistics Journal : referierte Veröffentlichungen, Vol. 2021, Iss. 17
Title

Generating Highly Constrained Warehouse Layouts Using Answer Set Programming (eng)
Author Pascal Kaiser, Andre Thevapalan, Christopher Reining, Gabriele Kern-Isberner, Michael ten Hompel
Language eng
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. Die Erzeugung gültiger Lösungen für stark eingeschränkte Lagerlayouts ist eine Herausforderung für Layoutplaner. Diese Experten generieren zulässige Layouts bisher analytisch basierend auf ihrer Erfahrung und ihrem Wissen. Der vorliegende Artikel stellt einen KI-basierten Ansatz vor, um zulässige Layouts automatisch mithilfe der Antwortmengenprogrammierung zu erzeugen. Das vorgestellte Framework ist in der Lage, alle zulässigen Lösungen zu generieren, um eine gewisse Anzahl an Regalen innerhalb des Layouts zu positionieren. Dadurch werden die Layoutplaner bei der Lösung stark eingeschränkter Probleme unterstützt.
Subject Antwortmengenprogrammierung, Kommissionierlager, Layoutplanung, Logische Programmierung, answer set programming, layout planning, logic programming, picking, warehousing
DDC 620
Rights fDPPL
URN: urn:nbn:de:0009-14-54219
DOI https://doi.org/10.2195/lj_Proc_kaiser_en_202112_01