Repetitive Nearest Neighbor Based Simulated Annealing Search Optimization Algorithm for Traveling Salesman Problem

Journals Menu

Follow SCIRP

ISSN Print: 2333-9705
ISSN Online: 2333-9721
www.scirp.org/journal/oalibj
E-mail: service@oalib.com

"Repetitive Nearest Neighbor Based Simulated Annealing Search Optimization Algorithm for Traveling Salesman Problem"
written by Md. Azizur Rahman, Hasan Parvez,
published by Open Access Library Journal, Vol.8 No.6, 2021

has been cited by the following article(s):

[1]	Modified Simulated Annealing Hybrid Algorithm to Solve the Traveling Salesman Problem
	Castellanos… - … on Control, Decision …, 2022

[2]	순회 왼판원 문제를 위한 지역 탐색의 그리디 기반 이웃해 생성 방법
	한국컴퓨터정보학회논문지, 2022

[3]	Neighbor Generation Strategies of Local Search for Permutation-based Combinatorial Optimization
	한국컴퓨터정보학회논문지, 2021

[4]	Optimization of Vehicle Routing Problem in the Context of E-commerce Logistics Distribution


[5]	Drso: Improved Discrete Rat Swarm Optimization Algorithm (Drso) for Solving the Traveling Salesman Problem

Follow SCIRP