Loop formation in transportation problem: Semi-cycle formation in restricted graph

Abstract

Loop formation in Transportation Problem using Modified Distribution Method can be termed as Semi-Cycle formation in Restricted Graph, from given starting vertex with some vertices participating in it which is different form cycle formation in Hamiltonian Cycle, where each vertex is involved. The participating vertices must be used exactly once except the first and last vertex which is same. The restriction is imposed by allowing only horizontal and vertical connection in the semi-cycle formation. This paper presents the algorithm for such semi-cycle formation for Transportation Problem. © 2018, Institute of Advanced Scientific Research, Inc. All rights reserved.