Yard storage assignment optimisation with neutral walks

Monika Kofler; Andreas Beham; Erik Pitzer; Stefan Wagner; Michael Affenzeller

doi:10.1007/978-3-642-53856-8_45

Yard storage assignment optimisation with neutral walks

Monika Kofler, Andreas Beham, Erik Pitzer, Stefan Wagner, Michael Affenzeller

Research Center Hagenberg

Research output: Chapter in Book/Report/Conference proceedings › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Computer Aided Systems Theory, EUROCAST 2013 - 14th International Conference, Revised Selected Papers
Publisher	Springer
Pages	356-363
Number of pages	8
Edition	PART 1
ISBN (Print)	9783642538551
DOIs	https://doi.org/10.1007/978-3-642-53856-8_45
Publication status	Published - 2013
Event	14th International Conference on Computer Aided Systems Theory, Eurocast 2013 - Las Palmas de Gran Canaria, Spain Duration: 10 Feb 2013 → 15 Feb 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	8111 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	14th International Conference on Computer Aided Systems Theory, Eurocast 2013
Country/Territory	Spain
City	Las Palmas de Gran Canaria
Period	10.02.2013 → 15.02.2013

Keywords

fitness landscapes
local search
neutral walk
storage location assignment

Access to Document

10.1007/978-3-642-53856-8_45

Cite this

Kofler, M., Beham, A., Pitzer, E., Wagner, S., & Affenzeller, M. (2013). Yard storage assignment optimisation with neutral walks. In Computer Aided Systems Theory, EUROCAST 2013 - 14th International Conference, Revised Selected Papers (PART 1 ed., pp. 356-363). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8111 LNCS, No. PART 1). Springer. https://doi.org/10.1007/978-3-642-53856-8_45

Kofler, Monika ; Beham, Andreas ; Pitzer, Erik et al. / Yard storage assignment optimisation with neutral walks. Computer Aided Systems Theory, EUROCAST 2013 - 14th International Conference, Revised Selected Papers. PART 1. ed. Springer, 2013. pp. 356-363 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).

@inproceedings{e2259e4ea24943fa9039dd528177dcb6,

title = "Yard storage assignment optimisation with neutral walks",

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.",

keywords = "fitness landscapes, local search, neutral walk, storage location assignment",

author = "Monika Kofler and Andreas Beham and Erik Pitzer and Stefan Wagner and Michael Affenzeller",

year = "2013",

doi = "10.1007/978-3-642-53856-8_45",

language = "English",

isbn = "9783642538551",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

number = "PART 1",

pages = "356--363",

booktitle = "Computer Aided Systems Theory, EUROCAST 2013 - 14th International Conference, Revised Selected Papers",

address = "Germany",

edition = "PART 1",

}

Kofler, M, Beham, A, Pitzer, E , Wagner, S & Affenzeller, M 2013, Yard storage assignment optimisation with neutral walks. in Computer Aided Systems Theory, EUROCAST 2013 - 14th International Conference, Revised Selected Papers. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 8111 LNCS, Springer, pp. 356-363, 14th International Conference on Computer Aided Systems Theory, Eurocast 2013, Las Palmas de Gran Canaria, Spain, 10.02.2013. https://doi.org/10.1007/978-3-642-53856-8_45

Yard storage assignment optimisation with neutral walks. / Kofler, Monika; Beham, Andreas; Pitzer, Erik et al.
Computer Aided Systems Theory, EUROCAST 2013 - 14th International Conference, Revised Selected Papers. PART 1. ed. Springer, 2013. p. 356-363 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8111 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceedings › Conference contribution › peer-review

TY - GEN

T1 - Yard storage assignment optimisation with neutral walks

AU - Kofler, Monika

AU - Beham, Andreas

AU - Pitzer, Erik

AU - Wagner, Stefan

AU - Affenzeller, Michael

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - fitness landscapes

KW - local search

KW - neutral walk

KW - storage location assignment

UR - http://www.scopus.com/inward/record.url?scp=84892561097&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-53856-8_45

DO - 10.1007/978-3-642-53856-8_45

M3 - Conference contribution

SN - 9783642538551

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 356

EP - 363

BT - Computer Aided Systems Theory, EUROCAST 2013 - 14th International Conference, Revised Selected Papers

PB - Springer

T2 - 14th International Conference on Computer Aided Systems Theory, Eurocast 2013

Y2 - 10 February 2013 through 15 February 2013

ER -

Kofler M, Beham A, Pitzer E , Wagner S , Affenzeller M. Yard storage assignment optimisation with neutral walks. In Computer Aided Systems Theory, EUROCAST 2013 - 14th International Conference, Revised Selected Papers. PART 1 ed. Springer. 2013. p. 356-363. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-53856-8_45

Yard storage assignment optimisation with neutral walks

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this