About Us

Memetic Computing's goals are:

  1. To be an outlet for high quality research in hybrid metaheuristics (including evolutionary hybrids) for optimization, control and design in continuous and discrete optimization domains. We seek to dissolve the barriers separating metaheuristics, exact and approximation algorithms research and to bring forth a renewed impetus towards the investigation and understanding of promising new hybrid algorithmic technologies.
  2. To go beyond current search methodologies towards innovative research on the emergence of cultural artifacts such as game, trade and negotiation strategies and, more generally, rules of behavior as they apply to, for example, robotic, multi-agent and artificial life systems.
  3. Ultimately, Memetic Computing aspires to serve as a focal publication where the latest results in Natural Computation, Artificial Intelligence, Machine Learning, Operational Research and Natural Sciences (e.g. cognitive, animal and insect’s behavior, etc.) are fuzzed together in novel ways in order to transcend the intrinsic limitations of a single discipline.

Potential authors are invited to submit original research articles for publication consideration. Reviews and short communications may also be considered. The first issue is scheduled for January 2009 while accepted papers are expected to appear online via SpringLINK around September 2008.

Aims and Scope

Potential authors are invited to submit original research articles for publication consideration at any time.  Reviews and short research communications are also welcomed. Further information on submission, format, lengths and style files is available through the journal website.  All manuscripts should be submitted electronically using the Online Submission system.

We aim to achieve a typical turnaround time of not more than 3 months for the review process.

Some (but not all) of the topics covered by Memetic Computing are:

  • Algorithmic Intelligence in Optimisation, Control and Design
  • Hybrid (Parallel) Metaheuristics such as Tabu Search, Path Relinking, Scatter Search, GRASP Methods, Iterated Local Search, Simulated Annealing, Variable Neighborhood Search, Evolutionary Algorithms, Learning Classifier Systems, Memetic Algorithms, Cultural Algorithms, etc.
  • Approximate and exact algorithms for Combinatorial and Continuous Optimisation
  • Integer and Linear Programming
  • Ant Colony Computing
  • Self-Organisation, Self-Assembly, Self-Generation, Self-Healing of Artificial Systems
  • Swarm Intelligence
  • Neural Networks
  • Evolutionary Dynamics
  • Memetic Theory
  • Artificial Cultures in Multi-Agent Systems, Webbots and Robots
  • Landscape Analysis
  • Methodological aspects of Experimental Computing
  • Search based Software Engineering
  • Genetic Programming
  • Constraint Optimisation
  • Representation and Encoding Studies
  • Real-world Applications
  • Machine Learning and Data Mining
  • Multiobjective Optimisation
  • Artificial Immune Systems