A new approach based a genetic algorithm for the selective travelling salesman problem

In this paper presents a new approach based a genetic algorithm to solve selective travelling salesman problem, which is concerned with finding a path between a given set of control points, among which a start and an end point are the same, and to maximize the total gain collected subject to a presc...

Full description

Saved in:
Bibliographic Details
Published inColloquium in Information Science and Technology (Print) pp. 785 - 788
Main Authors Laarabi, Bochar, Bouchaib, Radi
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2016
Subjects
Biological cells
combinatoire optimization
fitness function
genetic algorithm
Genetic algorithms
selective travelling salesman problem
Sociology
Statistics
Traveling salesman problems
Urban areas
Vehicles
vehicule routing problem
Online AccessGet full text
ISSN2327-1884
DOI10.1109/CIST.2016.7804993

Cover

More Information
Summary:In this paper presents a new approach based a genetic algorithm to solve selective travelling salesman problem, which is concerned with finding a path between a given set of control points, among which a start and an end point are the same, and to maximize the total gain collected subject to a prescribed cost constraint. This approach assured by creation of a population under the criterion ratio between the gain and cost. The results of the application of this approach give us the best of the objective function and the number of iterations for algorithm is reduced.
ISSN:2327-1884
DOI:10.1109/CIST.2016.7804993