Optimization of supply chain Distribution network using RFID Technique with hybrid k means Cluster based algorithm

Abstract

Transportation of goods constitutes an important part of in bound newlineas well as out bound logistics of Supply Chain Management SCM Efficient newlinedistribution of goods and services is of vital importance in today s newlinecompetitive market as transportation constitutes a considerable portion of the newlinetrading price of most products or services A broad range of decisions newlineranging from warehouse location to distribution of goods fall under newlinedistribution logistics management This study addresses the routing aspect of newlinedistribution logistics in SCM Many optimization problems have several equivalent mathematical newlinemodels It is often not apparent which of this model is most suitable for newlinepractical computations in particular when a certain application with a newlinespecific range of instance sizes is in focus Traveling Salesman Problem newline TSP is one of the most difficult combinatorial optimization problems In this newlineResearch TSP is considered with single objective function distance travelled newlineThis is solved using non traditional optimization algorithms and also by newlineproposed local search heuristic algorithm newlineA modified Genetic Algorithms GA system approach K Means newlineCluster based Heuristic approach Hybrid GA Simulated Annealing SA newlineApproach Hybrid K Means Cluster based heuristic GA and Hybrid newlineK Means Cluster based heuristic GA SA for travelling salesman problem is newlineProposed newline newline