Andere Kunden interessierten sich auch für
![Constraint Solid Traveling Salesman Problem mit genetischem Algorithmus]( "Constraint Solid Traveling Salesman Problem mit genetischem Algorithmus")
Constraint Solid Traveling Salesman Problem mit genetischem Algorithmus39,90 €![GENETIC ALGORITHM BASED CANNY DISTRIBUTED EDGE DETECTION USING XILINX]( "GENETIC ALGORITHM BASED CANNY DISTRIBUTED EDGE DETECTION USING XILINX")
GENETIC ALGORITHM BASED CANNY DISTRIBUTED EDGE DETECTION USING XILINX36,99 €![Data Mining of Objects Using Genetic Algorithm]( "Data Mining of Objects Using Genetic Algorithm")
Data Mining of Objects Using Genetic Algorithm26,99 €![General module to adaptive traffic lights using genetic algorithm]( "General module to adaptive traffic lights using genetic algorithm")
General module to adaptive traffic lights using genetic algorithm36,99 €![Image Enhancement Using Continuous Genetic Algorithm]( "Image Enhancement Using Continuous Genetic Algorithm")
Image Enhancement Using Continuous Genetic Algorithm26,99 €![Watermarking Technology using Frequency Domain & Genetic Programming]( "Watermarking Technology using Frequency Domain & Genetic Programming")
Watermarking Technology using Frequency Domain & Genetic Programming46,99 €![Implementation of MAC using modified booth algorithm]( "Implementation of MAC using modified booth algorithm")
Implementation of MAC using modified booth algorithm26,99 €
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.