Experience Seamless Full Ebook Downloads for Every Genre at textbookfull.

com

Discrete Problems in Nature Inspired Algorithms

First Edition Shukla

https://textbookfull.com/product/discrete-problems-in-
nature-inspired-algorithms-first-edition-shukla/

OR CLICK BUTTON

DOWNLOAD NOW

Explore and download more ebook at https://textbookfull.com

 Recommended digital products (PDF, EPUB, MOBI) that
you can download immediately if you are interested.

Discrete Problems in Nature Inspired Algorithms 1st

Edition Anupam Prof. Shukla

https://textbookfull.com/product/discrete-problems-in-nature-inspired-
algorithms-1st-edition-anupam-prof-shukla/

textboxfull.com

Bio-Inspired Algorithms in PID Controller Optimization

First Edition Ashour

https://textbookfull.com/product/bio-inspired-algorithms-in-pid-
controller-optimization-first-edition-ashour/

textboxfull.com

Nature-Inspired Algorithms and Applied Optimization 1st

Edition Xin-She Yang (Eds.)

https://textbookfull.com/product/nature-inspired-algorithms-and-
applied-optimization-1st-edition-xin-she-yang-eds/

textboxfull.com

Nature-inspired Computation and Swarm Intelligence:

Algorithms, Theory and Applications 1st Edition Xin-She
Yang (Editor)
https://textbookfull.com/product/nature-inspired-computation-and-
swarm-intelligence-algorithms-theory-and-applications-1st-edition-xin-
she-yang-editor/
textboxfull.com
Nature Inspired Computation in Engineering 1st Edition
Xin-She Yang (Eds.)

https://textbookfull.com/product/nature-inspired-computation-in-
engineering-1st-edition-xin-she-yang-eds/

textboxfull.com

Nature Inspired Design of Hybrid Intelligent Systems 1st

Edition Patricia Melin

https://textbookfull.com/product/nature-inspired-design-of-hybrid-
intelligent-systems-1st-edition-patricia-melin/

textboxfull.com

Nature Inspired Optimization Techniques for Image

Processing Applications Jude Hemanth

https://textbookfull.com/product/nature-inspired-optimization-
techniques-for-image-processing-applications-jude-hemanth/

textboxfull.com

Nature-Inspired Optimizers: Theories, Literature Reviews

and Applications Seyedali Mirjalili

https://textbookfull.com/product/nature-inspired-optimizers-theories-
literature-reviews-and-applications-seyedali-mirjalili/

textboxfull.com

Advances in Nature and Biologically Inspired Computing

Proceedings of the 7th World Congress on Nature and
Biologically Inspired Computing NaBIC2015 in
Pietermaritzburg South Africa held December 01 03 2015 1st
https://textbookfull.com/product/advances-in-nature-and-biologically-
Edition Nelishia Pillay
inspired-computing-proceedings-of-the-7th-world-congress-on-nature-
and-biologically-inspired-computing-nabic2015-in-pietermaritzburg-
south-africa-held-december-01-0/
textboxfull.com
Discrete Problems in Nature
Inspired Algorithms
Discrete Problems in Nature
Inspired Algorithms

Anupam Shukla
Ritu Tiwari
CRC Press
Taylor & Francis Group
6000 Broken Sound Parkway NW, Suite 300
Boca Raton, FL 33487-2742

© 2018 by Taylor & Francis Group, LLC

CRC Press is an imprint of Taylor & Francis Group, an Informa business

No claim to original U.S. Government works

Printed on acid-free paper

International Standard Book Number-13: 978-1-1381-9606-3 (Hardback)

This book contains information obtained from authentic and highly regarded sources. Reasonable efforts have been made to
publish reliable data and information, but the author and publisher cannot assume responsibility for the validity of all materials or
the consequences of their use. The authors and publishers have attempted to trace the copyright holders of all material reproduced
in this publication and apologize to copyright holders if permission to publish in this form has not been obtained. If any copyright
material has not been acknowledged please write and let us know so we may rectify in any future reprint.

Except as permitted under U.S. Copyright Law, no part of this book may be reprinted, reproduced, transmitted, or utilized in any
form by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying, microfilming, and
recording, or in any information storage or retrieval system, without written permission from the publishers.

For permission to photocopy or use material electronically from this work, please access www.copyright.com (http://www.
copyright.com/) or contact the Copyright Clearance Center, Inc. (CCC), 222 Rosewood Drive, Danvers, MA 01923, 978-750-8400.
CCC is a not-for-profit organization that provides licenses and registration for a variety of users. For organizations that have been
granted a photocopy license by the CCC, a separate system of payment has been arranged.

Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are used only for
identification and explanation without intent to infringe.
Visit the Taylor & Francis Web site at
http://www.taylorandfrancis.com

and the CRC Press Web site at

http://www.crcpress.com
Contents

Foreword I ......................................................................................................................................xv
Foreword II.................................................................................................................................. xvii
Foreword III ..................................................................................................................................xix
Preface ............................................................................................................................................xxi
Acknowledgments .................................................................................................................... xxiii
Authors .........................................................................................................................................xxv

1. Introduction to Optimization Problems .............................................................................1

1.1 Introduction ...................................................................................................................1
1.1.1 Artificial Intelligence ....................................................................................2
1.1.2 Soft Computing .............................................................................................3
1.1.3 Intelligent Systems ........................................................................................3
1.1.4 Expert Systems...............................................................................................4
1.1.5 Inference Systems ..........................................................................................4
1.1.6 Machine Learning .........................................................................................5
1.1.7 Adaptive Learning ........................................................................................5
1.1.8 Related Work Done ....................................................................................... 6
1.1.8.1 Heuristics ........................................................................................6
1.1.8.2 Meta-Heuristics ..............................................................................6
1.1.8.3 Hyper-Heuristics............................................................................7
1.1.8.4 Nature-Inspired Computation ..................................................... 7
1.1.8.5 Multiagent System .........................................................................9
1.1.8.6 Multiagent Coordination .............................................................. 9
1.1.8.7 Multiagent Learning ....................................................................10
1.1.8.8 Learning in Uncertainty ..............................................................10
1.1.8.9 Knowledge Acquisition in Graph-Based Problems
Knowledge ....................................................................................10
1.2 Combinatorial Optimization Problems.................................................................... 11
1.2.1 Traveling Salesman Problem ..................................................................... 12
1.2.2 Assignment Problem .................................................................................. 12
1.2.3 Quadratic Assignment Problem ................................................................13
1.2.4 Quadratic Bottleneck Assignment Problem ............................................ 14
1.2.5 0/1 Knapsack Problem ............................................................................... 14
1.2.6 Bounded Knapsack Problem ..................................................................... 15
1.2.7 Unbounded Knapsack Problem ................................................................ 15
1.2.8 Multichoice Multidimensional Knapsack Problem ................................ 16
1.2.9 Multidemand Multidimensional Knapsack Problem ............................ 16
1.2.10 Quadratic Knapsack Problem.................................................................... 16
1.2.11 Sharing Knapsack Problem ........................................................................ 17
1.2.12 Corporate Structuring................................................................................. 17
1.2.13 Sequential Ordering Problem .................................................................... 18
1.2.14 Vehicle Routing Problem ............................................................................ 18
1.2.15 Constrained Vehicle Routing Problem ..................................................... 18
1.2.16 Fixed Charge Transportation Problem ..................................................... 19

v
vi Contents

1.2.17 Job Scheduling .............................................................................................19

1.2.18 One-Dimensional Bin Packing Problem .................................................. 20
1.2.19 Two-Dimensional Bin Packing Problem .................................................. 20
1.3 Graph-Based Problems ............................................................................................... 21
1.3.1 Graph Coloring Problem .............................................................................. 21
1.3.2 Path Planning Problem ................................................................................. 21
1.3.3 Resource Constraint Shortest Path Problem .............................................. 22
1.4 Aim of This Book.........................................................................................................22
1.5 Summary ......................................................................................................................22
Solved Examples ....................................................................................................................23
Exercises ..................................................................................................................................25
References ...............................................................................................................................26

2. Particle Swarm Optimization .............................................................................................29

2.1 Introduction .................................................................................................................29
2.2 Traditional Particle Swarm Optimization Algorithm ............................................ 30
2.3 Variants of Particle Swarm Optimization Algorithm ............................................ 31
2.3.1 Sequential Particle Swarm Optimization Algorithm ................................ 32
2.3.1.1 Random Propagation ...................................................................32
2.3.1.2 Adaptive Schema for Sequential Particle Swarm
Optimization Algorithm .............................................................33
2.3.1.3 Convergence Criterion ................................................................33
2.3.2 Inertia Weight Strategies in Particle Swarm Optimization Algorithm ......34
2.3.2.1 Constant Inertia Weight ..............................................................34
2.3.2.2 Random Inertia Weight ...............................................................34
2.3.2.3 Adaptive Inertia Weight ..............................................................34
2.3.2.4 Sigmoid Increasing Inertia Weight ............................................ 35
2.3.2.5 Sigmoid Decreasing Inertia Weight ........................................... 35
2.3.2.6 Linear Decreasing Inertia Weight .............................................. 35
2.3.2.7 The Chaotic Inertia Weight ......................................................... 35
2.3.2.8 Chaotic Random Inertia Weight................................................. 36
2.3.2.9 Oscillating Inertia Weight ........................................................... 36
2.3.2.10 Global–Local Best Inertia Weight............................................... 36
2.3.2.11 Simulated Annealing Inertia Weight ......................................... 36
2.3.2.12 Logarithm Decreasing Inertia Weight ....................................... 37
2.3.2.13 Exponent Decreasing Inertia Weight ......................................... 37
2.3.3 Fine Grained Inertia Weight Particle Swarm Optimization
Algorithm ................................................................................................... 37
2.3.4 Double Exponential Self-Adaptive Inertia Weight Particle
Swarm Optimization Algorithm..................................................................38
2.3.5 Double Exponential Dynamic Inertia Weight Particle Swarm
Optimization Algorithm ...............................................................................39
2.3.6 Adaptive Inertia Weight Particle Swarm Optimization Algorithm........40
2.3.7 Chaotic Inertial Weight Approach in Particle Swarm
Optimization Algorithm ...............................................................................41
2.3.7.1 Application of Chaotic Sequences in Particle Swarm
Optimization Algorithm .............................................................41
2.3.7.2 Crossover Operation ....................................................................42
Contents vii

