Dynamics of Stochastic vs. Greedy Heuristics in Traveling Salesman Problem

Dynamics of Stochastic vs. Greedy Heuristics in Traveling Salesman Problem

We studied the relative performance of stochastic heuristics in order to establish the relations between the fundamental elements of their mechanisms. The insights on their dynamics, abstracted from the implementation details, may contribute to the development of an efficient framework for design of...

Full description

Bibliographic Details
Main Authors: Maciej Białogłowski, Mateusz Staniaszek, Wojciech Laskowski, Marcin Grudniak
Format: Article
Language:English
Published: Warsaw School of Computer Science 2018-12-01
Series:Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
Subjects:
traveling salesman problem
nearest neighbor
monte carlo
simulated annealing
genetic algorithm
particle swarm optimization
Online Access:http://zeszyty-naukowe.wwsi.edu.pl/zeszyty/zeszyt19/Maciej_Bialoglowski_et_al._OK.pdf

Internet

http://zeszyty-naukowe.wwsi.edu.pl/zeszyty/zeszyt19/Maciej_Bialoglowski_et_al._OK.pdf

Similar Items