A new memetic algorithm for the asymmetric traveling salesman problem (Q1771206): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/b:heur.0000045321.59202.52 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060358758 / rank | |||
Normal rank | |||
Latest revision as of 09:53, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new memetic algorithm for the asymmetric traveling salesman problem |
scientific article |
Statements
A new memetic algorithm for the asymmetric traveling salesman problem (English)
0 references
7 April 2005
0 references
asymmetric traveling salesman problem
0 references
local search
0 references
memetic algorithms
0 references
metaheuristics
0 references
