Constraint Solid Traveling Salesman Problem using Genetic Algorithm
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
39.90 €
19 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
Produktdetails
Produktinformationen zu „Constraint Solid Traveling Salesman Problem using Genetic Algorithm “
Klappentext zu „Constraint Solid Traveling Salesman Problem using Genetic Algorithm “
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.
Autoren-Porträt von Arindam Roy
Roy, ArindamArindam Roy received M.Sc & PhD degree in Applied Mathematics and M.Tech in Computer Application. He is currently an Assistant Professor in Computer science in P. K. College, Contai, WB, India. He has supervised research projects and guided many research scholars having 30+ int. publications. He was a Visiting fellow in Tsinghua University, China.
Bibliographische Angaben
- Autor: Arindam Roy
- 2019, 52 Seiten, Maße: 22 cm, Kartoniert (TB), Englisch
- Verlag: LAP Lambert Academic Publishing
- ISBN-10: 620026712X
- ISBN-13: 9786200267122
Sprache:
Englisch
Kommentar zu "Constraint Solid Traveling Salesman Problem using Genetic Algorithm"
0 Gebrauchte Artikel zu „Constraint Solid Traveling Salesman Problem using Genetic Algorithm“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Constraint Solid Traveling Salesman Problem using Genetic Algorithm".
Kommentar verfassen