A new hybrid heuristic approach for solving large traveling salesman problem (Q1886765): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4035642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Neural'' computation of decisions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Parallel Genetic Algorithms / rank
 
Normal rank

Revision as of 15:27, 7 June 2024

scientific article
Language Label Description Also known as
English
A new hybrid heuristic approach for solving large traveling salesman problem
scientific article

    Statements

    A new hybrid heuristic approach for solving large traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2004
    0 references
    Ant colony system
    0 references
    Traveling salesman problem
    0 references
    Metaheuristic approach
    0 references

    Identifiers