2.3.8 Distance-Based Locally Informed Particle Swarm

Optimization Algorithm ............................................................................42
2.3.8.1 Fitness Euclidean-Distance Ratio Particle Swarm
Optimization ................................................................................42
2.3.9 Speciation-Based Particle Swarm Optimization .....................................43
2.3.10 Ring Topology Particle Swarm Optimization .........................................43
2.3.11 Distance-Based Locally Informed Particle Swarm .................................43
2.3.12 Inertia-Adaptive Particle Swarm Optimization Algorithm with
Particle Mobility Factor ..............................................................................45
2.3.13 Discrete Particle Swarm Optimization Algorithm ................................. 46
2.3.14 Particle Swarm Optimization Algorithm for Continuous
Applications .................................................................................................47
2.4 Convergence Analysis of Particle Swarm Optimization Algorithm.................... 48
2.5 Search Capability of Particle Swarm Optimization Algorithm ............................ 49
2.6 Summary ......................................................................................................................49
Solved Examples ....................................................................................................................50
Exercises ..................................................................................................................................55
References ...............................................................................................................................56

3. Genetic Algorithms ..............................................................................................................57

3.1 Introduction .................................................................................................................57
3.2 Encoding Schemes ......................................................................................................59
3.2.1 Continuous Value Encoding ...................................................................... 59
3.2.2 Binary Encoding ..........................................................................................60
3.2.3 Integer Encoding .........................................................................................60
3.2.4 Value Encoding or Real Encoding ............................................................61
3.2.5 Tree Encoding ..............................................................................................61
3.2.6 Permutation Encoding................................................................................61
3.3 Selection ........................................................................................................................62
3.3.1 Roulette Wheel Selection............................................................................63
3.3.2 Rank Selection..............................................................................................63
3.3.3 Tournament Selection .................................................................................64
3.3.4 Steady-State Selection .................................................................................64
3.3.5 Random Selection ........................................................................................64
3.4 Crossover ......................................................................................................................64
3.4.1 Single Point Crossover................................................................................64
3.4.2 N Point Crossover ....................................................................................... 65
3.4.3 Uniform Crossover...................................................................................... 65
3.4.4 Arithmetic Crossover.................................................................................. 65
3.4.5 Tree Crossover .............................................................................................66
3.4.6 Order Changing Crossover ........................................................................ 66
3.4.7 Shuffle Crossover ........................................................................................ 66
3.5 Mutation .......................................................................................................................66
3.5.1 Inversion Mutation .....................................................................................67
3.5.2 Insertion Mutation ......................................................................................67
3.5.3 Displacement Mutation ..............................................................................67
viii Contents

3.5.4 Reciprocal Exchange Mutation (Swap Mutation) ...................................68

3.5.5 Shift Mutation ..............................................................................................68
3.6 Similarity Template................................................................................................... 68
3.7 Building Blocks .........................................................................................................69
3.8 Control Parameters ...................................................................................................70
3.9 Nontraditional Techniques in GAs......................................................................... 70
3.9.1 Genetic Programming ................................................................................. 71
3.9.2 Discrete Genetic Algorithms ...................................................................... 71
3.9.3 Genetic Algorithms for Continuous Applications .................................. 72
3.10 Convergence Analysis of Genetic Algorithms ...................................................... 72
3.11 Limitations and Drawbacks of Genetic Algorithms ............................................ 72
3.12 Summary ....................................................................................................................73
Solved Examples ....................................................................................................................73
Exercises ..................................................................................................................................78
References ...............................................................................................................................78

4. Ant Colony Optimization ...................................................................................................81

4.1 Introduction ...............................................................................................................81
4.2 Biological Inspiration ...............................................................................................81
4.2.1 Competition..................................................................................................82
4.2.2 High Availability .........................................................................................82
4.2.3 Brownian Motion.........................................................................................82
4.2.4 Pheromones and Foraging .........................................................................83
4.3 Basic Process and Flowchart ................................................................................... 84
4.4 Variants of Ant Colony Optimization .................................................................... 85
4.4.1 Ant System ...................................................................................................85
4.4.2 Ant Colony Optimization...........................................................................85
4.4.3 Best–Worst Ant System ............................................................................... 86
4.4.4 MAX–MIN Ant System ..............................................................................87
4.4.5 Rank-Based Ant System ............................................................................. 87
4.4.6 Ant-Q.............................................................................................................87
4.4.7 Hyper Cube Ant System .............................................................................88
4.4.8 Mean-Minded Ant Colony Optimization Algorithm .............................88
4.4.8.1 Mathematical Formulations for Mean-Minded
Ant Colony Optimization Algorithm........................................ 89
4.5 Applications...............................................................................................................90
4.6 Summary ....................................................................................................................91
Solved Examples ....................................................................................................................91
Exercises ..................................................................................................................................93
References ...............................................................................................................................93

5. Bat Algorithm ........................................................................................................................95

5.1 Biological Inspiration ...............................................................................................95
5.2 Algorithm ...................................................................................................................95
5.3 Related Work ............................................................................................................. 96
Solved Examples ..................................................................................................................105
Exercises ................................................................................................................................106
References .............................................................................................................................107
Contents ix

6. Cuckoo Search Algorithm .................................................................................................109

6.1 Introduction ...............................................................................................................109
6.2 Traditional Cuckoo Search Optimization Algorithm ........................................... 110
6.3 Variants of Cuckoo Search Algorithm .................................................................... 112
6.3.1 Modified Cuckoo Search ............................................................................. 113
6.3.2 Improved Cuckoo Search Algorithm with Adaptive Method............... 113
6.3.3 Multiobjective Cuckoo Search Algorithm for Design
Optimization....................................................................................... 115
6.3.3.1 Pareto Front ................................................................................... 116
6.3.4 Gradient-Based Cuckoo Search for Global Optimization ...................... 117
6.4 Applications ............................................................................................................... 118
6.4.1 Recognition of Parkinson Disease ............................................................. 118
6.4.2 Practical Design of Steel Structures ........................................................... 118
6.4.3 Manufacturing Optimization Problems ................................................... 119
6.4.4 Business Optimization ................................................................................ 119
6.4.5 Optimized Design for Reliable Embedded System ................................ 119
6.4.6 Face Recognition ..........................................................................................120
6.5 Summary and Concluding Remarks ......................................................................121
Solved Examples ..................................................................................................................122
Exercises ................................................................................................................................123
References .............................................................................................................................124

7. Artificial Bee Colony ..........................................................................................................127

7.1 Introduction ...............................................................................................................127
7.2 Biological Inspiration................................................................................................127
7.3 Swarm Behavior ........................................................................................................128
7.3.1 ABC Algorithm.............................................................................................130
7.4 Various Stages of Artificial Bee Colony Algorithm .............................................. 131
7.5 Related Work..............................................................................................................132
Solved Examples ..................................................................................................................141
Exercises ................................................................................................................................142
References .............................................................................................................................143

8. Shuffled Frog Leap Algorithm .........................................................................................145

8.1 Introduction ...............................................................................................................145
8.2 Related Work Done ................................................................................................... 146
8.2.1 Discrete Shuffled Flog Leaping Algorithm .............................................. 150
8.2.2 Quantum Shuffled Frog Leaping Algorithm ........................................... 151
Solved Questions .................................................................................................................157
Unsolved Questions ............................................................................................................158
References .............................................................................................................................159

9. Brain Storm Swarm Optimization Algorithm...............................................................161

9.1 Introduction ...............................................................................................................161
9.2 Brain Storm Optimization........................................................................................161
9.2.1 Brain Storm Optimization Algorithm ....................................................... 162
9.3 Related Work in Brain Storm Optimization and Other Contemporary
Algorithms .................................................................................................................164
x Contents

9.4 Hybridization of Brain Storm Optimization with Probabilistic

Roadmap Method Algorithm................................................................................166
9.5 Conclusion ...............................................................................................................174
9.6 Future Scope ............................................................................................................174
Solved Examples ..................................................................................................................174
Exercises ................................................................................................................................175
References .............................................................................................................................175

10. Intelligent Water Drop Algorithm ...................................................................................179

10.1 Intelligent Water Drop Algorithm ........................................................................ 179
10.1.1 Inspiration and Traditional Intelligent Water Drop Algorithm ........179
10.2 Intelligent Water Drop Algorithm for Discrete Applications ...........................181
10.2.1 Intelligent Water Drop Algorithm for an Optimized
Route Search ........................................................................................ 182
10.2.2 Intelligent Water Drop Algorithm Convergence and Exploration ..... 185
10.3 Variants of Intelligent Water Drop Algorithm .................................................... 186
10.3.1 Adaptive Intelligent Water Drop Algorithm ....................................... 186
10.3.2 Same Sand for Both Parameters (SC1) .................................................187
10.3.3 Different Sand for Parameters Same Intelligent Water Drop
Can Carry Both (SC2) .............................................................................188
10.3.4 Different Sand for Parameters Same Intelligent Water Drop
Cannot Carry Both (SC3)........................................................................189
10.4 Scope of Intelligent Water Drop Algorithm for Numerical Analysis ..............190
10.5 Intelligent Water Drop Algorithm Exploration and Deterministic
Randomness ............................................................................................................190
10.6 Related Applications ..............................................................................................190
10.7 Summary ..................................................................................................................193
Solved Question ...................................................................................................................194
Unsolved Questions ............................................................................................................194
References .............................................................................................................................195

11. Egyptian Vulture Algorithm .............................................................................................197

