Biogeography migration algorithm for traveling salesman problem (Q4915778): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1108/17563781111160002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046415119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the on-line quota traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic scheduling for real‐time distributed systems using ant colony optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Particle swarm optimization-based algorithms for TSP and generalized TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem / rank
 
Normal rank

Latest revision as of 09:15, 6 July 2024

scientific article; zbMATH DE number 6153337
Language Label Description Also known as
English
Biogeography migration algorithm for traveling salesman problem
scientific article; zbMATH DE number 6153337

    Statements

    Biogeography migration algorithm for traveling salesman problem (English)
    0 references
    0 references
    0 references
    12 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    biogeography migration algorithm
    0 references
    biogeography-based optimization
    0 references
    optimization techniques
    0 references
    traveling salesman problem
    0 references
    0 references