Hybrid discrete cuckoo search algorithm with Metropolis criterion for traveling salesman problem

DOI10.13232/J.CNKI.JNJU.2017.05.017zbMATH Open1399.68208MaRDI QIDQ3175271FDOQ3175271

Authors: Min Lin, Bixiong Liu, Xiaoyu Lin 

Publication date: 18 July 2018

Recommendations

• A discrete artificial bee colony algorithm for TSP
• Discrete cuckoo search for combinatorial optimization
• Discrete bird swarm algorithm based on information entropy matrix for traveling salesman problem
• An improved discrete butterfly optimization algorithm for solving TSP
• Application of imperialist competitive algorithm on solving the traveling salesman problem

zbMATH Keywords

traveling salesman problemcuckoo searchLévy flightMetropolis acceptance criterion

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (1)

• Discrete bird swarm algorithm based on information entropy matrix for traveling salesman problem

This page was built for publication: Hybrid discrete cuckoo search algorithm with Metropolis criterion for traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3175271)