Everything About ___
Live briefing

Everything about Linear genetic programming

Linear genetic programming (LGP) is a particular method of genetic programming wherein computer programs in a population are represented as a sequence of register-based instructions from an imperative programming language or machine language. The adjective "linear" stems from the fact that each LGP program is a sequence of instructions and the sequence of instructions is normally executed sequentially. Like in other programs, the data flow in LGP can be modeled as a graph that will visualize the potential multiple usage of register contents and the existence of structurally noneffective code (introns) which are two main differences of this genetic representation from the more common tree-based genetic programming (TGP) variant. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Linear genetic programmingA 5-minute orientation
  2. Skim a recent paper: Multitask Linear Genetic Programming With Shared Individuals and Its Application to Dynamic Job Shop SchedulingInfluential work since 2022
  3. Pick up a classic book: Linear genetic programmingThe most-reprinted book on the subject
  4. Read the landmark paper: Linear bilevel programming solution by genetic algorithmCited 153 times
  5. Go sideways: Data dependencyA closely related topic
  6. Go sideways: Transport triggered architectureA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Examples of LGP programs

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics