Please use this identifier to cite or link to this item:
https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1770Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Manna, Apurba | |
| dc.contributor.author | Maity, Samir | |
| dc.contributor.author | Roy, Arindam | |
| dc.date.accessioned | 2021-08-26T06:24:46Z | - |
| dc.date.available | 2021-08-26T06:24:46Z | - |
| dc.date.issued | 2020 | |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85080946947&doi=10.1007%2f978-3-030-34152-7_4&partnerID=40&md5=1d9f1592e68378682d35177eeac4f0de | |
| dc.identifier.uri | https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1770 | - |
| dc.description | Manna, Apurba, Department of Computer Science, P. K. College, Purba Medinipur, Contai, W.B. 721404, India; Maity, Samir, OM Group, Indian Institute of Management, Calcutta, India; Roy, Arindam, Department of Computer Science, P. K. College, Purba Medinipur, Contai, W.B. 721404, India | |
| dc.description | ISSN/ISBN - 1860949X | |
| dc.description | pp.43-52 | |
| dc.description | DOI - 10.1007/978-3-030-34152-7_4 | |
| dc.description.abstract | This investigation took an attempt to solve the cluster traveling salesman problem (CTSP) by the heuristic approach. In this problem, nodes are clustered with given a set of vertices (nodes). Given the set of vertices is divided into a prespecified number of clusters. The size of each cluster is also pre-specified. The main aim is to find the least cost Hamiltonian tour based on the given vertices. Here vertices of each cluster visited contiguously, and the clusters are visited in a specific order. Standard GA is used to find a Hamiltonian path for each cluster. The performance of the algorithm has been examined against two existing algorithms for some symmetric TSPLIB instances of various sizes. The computational results show the proposed algorithm works well among the studied metaheuristics regarding the best result and computational time. | |
| dc.publisher | SCOPUS | |
| dc.publisher | Studies in Computational Intelligence | |
| dc.publisher | Springer | |
| dc.relation.ispartofseries | 863 SCI | |
| dc.subject | Cluster TSP | |
| dc.subject | GA | |
| dc.subject | Heuristic | |
| dc.title | A heuristic approach for cluster TSP | |
| dc.type | Conference Paper | |
| Appears in Collections: | Operations Management | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.