Genetic Programming and Evolvable Machines
Last updated ISSN 1389-2576
Genetic Programming and Evolvable Machines is published by Springer Science+Business Media in computer science. It is a subscription journal. The article processing charge is $2,090.
Is your paper a fit?
The surest way to know is to compare your own abstract against what this journal has actually been publishing, rather than against its aims-and-scope page. Paste your abstract and Journal Hunt will tell you how close Genetic Programming and Evolvable Machines is — and show you journals like it.
What it publishes
Recent work in Genetic Programming and Evolvable Machines concentrates on these topics, taken from its published record rather than from its own description:
- Evolutionary Algorithms and Applications
- Metaheuristic Optimization Algorithms Research
- Reinforcement Learning in Robotics
- Advanced Multi-Objective Optimization Algorithms
- Viral Infectious Diseases and Gene Expression in Insects
- Evolution and Genetic Dynamics
- Gene Regulatory Network Analysis
- Neural Networks and Applications
- CRISPR and Genetic Engineering
- Modular Robots and Swarm Intelligence
Key facts
| Publisher | Springer Science+Business Media |
|---|---|
| ISSN | 1389-2576, 1573-7632 |
| Subject area | Computer Science |
| Access | Subscription |
| Article processing charge | $2,090 |
| Indexed in | Web of Science — Science Citation Index Expanded · Scopus |
| Articles published | 693 |
| Publishing since | 1992 |
| Journal website | www.springer.com/journal/10710 |
Facts come from OpenAlex, DOAJ and Wikidata and may lag the journal’s own pages. Check the publisher’s site before submitting. Indexing shown here is what is recorded, not a complete picture — about a third of journals have no indexing recorded anywhere we can read, so “not recorded” does not mean a journal is absent from Scopus or Web of Science.
Journals like Genetic Programming and Evolvable Machines
Other established journals in computer science, if this one is not the right home for your paper: