Genetic Programming with Tabu List for Dynamic Flexible Job Shop Scheduling
Created by W.Langdon from
gp-bibliography.bib Revision:1.8721
- @Article{Zhang:2026:EC,
-
author = "Fangfang Zhang and Mazhar Ansari Ardeh and Yi Mei and
Mengjie Zhang",
-
title = "Genetic Programming with Tabu List for Dynamic
Flexible Job Shop Scheduling",
-
journal = "Evolutionary Computation",
-
note = "Early Access",
-
keywords = "genetic algorithms, genetic programming",
-
ISSN = "1063-6560",
-
DOI = "
10.1162/evco.a.26",
-
abstract = "... proposes an effective GP algorithm with tabu lists
to capture the information of explored areas and guide
GP to explore more unexplored areas to improve GP
exploration ability for enhancing GP’s effectiveness.
First, we use phenotypic characterisation to represent
the behaviour of tree-based GP individuals for DFJSS as
vectors. Then, we build tabu lists that contain
phenotypic characterisations of explored individuals at
the current generation and across generations,
respectively. Finally, newly generated offspring are
compared with the individuals phenotypic
characterisations in the built tabu lists. If an
individual is unseen in the tabu lists, it will be kept
to form the new population at the next generation.
Otherwise, it will be discarded. We have examined the
proposed GP algorithm in nine different scenarios. ...
outperforms the compared algorithms in the majority of
scenarios. The proposed algorithm can maintain a
diverse and well-distributed population ... Further
analyses show that the proposed algorithm does cover a
large search area to find effective scheduling
heuristics by focusing on unseen individuals.",
- }
Genetic Programming entries for
Fangfang Zhang
Mazhar Ansari Ardeh
Yi Mei
Mengjie Zhang
Citations