Yard storage assignment optimisation with neutral walks

Publikation: Beitrag in Buch/Bericht/TagungsbandKonferenzbeitragBegutachtung

Abstract

In this paper we investigate how to stack products on a storage yard for efficient retrieval. The objective is to minimise both the transport distance and the number of stack shuffles. Previous research on yard storage assignment indicated that the fitness landscape of the problem features a high degree of neutrality, meaning that there are many neighbouring solutions with identical objective value. We exploit this property and couple local search, tabu search and evolution strategy with neutral walks and extrema selection. A small benchmark instance can be solved to optimality with all three modified algorithm variants while the standard algorithms got stuck in local optima.

OriginalspracheEnglisch
TitelComputer Aided Systems Theory, EUROCAST 2013 - 14th International Conference, Revised Selected Papers
Herausgeber (Verlag)Springer
Seiten356-363
Seitenumfang8
AuflagePART 1
ISBN (Print)9783642538551
DOIs
PublikationsstatusVeröffentlicht - 2013
Veranstaltung14th International Conference on Computer Aided Systems Theory, Eurocast 2013 - Las Palmas de Gran Canaria, Spanien
Dauer: 10 Feb 201315 Feb 2013

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NummerPART 1
Band8111 LNCS
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Konferenz

Konferenz14th International Conference on Computer Aided Systems Theory, Eurocast 2013
Land/GebietSpanien
OrtLas Palmas de Gran Canaria
Zeitraum10.02.201315.02.2013

Fingerprint

Untersuchen Sie die Forschungsthemen von „Yard storage assignment optimisation with neutral walks“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren