Membrane algorithm with Brownian subalgorithm and genetic subalgorithm

DOI10.1142/S012905410700539XMaRDI QIDQ3401484zbMATH OpenFDO

Authors Taishin Yasunobu Nishida

Publication date 29 January 2010

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

simulated annealinglocal searchmembrane algorithmtraveling salesman problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Approximation algorithms (68W25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Membrane Computing
• An adaptive membrane algorithm for solving combinatorial optimization problems
• A Membrane Algorithm for the Min Storage Problem
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Optimization by simulated annealing

Cites work

• Computing with membranes

Cited in

(7)

• Evolutionary algorithm based on dynamical structure of membrane systems in uncertain environments
• Evolutionary P systems: the notion and an example
• RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
• An adaptive membrane algorithm for solving combinatorial optimization problems
• A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows
• Membrane Computing
• A Membrane Algorithm for the Min Storage Problem

This page was built for publication: Membrane algorithm with Brownian subalgorithm and genetic subalgorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401484)