11.1 Introduction .............................................................................................................197
11.2 Motivation ...............................................................................................................197
11.3 History and Life Style of Egyptian Vulture ........................................................ 198
11.4 Egyptian Vulture Optimization Algorithm ......................................................... 199
11.4.1 Pebble Tossing .........................................................................................200
11.4.2 Rolling with Twigs ..................................................................................202
11.4.3 Change of Angle ......................................................................................203
11.4.4 Brief Description of the Fitness Function.............................................204
11.4.5 Adaptiveness of the Egyptian Vulture Optimization Algorithm ..... 204
11.5 Applications of the Egyptian Vulture Optimization Algorithm ...................... 204
11.5.1 Results of Simulation of Egyptian Vulture Optimization
Algorithm over Speech and Gait Set ....................................................204
Exercises ................................................................................................................................207
Solved Questions .................................................................................................................207
References ............................................................................................................................. 211
Contents xi

12. Biogeography-Based Optimization ................................................................................. 213

12.1 Introduction .............................................................................................................213
12.2 Biogeography ..........................................................................................................214
12.3 Biogeography Based Optimization ......................................................................216
12.3.1 Migration ..................................................................................................216
12.3.2 Mutation ...................................................................................................217
12.4 Biogeography-Based Optimization Algorithm .................................................. 218
12.5 Differences between Biogeography-Based Optimization and Other
Population-Based Optimization Algorithm........................................................ 219
12.6 Pseudocode of the Biogeography-Based Optimization Algorithm ................. 221
12.6.1 Some Modified Biogeography-Based Optimization
Approaches ..................................................................................... 221
12.6.1.1 Blended Biogeography-Based Optimization .....................221
12.6.1.2 Biogeography-Based Optimization with Techniques
Borrowed from Evolutionary Strategies ............................ 222
12.6.1.3 Biogeography-Based Optimization with Immigration
Refusal .....................................................................................222
12.6.1.4 Differential Evolution Combined with
Biogeography-Based Optimization ....................................222
12.7 Applications of Biogeography-Based Optimization..........................................223
12.7.1 Biogeography-Based Optimization for the Traveling
Salesman Problem ................................................................................... 223
12.7.2 Biogeography-Based Optimization for the Flexible Job
Scheduling Problem ................................................................................ 224
12.7.3 Biogeography-Based Optimization of Neuro-Fuzzy System;
Parameters for the Diagnosis of Cardiac Disease ............................... 224
12.7.4 Biogeography-Based Optimization Technique for Block-Based
Motion Estimation in Video Coding..................................................... 225
12.7.5 A Simplified Biogeography-Based Optimization Using
a Ring Topology.......................................................................................225
12.7.6 Satellite Image Classification .................................................................225
12.7.7 Feature Selection......................................................................................225
12.8 Convergence of Biogeography-Based Optimization for Binary Problems.....226
Solved Questions .................................................................................................................226
Unsolved Questions ............................................................................................................228
References .............................................................................................................................229

13. Invasive Weed Optimization ............................................................................................231

13.1 Invasive Weed Optimization................................................................................. 231
13.1.1 Invasive Weed Optimization Algorithm in General .......................... 232
13.1.2 Modified Invasive Weed Optimization Algorithm ............................ 233
13.2 Variants of Invasive Weed Optimization ............................................................ 233
13.2.1 Modified Invasive Weed Optimization Algorithm with Normal
Distribution for Spatial Dispersion.......................................................234
13.2.2 Discrete Invasive Weed Optimization in General .............................. 237
xii Contents

13.3 Invasive Weed Optimization Algorithm for Continuous Application ...........237

13.3.1 Invasive Weed Optimization for Mathematical Equations ............... 237
13.3.2 Discrete Invasive Weed Optimization Algorithm for
Discrete Applications..............................................................................238
13.3.2.1 Invasive Weed Optimization Algorithm Dynamics
and Search ..............................................................................238
13.3.2.2 Hybrid of IWO and Particle Swarm Optimization
for Mathematical Equations.................................................238
13.4 Related Work ...........................................................................................................239
13.5 Summary ..................................................................................................................242
Solved Questions .................................................................................................................243
Unsolved Questions ............................................................................................................243
References .............................................................................................................................244

14. Glowworm Swarm Optimization ....................................................................................245

14.1 Introduction .............................................................................................................245
14.1.1 The Algorithm Description .................................................................... 246
14.2 Variants of Glowworm Swarm Optimization Algorithm ................................. 249
14.2.1 Hybrid Coevolutionary Glowworm Swarm Optimization
(HCGSO)...................................................................................................249
14.2.1.1 Transformation of the Problem ........................................... 250
14.2.1.2 The Process of HCGSO .........................................................250
14.2.2 Glowworm Swarm Optimization with Random
Disturbance Factor ..................................................................................251
14.2.3 Glowworm Swarm Optimization Algorithm Based on
Hierarchical Multisubgroup .................................................................. 251
14.2.3.1 Improved Logistic Map ........................................................252
14.2.3.2 Adaptive Step Size ................................................................252
14.2.3.3 Selection and Crossover ....................................................... 252
14.2.3.4 Hybrid Artificial Glowworm Swarm Optimization
Algorithm ...............................................................................253
14.2.4 Particle Glowworm Swarm Optimization ...........................................253
14.2.4.1 Parallel Hybrid Mutation .....................................................254
14.2.4.2 Local Searching Strategy ...................................................... 254
14.2.4.3 Particle Glowworm Swarm Optimization Algorithm ..... 255
14.2.5 Glowworm Swarm Optimization Algorithm-Based Tribes .............. 256
14.2.5.1 Tribal Structure ...................................................................... 256
14.2.5.2 The Glowworm Swarm Optimization
Algorithm-Based Tribes........................................................256
14.2.6 Adaptive Neighborhood Search’s Discrete Glowworm Swarm
Optimization Algorithm.........................................................................258
14.2.6.1 Adaptive Neighborhood Search’s Discrete
Glowworm Swarm Optimization Algorithm and
Its Application to Travelling Salesman Problem .............. 258
14.2.6.2 Some Other Features of the Algorithm .............................. 260
14.2.6.3 Adaptive Neighborhood Search’s Discrete
Glowworm Swarm Optimization Algorithm Steps ......... 260
Contents xiii

14.3 Convergence Analysis of Glowworm Swarm Optimization Algorithm ........ 261

14.4 Applications of Glowworm Swarm Optimization Algorithms ....................... 261
14.4.1 Hybrid Artificial Glowworm Swarm Optimization for
Solving Multidimensional 0/1 Knapsack Problem ............................ 262
14.4.2 Glowworm Swarm Optimization Algorithm for
K-Means Clustering ................................................................................262
14.4.3 Discrete Glowworm Swarm Optimization Algorithm for
Finding Shortest Paths Using Dijkstra Algorithm and
Genetic Operators ...................................................................................263
14.4.3.1 Labeling Method ...................................................................263
14.4.3.2 Roulette Selection Strategy ..................................................263
14.4.3.3 Single-Point Crossover Strategy..........................................264
14.4.3.4 Mutation Strategy..................................................................264
14.4.3.5 Procedure of Glowworm Swarm Optimization
Algorithm for Finding Shortest Paths ................................264
14.5 Search Capability of Glowworm Swarm Optimization Algorithm ................265
14.6 Summary ..................................................................................................................265
Solved Examples ..................................................................................................................266
Exercises ................................................................................................................................268
References .............................................................................................................................269

15. Bacteria Foraging Optimization Algorithm ...................................................................271

15.1 Introduction .............................................................................................................271
15.2 Biological Inspiration .............................................................................................271
15.3 Bacterial Foraging Optimization Algorithm ....................................................... 272
15.3.1 Chemotaxis...............................................................................................274
15.3.2 Swarming .................................................................................................274
15.3.3 Reproduction ...........................................................................................275
15.3.4 Elimination and Dispersal .....................................................................275
15.4 Variants of Bacterial Foraging Optimization Algorithm with Applications .....276
Solved Questions .................................................................................................................279
Unsolved Questions ............................................................................................................281
References .............................................................................................................................281

16. Flower Pollination Algorithm ..........................................................................................283

16.1 Introduction .............................................................................................................283
16.2 Flower Pollination ..................................................................................................283
16.2.1 Pollination ................................................................................................283
16.2.2 Self-Pollination ........................................................................................284
16.2.3 Cross-Pollination .....................................................................................284
16.3 Characteristics of Flower Pollination ...................................................................285
16.4 Flower Pollination Algorithm ...............................................................................285
16.5 Multiobjective Flower Pollination Algorithm .................................................... 287
xiv Contents

16.6 Variants of Flower Pollination Algorithm ........................................................... 288

16.6.1 Modified Flower Pollination Algorithm for Global Optimization ..... 288
16.6.2 Elite Opposition-Based Flower Pollination Algorithm...................... 292
16.6.2.1 Global Elite Opposition-Based Learning Strategy ...........292
16.6.2.2 Local Self-Adaptive Greedy Strategy .................................292
16.6.2.3 Dynamic Switching Probability Strategy...........................292
16.7 Application of Flower Pollination Algorithm .................................................... 292
16.7.1 The Single-Objective Flower Pollination Algorithm .......................... 292
16.7.2 The Multiobjective Flower Pollination Algorithm ............................. 293
16.7.3 The Hybrid Flower Pollination Algorithm .......................................... 293
16.8 Conclusion ...............................................................................................................294
Solved Questions .................................................................................................................294
Unsolved Questions ............................................................................................................295
References .............................................................................................................................296
Index .............................................................................................................................................299
Foreword I

Nature-inspired algorithms are currently gaining increasing popularity for their

