| 000 | 03249cam a2200421Ii 4500 | ||
|---|---|---|---|
| 001 | 94626 | ||
| 003 | ES-MaUEC | ||
| 005 | 20230102112624.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 160927s2017 sz a ob 000 0 eng d | ||
| 020 |
_a3319442546 _q(electronic bk.) |
||
| 020 |
_a9783319442549 _q(electronic bk.) |
||
| 020 |
_z3319442538 _q(print) |
||
| 020 |
_z9783319442532 _q(print) |
||
| 035 |
_a(OCoLC)959278160 _z(OCoLC)959330646 _z(OCoLC)962396459 _z(OCoLC)974650834 _z(OCoLC)981103068 _z(OCoLC)1005809256 |
||
| 040 |
_aN$T _cN$T _dIDEBK _dEBLCP _dGW5XE _dN$T _dAZU _dCCO _dYDX _dOCLCF _dCOO _dIDB _dMERUC _dUAB _dUPM _dVT2 _dUWO _dIOG _dESU _dJBG _dIAD _dICW _dICN _dOTZ _dOCLCQ _dU3W _dES-MaUEC _bspa |
||
| 050 | 4 |
_aQ342 _b.K855 2017 EB |
|
| 100 | 1 |
_aKulkarni, Anand Jayant, _eautor |
|
| 245 | 1 | 0 |
_aCohort intelligence : _ba socio-inspired optimization method _cAnand Jayant Kulkarni, Ganesh Krishnasamy, Ajith Abraham. |
| 264 | 1 |
_aCham, Switzerland _bSpringer _c2017. |
|
| 300 |
_a1 recurso en línea (xi, 134 páginas) _bilustraciones |
||
| 336 |
_aTexto _btxt _2rdacontent |
||
| 337 |
_aelectrónico _bc _2rdamedia |
||
| 338 |
_arecurso electrónico _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 0 |
_aIntelligent systems reference library _x1868-4394 _vvolume 114 |
|
| 500 |
_aSpringerLink _bSpringer Engineering eBooks 2017 English+International |
||
| 504 | _aIncluye referencias bibliográficas | ||
| 505 | 0 | _aIntroduction To Optimization -- Socio-Inspired Optimization Using Cohort Intelligence -- Cohort Intelligence For Constrained Test Problems -- Modified Cohort Intelligence For Solving Machine Learning Problems -- Solution To 0-1 Knapsack Problem Using Cohort Intelligence Algorithm -- Cohort Intelligence For Solving Travelling Salesman Problems -- Solution To A New Variant Of The Assignment Problem Using Cohort Intelligence Algorithm -- Solution To Sea Cargo Mix (Scm) Problem Using Cohort Intelligence Algorithm -- Solution To The Selection Of Cross-Border Shippers (Scbs) Problem -- Conclusions And Future Directions. | |
| 520 | 3 | _aThis Volume discusses the underlying principles and analysis of the different concepts associated with an emerging socio-inspired optimization tool referred to as Cohort Intelligence (CI). CI algorithms have been coded in Matlab and are freely available from the link provided inside the book. The book demonstrates the ability of CI methodology for solving combinatorial problems such as Traveling Salesman Problem and Knapsack Problem in addition to real world applications from the healthcare, inventory, supply chain optimization and Cross-Border transportation. The inherent ability of handling constraints based on probability distribution is also revealed and proved using these problems. . | |
| 650 | 7 |
_aOptimización combinatoria _2embne _0(OCoLC)fst00868980 _0 _9157651 |
|
| 700 | 1 |
_aAbraham, Ajith _d1968- _eautor _945309 |
|
| 700 | 1 |
_aKrishnasamy, Ganesh, _eautor |
|
| 856 | 4 | 0 |
_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=http://link.springer.com/10.1007/978-3-319-44254-9 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid) |
| 988 | _aEBOOK, asignarmaterias, EBSPRINGER_2017A | ||
| 998 |
_b02/2018 _dz _e- _zSI |
||
| 999 |
_c94626 _d94626 _x1 |
||