A Heuristic Algorithm for Optimal Hamiltonian Cycles in Weighted Graphs
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2015, Vol 11, Issue 6
Abstract
Abstract. The paper focuses on finding of the optimal Hamiltonian cycle, when it is regarded with respect to cost, time, distance or difficulty level of the route. The problem is strictly related to the traveling salesman problem proved to be NP-complete for general graphs. The paper gives a heuristic algorithm for finding the optimal spanning cycle in a weighted graph. Its idea is based on optimization of weight losses and reduction the complexity of a problem by reduction the dimension of the graph payoff matrix.
Authors and Affiliations
Tadeusz Ostrowski, Petroula Mavrikiou
Keywords
Related Articles
- EP ID EP651575
- DOI 10.24297/jam.v11i6.1227
- Views 148
- Downloads 0
(g*p)**- CLOSED SETS IN TOPOLOGICAL SPACES
In this paper, we have introduced a new class of sets called (g*p)**-closed sets which is properly placed in between the class of closed sets and the class of (g*p)**-closed sets. As an application, we introduce three ne...
Spectra of some Operations on Graphs
In this paper, we consider a finite undirected and connected simple graph G(E, V) with vertex set V(G) and edge set E(G).We introduced a new computes the spectra of some operations on simple graphs [union of disjoin...
Some properties on semi-symmetric metric T-connection on Sasakian Manifold
In the present paper we have studied some properties of semi symmetric metric connection in almost contact metric manifold. In this paper we have studied some results related to quasi conformal curvature tensor, m-projec...
On a two (nonlocal) point boundary value problem of arbitrary (fractional) orders integro-differential equation
Here we study the existence of solutions of the functional integral equation:  ...
A new analytical modelling for fractional telegraph equation via Elzaki transform
The main aim of this paper is to propose a new and simple algorithm for space-fractional telegraph equation, namely new fractional homotopy analysis transform method (FHATM). The fractional homotopy analysis transform...