Cargando…

The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm

The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some prespecified clusters. The objective is to find the least cost Hamiltonian tour in which vertices of a...

Descripción completa

Detalles Bibliográficos
Autor principal: Ahmed, Zakir Hussain
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3950363/
https://www.ncbi.nlm.nih.gov/pubmed/24701148
http://dx.doi.org/10.1155/2014/258207

Ejemplares similares