Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

Constraint Solid Traveling Salesman Problem using Genetic Algorithm - Arindam Roy

englanti
2019-08-06
43,07 € 57,42 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 12-18 arkipäivässä

30 päivän palautusoikeus

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äydellinen kuvaus

Saatat myös pitää

Kuvaus

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.

Lisätietoja

Kirjoittaja Arindam Roy
Julkaisija LAP LAMBERT Academic Publishing
Julkaisuvuosi 2019
Kannen tyyppi Pehmeäkantinen
EAN 9786200267122
Kirjoita oma arvostelusi
Arvostelet: Constraint Solid Traveling Salesman Problem using Genetic Algorithm
Arvostelusi:

Goodreads-arvostelut

43,07 € 57,42 €