It looks like you're offline.
Open Library logo
additional options menu

MARC Record from marc_columbia

Record ID marc_columbia/Columbia-extract-20221130-030.mrc:222805402:11257
Source marc_columbia
Download Link /show-records/marc_columbia/Columbia-extract-20221130-030.mrc:222805402:11257?format=raw

LEADER: 11257cam a2200745 i 4500
001 14985362
005 20211016232723.0
006 m o d
007 cr cnu---unuuu
008 200521t20202021flua ob 001 0 eng
010 $a 2020018735
035 $a(OCoLC)on1157680156
035 $a(NNC)14985362
040 $aDLC$beng$erda$cDLC$dOCLCO$dYDX$dTYFRS$dUKMGB$dTYFRS$dOCLCF$dUKAHL$dSFB$dNOC
015 $aGBC079447$2bnb
016 7 $a019825973$2Uk
019 $a1197737823$a1260365851
020 $a9780429422607$qelectronic book
020 $a0429422601$qelectronic book
020 $a9780429749469$q(electronic bk. : EPUB)
020 $a0429749465$q(electronic bk. : EPUB)
020 $a9780429749476$q(electronic bk. : PDF)
020 $a0429749473$q(electronic bk. : PDF)
020 $a9780429749452$q(electronic bk. : Mobipocket)
020 $a0429749457$q(electronic bk. : Mobipocket)
020 $z9781138391017$qhardcover
020 $z1138391018
024 7 $a10.1201/9780429422607$2doi
035 $a(OCoLC)1157680156$z(OCoLC)1197737823$z(OCoLC)1260365851
037 $a9780429422607$bTaylor & Francis
042 $apcc
050 04 $aQ337.3$b.S9244 2020eb
072 7 $aCOM$x059000$2bisacsh
072 7 $aMAT$x004000$2bisacsh
072 7 $aTEC$x007000$2bisacsh
072 7 $aUMB$2bicssc
082 00 $a006.3/824$223
049 $aZCUA
245 00 $aSwarm intelligence algorithms.$pModifications and applications /$cedited by Adam Slowik.
250 $aFirst edition.
264 1 $aBoca Raton, FL :$bCRC Press,$c2020.
264 4 $c©2021
300 $a1 online resource (xxviii, 349 pages) :$billustrations (some color)
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
504 $aIncludes bibliographical references and index.
520 $a"This book presents 24 swarm algorithms together with their modifications and practical applications. Each chapter is devoted to one algorithm. It contains a short description along with a pseudo-code showing the various stages of its operation. In addition, each chapter contains a description of selected modifications of the algorithm and shows how it can be used to solve a selected practical problem"--$cProvided by publisher.
588 $aDescription based on online resource; title from digital title page (viewed on September 11, 2020).
545 0 $aAdam Slowik (IEEE Member 2007; IEEE Senior Member 2012) is an Associate Professor in the Department of Electronics and Computer Science, Koszalin University of Technology. His research interests include soft computing, computational intelligence, and, particularly, bio-inspired optimization algorithms and their engineering applications. He was a recipient of one Best Paper Award (IEEE Conference on Human System Interaction - HSI 2008).
505 0 $a1 Ant Colony Optimization, Modications, and Application ; Pushpendra Singh, Nand K. Meena, and Jin Yang; 1.1 Introduction ; 1.2 Standard Ant System ; 1.2.1 Brief of Ant Colony Optimization; 1.2.2 How articial ant selects the edge to travel? ; 1.2.3 Pseudo-code of standard ACO algorithm ; 1.3 Modied Variants of Ant Colony Optimization ; 1.3.1 Elitist ant systems ; 1.3.2 Ant colony system ; 1.3.3 Max-min ant system ; 1.3.4 Rank based ant systems ; 1.3.5 Continuous orthogonal ant systems ; 1.4 Application of ACO to Solve Real-life Engineering Optimization; Problem ; 1.4.1 Problem description ; 1.4.2 Problem formulation ; 1.4.3 How ACO can help to solve this optimization problem?; 1.4.4 Simulation results; 1.5 Conclusion ; 2 Articial Bee Colony Modications and An Application to Software Requirements Selection ; Bahriye Akay; 2.1 Introduction ; 2.2 The Original ABC algorithm in brief; 2.3 Modications of the ABC algorithm ; 2.3.1 ABC with Modied Local Search; 2.3.2 Combinatorial version of ABC ; 2.3.3 Constraint Handling ABC ; 2.3.4 Multi-objective ABC ; 2.4 Application of ABC algorithm for Software Requirement Selection; 2.4.1 Problem description ; 2.4.2 How can the ABC algorithm be used for this problem? ; 2.4.2.1 Objective Function and Constraints; 2.4.2.2 Representation ; 2.4.2.3 Local Search ; 2.4.2.4 Constraint Handling and Selection Operator ; 2.4.3 Description of the Experiments ; 2.4.4 Results obtained; 2.5 Conclusions ; References ; 3 Modied Bacterial Forging Optimization and Application ; Neeraj Kanwar, Nand K. Meena, Jin Yang, and Sonam Parashar; 3.1 Introduction ; 3.2 Original BFO algorithm in brief; 3.2.1 Chemotaxis; 3.2.2 Swarming ; 3.2.3 Reproduction ; 3.2.4 Elimination and dispersal ; 3.2.5 Pseudo-codes of the original BFO algorithm ; 3.3 Modications in Bacterial Foraging Optimization ; 3.3.1 Non-uniform elimination-dispersal probability distribution; 3.3.2 Adaptive chemotaxis step ; 3.3.3 Varying population ; 3.4 Application of BFO for Optimal DER Allocation in Distribution Systems; 3.4.1 Problem description ; 3.4.2 Individual bacteria structure for this problem ; 3.4.3 How can the BFO algorithm be used for this problem? ; 3.4.4 Description of experiments; 3.4.5 Results obtained ; 3.5 Conclusions ; 4 Bat Algorithm Modications and Application ; Neeraj Kanwar, Nand K. Meena, and Jin Yang; 4.1 Introduction ; 4.2 Original Bat Algorithm in Brief; 4.2.1 Random y ; 4.2.2 Local random walk ; 4.3 Modications of the Bat algorithm ; 4.3.1 Improved bat algorithm ; 4.3.2 Bat algorithm with centroid strategy ; 4.3.3 Self-adaptive bat algorithm (SABA) ; 4.3.4 Chaotic mapping based BA; 4.3.5 Self-adaptive BA with step-control and mutation mechanisms; 4.3.6 Adaptive position update ; 4.3.7 Smart bat algorithm; 4.3.8 Adaptive weighting function and velocity ; 4.4 Application of BA for optimal DNR problem of distribution system ; 4.4.1 Problem description; 4.4.2 How can the BA algorithm be used for this problem?; 4.4.3 Description of experiments ; 4.4.4 Results; 4.5 Conclusion; 5 Cat Swarm Optimization -- Modications and Application ; Dorin Moldovan, Adam Slowik, Viorica Chifu, and Ioan Salomie; 5.1 Introduction ; 5.2 Original CSO algorithm in brief ; 5.2.1 Description of the original CSO algorithm ; 5.3 Modications of the CSO algorithm; 5.3.1 Velocity clamping ; 5.3.2 Inertia weight ; 5.3.3 Mutation operators ; 5.3.4 Acceleration coecient c1; 5.3.5 Adaptation of CSO for diets recommendation; 5.4 Application of CSO algorithm for recommendation of diets ; 5.4.1 Problem description; 5.4.2 How can the CSO algorithm be used for this problem? ; 5.4.3 Description of experiments ; 5.4.4 Results obtained; 5.4.4.1 Diabetic diet experimental results ; 5.4.4.2 Mediterranean diet experimental results ; 5.5 Conclusions; References ; 6 Chicken Swarm Optimization -- Modications and Application</P><P>Dorin Moldovan and Adam Slowik; 6.1 Introduction; 6.2 Original CSO algorithm in brief ; 6.2.1 Description of the original CSO algorithm ; 6.3 Modications of the CSO algorithm ; 6.3.1 Improved Chicken Swarm Optimization (ICSO) ; 6.3.2 Mutation Chicken Swarm Optimization (MCSO) </P><P>6.3.3 Quantum Chicken Swarm Optimization (QCSO) ; 6.3.4 Binary Chicken Swarm Optimization (BCSO); 6.3.5 Chaotic Chicken Swarm Optimization (CCSO) ; 6.3.6 Improved Chicken Swarm Optimization -- Rooster Hen Chick (ICSO-RHC) ; 6.4 Application of CSO for Detection of Falls in Daily Living Activities; 6.4.1 Problem description ; 6.4.2 How can the CSO algorithm be used for this problem? ; 6.4.3 Description of experiments ; 6.4.4 Results obtained; 6.4.5 Comparison with other classication approaches; 6.5 Conclusions ; References ; 7 Cockroach Swarm Optimization Modications and Application; Joanna Kwiecien; 7.1 Introduction; 7.2 Original CSO algorithm in brief; 7.2.1 Pseudo-code of CSO algorithm; 7.2.2 Description of the original CSO algorithm; 7.3 Modications of the CSO algorithm; 7.3.1 Inertia weight; 7.3.2 Stochastic constriction coecient; 7.3.3 Hunger component; 7.3.4 Global and local neighborhoods; 7.4 Application of CSO algorithm for traveling salesman problem; 7.4.1 Problem description; 7.4.2 How can the CSO algorithm be used for this problem? ; 7.4.3 Description of experiments; 7.4.4 Results obtained; 7.5 Conclusions ; References ; 8 Crow Search Algorithm -- Modications and Application; Adam Slowik and Dorin Moldovan; 8.1 Introduction ; 8.2 Original CSA in brief ; 8.3 Modications of CSA ; 8.3.1 Chaotic Crow Search Algorithm (CCSA); 8.3.2 Modied Crow Search Algorithm (MCSA) ; 8.3.3 Binary Crow Search Algorithm (BCSA) ; 8.4 Application of CSA for Jobs Status Prediction; 8.4.1 Problem description; 8.4.2 How can CSA be used for this problem?; 8.4.3 Experiments description; 8.4.4 Results; 8.5 Conclusions; References; 9 Cuckoo Search Optimisation Modications and Application; Dhanraj Chitara, Nand K. and Jin Yang; 9.1 Introduction; 9.2 Original CSO Algorithm in Brief; 9.2.1 Breeding behavior of cuckoo ; 9.2.2 Levy Flights; 9.2.3 Cuckoo search optimization algorithm ; 9.3 Modied CSO Algorithms; 9.3.1 Gradient free cuckoo search; 9.3.2 Improved cuckoo search for reliability optimization problems; 9.4 Application of CSO Algorithm for Designing Power System Stabilizer; 9.4.1 Problem description ; 9.4.2 Objective function and problem formulation; 9.4.3 Case study on two-area four machine power system; 9.4.4 Eigenvalue analysis of TAFM power system without and with PSSs ; 9.4.5 Time-domain simulation of TAFM power system; 9.4.6 Performance indices results and discussion of TAFM power system; 9.5 Conclusion; 10 Improved Dynamic Virtual Bats Algorithm for Identifying a Suspension System Parameters ; Ali Osman Topal; 10.1 Introduction ; 10.2 Original Dynamic Virtual Bats Algorithm (DVBA) ; 10.3 Improved Dynamic Virtual Bats Algorithm (IDVBA) ; 10.3.1 The weakness of DVBA ; 10.3.2 Improved Dynamic Virtual Bats Algorithm (IDVBA); 10.4 Application of IDVBA for identifying a suspension system; 10.5 Conclusions</P><P>11 Dispersive Flies Optimisation: Modications and Application; Mohammad Majid al-Rifaie, Hooman Oroojeni M. J., and Mihalis Nicolaou; 11.1 Introduction; 11.2 Dispersive Flies Optimisation; 11.3 Modications in DFO; 11.3.1 Update Equation; 11.3.2 Disturbance Threshold, ; 11.4 Application: Detecting false alarms in ICU; 11.4.1 Problem Description; 11.4.2 Using Dispersive Flies Optimisation; 11.4.3 Experiment Setup; 11.4.3.1 Model Conguration; 11.4.3.2 DFO Conguration; 11.4.4 Results; 11.5 Conclusions ; References ; 12 Improved Elephant Herding Optimization and Application ; Nand K.
650 0 $aSwarm intelligence.
650 0 $aAlgorithms.
650 0 $aMathematical optimization.
650 7 $aCOMPUTERS / Computer Engineering$2bisacsh
650 7 $aMATHEMATICS / Arithmetic$2bisacsh
650 7 $aTECHNOLOGY / Electricity$2bisacsh
650 7 $aAlgorithms$2fast$0(OCoLC)fst00805020
650 7 $aMathematical optimization$2fast$0(OCoLC)fst01012099
650 7 $aSwarm intelligence$2fast$0(OCoLC)fst01139953
655 4 $aElectronic books.
700 1 $aSlowik, Adam,$eeditor.
776 08 $iPrint version:$tSwarm intelligence algorithm$bFirst edition.$dBoca Raton : Taylor and Francis, 2020.$z9781138391017$w(DLC) 2020018734
856 40 $uhttp://www.columbia.edu/cgi-bin/cul/resolve?clio14985362$zTaylor & Francis eBooks
852 8 $blweb$hEBOOKS