A novel state transition simulated annealing algorithm for the multiple traveling salesmen problem

Yan Zhang; Xiaoxia Han; Yingchao Dong; Jun Xie; Gang Xie; Xinying Xu

doi:10.1007/s11227-021-03744-1

ScienceGate Book Chapters

JOURNAL ARTICLE

A novel state transition simulated annealing algorithm for the multiple traveling salesmen problem

Yan Zhang Xiaoxia Han Yingchao Dong Jun Xie Gang Xie Xinying Xu

Year: 2021 Journal: The Journal of Supercomputing Vol: 77 (10)Pages: 11827-11852 Publisher: Springer Science+Business Media

DOI: 10.1007/s11227-021-03744-1

Get Full-Text PDF Get Analytical Report

Keywords:

Travelling salesman problem Computer science Simulated annealing Algorithm Benchmark (surveying) Mathematical optimization 2-opt Operator (biology) Mathematics

Metrics

Cited By

3.95

FWCI (Field Weighted Citation Impact)

Refs

0.94

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

A novel state transition simulated annealing algorithm for the multiple traveling salesmen problem

Metrics

Citation History

Topics

Related Documents

Solving Competitive Traveling Salesmen Problem Using Simulated Annealing

Artificial Electric Field Algorithm with Greedy State Transition Strategy for Spherical Multiple Traveling Salesmen Problem

A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm

Optimization of Multiple Traveling Salesmen Problem by a Novel Representation Based Genetic Algorithm

A neural network algorithm for the multiple traveling salesmen problem