Cluster of Optimal Chains of All-Pairs Shortest Paths to Deduce Minimum Cost Tour
Main Article Content
Abstract
This paper aims at analyzing all-pairs shortest paths algorithm by Floyd to extract optimal path between any pair of vertices of various path length. To form least cost round tour, vertices of an optimal chain are grouped into cluster. These optimal chains are combined by taking an account of both path length as well as magnitude of the path. The chain which has largest path length and optimal distance will be considered first. Tour is constructed by adding up vertices to optimal chains in suitable positions based on nearness. This approach is a mix of both dynamic and greedy strategies. Illustrations of different variations are focus of the study.
Keywords:Cost Adjacency Matrix, Optimal Chain, Round tour, Path length matrix, predecessor matrix and all-pairs shortest paths
Keywords:Cost Adjacency Matrix, Optimal Chain, Round tour, Path length matrix, predecessor matrix and all-pairs shortest paths
Downloads
Download data is not yet available.
Article Details
Section
Articles
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.