Yard storage assignment optimisation with neutral walks

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationComputer Aided Systems Theory, EUROCAST 2013 - 14th International Conference, Revised Selected Papers
Number of pages8
EditionPART 1
ISBN (Print)9783642538551
Publication statusPublished - 2013
Event14th International Conference on Computer Aided Systems Theory, Eurocast 2013 - Las Palmas de Gran Canaria, Spain
Duration: 10 Feb 201315 Feb 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume8111 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference14th International Conference on Computer Aided Systems Theory, Eurocast 2013
CityLas Palmas de Gran Canaria


  • fitness landscapes
  • local search
  • neutral walk
  • storage location assignment


Dive into the research topics of 'Yard storage assignment optimisation with neutral walks'. Together they form a unique fingerprint.

Cite this