Genetic Algorithm for Facility Location Problem.

      Аннотация: This book is a Bhagavad Gita to be preserved for life-long for every student,academician and practising professionals. This book is meticulously designed and documented, into six chapters. Facility location problem is discussed with its application in chapter one. The total covering problem, comes under the facility location problem. Literature review of covering problem is given in detail in the second chapter. The problem is Combinatorial in nature. It is inevitale to develop an efficient heuristic for solving. GA, Simulated Annealing, Tabu-search and Ant Colony Optimization are known as meta-heuristics. In total covering problem, the objective is to locate facilities at minimum number of sites to cover all the customers is described with example in chapter three. The crossover operation which is performed on chromosome to produce offspring explained with number of table-illustrations in chapter four. Newly developed GA based heuristic is compared with the standard heuristic;Model and GRASP based heuristic Statistically for evaluation produced in chapter five and Conclusion in chapter six.The Book is a boon for practitioners to create facility with less cost to earn more profit.

Ключевые слова: Algorithm, Gene, logistic, chromosome, CROSSOVER, ., covering problem, operators, Facility Location, OR, offspring, GA. Heuristic, Search Optimization, GRASP, FitnessValue, Customer center, Dealer network