Loading...
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...
Na minha lista:
| Hovedforfatter: | |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Hindawi Publishing Corporation
2014
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3950363/ https://ncbi.nlm.nih.gov/pubmed/24701148 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1155/2014/258207 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|