Simulated Annealing with a Hybrid Local Search for Solving the Traveling Salesman Problem

Dongming Zhao; Wei Xiong; Zongyu Shu

doi:10.1166/jctn.2015.3868

ScienceGate Book Chapters

JOURNAL ARTICLE

Simulated Annealing with a Hybrid Local Search for Solving the Traveling Salesman Problem

Dongming Zhao Wei Xiong Zongyu Shu

Year: 2015 Journal: Journal of Computational and Theoretical Nanoscience Vol: 12 (7)Pages: 1165-1169 Publisher: American Scientific Publishers

DOI: 10.1166/jctn.2015.3868

Get Full-Text PDF Get Analytical Report

Keywords:

Travelling salesman problem Simulated annealing Mathematical optimization Computer science Mathematics

Metrics

Cited By

1.26

FWCI (Field Weighted Citation Impact)

Refs

0.91

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Metaheuristic Optimization Algorithms Research

Physical Sciences → Computer Science → Artificial Intelligence

Simulated Annealing with a Hybrid Local Search for Solving the Traveling Salesman Problem

Metrics

Citation History

Topics

Related Documents

Solving Colored Traveling Salesman Problem via Multi-neighborhood Simulated Annealing Search

Solving the traveling salesman problem using simulated annealing

Laufzeitanalyse von Iterated Local Search und Simulated Annealing am Traveling Salesman Problem

Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search

Simulated Annealing – 2 Opt Algorithm for Solving Traveling Salesman Problem