MEMBRANE ALGORITHM WITH BROWNIAN SUBALGORITHM AND GENETIC SUBALGORITHM

DOI10.1142/S012905410700539XzbMath1183.68236MaRDI QIDQ3401484

Taishin Y. Nishida

Publication date: 29 January 2010

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

zbMATH Keywords

simulated annealinglocal searchtraveling salesman problemmembrane algorithm

Mathematics Subject Classification ID

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

Related Items (4)

A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows ⋮ RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS ⋮ Evolutionary algorithm based on dynamical structure of membrane systems in uncertain environments ⋮ Evolutionary P systems: the notion and an example

Cites Work

• Computing with membranes

This page was built for publication: MEMBRANE ALGORITHM WITH BROWNIAN SUBALGORITHM AND GENETIC SUBALGORITHM