Performance analysis of the partial use of a local optimization operator on the genetic algorithm for the Travelling Salesman Problem
Background: The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many heuristic algorithms and exact methods for solving the problem. Objectives: In this paper we study the influence of hybridization of a genetic algor...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2012-01-01
|
Series: | Business Systems Research |
Subjects: | |
Online Access: | http://www.degruyter.com/view/j/bsrj.2012.3.issue-1/v10305-012-0002-4/v10305-012-0002-4.xml?format=INT |