EUVIMEDEUVIMED entdecken
Crossref

Automating the Packing Heuristic Design Process with Genetic Programming

Edmund K Burke, Matthew R Hyde, Graham Kendall, John Woodward

Evolutionary Computation · 2012-03 · 20 (1) · 63-89

DOI: 10.1162/evco_a_00044 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Evolutionary Computation, 2012-03. Verfasst von Edmund K Burke und 3 weiteren Autor:innen. Beteiligte Einrichtung: University of Nottingham, School of Computer Science, Jubilee Campus, Nottingham, NG8 1BB, UK. ekb@cs.nott.ac.uk. Hauptthemen laut MEDLINE: Algorithms, Computer-Aided Design, Models, Theoretical, Software. Die Arbeit wurde bisher 98-mal zitiert (Crossref) und nennt 72 Literaturangaben.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The literature shows that one-, two-, and three-dimensional bin packing and knapsack packing are difficult problems in operational research. Many techniques, including exact, heuristic, and metaheuristic approaches, have been investigated to solve these problems and it is often not clear which method to use when presented with a new instance. This paper presents an approach which is motivated by the goal of building computer systems which can design heuristic methods. The overall aim is to explore the possibilities for automating the heuristic design process. We present a genetic programming system to automatically generate a good quality heuristic for each instance. It is not necessary to change the methodology depending on the problem type (one-, two-, or three-dimensional knapsack and bin packing problems), and it therefore has a level of generality unmatched by other systems in the literature. We carry out an extensive suite of experiments and compare with the best human designed heuristics in the literature. Note that our heuristic design methodology uses the same parameters for all the experiments. The contribution of this paper is to present a more general packing methodology than those currently available, and to show that, by using this methodology, it is possible for a computer system to design heuristics which are competitive with the human designed heuristics from the literature. This represents the first packing algorithm in the literature able to claim human competitive results in such a wide variety of packing domains.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsComputer-Aided DesignModels, TheoreticalSoftwareComputer Simulation

Autor:innen und Institutionen

  • University of Nottingham, School of Computer Science, Jubilee Campus, Nottingham, NG8 1BB, UK. ekb@cs.nott.ac.uk

Zitieren

APA

Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. (2012). Automating the Packing Heuristic Design Process with Genetic Programming. Evolutionary Computation, 20(1), 63-89. https://doi.org/10.1162/evco_a_00044

Vancouver

Burke EK, Hyde MR, Kendall G, Woodward J. Automating the Packing Heuristic Design Process with Genetic Programming. Evolutionary Computation. 2012;20(1):63-89. doi:10.1162/evco_a_00044

BibTeX
@article{Burke2012,
  author = {Burke, Edmund K and Hyde, Matthew R and Kendall, Graham and Woodward, John},
  title = {Automating the Packing Heuristic Design Process with Genetic Programming},
  journal = {Evolutionary Computation},
  year = {2012},
  volume = {20},
  number = {1},
  pages = {63--89},
  doi = {10.1162/evco_a_00044}
}
Kostenlos starten →