Lexi-search algorithm using pattern recognition technique for solving a variant constrained bulk transshipment problem

Abstract

In this article we present a variant transportation problem called “A Variant Constrained Bulk Transshipment Problem”. The purpose of this paper is to propose an efficient Lexi-Search Algorithm using pattern recognition technique for solving “A Variant Constrained Bulk Transshipment Problem” on a scalable multicomputer platform and to obtain an optimal solution. Our results show that the proposed algorithm is highly competitive on a set of benchmark problems. The objective of the problem is to minimize the total bulk cost of supplying the required products to the destinations with the restriction that any destination should get its requirement from one source only, even when it gets from a destination. In the sequel we developed a Lexi-Search algorithm based “Pattern Recognition Technique” to solve this problem which takes care of simple combinatorial structure of the problem and computational results are reported. In this discussion we have studied a variation of the transportation problems called “A Variant Constrained Bulk Transshipment Problem”. It also comes under combinatorial programming problems.