Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Constraint Solid Traveling Salesman Problem using Genetic Algorithm - Arindam Roy

inglise keel
2019-08-06
40,19 € 57,42 €

-30% koodiga BOOKS

Meie tarnija laos

Saadetis 12-18 tööpäeva jooksul

30-päevane tagastamisõigus

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 ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Arindam Roy
Kirjastaja LAP LAMBERT Academic Publishing
Väljalaskeaasta 2019
Kaanetüüp Pehme kaanega
EAN 9786200267122
Kirjuta oma arvustus
Te vaatate: Constraint Solid Traveling Salesman Problem using Genetic Algorithm
Teie hinnang:

Goodreads'i arvustused

40,19 € 57,42 €