widespread applications in diverse domains of scientific and engineering optimization
problems. There exists a vast literature on nature-inspired algorithms, spread across scien-
tific journals, conference proceedings, and so on. Unfortunately, I did not come across any
book covering all aspects of nature-inspired algorithms. This book by Professor Anupam
Shukla and Dr. Ritu Tiwari fills this void. It covers almost all the aspects of nature-inspired
algorithms in a single, precise, and resourceful volume.
A lot of promising nature-inspired algorithms have emerged over the past two decades.
Particle swarm optimization, ant colony optimization, bat algorithm, artificial bee colony
algorithm, bacteria foraging optimization algorithm, shuffled frog-leaping algorithm,
cuckoo search algorithm, invasive weed optimization algorithm, and flower pollination
algorithm are just a few to mention in this regard. At this point, there is a need to educate
people about the principles, concepts, applications, issues, and solutions related to the use
of nature-inspired algorithms.
I am sure that this book will be of great contribution toward the same and would fur-
ther carve a deep mark in the nature-inspired algorithms literature for the reference of
enthusiasts. It is unique for its content, readability, and above all the presentation style.
This book includes both the theoretical foundations along with a variety of applications
that further help in understanding the different nature-inspired algorithms. It is always
considered to be good to have a practical component attached to the courses whose per-
formance ultimately reflects the overall understanding of the students. Ample coverage of
applications, issues, and perspectives, makes this book rich and diverse. This book will be
very useful for the students, academicians, and researchers studying/working in the field
related to nature-inspired algorithms. It would be equally useful to researchers migrating
from mathematics and other disciplines to computer science.

Amit Konar
Jadavpur University, Kolkata

xv
Foreword II

This book provides a systematic introduction to most of the popular nature-inspired

algorithms for optimization, including particle swarm optimization, ant colony optimi-
zation, bat algorithm, artificial bee colony algorithm, shuffled frog-leaping algorithm,
invasive weed optimization algorithm, flower pollination algorithm, and so on.
Nature-inspired computation is one of the most promising areas of research and has
a lot of scope in the near future as well. Nature-inspired algorithms have very diverse
application areas, which are growing steadily. Nature-inspired algorithms have in fact
become the most widely used optimization algorithms. This book covers the theoretical
background including extensive literature review of the nature-inspired algorithms and
the practical implementations of these algorithms for solving various discrete optimiza-
tion problems.
This book will definitely be useful as a reference book on nature-inspired algorithms for
graduates, postgraduates, doctoral students, researchers, and even faculties in computer
science, engineering, and natural sciences.

P.N. Suganthan
Nanyang Technological University

xvii
Foreword III

Combinatorial optimization forms an important area under theoretical computer science

and applied mathematics with several industrial applications and it aims at identifying an
optimal solution from a finite set of solutions. The solutions are normally discrete or can be
formed into discrete structures. In most of such problems, the exhaustive search becomes
intractable, necessitating various forms of intelligent search and optimization. This book—
Discrete Problems in Nature Inspired Algorithms, authored by Professor Anupam Shukla and
Dr. Ritu Tiwari—comprises a great treatise on solving the usually NP-complete combina-
torial optimization problems by using various nature-inspired metaheuristic algorithms.
Starting with a lucid introduction to various combinatorial optimization scenarios, the
author has aptly guided the reader through a comprehensive journey of the development
of the metaheuristics, their qualitative advantages and downsides, and applicability to
various related problem domains. The exposure of the material is lucid. Quite compli-
cated concepts are presented in a clear and convincing way, which can be attributed to the
expertise of the author.
Finally, I must conclude that this is a very timely volume with a well-compiled expo-
sure of the cutting edge research on and with nature-inspired discrete optimization algo-
rithms. I am quite sure that the researchers and practitioners from the related fields will
be immensely benefitted from this book.

Swagatam Das
Indian Statistical Institute, Kolkata

xix
Preface

Nature has been a constant source of inspiration for scientists since centuries. Various
laws and theories have been formulated by observing the different phenomena that occur
in nature. Nature-inspired algorithms is an area inspired by natural processes; in the recent
past, many algorithms have been developed taking inspiration from certain biological,
geographical, and chemical processes that take place in the natural world. Nature-inspired
algorithms have the immense potential for optimizing complex real-world problems and
have been applied in various areas. In the past two decades, plethora of new and promis-
ing nature-inspired algorithms has been introduced. The highly multidisciplinary nature
of the field further has attracted a number of researchers. There is a mammoth of litera-
ture available in the field of nature-inspired algorithms. The current literature covers the
theoretic concepts, but the practical applications might still be very difficult for students to
comprehend and implement. Many students find it difficult to visualize the application of
nature-inspired algorithms from theoretical text.
This book not only helps them in understanding these algorithms but also exposes them
to the current developments over various related fields. This empowers them to pursue
research in these areas and contribute toward research and development at large. The
main purpose of this book is to explain the nature-inspired algorithms theoretically and
in terms of their practical applications to real-world problems to the readers. This will
enable them to get an in-depth, practical exposure to the methodology of the application
of the nature-inspired algorithms in various situations.
This book can also be used as a standard text or reference book for courses related to
nature-inspired algorithms, evolutionary algorithms, and so on. This book may be referred
for the purpose of elementary and advanced studies as it introduces the basic concepts of
nature-inspired computing and then also discusses some state-of-the-art variants of those
basic algorithms and then finally explains their practical examples. This book also incor-
porates some of the recent developments over various areas.

Salient Features
• Introduction to the world of nature-inspired computing
• Foundations of the basic nature-inspired algorithms
• Detailed description of the problem and solution
• Information on recent developments in the various nature-inspired algorithms
• Interdisciplinary applications of the nature-inspired algorithms

xxi
xxii Preface

Intended Readers
• Students of undergraduate, postgraduate, doctorate, and postdoctorate levels can
refer this book as a text or reference book for nature-inspired algorithms.
• Researchers can refer this book to obtain a good insight into the recent develop-
ments in the field of nature-inspired algorithms.

Origin of This Book

This book is a result of the continuous research done over the time by the authors. Much of
the work presented is done by the authors themselves. Databases to the various problems
have either been self-generated by the authors or used from the public database reposi-
tories. At some places, the authors have also included a comprehensive discussion of the
problems and the solutions present in the literature. This is a result of the efforts put in by
various students of the ABV-Indian Institute of Information Technology and Management,
Gwalior, India, in forms of projects: B.Tech, M.Tech, and PhD theses.
Acknowledgments

This book is our yet another step into the world of authored books. It began as a dream to
use our past research as a base to create a landmark into the world of nature-inspired com-
puting. It is natural that the dream required a lot of encouragement, guidance, and sup-
port that were provided by numerous people in various phases of this book. The authors
acknowledge all those people who made this possible.
The authors thank Professor S.G. Deshmukh, director, ABV-IIITM, Gwalior, India, for
extending all sorts of help and support during the course of writing this book. This book
would not have been initiated without his encouragement and support.
The authors thank Professor. Amit Konar, Professor P.N. Suganthan, and Professor
Swagatam Das for writing the foreword for this book. Their precious words have added a
greater charm to this book. The authors further express their thanks to Dr. A.S. Zadgaonkar,
ex-vice-chancellor, Dr. C.V. Raman University, Bilaspur, India, for the guidance and moti-
vation that he has bestowed during the entire course of work with the authors.
This book would have never been possible without the pioneering work carried out by
the coresearchers associated with the authors. The authors also thank the student fraternity
of the Institute for taking deep interest into the courses titled “Special Topics in Intelligent
Systems” and “Soft Computing.” Their interest to learn beyond the classroom program has
been the key motivation for this book. The authors are highly indebted to all the students
who undertook challenging problems as a part of their thesis and came up with excel-
lent solutions and experimental results. The authors thank their PhD students Sanjeev
Sharma, Apoorva Mishra, and Saumil Maheshwari for their constant support during each
phase of this book. The authors thank their postgraduation students Prashant Shrivastava,
Chiranjib Sur, Annupriya, Riya Naval, Alok Sharma, Prashant Pandey, Harshita Lalwani,
and others for the quality results they produced during their course of work with the
authors. The authors further thank Pritesh Tiwari for helping in editing some parts of the
manuscript.
The first author thanks his son Apurv Shukla for his support during the course of
writing this book. The second author thanks her mother Parvati Tiwari and her late aunt
Dr. Asha Shukla for motivation and blessings for writing this book.
This book required a lot of work by numerous people around the globe. The authors
thank the entire staff of Taylor & Francis Group and all the associated units who have
worked over different phases of this book. The authors thank all the people who have been
associated with and have contributed to this book. Above all, we all thank the Almighty for
his constant blessings and love. Without Him, this project would not have been possible.

xxiii
Authors

Prof. Anupam Shukla is currently a professor in the Department of Information and

Communication Technology (ICT) at ABV-Indian Institute of Information Technology
and Management (ABV-IIITM), Gwalior, India. He has 29 years of administrative,
research, and teaching experience. He is globally renowned for his research on artificial
intelligence and robotics, which has won him several academic accolades and resulted in
collaborations with academicians across the world.
He has been awarded “Distinguished Professor” by Computer Society of India, Mumbai,
2017; “Dewang Mehta National Education Award” for best Professor, 2016; “Professor Rais
Ahmed Memorial Award,” Acoustical Society of India in 2015; Engineering Professor
of the Month, Higher Education Review, India, 2014; “Best Paper Award,” Institute of
Engineers, India, 2006; University Gold Medal (Valedictorian) from Jadavpur University,
Kolkata, India, 1998, for scoring highest marks at master’s level; and “Young Scientist
Award,” Madhya Pradesh Council of Science and Technology, Bhopal, 1995.
He is the author of three patents, three books titled: (1) Real Life Applications of Soft
Computing, Taylor & Francis; (2) Intelligent Planning for Mobile Robotics: Algorithmic Approaches,
IGI Global; and (3) Towards Hybrid and Adaptive Computing: A Perspective, Springer–Verlag
Publishers, editor of three books published by IGI Global Press, United States, and mentor
of 17 doctorate and 106 postgraduate theses. He has 174 peer-reviewed publications and
is a reviewer of various international journals, including ACM Computing Review, IEEE
Transactions on Information Technology in Biomedicine, and Elsevier Neurocomputing journal.
He has successfully completed 13 government-sponsored projects, aimed at developing IT
applications for Indian farmers, skill development of the Indian youth and infrastructure
development at parent institutes, and so on. He is currently a nominated expert member
of the accreditation committee of National Board of Accreditation, India. At NIT Raipur, he
was the founding Head of the Department (HOD) of departments of biomedical engineer-
ing and biotechnology engineering and the founding coordinator of the Chhattisgarh–IIT
Kanpur Knowledge Sharing Program, a first of its kind e-learning program in India.

