Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Constraint Solid Traveling Salesman Problem using Genetic Algorithm - Arindam Roy

angļu valoda
2019-08-06
40,19 € 57,42 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 12-18 darba dienu laikā

30 dienu atgriešanas politika

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 ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

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.

Vairāk informācijas

Autors Arindam Roy
Izdevējs LAP LAMBERT Academic Publishing
Izlaides gads 2019
Vāka tips Mīkstais vāks
EAN 9786200267122
Rakstiet savu atsauksmi
Jūs vērtējat: Constraint Solid Traveling Salesman Problem using Genetic Algorithm
Jūsu novērtējums:

Goodreads atsauksmes

40,19 € 57,42 €