Solution of a Solid Traveling Purchaser Problem using Modified Genetic Algorithm and Comparison Crossover Technique

In this paper we develops a comparison crossover for Modified genetic algorithm (MGA) to solve a NP hard optimization problem. Here we consider a set of markets, a depot and some products for each of which a positive demand is specified. Each product is made available in a subset of markets in each of which only a given quantity, less than or equal to the required one, can be purchased at a given unit price. Here, this Traveling purchaser problem (TPP) searches for a cycle starting at and ending to the depot and visiting a subset of markets at a minimum traveling cost, also we introduce different vehicle to visit different markets say solid TPP (STPP). The effectiveness of our model are illustrated by numerical examples.