A solution of TSP based on the ant colony algorithm improved by particle swarm optimization (Q2321652): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128861122, #quickstatements; #temporary_batch_1723473115199
 
(4 intermediate revisions by 4 users 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.3934/dcdss.2019066 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2900531744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3193679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A forecasting method for Chinese civil planes attendance rate based on vague sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved TOPSIS with weighted hesitant vague information / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128861122 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:32, 12 August 2024

scientific article
Language Label Description Also known as
English
A solution of TSP based on the ant colony algorithm improved by particle swarm optimization
scientific article

    Statements

    A solution of TSP based on the ant colony algorithm improved by particle swarm optimization (English)
    0 references
    0 references
    23 August 2019
    0 references
    TSP
    0 references
    improved ant colony algorithm
    0 references
    particle swarm optimization
    0 references

    Identifiers