Dr. Ritu Tiwari is an associate professor (Department of Information and Communi-

cations Technology) at ABV-IIITM, Gwalior, India. She has 15 years of teaching and
research experience, which includes 10 years of post PhD teaching and research experi-
ence. Her field of research includes robotics, artificial intelligence, soft computing, and
applications (biometrics, biomedical, and prediction).
She has two patents in her name and has authored three books titled: (1) Real Life
Applications of Soft Computing, Taylor & Francis; (2) Intelligent Planning for Mobile Robotics:
Algorithmic Approaches, IGI Global; and (3) Towards Hybrid and Adaptive Computing: A
Perspective, Springer–Verlag Publishers. She has also edited two books in the area of bio-
medical engineering from IGI Global. She has supervised 7 PhD students and more than
100 master’s students and has published 104 research papers in various national and inter-
national journals/conferences.

xxv
xxvi Authors

She has received “Young Scientist Award” from Chhattisgarh Council of Science &
Technology, India, in the year 2006. She has also received gold medal in her postgradu-
ation from National Institute of Technology (NIT), Raipur, India. She has completed 10
prestigious research projects sponsored by Department of science and technology (DST)
and Department of Information Technology (DIT), Government of India. She is currently
involved with the Government of India and is working on three sponsored research proj-
ects. She is a reviewer of various international journals, including ACM Computing Review,
IEEE Transactions on Information Technology in Biomedicine, Elsevier Journal of Biomedical
Informatics, and Elsevier Neurocomputing journal.
1
Introduction to Optimization Problems

1.1 Introduction
In the present world, we are obsessed with solving a huge number of problems. With the
progress of science and technology, humans have been able to tame some of them [1]. Due
to advancements in the field of automation, and knowing the fact that natural resources
are on the verge of exhaustion, scientists, today, are paying a lot of attention on the low
resource (regarding power, time, and occupancy) factor, which can be achieved through
optimization. Optimization can be achieved at many levels.
The discovery of nature-inspired computing and its allied optimization branches has
revolutionized computation and automation, the future of which lies in the hands of
machine learning and self-adaptive systems [2–4].
One might wonder, why adaptive learning systems? In a real-life environment, every
system is associated with some input and output mappings in which the inputs act as the
main decisive factor for the outputs. However, unless the system is carefully designed,
the range associated with the input and output data variables is highly unpredictable and
nonstationary, and there exist a large number of samples. In such a scenario, it becomes
a challenge for supervised learning to establish a nonlinear model, which can produce
correct judgment through the efficient processing of data and intelligent decision-making.
However, there always remain chances of deviation due to irregularities in the datasets.
Hence, there is a requirement for the system to adapt to the appearance of a new data and
the combination of situations.
This adaption is handled in various ways in various situations and it depends on the
mathematics of the algorithms. In this chapter, we will introduce techniques for such
kinds of adaption that are involved in nature-inspired metal-heuristics [5] on many
problems.
This work can be marked as an introduction to a bunch of bio-inspired computation tech-
niques, which can be readily applied to the graph-based and discrete optimization prob-
lems. Before moving further, the term discrete optimization problems should be explained
and illustrated so that you can have a clear idea of what kind or class of problems we are
referring to. Consider an equation of any straight line of the form y = mx + c. For any value
of x ∈ R, where R is the set of Real numbers, the value of y is valid and acceptable and this
is a simple continuous domain problem. There is no minimum or maximum value that
can be achieved due to the nonconvergence attitude of this equation. On the other hand,
an equation of the form y = |x12 | + |x22 | has a minimum value at zero and x1 , x2 both can have
any value in R. What if we say that the equation y = |x12 | + |x22 | also has a minimum value at
zero but x1 , x2 can only take integer values lying within Z, where Z is the set of Integers.

1
2 Discrete Problems in Nature Inspired Algorithms

