Designing new heuristics for the capacitated lot sizing problem by genetic programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8081
- @Article{HEIN:2018:COR,
-
author = "Fanny Hein and Christian Almeder and
Goncalo Figueira and Bernardo Almada-Lobo",
-
title = "Designing new heuristics for the capacitated lot
sizing problem by genetic programming",
-
journal = "Computer \& Operations Research",
-
volume = "96",
-
pages = "1--14",
-
year = "2018",
-
keywords = "genetic algorithms, genetic programming",
-
ISSN = "0305-0548",
-
DOI = "doi:10.1016/j.cor.2018.03.006",
-
URL = "http://www.sciencedirect.com/science/article/pii/S0305054818300753",
-
abstract = "This work addresses the well-known capacitated lot
sizing problem (CLSP) which is proven to be an NP-hard
optimization problem. Simple period-by-period
heuristics are popular solution approaches due to the
extremely low computational effort and their
suitability for rolling planning horizons. The aim of
this work is to apply genetic programming (GP) to
automatically generate specialized heuristics specific
to the instance class. Experiments show that we are
able to obtain better solutions when using GP evolved
lot sizing rules compared to state-of-the-art
constructive heuristics",
- }
Genetic Programming entries for
Fanny Hein
Christian Almeder
Luis Goncalo Rodrigues Reis Figueira
Bernardo Almada-Lobo
Citations