文章基本信息

标题：Open Loop Travelling Salesman Problem using Genetic Algorithm
本地全文：下载
作者：AKSHATHA .P.S ; VASUDHA VASHISHT ; TANUPRIYA CHOUDHURY 等
期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2013
卷号：1
期号：1
出版社：S&S Publications
摘要：Genetic algorithm is an optimization technique based on crossover and mutation operators using a survival ofthe fittest idea. They have been used successfully in a variety of different problems. Travelling salesman problem is one of thecommonly studied optimization problem. In the travelling salesman problem we wish to find a tour of all nodes in a weightedgraph so that the total weight is minimized. In this paper a single salesman travels to each of the cities but does not close theloop by returning to the city he started from and each city is visited by the salesman exactly once.
关键词：Genetic Algorithm; Open Travelling Salesman Problem