A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem (Q712674): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Beam-ACO / rank
 
Normal rank
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.1016/j.ins.2012.02.055 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034531826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of convergence for ant algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony system with communication strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization theory: a survey / 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
Property / cites work
 
Property / cites work: A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4805282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel implementation of ant colony optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant algorithms: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization for the cell assignment problem in PCS networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new hybrid heuristic approach for solving large traveling salesman problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:25, 5 July 2024

scientific article
Language Label Description Also known as
English
A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem
scientific article

    Statements

    A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    17 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    ant colony optimisation
    0 references
    parallel processing
    0 references
    convergence
    0 references
    travelling salesman problem
    0 references
    0 references