A New Vision on Solving a Variant Constraint Bulk Transshipment Problem using C-Language

Abstract

This research article explores on an error-free algorithm entitled by Lexi Search Algorithm (LSA) built on Pattern Recognition Technique (PRT) and its application in solving a Variant Constraint Bulk Transshipment Problem. Lexi Search Algorithms are shown to be dynamic in a large number of combinatorial situations. Here an innovative algorithm called LSA established on PRT  has been proposed in order to acquire the optimal solution and the discussions made here are demonstrated by means of numerical examples.Using C- Language the proposed algorithm is designed and it can be observed that this algothim has the ability to execute enormous problems.