- -

Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System

Show full item record

Yousefikhoshbakht, M.; Malekzadeh, N.; Sedighpour, M. (2016). Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System. International Journal of Production Management and Engineering. 4(2):65-73. doi:10.4995/ijpme.2016.4618.

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/74221

Files in this item

Item Metadata

Title: Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System
Author:
Issued date:
Abstract:
[EN] The TSP is considered one of the most well-known combinatorial optimization tasks and researchers have paid so much attention to the TSP for many years. In this problem, a salesman starts to move from an arbitrary ...[+]
Subjects: Reactive Bone Route Algorithm , Genetic Algorithm , Ant Colony System , Traveling Salesman Problem , NP-hard Problems
Copyrigths: Reconocimiento - No comercial (by-nc)
Source:
International Journal of Production Management and Engineering. (issn: 2340-5317 ) (eissn: 2340-4876 )
DOI: 10.4995/ijpme.2016.4618
Publisher:
Universitat Politècnica de València
Publisher version: https://doi.org/10.4995/ijpme.2016.4618
Type: Artículo

This item appears in the following Collection(s)

Show full item record