• Sonuç bulunamadı

A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm

N/A
N/A
Protected

Academic year: 2021

Share "A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm"

Copied!
7
0
0

Yükleniyor.... (view fulltext now)

Tam metin

Referanslar

Benzer Belgeler

In this paper, a preference-based, interactive memetic random-key genetic algorithm (PIMRKGA) is developed and used to find (weakly) Pareto optimal solutions to manufacturing

• Analog ve dijital sinyaller genellikle elektrik sinyaller yoluyla, bilgi aktarmak için kullanılır.. – Bu teknolojilerin her ikisinde de ses veya video ile alınan bilgiler

Because municipalities are separately evolving, the worst case time complexity of Algorithm 2 in each iteration is ex- actly equal to the memetic SOM when assigned cities to

Fakat hem otofaji hem de hücre ölüm araştırmaları topluluklarında yer alan bazı seçkin üyelerin, otofajinin doğrudan bir öldürücü etki gösterebileceği fikrine karşı

The previous results showed us the effect of 2-Opt local search algorithm along with the cooperative coevolutionary algorithm to TSP with increased population size,

As yet, genetic algorithms have not found a better solution to the traveling salesman problem than the one already known, but many of the known best solutions

In combinatorial optimization, the requirement for local search techniques is significant in order to get better results, considering there is no guarantee for optimal solution

The histopathological analysis of the pseudo- eyes revealed structures and the localizations of the cornea, retina, sclera, iris, zonula adherens, lacrimal gland and ducts