A genetic programming-based hyper-heuristic approach for storage location assignment problem

Jing Xie, Yi Mei, Andreas T. Ernst, Xiaodong Li, Andy Song

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

Abstract

This study proposes a method for solving real-world warehouse Storage Location Assignment Problem (SLAP) under grouping constraints by Genetic Programming (GP). Integer Linear Programming (ILP) formulation is used to define the problem. By the proposed GP method, a subset of the items is repeatedly selected and placed into the available current best location of the shelves in the warehouse, until all the items have been assigned with locations. A heuristic matching function is evolved by GP to guide the selection of the subsets of items. Our comparison between the proposed GP approach and the traditional ILP approach shows that GP can obtain near-optimal solutions on the training data within a short period of time. Moreover, the evolved heuristics can achieve good optimization results on unseen scenarios, comparable to that on the scenario used for training. This shows that the evolved heuristics have good reusability and can be directly applied for slightly different scenarios without any new search process.

Original languageEnglish
Title of host publicationProceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages3000-3007
Number of pages8
ISBN (Electronic)9781479914883
DOIs
Publication statusPublished - 16 Sep 2014
Externally publishedYes
EventIEEE Congress on Evolutionary Computation 2014 - Beijing, China
Duration: 6 Jul 201411 Jul 2014

Conference

ConferenceIEEE Congress on Evolutionary Computation 2014
Abbreviated titleIEEE CEC 2014
CountryChina
CityBeijing
Period6/07/1411/07/14

Cite this

Xie, J., Mei, Y., Ernst, A. T., Li, X., & Song, A. (2014). A genetic programming-based hyper-heuristic approach for storage location assignment problem. In Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014 (pp. 3000-3007). [6900604] IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/CEC.2014.6900604
Xie, Jing ; Mei, Yi ; Ernst, Andreas T. ; Li, Xiaodong ; Song, Andy. / A genetic programming-based hyper-heuristic approach for storage location assignment problem. Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014. IEEE, Institute of Electrical and Electronics Engineers, 2014. pp. 3000-3007
@inproceedings{6504ca908cc34672a6cb6b9212cd27f0,
title = "A genetic programming-based hyper-heuristic approach for storage location assignment problem",
abstract = "This study proposes a method for solving real-world warehouse Storage Location Assignment Problem (SLAP) under grouping constraints by Genetic Programming (GP). Integer Linear Programming (ILP) formulation is used to define the problem. By the proposed GP method, a subset of the items is repeatedly selected and placed into the available current best location of the shelves in the warehouse, until all the items have been assigned with locations. A heuristic matching function is evolved by GP to guide the selection of the subsets of items. Our comparison between the proposed GP approach and the traditional ILP approach shows that GP can obtain near-optimal solutions on the training data within a short period of time. Moreover, the evolved heuristics can achieve good optimization results on unseen scenarios, comparable to that on the scenario used for training. This shows that the evolved heuristics have good reusability and can be directly applied for slightly different scenarios without any new search process.",
author = "Jing Xie and Yi Mei and Ernst, {Andreas T.} and Xiaodong Li and Andy Song",
year = "2014",
month = "9",
day = "16",
doi = "10.1109/CEC.2014.6900604",
language = "English",
pages = "3000--3007",
booktitle = "Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014",
publisher = "IEEE, Institute of Electrical and Electronics Engineers",
address = "United States",

}

Xie, J, Mei, Y, Ernst, AT, Li, X & Song, A 2014, A genetic programming-based hyper-heuristic approach for storage location assignment problem. in Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014., 6900604, IEEE, Institute of Electrical and Electronics Engineers, pp. 3000-3007, IEEE Congress on Evolutionary Computation 2014, Beijing, China, 6/07/14. https://doi.org/10.1109/CEC.2014.6900604

A genetic programming-based hyper-heuristic approach for storage location assignment problem. / Xie, Jing; Mei, Yi; Ernst, Andreas T.; Li, Xiaodong; Song, Andy.

Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014. IEEE, Institute of Electrical and Electronics Engineers, 2014. p. 3000-3007 6900604.

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

TY - GEN

T1 - A genetic programming-based hyper-heuristic approach for storage location assignment problem

AU - Xie, Jing

AU - Mei, Yi

AU - Ernst, Andreas T.

AU - Li, Xiaodong

AU - Song, Andy

PY - 2014/9/16

Y1 - 2014/9/16

N2 - This study proposes a method for solving real-world warehouse Storage Location Assignment Problem (SLAP) under grouping constraints by Genetic Programming (GP). Integer Linear Programming (ILP) formulation is used to define the problem. By the proposed GP method, a subset of the items is repeatedly selected and placed into the available current best location of the shelves in the warehouse, until all the items have been assigned with locations. A heuristic matching function is evolved by GP to guide the selection of the subsets of items. Our comparison between the proposed GP approach and the traditional ILP approach shows that GP can obtain near-optimal solutions on the training data within a short period of time. Moreover, the evolved heuristics can achieve good optimization results on unseen scenarios, comparable to that on the scenario used for training. This shows that the evolved heuristics have good reusability and can be directly applied for slightly different scenarios without any new search process.

AB - This study proposes a method for solving real-world warehouse Storage Location Assignment Problem (SLAP) under grouping constraints by Genetic Programming (GP). Integer Linear Programming (ILP) formulation is used to define the problem. By the proposed GP method, a subset of the items is repeatedly selected and placed into the available current best location of the shelves in the warehouse, until all the items have been assigned with locations. A heuristic matching function is evolved by GP to guide the selection of the subsets of items. Our comparison between the proposed GP approach and the traditional ILP approach shows that GP can obtain near-optimal solutions on the training data within a short period of time. Moreover, the evolved heuristics can achieve good optimization results on unseen scenarios, comparable to that on the scenario used for training. This shows that the evolved heuristics have good reusability and can be directly applied for slightly different scenarios without any new search process.

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

U2 - 10.1109/CEC.2014.6900604

DO - 10.1109/CEC.2014.6900604

M3 - Conference Paper

SP - 3000

EP - 3007

BT - Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014

PB - IEEE, Institute of Electrical and Electronics Engineers

ER -

Xie J, Mei Y, Ernst AT, Li X, Song A. A genetic programming-based hyper-heuristic approach for storage location assignment problem. In Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014. IEEE, Institute of Electrical and Electronics Engineers. 2014. p. 3000-3007. 6900604 https://doi.org/10.1109/CEC.2014.6900604