Constraint Solid Traveling Salesman Problem using Genetic Algorithm

by Arindam Roy

Normally two-dimensional TSPs are available in the literature. But, in real life three-dimensional TSPs (3DTSP) are in vogue. In 3DTSP, different conveyances available at different cities are used by the salesman for minimum cost. These TSPs have wide applications in medical representative, network routing, transport, logistical problems and electronic manufacturing field, etc. Again, these NP-hard problems can be formulated and solved in different imprecise environments. Here, Genetic Algorithm is developed and used to solve these type of NP-hard problems. Different types Genetic Algorithm operators were newly developed to solve these problems. During my research work, I observed that to solve the discrete optimization problems by soft computing techniques particularly Genetic Algorithm, Ant colony optimization, Particle swarm optimization, there is a lot of scope to design new operators with different uncertain parameters and new hybridization technique. This motivated me to consider some innovative TSPs and solve by soft computing techniques.

52 pages, Paperback

Published August 6, 2019

About the author

Arindam Roy’s career in journalism spans 33 years. He was the Managing Editor of a Citizen Journalism portal, Merinews, and has held senior editorial positions in several publications. As correspondent and bureau chief, he has written extensively for the Times of India, Associated Press and multiple news outlets. He is the co-author of Kumbh: Confluence of Faith, Allahabad: Where the Rivers Meet and Kumbha Mela: Pellgrinaggio Indianao. He lives in Allahabad.