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

Xiutang Geng; Zhihua Chen; Wei Yang; Deqian Shi; Kai Zhao

doi:10.1016/j.asoc.2011.01.039

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Xiutang Geng Zhihua Chen Wei Yang Deqian Shi Kai Zhao

Year: 2011 Journal: Applied Soft Computing Vol: 11 (4)Pages: 3680-3689 Publisher: Elsevier BV

DOI: 10.1016/j.asoc.2011.01.039

Get Full-Text PDF Get Analytical Report

Keywords:

Simulated annealing Travelling salesman problem Greedy algorithm Mathematical optimization Heuristics Greedy randomized adaptive search procedure Algorithm Computer science Local search (optimization) Adaptive simulated annealing Hill climbing 2-opt Best-first search Search algorithm Convergence (economics) Bottleneck traveling salesman problem Combinatorial optimization Mathematics Beam search

Metrics

245

Cited By

14.89

FWCI (Field Weighted Citation Impact)

Refs

0.99

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Metaheuristic Optimization Algorithms Research

Physical Sciences → Computer Science → Artificial Intelligence

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Scheduling and Timetabling Solutions

Social Sciences → Decision Sciences → Management Science and Operations Research

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

Metrics

Citation History

Topics

Related Documents

Simulated Annealing – 2 Opt Algorithm for Solving Traveling Salesman Problem

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

Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem

Solving the traveling salesman problem using simulated annealing

List-Based Simulated Annealing Algorithm for Traveling Salesman Problem