This is what is referred to as the fundamental discrete optimization problem in which the
variable parameters take only integer values. However, this is not what we are looking
for. We are going for a generalized discrete optimization problem set, which will have the
above-mentioned kind of problems as special cases and we would not have to reformulate
our equations.
Now, optimization may mean different things for different types of problems. For
minimization as optimization of a function f, we have f ( x) ≤ f ( a) where ∀x ∈ S and S ⊆ B
where S denotes the allowed representations for x and B is the constraint for the vari-
able, which can be a domain or range or an integer value depending on the problem.
Here, a ∈ S and f ( a) = MIN( f ( x) : ∀x ∈ S ⊆ B and is called the optimized solution or the
global solution.

1.1.1 Artificial Intelligence

Artificial intelligence is defined as the capability of perfect sensing and intelligent
decision-making of a system, which facilitates complex jobs and is worthy of usage for
humankind and works under the influence of an external environment (virtual or real).
Artificial intelligence can also be defined as the capability of the performance of the sys-
tem, which cannot be achieved through a fixed sequence of instructions. Systems based
on a fixed sequence of instructions would be biased, and an optimal decision would not
be possible [6].
In other words, what artificial intelligence does is the same as done by a mechanical
machine and that is it makes life easy. Similar to machines, it helps in performing a very
complex task in the blink of an eye or with the press of a button. The same is done by a
simple computer program, but can we call it an artificial intelligence system? No, we can-
not! And there are several reasons for it. A simple computer program is just performing or
executing some instructions and, at any point in time, it does not take any decisions, and
it is not bothered whether the output generated is desired or not. As we are talking about
taking decisions, it is obvious that more than one outcome or combinations of outcomes is
involved, but the system will seek out the best or the optimized one (if it can, else it will let
one decision go and later find out whether it was the best or if it is the best among all) for
the given situation depending on some evaluation criteria. So, an intelligent system must
be able to make complex judgments consisting of multiple parameters and situations tak-
ing care of the constraints and rules. In modern times, intelligent systems are adaptive and
have the capability of learning from experience [6].
Consider the example of any search operation such as playing chess on a computer.
The feedback from the users (i.e., the move they make) acts as an influence for the system
to reproduce the optimal decision, which will make the game more interesting. Had the
system taken any random step, its reaction would not have been considered intelligent,
and the result of such a decision would have been a matter of probability and chance.
However, sometimes randomness appears to be more useful than more determinis-
tic approaches, especially when the combination of decisions is quite large and conse-
quently the cost (both regarding the computational complexity and time) of estimation
of fitness of such a decision is also huge. The purpose of adoption of random behavior in
many decision-making functions is to reduce the dimension or the number of possible
combinations for all the entities that are involved in the system. Another example is the
search engine that had revolutionized the ways of information storage and its retrieval
capability when the quantity of such information had grown boundless, and there was
Exploring the Variety of Random
Documents with Different Content
Elder’s people. il *$1.75 (2c) Houghton
20–5405

Through these stories of old New England we look into the hearts
of the country people, hear their gossip, learn to know their homely
religion, their superstitions, see the struggles they have with their
baser selves and glimpse their higher natures. We also learn to love
the sturdy souls that recur in all the stories and embody the best that
is in them all—Elder Perry, Old Steve, Miss Mahala, and others. The
stories are: The deacon’s whistle; A change of heart; A rural
telephone; The step-father; John-a-dreams; Miss Mahala’s miracle;
An old fiddler; The blessing called peace; Father James; The
impossible choice; A village dressmaker; Miss Mahala’s will; A life in
a night; Miss Mahala and Johnny.

“Undramatic, but interesting.”

+ Booklist 16:314 Je ’20

+ Lit D p102 O 23 ’20 1200w

“Mrs Spofford is not by any means a great craftsman, her

limitations are quite evident, but within her power—and she is never
unduly anxious to achieve what is beyond her—she provides some
interesting and entertaining bits of fiction.”

+ − N Y Evening Post p2 Ap 10 ’20 480w

“The series of short stories which makes up this chronicle contains

nothing particularly new or striking, but the tales have quite a good
deal of verisimilitude, and some of the characters are likable.”
 + N Y Times 25:198 Ap 18 ’20 280w
Outlook 124:657 Ap 14 ’20 20w

“Mrs Spofford has finely and strongly delineated a number of

choice spirits here whom one will not easily forget. She has also
incorporated much of the quiet humor of this type of people, and, all
in all, has presented here not an especially great book but a very
interesting one.”

+ Springf’d Republican p11a My 9 ’20

250w

SPRING RICE, SIR CECIL ARTHUR. Poems.

*$3 Longmans 821
20–17907

“Mr Bernard Holland reminds us in his preface that the late

ambassador to the United States published two books in his lifetime,
a book of verse with interludes in poetic prose ‘adapted from the
Persian’ and a prose version of a Persian love tale with a veiled
mystical meaning. Besides the Persian sonnets this volume contains
‘In memoriam, A. C. M. L.,’ and a number of miscellaneous
poems.”—The Times [London] Lit Sup

“His poems are like his personality and please us by some charm
which is not quite analysable. They are strangely different from the
work of most men of action. There are only a few poems in this book
which are absolutely bad, but, on the other hand, there is probably
none which is not marked by some flaw.”
 + − Spec 125:782 D 11 ’20 850w
+ Springf’d Republican p7a N 28 ’20 720w
(Reprinted from The Times [London] Lit
Sup O 14 ’20)
The Times [London] Lit Sup p654 O 7
’20 90w

“They are true poetry. The volume may not add one to the list of
great English sonnets; but the beauty and the sincerity of these claim
attention.”

+ The Times [London] Lit Sup p664 O 14

’20 720w

SPYRI, FRAU JOHANNA (HEUSSER).

Cornelli; tr. by Elisabeth P. Stork. (Stories all
children love ser.) il *$1.50 (3½c) Lippincott
20–17408

In his introduction to this story for children Charles Wharton

Stork regrets that its author should be known for one of her books
only, altho that one is the justly popular “Heidi.” In the present story,
he thinks “we find a deeper treatment of character, combined with
equal spirit and humor of a different kind.” It is the story of a happy-
hearted little Swiss girl who is changed into a sullen, morose and
unattractive child through the misunderstanding of two women in
whose care her father leaves her. A woman of different type, the
mother of a family of four, finds the secret of Cornelli’s unhappiness
and brings back the old sunny disposition.

“There is a breath of the mountain freshness which suggests

‘Heidi.’ The translation of the children’s speeches into formal English
gives them sometimes a rather stilted effect.”

+ − Booklist 17:163 Ja ’21

SPYRI, FRAU JOHANNA (HEUSSER). Toni,

the little wood-carver; tr. by Helen B. Dole. il *$1 (9c)
Crowell
20–15071

From earliest childhood Toni had carved animals out of wood and
his dearest ambition is to be a wood-carver. But the cost of
instruction is beyond his mother’s means and he is sent up into the
mountains to herd the farmer’s cows. Here, overcome by the
loneliness, he breaks down and falls into a lethargy from which
nothing arouses him. He is taken to a great sanitarium where he
finally recovers and finds a good friend who provides the money for
the desired training.

Wis Lib Bul 16:199 N ’20 90w

 SQUIRE, JOHN COLLINGS (SOLOMON
EAGLE, pseud.). Birds, and other poems. *$1.25
Doran 821
(Eng ed A20–244)

Birds, the first poem of this collection is based on the thought that
the birds are older than man and that in the days of his infancy they
built their nests in the self-same way and with the same perfection
they do today. The other poems are: Processes of thought, Airship
over suburb, Harlequin, Winter nightfall, Two songs, and A far place.

“‘The birds’ is an interesting poem full of felicitous things. But it

seems somehow to lack intensity. The three poems called ‘Processes
of thought’ are naturally more personal, more intimately felt; for they
are a record of introspection. In these we seem to be getting nearer
our ideal of what the lyric inspired by science or philosophy should
be like.” A. L. H.

+ − Ath p783 Ag 22 ’19 1000w

“His nature minutæ, his tenderness, his color are Wordsworthian,

with a drama, a music, a diamond-cut-diamond quality, as well as a
quality of the noblest oratory, that the old bard never knew.”

+ Bookm 52:367 D ’20 280w

“The poem after which the collection takes its name has a common
idea but one which Mr Squire expresses with uncommon vigor and
suggestion. The advantage of Mr Squire over the average American
poet of similar gifts is his ability to express sentiment without
sentimentalizing the mood.” W: S. Braithwaite

+ − Boston Transcript p9 D 1 ’20 1500w

“The difficulty with his poetry, for there is a difficulty—lies in the

unfortunate fact, that despite the obvious care he lavishes upon it, it
is too lax, too impersonal. Like everyone else who has something new
to say, Mr Squire has discovered that a new idea depends on a new
form of utterance being found to fit it. It is only a pity that he has so
few new ideas, and that he is content instead with writing poems in
which neither the idea—nor the utterance—is of the slightest
importance.” J: G. Fletcher

− + Freeman 2:284 D 1 ’20 900w

“His head is clearer than his poetry is fine; he is sober, and he has
a vein of reflection not wholly resembling other men’s, but the
strength that he has displayed rather than implied, and his
metaphors, of which he apparently is proud, are painfully
overdeveloped.”

− + Nation 112:86 Ja 19 ’21 80w

“The writing of verse is only one of Mr Squire’s innumerable

activities, and yet he is a poet of no small talent. Unlike most of his
brother Georgians, he is at his best when he is most metaphysical. At
his best he is fantastically powerful; at his worst he is florid and
bombastic. The present volume shows him more in the latter mood.”

+ − N Y Evening Post p11 N 6 ’20 180w

 “Mr Squire in his present volume has lost none of that quiet
controlled distinction which was always his; but he seems to have got
rid of the rather hard, metallic note which was noticeable in some of
his former work. The most remarkable poem of the book is called ‘A
far place.’ To us it seems one of the most original and absolutely
successful and complete poems that Mr Squire has ever written.”

+ Spec 123:376 S 20 ’19 620w

“This little book is not merely a joy in itself and additional to what
is now a considerable body of work, but extremely rich in promise.”

+ The Times [London] Lit Sup p409 Jl 31

’19 980w

SQUIRE, JOHN COLLINGS (SOLOMON

EAGLE, pseud.). Books in general. (2nd ser.)
*$2.50 (3½c) Knopf 824
20–16289

This is the second series of short essays, reviews and squibs on

books and writers, collected from weekly contributions to the New
Statesman. They are brilliant, witty and full of originality. Some of
the topics are: The descendants of Shakespeare; Scientific
management for Pegasus; The inferior poems of Keats; One’s
favourite author defined; Shelley’s letters; The essay in America; The
humours of hymnology; Dialect in literature; Verhaeren; On
submitting manuscripts; Rupert Brooke in retrospect.
 Booklist 17:107 D ’20

“Even more interesting than technical success, in this sort of thing,

is the quality of mind we see at work. Mr Squire has an admirable
sanity.” K. F. Gerould

+ Bookm 52:263 N ’20 780w

“Mr Squire’s style is distinctly conversational. The fluent grace of

such table-talk, however, neatly disposes of the adage that all men
talk in prose.”

+ Dial 69:665 D ’20 70w

“Somehow the sense of leisure in ‘Books in general’ is not richly

filled; the notations are too fluent, the writing lacks spring, and more
often than not it lacks the effect of enjoyment. Scarcely one of his
papers can be read without expectancy. But the promise is seldom
fulfilled.” C. M. R.

− Freeman 2:382 D 29 ’20 210w

“The comments on books, politics and things in general are

thoughtful, amusing and suggestive, worth reading and thinking
about.”

+ Ind 104:68 O 9 ’20 320w

“They are informative, witty, often merely playful. Critical acumen

is shown at times, but more often the evident purpose of the papers
is to amuse.”

+ N Y Times p10 O 8 ’20 550w

“Mr Squire mentions books and publications from this country

only for the purpose of jeering at them; it is gently done, but still a
jeer. ‘Books in general,’ however, includes such pleasing essays ...
that most of us will forgive ‘Solomon Eagle’ for tweaking a feather or
two of the American eagle’s tail.” E. L. Pearson

+ − Review 3:229 S 15 ’20 180w

Reviewed by P. U. Kellogg

+ Survey 45:27 O 2 ’20 680w

STARLING, ERNEST HENRY. Feeding of

nations. *$1.90 (*5s) Longmans 338.1
20–666

“This small book of one hundred forty-five pages contains a vast

store of information concerning the principles of human nutrition
and the application of these principles to the problem of feeding the
community in times of peace and war.” (N Y Evening Post) “Dr
Starling was chairman of the Food committee of the Royal society
which took up the study of the problem of feeding the nation before
the government realized that there was a problem, and afterwards
scientific adviser to the ministry of food.” (Survey)
 “An extremely able and attractive presentation of a difficult
subject.”

+ N Y Evening Post p5 Mr 20 ’20 500w

+ Survey 43:656 F 28 ’20 1050w

STEARNS, HAROLD EDMUND. Liberalism in

America: its origin, its temporary collapse, its future.
*$1.75 (2½c) Boni & Liveright 321.8
20–1878

“The core of liberal philosophy” writes the author, “is respect for
the individual and his freedom of conscience and opinion.” To trace
the foundations of this philosophy in America and to account for its
complete break-down during the war is the main purpose of this
book. The ten chapter titles are: What liberalism is; The English
heritage and the American development; American liberalism to the
eve of the war; The emotional breakdown before warhysteria;
Timidity and the seductions of office or career; President Wilson, the
technique of liberal failure; Political symbolism and the mob;
Débâcle of pragmatism; Leadership; The future. A bibliography of
two pages follows. The author was formerly associate editor of the
Dial.

“His plea for tolerance is marked by intolerance, for good-nature

with ungenerosity in weighing the motives of others, for
nonpartisanship and detachment with evident animus and one-sided
advocacy rather than fairness and breadth of vision. Hence the value
of the work as a critique of American liberalism is very seriously
impaired for the general reader and the serious student.” C. E.
Merriam

− Am Pol Sci R 14:511 Ag ’20 520w

“While one cannot altogether agree with the conclusions of the

author of this extremely readable exposition of liberalism, the
arguments are in most cases clear, and fairly presented.”

+ − Bookm 52:173 O ’20 200w

“But for all the flat contradictions with which the book seems to
abound, it is interesting for the variety of subjects of current interest
it touches notwithstanding the author does not seem to have
completely assimilated these—as, indeed, who has? One thing that
can be said about the book in general is that it is liberal.” W. A. M.

− + Boston Transcript p6 F 25 ’20 800w

“Herein lies the fundamental weakness of the discussion. One

gathers no clearly defined impression of what liberalism is or expects
to do, and who are the liberals. Mr Stearns writes impassionately and
with a refreshing verve that carries the reader headlong with him.”

+ − Cath World 111:254 My ’20 340w

Ind 102:234 My 8 ’20 170w

“One inclines to a wish that the writer had brought to his task a
little more sympathy, a little more humility, and a great deal more
information, and the wish becomes very strong when one reaches his
discussion of Mr Wilson. In a considered estimate by a liberal
thinker one looks for a fair and balanced examination of causes and
results. Mr Stearns simplifies the president’s problems so that any
departmental clerk might have overcome them. He imputes low
motives without the least apparent justification.” Jacob Zeitlin

− Nation 110:238 F 21 ’20 850w

“The book is of great value. Its analysis of American tendencies is

more balanced and inclusive than any contemporary work upon the
subject.” C. W.

+ N Y Call p6 Ja 9 ’21 230w

Reviewed by W. J. Ghent

− Review 2:229 Mr 6 ’20 1150w

R of Rs 61:336 Mr ’20 50w

“It is no engaging picture of our American war mind that Mr

Stearns paints, and twenty months ago it would have been hotly
resented by the great majority of our people. That the average man of
intelligence is likely to find himself mainly in agreement with it now
(although he may hesitate to admit the fact, even to himself) is the
best evidence that the picture is essentially true.” F: A. Ogg

+ Survey 44:308 My 29 ’20 350w

“As a volume of broad discussions, enriched by much reflection on

books and events, and by brilliant insight into motives, this book is a
success. Yet as an ordered analysis of the basic problem of liberty the
book fails, and its chief value will be lost unless it becomes the
starting point of a much needed discussion.” G: Soule

+ − Yale R n s 10:197 O ’20 500w

STEBBING, EDWARD PERCY. Diary of a

sportsman naturalist in India. il *$5 Lane 799
20–22627

This diary is published with a purpose. The author says: “The

sporting anecdotes and material selected from my note-books, which
form the greater part of the book, are designed to lead up to and
emphasize the necessity which exists of affording an adequate
protection to the game and other animals of India.” (Preface) The
book is in two parts: Sport in the big game jungles of India; and
Game protection and the provision of sanctuaries for the
preservation of the Indian fauna. There are illustrations from
photographs and sketches by the author and others.

“He describes his experiences fairly graphically, although, after a

few pages, we have too much confidence in his shooting to be
seriously alarmed for him.”

+ − Ath p473 O 8 ’20 260w

“There is a chapter on ‘Jungle lore,’ and several real tiger stories

that outdo most of those common to fiction. All the photographs are
very good, and the little pen and ink drawings, which are the
productions of five different persons, while not equal to Mr Seton’s,
carry their own individuality, and give new life to the already
entertaining text.”

+ Boston Transcript p2 D 11 ’20 210w

“A most interesting collection of reminiscences. His tiger stories

are capital.”

+ Spec 124:245 Ag 21 ’20 250w

“As a faithful account of conditions as they have been during the

last quarter of a century, Mr Stebbing’s book is likely to have a
definite and permanent value; and he knows well how to entertain as
well as to instruct.”

+ The Times [London] Lit Sup p497 Ag 5

’20 750w

STEELE, DAVID MCCONNELL. Papers and

essays for churchmen; being a series of studies on
topics made timely by current events. *$1.50 (2½c)
Jacobs 204
20–1134

The only unity that the author claims for this collection of papers is
that “they were all written to be read either to or by churchmen.”
(Foreword) The author’s mental tenor is conservative and his
thinking along the lines of his convictions is vigorous. He holds that
the war has dispelled the mist of immoral emotionalism that had
begun to envelop the churches, a form of this emotionalism being the
literal interpretation of “Love thy neighbor as thyself.” He repudiates
woman’s suffrage as wholly bad, hurls anathema against labor
organisations and socialism and advises that the poor, as the
“economically sick,” are properly the charges, not of the church, but
of the state. The contents are: Effect of the war on religion; Wanted,
an American Sunday; Woman suffrage and religion; Men’s clubs and
the churches; The poor, with you always; The church and labor
agitation; Socialism—Christian and pagan; Revelation—final or
progressive; The Episcopal church; Change of name of the church;
Proportionate representation.

[2]
STEELE, HARWOOD ELMES ROBERT.
Canadians in France, 1915–1918: with 8 sketch maps.
il *$8 Dutton 940.371
(Eng ed 20–10382)

“A detailed history of the operations of the Canadian Army corps,

consisting of four divisions and ‘corps troops.’ In writing this account
Captain Steele is describing in the main events that occurred under
his own observation in 1915 to the close of the war in 1918.”—R of Rs

“Captain Steele has the gift of clear, straightforward description;

and there is little to be desired in the succinctness and clarity with
which he etches in a number of Homeric incidents.”

+ Ath p816 Je 18 ’20 80w

+ Boston Transcript p8 D 1 ’20 420w
R of Rs 62:671 D ’20 60w
 “Captain Steele’s book is admirably written and full of vivid detail.”

+ Spec 124:49 Jl 10 ’20 200w

STEINER, RUDOLF. Four mystery plays. 2v *$3

Putnam 832
20–6848

H. Collison, one of the translators of these plays, describes them as

representing “the psychic development of man up to the moment
when he is able to pierce the veil and see into the beyond.” (Introd.)
They embody the author’s occult philosophy and form one
continuous series. The characters are represented on their physical
as well as on their spiritual plane and include many types—the occult
leader, the seeress, the artist, scientist, philosopher, historian,
mystic, and man of the world, also the forces of evil in Lucifer and
Ahriman. Collaborators with the translator are S. M. K. Gandell and
R. T. Gladstone. The plays are: The portal of initiation; The soul’s
probation; The guardian of the threshold; The soul’s awakening.

“‘Four mystery plays’ will doubtless command the attention of the

author’s disciples, but they are too formidable to win the interest of
the average outsider. The blank verse translation is adequate, but
hardly inspired.”

+ − Dial 69:321 S ’20 70w

“The only advantage gained by the play form is, perhaps, a little
simplicity in the treatment of very abstract subjects.”
 − + Springf’d Republican p7a N 28 ’20 180w
The Times [London] Lit Sup p780 N 25
’20 110w

[2]
STEPHENS, JAMES. Irish fairy tales. il *$5
(6½) Macmillan
20–21207

The first of these ancient folk-tales tells of the subduing of Tuan

mac Cairill, the powerful heathen, by Finnian, the Abbott of Moville.
Finnian lays siege to Tuan’s stronghold by seating himself before its
gates and fasting. Heathen etiquette forbade the attack of a
defenceless man and heathen hospitality a man’s starving before the
gates. So Finnian is admitted and at once proceeds to convert Tuan.
Thereupon Tuan, the grandson of Noah, tells his story which dates
back to the beginning of time in Ireland and is wonderful indeed. The
other tales are: The boyhood of Fionn; The birth of Bran; Oisin’s
mother; The wooing of Becfola; The little brawl at Allen; The Carl of
the drab coat; The enchanted cave of Cesh Corran; Becuma of the
white skin; Mongan’s frenzy. The full page illustrations in color and
the chapter vignettes are by Arthur Rackham.

“This book is written by a man who has a touch a little beyond

talent.” R. E. Roberts

+ Ath sup p783 D 3 ’20 180w

+ Booklist 17:164 Ja ’21
 “It is unfortunate that in the arrangement of his book he does not
give greater heed to the various cycles in which nearly all Irish stories
belong. But lack of unity is almost the only adverse criticism that can
be brought against the book. Mr Stephens has re-told Irish legends in
a volume that should take a permanent place in literature.” N. J.
O’Conor

+ − Boston Transcript p3 D 18 ’20 1350w

“James Stephens’ writing has the gift of everlasting youth. Arthur

Rackham’s drawings have inherent magic. Wherefore the two are
fortunately met in a new book, primarily for children, but also full of
appeal to grown-ups with a sense of humor.”

+ Ind 103:442 D 25 ’20 90w

“Though some of the stories as told by Mr Stephens appear to be

more in the nature of historic legends rather than fairy tales, the
collection provides good reading in which humour of a subtle kind
abounds.”

+ Int Studio 72:206 Ja ’21 60w

“There is enough of the hard line of beauty in his work to make one
rejoice in its amplitude.” F. H.

+ New Repub 25:111 D 22 ’20 1700w

“Humor shines, here, riots in wild fancy, extravagance rides by the

side of beauty.” Hildegarde Hawthorne
 + N Y Times p8 D 19 ’20 60w

“Stephens has put a lot of himself into the telling of these tales;
they are moulded by his story-telling instinct, given finish by his
English and burnished by his humor.” D. W. Webster

+ Pub W 98:1200 O 16 ’20 200w

“Children may enjoy it, but, like Arthur Rackham’s exquisite

illustrations, it will be fully appreciated only by more sophisticated
readers.” E. L. Pearson

+ Review 3:619 D 22 ’20 170w

+ Spec 125:784 D 11 ’20 60w

“There is much good narrative, much humour, and, usually,

unstrained simplicity in the book, but above all there are passages of
enchanting beauty.”

+ The Times [London] Lit Sup p830 D 9

’20 310w

STERRETT, FRANCES ROBERTA. Nancy

goes to town. *$2 (5c) Appleton
20–18766
 Nancy goes to town to take nurses’ training, telling all her friends
in Mifflin that she intends to marry a rich patient. She meets two rich
patients, one an old woman, the other an old man. The two are
business rivals and they become rivals also for Nancy’s favor. One
has a nephew, the other a grandson, both put forward as candidates
for Nancy’s hand. So the rich husband is within her reach, but Nancy
chooses, after some faltering, to marry Dr Rolf Jensen, the poor
young doctor.

“The description of hospital life from the point of view of a lively

girl, with quick wit and a keen sense of humor, is capital.”

+ N Y Times p24 Ja 16 ’21 420w

STEVENS, WILLIAM OLIVER, and

WESTCOTT, ALLAN FERGUSON. History of sea
power. il *$6 Doran 359
20–18945

This volume covers the evolution and influence of sea power from
the beginnings to the present time and treats naval history not from
the point of view of a sequence of battles but as a vital force in the
rise and fall of nations and in the evolution of civilization. It traces its
beginnings from the Island of Crete in the Mediterranean long before
the dawn of history to its present significance. The book is indexed,
has a list of references at the end of each chapter and ninety-six
maps, diagrams and illustrations. Contents: The beginnings of
navies; Athens as a sea power; The sea power of Rome; The navies of
the middle ages (two chapters); Opening the ocean routes; Sea power
in the North; England and the Armada; Rise of English sea power
(two chapters); Napoleonic wars (three chapters); Revolution in
naval warfare; Rivalry for world power; The world war (three
chapters); Conclusion.

“Though surprisingly condensed, an informative and authoritative

work.”

+ Booklist 17:143 Ja ’21

“It is a more objective and less theoretical study [than Mahan’s

‘Influence of sea power on history,’] with more interest for the
general reader; in addition to which it is a convenient reference
book.”

+ Springf’d Republican p8a D 5 ’20 620w

STEVENSON, GEORGE. Benjy. *$1.75 (*7s)

(2c) Lane
20–5234

The book recounts the fortunes of the Ainsworth family from the
time when young Dr Ainsworth drives his bride Priscilla home in the
gig, to the coming of the children—up to the number of thirteen—
with its resultant poverty; and the varied careers and fortunes of all
these in turn. Benjy, the youngest, his mother’s favorite, follows his
father into the medical profession. Outwardly his life is drab, all its
important happenings being of the nature of disappointments. The
more brilliantly endowed brother, Basil, wins and weds Benjy’s own
beloved Clara who dies in childbirth through Basil’s light-hearted
want of foresight. When Uncle Benjy adopts little Clara to save her
from a bad step-mother, death robs him of her also. Then comes the
war and offers him a welcome escape from himself.

“It is only when the children grow older and come into touch with
the world that Mr Stevenson fails lamentably. The quaint, old-
fashioned children are replaced by plain, strange young men and
women, and the author in his effort to convince us of Benjy’s purity
of heart pours over him such a great pale flood of sentimentality that
he is drowned before our eyes.” K. M.

+ − Ath p1371 D 19 ’19 420w

Reviewed by R. M. Underhill

+ Bookm 51:443 Je ’20 130w

“An almost masterly understanding of human (and English)

limitations pervades the story. It is told always with a sure judgment
and reticence.”

+ Boston Transcript p4 My 19 ’20 130w

“A calm tale; interesting incident and fairly interesting characters,

but no particular point.”

+ − Ind 103:323 S 11 ’20 20w

“Such is the charm of Mr Stevenson’s insouciant style that we lose

consciousness of the fact that we are listening to an ‘author.’ The
author’s powers of characterization are, in fact, responsible for a
minor fault in ‘Benjy’—the diffusing of interest in too many
characters.”

+ − N Y Times p25 Ag 1 ’20 550w

Outlook 124:657 Ap 14 ’20 20w

“It is well conceived and full of appreciation of individual

character.”

+ Sat R 129:234 Mr 6 ’20 60w

“Though the reader may become rather bewildered in trying to

follow each particular thread, the book is illuminated with many of
the author’s quiet touches of humour and is written with his usual
distinction of style.”

+ − Spec 124:53 Ja 10 ’20 60w

The Times [London] Lit Sup p633 N 6
’19 80w

STEVENSON, ROBERT LOUIS BALFOUR.

Learning to write; ed. by J: W: Rogers, jr. *$1.35
Scribner 808
20–6692

“This book is a compilation of everything R. L. S. has said on

writing, both in his essays on literary art and in the casual
observations made in his letters.”—Booklist
 + Booklist 16:306 Je ’20
+ Freeman 2:94 O 6 ’20 380w

“You cannot learn much about electricity by watching the lightning

in the thunder cloud. Even if Stevenson did teach himself to write as
he says he did, which is nothing more than an improbable
hypothesis, reading his extremely characteristic and technically
complex descriptions of his methods will not help a single youngster
out of the toils and troubles of the early days of his probation.” W:
McFee

− N Y Evening Post p9 My 8 ’20 1300w

“It is to be feared that Stevenson’s confidences in regard to his own

literary processes have done all too much to foster hope in the bosom
of ‘would-be’ authors.... One is inclined to take it with several grains
of salt.” R: Le Gallienne

+ − N Y Times 25:8 Je 27 ’20 2250w

+ School R 28:628 O ’20 110w

“Likely to prove a gold mine of interesting information not only to

aspiring writers, but to people who are interested in books as well.”

+ Springf’d Republican p8 Jl 24 ’20 240w

 STEWART, BASIL. Japanese color prints and
the subjects they illustrate. il *$20 Dodd 761

“Mr Stewart knows just what collectors of Japanese prints want

and do not want. But they want a handbook of 300–odd pages, with
reproductions of signatures, lists of important sets, chronological
tables, brief biographical information; of handy format and popular
style. And such is the book before us. There are a glossary, a chapter
on ‘Forgeries and imitations,’ another on ‘Actor prints’ in general,
and an excursus on the ‘Forty-seven rōnins’ in history and on the
stage.”—The Times [London] Lit Sup

“It is no serious condemnation to say that ‘Japanese colour prints’

is not the book on Japanese colour prints for which we are all
looking.”

+ − Int Studio 72:33 N ’20 200w

“The ground covered is so vast that the treatment in certain cases

inevitably seems somewhat cursory. One or two inaccuracies may be
noted.”

+ − The Times [London] Lit Sup p464 Jl 22

’20 640w

STEWART, WENTWORTH. Making of a

nation. $1.50 (3c) Stratford co. 325.7
 20–3491

In this discussion of Americanism and Americanization the author

holds that we cannot make American citizens of aliens by formal
educational programs, that we must take into consideration the
psychology of Americanization and treat Americanism as a thing of
the spirit rather than of naturalization papers. Certain undesirable
features in our alien population—such as foreign language
newspapers, religious worship in a foreign tongue—should be treated
by a process of elimination rather than coercion, while “all
anarchistic agitators,” and unamerican labor agitators should be
summarily dealt with. As one of the educational factors for
Americanization a modified form of the open forum is
recommended. Contents: The nation’s awakening; The nation’s task
of unification; Eliminating the handicaps to Americanism;
Constructive government and nation building; Providing conditions
for Americanism—or the application of constructive government;
The neighborhood and the nation; International sentiment and
nationalism.

STILL, JOHN. Poems in captivity. *$2 Lane 821

20–5612

The author discovered the poet in himself during his three years of
captivity in Turkey, “where each one of us was driven to seek inside
himself some alleviation of the daily dullness, many of us there found
things we had not suspected to exist.... I found these verses, all of
which were written there, and their discovery made more happy
many of the eleven hundred and seventy-nine days I spent as a
prisoner of war.” (Foreword) The poems are in five groups: Prison
verses; Woodcraft and forest lore; Tales from the Mahawansa;
Various songs and sketches. The frontispiece is a facsimile of a part
of the ms. which was concealed in a hollow walking-stick, and some
explanatory notes are appended.

“Mr Still’s work is undeniably interesting, and his chosen vehicle

seems to be the right one.”

+ Ath p1018 O 10 ’19 100w

Boston Transcript p4 Ap 21 ’20 280w

“He writes fluently and the Ceylonese legends that he relates are
interesting in themselves, but his medium hardly ever touches the
authentic heights of poetry.”

+ − N Y Times 25:16 Je 27 ’20 100w

“The merit of Mr Still’s work is that it gives aptly and agreeably a

full, warm picture of scenes picturesque and historic.”

+ The Times [London] Lit Sup p534 O 2

’19 160w

STOCKBRIDGE, MRS BERTHA EDSON

(LAY). What to drink; the blue book of beverages. il
*$1.50 Appleton 641.8
20–2272

In these days of prohibition this book solves the hostess’ problem

of what to serve to drink. All she needs is a stock of syrups, shrubs
and vinegars, says the author. “If, however, she is inclined to think it
an arduous task, let her turn to these recipes, and she will be
convinced that the labor and the time expended bring their own
reward in ... a delicious drink delightfully made.” (Foreword) The
contents present an exhaustive array of recipes for fruitades and
punches and drinks hot and cold—non-alcoholic cocktails, syrups,
grape juice, root beer and cider, hot drinks such as coffee, chocolate,
etc., drinks for invalids and children, sundaes and sauces, ice-
creams, sherbets, etc. There is an index.

Booklist 17:18 O ’20

Springf’d Republican p13a Ap 18 ’20
250w
The Times [London] Lit Sup p241 Ap
15 ’20 50w

STOCKBRIDGE, FRANK PARKER. Yankee

ingenuity in the war. il *$2.50 Harper 623
20–8261

It was as a reaction of the author’s patriotic pride to the slanderous

disparagements of America’s participation in the war that the book
was written and for that reason it is limited to the consideration of
distinctly American enterprise. It has, however, not been written for
the scientist or the technologist, but for the average American,
neither skilled nor interested in technical details. A partial list of the
contents is: The mobilization of science and industry; The Liberty
motor; American military airplanes; The chemical conquest of the
air; Potash, sulphuric acid, and dyestuffs; Poison gas; Some
extraordinary ship-building feats; Some Yankee tricks in undersea
warfare; The wonders of war wireless; Medical and surgical
achievements. The book is profusely illustrated from official
photographs.

“Interesting and informative.”

+ Booklist 17:67 N ’20

Wis Lib Bul 16:234 D ’20 70w

STOCKLEY, CYNTHIA. Pink gods and blue

demons. *$1.50 (9c) Doran
20–10303

A story of South Africa. The pink gods and blue demons are the
lightning flashes of temptation from the facets of diamonds. Loree
Temple, a young and much indulged wife, falls under their spell. Her
husband has gone north on business leaving her alone in Kimberley.
She falls under the spell of the diamonds and so into the power of the
man who can give them to her. She is extricated through the loyalty
and generosity of another woman, and, her lesson learned, goes to
join her husband.

“The tale is interesting and moves swiftly forward to a sufficiently

dramatic climax.”

+ N Y Times 25:320 Je 20 ’20 450w

 “The story holds one’s attention closely.”

+ Outlook 125:507 Jl 14 ’20 50w

STOCKTON, JAMES LEROY. Project work in

education. *$1.20 (3c) Houghton 371.3
20–14397

The book is one of the “Riverside educational monographs” edited

by Henry Suzzallo. Its object is to show what can be done to replace
the traditional teaching by isolated subjects by a more vital method
built on a practical psychological basis. The project method in brief
implies “learning to do by doing,” or “self-education through
activities,” and is the result of the working-out of the most
fundamental of modern educational principles. The book falls into
two parts, considering project work both as a method and as a
subject. Part I contains: The evolution of the principles underlying
the project method; The transfer of the principles to America;
Modern American principles of education; The project method in the
modern public school; Project work in trade education. Part II
contains: The evolution of the project subject; The broader
conception of the content of the project subject; The necessity of
more direct teaching of the project subject; Summary; Outline.

STODDARD, THEODORE LOTHROP. Rising

tide of color against white world-supremacy; with an
introd. by Madison Grant. *$3 Scribner 327
20–7502
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.

Let us accompany you on the journey of exploring knowledge and

personal growth!

textbookfull.com