Experience Seamless Full Ebook Downloads for Every Genre at textbookfull.

com

Swarm Evolutionary and Memetic Computing 4th

International Conference SEMCCO 2013 Chennai India
December 19 21 2013 Proceedings Part I 1st Edition
M. Fatih Tasgetiren
https://textbookfull.com/product/swarm-evolutionary-and-
memetic-computing-4th-international-conference-
semcco-2013-chennai-india-december-19-21-2013-proceedings-
part-i-1st-edition-m-fatih-tasgetiren/

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.

Swarm Evolutionary and Memetic Computing 6th International

Conference SEMCCO 2015 Hyderabad India December 18 19 2015
Revised Selected Papers 1st Edition Bijaya Ketan Panigrahi
https://textbookfull.com/product/swarm-evolutionary-and-memetic-
computing-6th-international-conference-semcco-2015-hyderabad-india-
december-18-19-2015-revised-selected-papers-1st-edition-bijaya-ketan-
panigrahi/
textboxfull.com

Big Data Analytics Second International Conference BDA

2013 Mysore India December 16 18 2013 Proceedings 1st
Edition Sameep Mehta
https://textbookfull.com/product/big-data-analytics-second-
international-conference-bda-2013-mysore-india-
december-16-18-2013-proceedings-1st-edition-sameep-mehta/
textboxfull.com

Ambient Intelligence 4th International Joint Conference

AmI 2013 Dublin Ireland December 3 5 2013 Proceedings 1st
Edition Serge Autexier
https://textbookfull.com/product/ambient-intelligence-4th-
international-joint-conference-ami-2013-dublin-ireland-
december-3-5-2013-proceedings-1st-edition-serge-autexier/
textboxfull.com

Progress in Cryptology INDOCRYPT 2013 14th International

Conference on Cryptology in India Mumbai India December 7
10 2013 Proceedings 1st Edition Yoshinori Aono
https://textbookfull.com/product/progress-in-cryptology-
indocrypt-2013-14th-international-conference-on-cryptology-in-india-
mumbai-india-december-7-10-2013-proceedings-1st-edition-yoshinori-
aono/
textboxfull.com
Genetic and Evolutionary Computing Proceedings of the
Seventh International Conference on Genetic and
Evolutionary Computing ICGEC 2013 August 25 27 2013 Prague
Czech Republic 1st Edition Ladislav Zjavka (Auth.)
https://textbookfull.com/product/genetic-and-evolutionary-computing-
proceedings-of-the-seventh-international-conference-on-genetic-and-
evolutionary-computing-icgec-2013-august-25-27-2013-prague-czech-
republic-1st-edition-ladislav-zja/
textboxfull.com

Algorithms and Architectures for Parallel Processing 13th

International Conference ICA3PP 2013 Vietri sul Mare Italy
December 18 20 2013 Proceedings Part I 1st Edition Antonio
Balzanella
https://textbookfull.com/product/algorithms-and-architectures-for-
parallel-processing-13th-international-conference-ica3pp-2013-vietri-
sul-mare-italy-december-18-20-2013-proceedings-part-i-1st-edition-
antonio-balzanella/
textboxfull.com

The 15th International Conference on Biomedical

Engineering ICBME 2013 4th to 7th December 2013 Singapore
1st Edition B. L. Khoo
https://textbookfull.com/product/the-15th-international-conference-on-
biomedical-engineering-icbme-2013-4th-to-7th-
december-2013-singapore-1st-edition-b-l-khoo/
textboxfull.com

Universal Access in Human Computer Interaction User and

Context Diversity 7th International Conference UAHCI 2013
Held as Part of HCI International 2013 Las Vegas NV USA
July 21 26 2013 Proceedings Part II 1st Edition Stijn
https://textbookfull.com/product/universal-access-in-human-computer-
Bannier
interaction-user-and-context-diversity-7th-international-conference-
uahci-2013-held-as-part-of-hci-international-2013-las-vegas-nv-usa-
july-21-26-2013-proceedings-pa/
textboxfull.com

Algorithms and Architectures for Parallel Processing 13th

International Conference ICA3PP 2013 Vietri sul Mare Italy
December 18 20 2013 Proceedings Part II 1st Edition Peter
Benner
https://textbookfull.com/product/algorithms-and-architectures-for-
parallel-processing-13th-international-conference-ica3pp-2013-vietri-
sul-mare-italy-december-18-20-2013-proceedings-part-ii-1st-edition-
peter-benner/
textboxfull.com
 Bijaya Ketan Panigrahi
Ponnuthurai Nagaratnam Suganthan
Swagatam Das
Shubhransu Sekhar Dash (Eds.)
LNCS 8297

Swarm, Evolutionary,
and Memetic Computing
4th International Conference, SEMCCO 2013
Chennai, India, December 2013
Proceedings, Part I

123
Lecture Notes in Computer Science 8297
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board
David Hutchison
Lancaster University, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Alfred Kobsa
University of California, Irvine, CA, USA
Friedemann Mattern
ETH Zurich, Switzerland
John C. Mitchell
Stanford University, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
Oscar Nierstrasz
University of Bern, Switzerland
C. Pandu Rangan
Indian Institute of Technology, Madras, India
Bernhard Steffen
TU Dortmund University, Germany
Madhu Sudan
Microsoft Research, Cambridge, MA, USA
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbruecken, Germany
Bijaya Ketan Panigrahi
Ponnuthurai Nagaratnam Suganthan
Swagatam Das
Shubhransu Sekhar Dash (Eds.)

Swarm, Evolutionary,
and Memetic Computing
4th International Conference, SEMCCO 2013
Chennai, India, December 19-21, 2013
Proceedings, Part I

13
Volume Editors
Bijaya Ketan Panigrahi
IIT Delhi, New Delhi, India
E-mail: [email protected]
Ponnuthurai Nagaratnam Suganthan
Nanyang Technological University, Singapore
E-mail: [email protected]
Swagatam Das
Indian Statistical Institute, Kolkata, India
E-mail: [email protected]
Shubhransu Sekhar Dash
SRM University, Tamil Nadu, India
E-mail: [email protected]

ISSN 0302-9743 e-ISSN 1611-3349

ISBN 978-3-319-03752-3 e-ISBN 978-3-319-03753-0
DOI 10.1007/978-3-319-03753-0
Springer Cham Heidelberg New York Dordrecht London

Library of Congress Control Number: 2013954557

CR Subject Classification (1998): F.1, I.2, H.3, F.2, I.4-5, J.3, H.4

LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues

© Springer International Publishing Switzerland 2013
This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of
the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology
now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection
with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and
executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication
or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location,
in ist current version, and permission for use must always be obtained from Springer. Permissions for use
may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution
under the respective Copyright Law.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
While the advice and information in this book are believed to be true and accurate at the date of publication,
neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or
omissions that may be made. The publisher makes no warranty, express or implied, with respect to the
material contained herein.
Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India
Printed on acid-free paper
Springer is part of Springer Science+Business Media (www.springer.com)
 Preface

This LNCS volume contains the papers presented at the 4th International
Conference on Swarm, Evolutionary and Memetic Computing (SEMCCO 2013)
held during December 19–21, 2013, at SRM University, Chennai, India. SEM-
CCO is regarded as one of the prestigious international conference series that
aims at bringing together researchers from academia and industry to report and
review the latest progresses in the cutting-edge research on swarm, evolutionary,
memetic and other computing techniques such as neural and fuzzy computing,
to explore new application areas, to design new nature-inspired algorithms for
solving hard problems, and finally to create awareness about these domains to
a wider audience of practitioners.
SEMCCO 2013 received 350 paper submissions from 20 countries across the
globe. After a rigorous peer-review process involving 1,100 reviews, 126 full-
length articles were accepted for oral presentation at the conference. This cor-
responds to an acceptance rate of 36% and is intended to maintain the high
standards of the conference proceedings. The papers included in this LNCS vol-
ume cover a wide range of topics in swarm, evolutionary, memetic, fuzzy, and
neural computing algorithms and their real-world applications in problems from
diverse domains of science and engineering.
The conference featured distinguished keynote speakers: Prof. Marios M.
Polycarpou, President, IEEE Computational Intelligence Society and Director,
KIOS Research Center for Intelligent Systems and Networks Department of Elec-
trical and Computer Engineering, University of Cyprus; Prof. Ferrante Neri, Pro-
fessor of Computational Intelligence Optimization, De Montfort University, UK;
Dr. M. Fatih Tasgetiren, Associate Professor of Industrial Engineering, Yasar
University, Turkey; Dr. Dipti Srinivasan, Associate Professor, Department of
Electrical and Computer Engineering, National University of Singapore. The
other prominent speakers were Dr. P.N. Suganthan, NTU, Singapore; Dr. Adel
Nasiri, Department of Electrical Engineering and Computer Science, University
of Wisconsin-Milwaukee, USA; Dr. Ravipudi Venkata Rao, NIT, Surat, India;
and Dr. Swagatam Das, ISI, Kolkata, India.
We take this opportunity to thank the authors of the submitted papers for
their hard work, adherence to the deadlines, and patience with the review pro-
cess. The quality of a referred volume depends mainly on the expertise and ded-
ication of the reviewers. We are indebted to the Program Committee/Technical
Committee members, who produced excellent reviews in short time frames.
We would also like to thank our sponsors for providing all the logistical sup-
port and financial assistance. First, we are indebted to SRM University Man-
agement and Administration for supporting our cause and encouraging us to
organize the conference at SRM University, Chennai, India. In particular, we
would like to express our heartfelt thanks for providing us with the necessary
VI Preface

financial support and infrastructural assistance to hold the conference. Our sin-
cere thanks to Thiru T.R. Pachamuthu, Chancellor, Shri P. Sathyanarayanan,
President, Dr. M. Ponnavaikko, Vice-Chancellor, Dr. N. Sethuraman, Registrar,
and Dr. C. Muthamizhchelvan, Director (E&T) of SRM University, for their en-
couragement and continuous support. We thank Prof. Carlos A. Coello Coello,
Prof. Nikhil R. Pal, and Prof. Rajkumar Roy for providing valuable guidelines
and inspiration to overcome various difficulties in the process of organizing this
conference.
We would also like to thank the participants of this conference. Finally, we
would like to thank all the volunteers who made great efforts in meeting the
deadlines and arranging every detail to make sure that the conference could run
smoothly. We hope the readers of these proceedings find the papers inspiring
and enjoyable.

December 2013 Bijaya Ketan Panigrahi

Swagatam Das
P.N. Suganthan
S.S. Dash
 Organization

Chief Patron
Thiru T.R. Pachamuthu

Patron
Shri P. Sathyanarayanan

Honorary Chairs
Nikhil R. Pal, India
Carlos A. Coello Coello, Mexico
Rajkumar Roy, UK
M. Ponnavaikko, India

General Chairs
B.K. Panigrahi, India
Swagatam Das, India
P.N. Suganthan, Singapore

Program Chairs
S.S. Dash, India
Zhihua Cui, China
J.C. Bansal, India

Program Co-chairs
K. Vijaya Kumar, India
A. Rathinam, India

Steering Committee Chair

P.N. Suganthan, Singapore

Publicity Chairs
S.S. Dash, India
S.C. Satpathy, India
N.C. Sahoo, Malaysia
VIII Organization

Special Session Chairs

Sanjoy Das, USA R. Rajendran, India

Wei-Chiang Hong, Taiwan E. Poovammal, India

Tutorial Chair
S.K. Udgata, India

Technical Program Committee

Abbas Khosravi Deakin University, Australia
Ahmed Y. Saber Senior Power System Engineer - R&D
Department, OTI/ETAP, CA, USA
Aimin Zhou East China Normal University, China
Almoataz Youssef Abdelaziz Ain Shams University, Cairo, Egypt
Athanasios V. Vasilakos University of Western Macedonia, Greece
Ayman Abd El-Saleh Multimedia University, Cyberjaya, Malaysia
Balasubramaniam Jayaram Indian Institute of Technology Hyderabad,
India
Carlos A. Coello Coello CINVESTAV-IPN, México
Chilukuri K. Mohan Syracuse University, USA
Chanan Singh Texas A&M University, USA
Dipankar Dasgupta University of Memphis, USA
Dinesh Kant Kumar RMIT, Australia
Esperanza Garcı́a-Gonzalo Oviedo University, Spain
Ganapati Panda IIT Bhubaneswar, India
G. Kumar Venayagamoorthy Clemson University, USA
G.A. Vijayalakshmi Pai PSG College of Technology, Coimbatore, India
Gerardo Beni University of California, Riverside, USA
Halina Kwasnicka Wroclaw University of Technology, Poland
Hisao Ishibuchi Japan
Hong-Jie Xing Hebei University, China
Janusz Kacprzyk Systems Research Institute, Poland
John MacIntyre University of Sunderland, UK
Jeng-Shyang Pan National Kaohsiung University of Applied
Sciences, Taiwan
Juan Luis Fernández Martı́nez Universidad de Oviedo, Spain
Kalyanmoy Deb IIT Kanpur, India
Konstantinos E. Parsopoulos University of Ioannina, Greece
K. Vaisakh Andhra University, India
Laxmidhar Behera IIT Kanpur, India
Leandro Nunes de Castro Universidade Presbiteriana Mackenzie, Brazil
Lingfeng Wang The University of Toledo, USA
 Organization IX

M.A. Abiso King Fahd University of Petroleum & Minerals,

Saudi Arabia
Maurice Clerc France Telecom R&D, France
Manoj Kumar Tiwari IIT Kharagpur, India
Martin Middendorf University of Leipzig, Germany
Meng Hiot Lim NTU, Singapore
N.C. Sahoo IIT Bhubaneswar, India
Oscar Castillo Tijuana Inst. Technology, Mexico
Peng Shi University of Adelaide, Australia
Pei Chan Chang Taiwan
P.K. Dash SOA University, India
Quan Min Zhu University of the West of England, Bristol, UK
Rafael Stubs Parpinelli State University of Santa Catarina, Brazil
Saeid Nahavandi Deakin University, Australia
Samrat Sabat University of Hyderabad, Hyderabad, India
Satchidananda Dehuri Ajou University, South Korea
Shu-Heng Chen National Chengchi University, Taipei, Taiwan,
ROC
S.G. Ponnambalam Monash University, Malaysia
Siba K. Udgata University of Hyderabad, Hyderabad, India
Saman K. Halgamuge Australia
Sanjoy Das Kansas State University, USA
S. Baskar Thiagarajar College of Engineering, India
Somanath Majhi IIT, Guwahati, India
Tan Kay Chen National University of Singapore, Singapore
Vincenzo Piuri Università degli Studi di Milano, Italy
V. Ravi IDRBT, Hyderabad, India
Wei-Chiang Hong Oriental Institute of Technology, Taiwan
Xin-She Yang Middlesex University, London, UK
X.Z. Gao Aalto University, Finland
Yew-Soon Ong Nanyang Technological University, Singapore
Yuehui Chen University of Jinan, China
Yuhui Shi Xi’an Jiaotong-Liverpool University, China
Yucheng Dong Sichuan University, China
Zhao Xu Hong Kong Polytechnic University, Hong Kong
Zong Woo Geem Gachon University, South Korea
S. Baskar Thiagrajar College of Engineering, Madurai,
India
P. Somsundaram Anna University, Chennai, India
D. Devaraj Kalasalingam University, India
C. Christopher Asir Rajan Pondicherry University, India
X Organization

Technical Review Board

Abdelaziz, Almoataz Delhibabu, K. Kazimipoor, Borhan

Abhyankar, Abhijit Dewan, Hrishikesh Khadkikar, Vinod
Agarwal, Vineeta Dhingra, Atul Lakshmi, B. Geetha
Alizadeh Bidgoli, Elgammal, Adel Lim, Meng-Hiot
Mohsen Fernández Martı́nez, Lohokare, Mohan
Amali, Miruna Joe Juan Luis Lopes, Heitor Silverio
Anand, Ashish Fu, Wenlong Li, Miqing
Asafuddoula, Md. Gaddam, Mallesham M.P., Selvan
Abido, Mohammad Garcia Gonzalo, Maity, Dipankar
Ahuja, Ashish Esperanza Martinovic, Goran
Ansari, Abdul Quaiyum Geem, Zong Woo Martinovic, Jan
B., Chitti Babu Ghosh, Arnob Meher, Saroj K.
Bakwad, Kamalakar Ghoshal, Saktiprasad Majhi, Babita
Banakara, Basavaraja Grosan, Crina Majhi, Ritanjali
Bansal, Jagdish Chand G. Sridhar Reddy, Mandal, Durbadal
Benı́tez, José M. Gandhi, Tapan Mandal, Kamal
Bhuvaneswari, G. Gao, Xiao-Zhi Matousek, Radek
Bijwe, P.R. Giri, Ritwik Maurice, Clerc
Bajo, Javier Godarzi, Hosin Mehrotra, Kishan
Bhat, Ashoka Gottipati, Pavani Mei, Yi
Brest, Janez Gross, Roderich Mishra, Mahesh Kumar
Casola, Valentina Hassanien, Aboul Ella Misra, Bijan
Chen, Jianyong Hamza, Noha Misra, Rakesh K.
Cernea, Ana Hasan, Shazia Mohan, Chilukuri
Ch., Sudheer Hong, Tzung-Pei Mohanty, Mihir
Chatterjee, Saibal Hong, Wei-Chiang Mohanty, Saraju
Chaturvedi, D.K. Hota, Ashish R. Mohapatra, Ankita
Chawla, Akshay Iacca, Giovanni Morgan, Rachael
Cui, Zhiwei Iqbal, Muhammad Muda, Azah
Dahal, Keshav Janakiraman Muhammad Ishaque,
Das, Sanjoy Jayavelu, Senthilnath Kashif
Das, Swagatam Kaabouch, Naima Mukherjee, V.
Dash, S.S. Kai-Zhou, Gao Murthy, J.V.R
Datta, Dilip Karabulut, Korhan Nguyen, Su
De, Dipankar Konar, Amit Nanda, Pradipta Kumar
Dwivedi, Sanjeet Kominkova Oplatkova, Otjacques, Benoit
Dash, P.K Zuzana P., Jayaprakash
Datta, Rituparna Kononova, Anna Panda, Rutuparna
Dauwels, Justin Kratky, Michal Parida, Sanjoy
Davendra, Donald Kwintiana, Bernadetta Platos, Jan
De, Mala K.R., Krishnanand Pati, Soumen Kumar
Debchoudhury, S. Kale, Vijay Patnaik, Amalendu
Dehuri, Satchidananda Kar, Rajib Ponnambalam, S.G.
 Organization XI

Pratihar, Dilip Selvakumar, A. Swain, Akshaya

P.P., Rajeevan Immanuel Thangaraj, Radha
Panda, Sidhartha Senroy, Nilanjan Thomas, Mini
Panda, Ganapati Shariatmadar, Seyed Tiwari, Manoj
Pandit, Manjaree Mohammad Tang, Ke
Panigrahi, Siba Sharma, Shailendra Thelukuntla, Chandra
Parillo, Fernando Shukla, Anupam Shekar
Pant, Millie Singh, Madhu Torkaman, Hossein
Pattnaik, Shyam Singh, Mukhtiar Udgata, S.K.
Pluhacek, Michal Singh, Pramod Kumar V., Ravikumarpandi
Puhan, Niladri Swarup, Shanti Vaisakh, K.
Qian, Bin Sabat, Samrat Verma, Nishchal
Rao, Ravipudi Salkuti, Surender Reddy Vijay, Ritu
Rocky, Taif Hossain Samantaray, Subhransu Wang, Lingfeng
Rout, Pravat Kumar Satapathy, Suresh Wang, Shengyao
Rybnik, Mariusz Chandra Willjuice
Rajagopal, V. Schaefer, Gerald Iruthayarajan, M.
Rahman, Humyun Fuad Senkerik, Roman Xie, Liping
Rajasekhar, Anguluri Sethuraman, Kowsalya Yang, Xin-She
Ramasamy, Savitha Shieh, Chin-Shiuh Yusof, Norazah
Ravi, V. Shrivastava, Ashish Yussof, Salman
Ravishankar, Jayashri Shrivastava, Nitin Anand Zamuda, Ales
Ren, Ye Singh, Bhim Zapotecas Martı́nez, Saúl
Singh, Manohar Xie, Feng
S., Sudha Singh, Sanjeev Xue, Bing
Saikia, Lalit Sinha, Dr. Nidul Zelinka, Ivan
Salehinejad, Hojjat Zhihua, Cui
Samiei Moghaddam, Sishaj P. Simon Zhou, Aimin
Mahmoud Skanderová, Lenka Zhuhadar, Leyla
Saxena, Anmol Ratna Sun, Jianyong

Organizing/Technical Program Committee

R. Jegatheesan, SRM University
R. Ramanujam, SRM University
N. Chellammal, SRM University
C.S. Boopathy, SRM University
D. Suchithra, SRM University
K. Mohanraj, SRM University
N. Kalaiarasi, SRM University
R. Sridhar, SRM University
D. Sattianandan, SRM University
C. Bharathiraja, SRM University
S. Vidyasagar, SRM University
C. Subramanian, SRM University
 Table of Contents – Part I

A Populated Iterated Greedy Algorithm with Inver-Over Operator

for Traveling Salesman Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
M. Fatih Tasgetiren, Ozge Buyukdagli, Damla Kiziay, and
Korhan Karabulut

Meta-modeling and Optimization for Varying Dimensional Search

Space . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
Kalyanmoy Deb, Soumil Srivastava, and Akshay Chawla

A General Variable Neighborhood Search Algorithm for the No-Idle

Permutation Flowshop Scheduling Problem . . . . . . . . . . . . . . . . . . . . . . . . . . 24
M. Fatih Tasgetiren, Ozge Buyukdagli, Quan-Ke Pan, and
Ponnuthurai Nagaratnam Suganthan

Design of Non-uniformly Weighted and Spaced Circular Antenna

Arrays with Reduced Side Lobe Level and First Null Beamwidth Using
Seeker Optimization Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
Gopi Ram, Durbadal Mandal, Sakti Prasad Ghoshal, and Rajib Kar

Covariance Matrix Adaptation Evolutionary Strategy for the Solution

of Transformer Design Optimization Problem . . . . . . . . . . . . . . . . . . . . . . . . 47
Selvaraj Tamilselvi and Subramanian Baskar

Load Information Based Priority Dependant Heuristic for Manpower

Scheduling Problem in Remanufacturing . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
Shantanab Debchoudhury, Debabrota Basu, Kai-Zhou Gao, and
Ponnuthurai Nagaratnam Suganthan

A Tree Based Chemical Reaction Optimization Algorithm for QoS

Multicast Routing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68
Satya Prakash Sahoo, Sumaiya Ahmed, Manoj Kumar Patel, and
Manas Ranjan Kabat

A New Improved Knowledge Based Cultural Algorithm for Reactive

Power Planning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
Bidishna Bhattacharya, Kamal K. Mandal, and Niladri Chakraborty

BFO-RLDA: A New Classification Scheme for Face Images Using

Probabilistic Reasoning Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
Lingraj Dora, Sanjay Agrawal, and Rutuparna Panda
XIV Table of Contents – Part I

Optimal Stable IIR Low Pass Filter Design Using Modified Firefly
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
Suman K. Saha, Rajib Kar, Durbadal Mandal, and
Sakti Prasad Ghoshal

Firefly Algorithm with Various Randomization Parameters:

An Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110
Nadaradjane Sri Madhava Raja, K. Suresh Manic, and
V. Rajinikanth

Reducing Power Losses in Power System by Using Self Adaptive Firefly

Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
B. Suresh Babu and A. Shunmugalatha

A Soft-Computing Based Approach to Economic and Environmental

Analysis of an Autonomous Power Delivery System Utilizing Hybrid
Solar – Diesel – Electrochemical Generation . . . . . . . . . . . . . . . . . . . . . . . . . 133
Trina Som and Niladri Chakraborty

Parameter Adaptation in Differential Evolution Based on Diversity

Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146
S. Miruna Joe Amali and Subramanian Baskar

Data Clustering with Differential Evolution Incorporating

Macromutations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158
Goran Martinović and Dražen Bajer

Improved Adaptive Differential Evolution Algorithm with External

Archive . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 170
Rammohan Mallipeddi and Ponnuthurai Nagaratnam Suganthan

Fuzzy Clustering of Image Pixels with a Fitness-Based Adaptive

Differential Evolution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 179
Soham Sarkar, Gyana Ranjan Patra, Swagatam Das, and
Sheli Sinha Chaudhuri

Performance Study of a New Modified Differential Evolution Technique

Applied for Optimal Placement and Sizing of Distributed Generation . . . 189
S. Kumar, D. Pal, Kamal K. Mandal, and Niladri Chakraborty

An Approach to Solve Multi-criteria Supplier Selection While

Considering Environmental Aspects Using Differential Evolution . . . . . . . 199
Sunil Kumar Jauhar, Millie Pant, and Aakash Deep

Comparison between Differential Evolution Algorithm and Particle

Swarm Optimization for Market Clearing with Voltage Dependent
Load Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209
Deep Kiran, Bijaya Ketan Panigrahi, and A.R. Abhyankar
 Table of Contents – Part I XV

Multipopulation-Based Differential Evolution with Speciation-Based

Response to Dynamic Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 222
Souvik Kundu, Debabrota Basu, Sheli Sinha Chaudhuri

A Modified Differential Evolution for Symbol Detection

in MIMO-OFDM System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 236
Aritra Sen, Subhrajit Roy, and Swagatam Das

Lévy Flight Based Local Search in Differential Evolution . . . . . . . . . . . . . . 248

Harish Sharma, Shimpi Singh Jadon, Jagdish Chand Bansal, and
K.V. Arya

An Adaptive Differential Evolution Based Fuzzy Approach for Edge

Detection in Color and Grayscale Images . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
Satrajit Mukherjee, Bodhisattwa Prasad Majumder,
Aritran Piplai, and Swagatam Das

A Differential Evolution Approach to Multi-level Image Thresholding

Using Type II Fuzzy Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 274
Ritambhar Burman, Sujoy Paul, and Swagatam Das

Differential Evolution with Controlled Annihilation and Regeneration

of Individuals and a Novel Mutation Scheme . . . . . . . . . . . . . . . . . . . . . . . . 286
Sudipto Mukherjee, Sarthak Chatterjee, Debdipta Goswami, and
Swagatam Das

Differential Evolution and Offspring Repair Method Based Dynamic

Constrained Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 298
Kunal Pal, Chiranjib Saha, and Swagatam Das

Adaptive Differential Evolution with Difference Mean Based

Perturbation for Practical Engineering Optimization Problems . . . . . . . . . 310
Rupam Kundu, Rohan Mukherjee, and Swagatam Das

Transmission Line Management Using Multi-objective Evolutionary

Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 321
K. Pandiarajan and C.K. Babulal

Normalized Normal Constraint Algorithm Based Multi-Objective

Optimal Tuning of Decentralised PI Controller of Nonlinear
Multivariable Process – Coal Gasifier . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 333
Rangasamy Kotteeswaran and Lingappan Sivakumar

Simulated Annealing Based Real Power Loss Minimization Aspect

for a Large Power Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 345
Syamasree Biswas (Raha), Kamal Krishna Manadal, and
Niladri Chakraborty
XVI Table of Contents – Part I

Hybrid Artificial Bee Colony Algorithm and Simulated Annealing

Algorithm for Combined Economic and Emission Dispatch Including
Valve Point Effect . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 354
Sundaram Arunachalam, R. Saranya, and N. Sangeetha

Spectrum Allocation in Cognitive Radio Networks Using Firefly

Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 366
Kiran Kumar Anumandla, Shravan Kudikala,
Bharadwaj Akella Venkata, and Samrat L. Sabat

Bi-objective Optimization in Identical Parallel Machine Scheduling

Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 377
Sankaranarayanan Bathrinath, S. Saravana Sankar,
S.G. Ponnambalam, and B.K.V. Kannan

Teaching-Learning-Based Optimization Algorithm in Dynamic

Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 389
Feng Zou, Lei Wang, Xinhong Hei, Qiaoyong Jiang, and
Dongdong Yang

A Novel Ant Colony Optimization Algorithm for the Vehicle Routing

Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 401
Srinjoy Ganguly and Swagatam Das

Implementation of Fractional Order PID Controller for Three

Interacting Tank Process Optimally Tuned Using Bee Colony
Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 413
U. Sabura Banu

Artificial Bee Colony-Based Approach for Optimal Capacitor Placement

in Distribution Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 424
Attia El-Fergany, Almoataz Y. Abdelaziz, and
Bijaya Ketan Panigrahi

Grammatical Bee Colony . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 436

Tapas Si, Arunava De, and Anup Kumar Bhattacharjee

Artificial Bee Colony Algorithm for Probabilistic Target Q-coverage

in Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 446
S. Mini, Siba K. Udgata, and Samrat L. Sabat

Chaos Synchronization in Commensurate Fractional Order Lü System

via Optimal PIλ Dμ Controller with Artificial Bee Colony Algorithm . . . . 457
Anguluri Rajasekhar, Shantanu Das, and Swagatam Das

Cooperative Micro Artificial Bee Colony Algorithm for Large Scale

Global Optimization Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 469
Anguluri Rajasekhar and Swagatam Das
 Table of Contents – Part I XVII

Improvement in Genetic Algorithm with Genetic Operator Combination

(GOC) and Immigrant Strategies for Multicast Routing in Ad Hoc
Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 481
P. Karthikeyan and Subramanian Baskar
Ensemble of Dying Strategies Based Multi-objective Genetic
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 492
Rahila Patel, M.M. Raghuwanshi, and L.G. Malik
Effect of Photovoltaic and Wind Power Variations in Distribution
System Reconfiguration for Loss Reduction Using Ant Colony
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 504
H.A. Abdelsalam, Almoataz Y. Abdelaziz, R.A. Osama, and
Bijaya Ketan Panigrahi
Inter-species Cuckoo Search via Different Levy Flights . . . . . . . . . . . . . . . . 515
Swagatam Das, Preetam Dasgupta, and Bijaya Ketan Panigrahi
Cuckoo Search Algorithm for the Mobile Robot Navigation . . . . . . . . . . . . 527
Prases Kumar Mohanty and Dayal R. Parhi
Automatic Generation Control of Multi-area Power System Using
Gravitational Search Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 537
Rabindra Kumar Sahu, Umesh Kumar Rout, and Sidhartha Panda
Design and Simulation of FIR High Pass Filter Using Gravitational
Search Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 547
R. Islam, Rajib Kar, Durbadal Mandal, and Sakti Prasad Ghoshal
Solution of Optimal Reactive Power Dispatch by an Opposition-Based
Gravitational Search Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 558
Binod Shaw, V. Mukherjee, and Sakti Prasad Ghoshal
A Novel Swarm Intelligence Based Gravitational Search Algorithm
for Combined Economic and Emission Dispatch Problems . . . . . . . . . . . . . 568
Hari Mohan Dubey, Manjaree Pandit, Bijaya Ketan Panigrahi, and
Mugdha Udgir
Particle Swarm Optimization Based Optimal Reliability Design
of Composite Electric Power System Using Non-sequential Monte Carlo
Sampling and Generalized Regression Neural Network . . . . . . . . . . . . . . . . 580
R. Ashok Bakkiyaraj and Narayanan Kumarappan
A Bacteria Foraging-Particle Swarm Optimization Algorithm for QoS
Multicast Routing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 590
Rohini Pradhan, Manas Ranjan Kabat, and Satya Prakash Sahoo
Performance Evaluation of Particle Swarm Optimization Algorithm
for Optimal Design of Belt Pulley System . . . . . . . . . . . . . . . . . . . . . . . . . . . 601
Pandurengan Sabarinath, M.R. Thansekhar, and R. Saravanan
XVIII Table of Contents – Part I

Optimal Sizing for Stand-Alone Hybrid PV-WIND Power Supply

System Using PSO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 617
D. Suchitra, R. Jegatheesan, M. Umamaheswara Reddy, and
T.J. Deepika

A Peer-to-Peer Dynamic Single Objective Particle Swarm Optimizer . . . . 630

Hrishikesh Dewan, Raksha B. Nayak, and V. Susheela Devi

Aligned PSO for Optimization of Image Processing Methods Applied

to the Face Recognition Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 642
Juan Luis Fernández-Martı́nez, Ana Cernea,
Esperanza Garcı́a-Gonzalo, Julian Velasco, and
Bijaya Ketan Panigrahi

Optimal Operation Management of Transmission System with Fuel Cell

Power Plant Using PSO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 652
S. Vidyasagar, K. Vijayakumar, and D. Sattianadan

PID Tuning and Control for 2-DOF Helicopter Using Particle Swarm
Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 662
A.P.S. Ramalakshmi, P.S. Manoharan, and P. Deepamangai

Optimal Location and Parameter Selection of Thyristor Controlled

Series Capacitor Using Particle Swarm Optimization . . . . . . . . . . . . . . . . . 673
S. Devi and M. Geethanjali

A New Particle Swarm Optimization with Population Restructuring

Based Multiple Population Strategy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 688
Qingjian Ni, Cen Cao, and Huimin Du

Small Signal Stability Constrained Optimal Power Flow Using Swarm

Based Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 699
Mani Devesh Raj and Periyasami Somasundaram

Online Voltage Stability Assessment of Power System by Comparing

Voltage Stability Indices and Extreme Learning Machine . . . . . . . . . . . . . . 710
M.V. Suganyadevi and C.K. Babulal

A Peer-to-Peer Particle Swarm Optimizer for Multi-objective

Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 725
Hrishikesh Dewan, Raksha B. Nayak, and V. Susheela Devi

A Novel Improved Discrete ABC Algorithm for Manpower Scheduling

Problem in Remanufacturing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 738
Debabrota Basu, Shantanab Debchoudhury, Kai-Zhou Gao, and
Ponnuthurai Nagaratnam Suganthan
 Table of Contents – Part I XIX

Optimal Partial-Retuning of Decentralised PI Controller of Coal

Gasifier Using Bat Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 750
Rangasamy Kotteeswaran and Lingappan Sivakumar

Optimal Velocity Requirements for Earth to Venus Mission Using

Taboo Evolutionary Programming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 762
M. Mutyalarao, Amaranathan Sabarinath, and M. Xavier James Raj

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 773

 Table of Contents – Part II

Critical Issues in Model-Based Surrogate Functions in Estimation

of Distribution Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
Roberto Santana, Alexander Mendiburu, and Jose A. Lozano

Sandholm Algorithm with K-means Clustering Approach

for Multi-robot Task Allocation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
Murugappan Elango, Ganesan Kanagaraj, and S.G. Ponnambalam

Genetic Programming for Modeling Vibratory Finishing Process: Role

of Experimental Designs and Fitness Functions . . . . . . . . . . . . . . . . . . . . . . 23
Akhil Garg and Kang Tai

Non-fragile Robust PI Controller Design Using Co-variance Matrix

Adaptation Evolutionary Strategy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
K. Mohaideen Abdul Kadhar and S. Baskar

Meta Heuristic Approaches for Circular Open Dimension Problem . . . . . . 44

N. Madhu Sudana Rao, M. Aruna, and S. Bhuvaneswari

Protein Function Prediction Using Adaptive Swarm Based Algorithm . . . 55

Archana Chowdhury, Amit Konar, Pratyusha Rakshit, and
Ramadoss Janarthanan

Reduction of Bullwhip Effect in Supply Chain through Improved

Forecasting Method: An Integrated DWT and SVM Approach . . . . . . . . . 69
Sanjita Jaipuria and S.S. Mahapatra

An Ant Colony Optimization Algorithm for the Min-Degree

Constrained Minimum Spanning Tree Problem . . . . . . . . . . . . . . . . . . . . . . . 85
V. Venkata Ramana Murthy and Alok Singh

Multiobjective Differential Evolution Algorithm Using Binary Encoded

Data in Selecting Views for Materializing in Data Warehouse . . . . . . . . . . 95
Rajib Goswami, Dhruba Kumar Bhattacharyya, and
Malayananda Dutta

Robust Protective Relay Setting and Coordination Using Modified

Differential Evolution Considering Different Network Topologies . . . . . . . 107
Joymala Moirangthem, Bijaya Ketan Panigrahi,
Krishnanand K.R., and Sanjib Kumar Panda
XXII Table of Contents – Part II

Real-Coded Genetic Algorithm and Fuzzy Logic Approach

for Real-Time Load-Tracking Performance of an Autonomous Power
System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119
Abhik Banerjee, V. Mukherjee, and S.P. Ghoshal

Short Term Load Forecasting (STLF) Using Generalized Neural

Network (GNN) Trained with Adaptive GA . . . . . . . . . . . . . . . . . . . . . . . . . 132
D.K. Chaturvedi and Sinha Anand Premdayal

Gene Selection Using Multi-objective Genetic Algorithm Integrating

Cellular Automata and Rough Set Theory . . . . . . . . . . . . . . . . . . . . . . . . . . 144
Soumen Kumar Pati, Asit Kumar Das, and Arka Ghosh

Fusion at Features Level in CBIR System Using Genetic Algorithm . . . . . 156

Chandrashekhar G. Patil, Mahesh T. Kolte, and
Devendra S. Chaudhari

New Bio-inspired Meta-Heuristics - Green Herons Optimization

Algorithm - for Optimization of Travelling Salesman Problem
and Road Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 168
Chiranjib Sur and Anupam Shukla

A Comparative Analysis of Results of Data Clustering with Variants

of Particle Swarm Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180
Anima Naik, Suresh Chandra Satapathy, and K. Parvathi

Hybrid Particle Swarm Optimization Technique for Protein Structure

Prediction Using 2D Off-Lattice Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193
Nanda Dulal Jana and Jaya Sil

Software Effort Estimation Using Functional Link Neural Networks

Optimized by Improved Particle Swarm Optimization . . . . . . . . . . . . . . . . 205
Tirimula Rao Benala, Rajib Mall, and Satchidananda Dehuri

Improved Feature Selection Based on Particle Swarm Optimization

for Liver Disease Diagnosis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 214
Gunasundari Selvaraj and Janakiraman S.

Groundwater System Modeling for Pollution Source Identification

Using Artificial Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 226
Raj Mohan Singh and Divya Srivastava

Stochastic Analysis for Forecasting the MW Load of Plug-In Electric

Vehicles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237
C.S. Indulkar and K. Ramalingam
 Table of Contents – Part II XXIII

Biometric Based Personal Authentication Using Eye Movement

Tracking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 248
Atul Dhingra, Amioy Kumar, Madasu Hanmandlu, and
Bijaya Ketan Panigrahi

Accelerated Simulation of Membrane Computing to Solve the N-queens

Problem on Multi-core . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 257
Ali Maroosi and Ravie Chandren Muniyandi

A Genetic Algorithm Optimized Artificial Neural Network

for the Segmentation of MR Images in Frontotemporal Dementia . . . . . . . 268
R. Sheela Kumari, Tinu Varghese, C. Kesavadas,
N. Albert Singh, and P.S. Mathuranath

Intelligent Computation and Kinematics of 4-DOF SCARA Manipulator

Using ANN and ANFIS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 277
Panchanand Jha and Bibhuti Bhusan Biswal

Hybrid Neuro-Fuzzy Network Identification for Autonomous

Underwater Vehicles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
Osama Hassanein, G. Sreenatha, and Tapabrata Ray

Prediction of Protein Structural Class by Functional Link Artificial

Neural Network Using Hybrid Feature Extraction Method . . . . . . . . . . . . . 298
Bishnupriya Panda, Ambika Prasad Mishra, Babita Majhi, and
Minakhi Rout

ANN Modeling of a Steelmaking Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308

Dipak Laha

Crop Yield Forecasting Using Neural Networks . . . . . . . . . . . . . . . . . . . . . . 319

Mukesh Meena and Pramod Kumar Singh

Non-linear Dynamic System Identification Using FLLWNN with Novel

Learning Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 332
Mihir Narayan Mohanty, Badrinarayan Sahu,
Prasanta Kumar Nayak, and Laxmi Prasad Mishra

Analysis of Transient Stability Based STATCOM for Neural Network

Controller in Cascaded Multilevel Inverter . . . . . . . . . . . . . . . . . . . . . . . . . . . 342
P.K. Dhal and C. Christober Asir Ranjan

Emotion Recognition System by Gesture Analysis Using Fuzzy Sets . . . . 354

Reshma Kar, Aruna Chakraborty, Amit Konar, and
Ramadoss Janarthanan

Automatic Eye Detection in Face Images for Unconstrained Biometrics

Using Genetic Programming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 364
Chandrashekhar Padole and Joanne Athaide
XXIV Table of Contents – Part II

Neural Network Based Gesture Recognition for Elderly Health Care

Using Kinect Sensor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 376
Sriparna Saha, Monalisa Pal, Amit Konar, and
Ramadoss Janarthanan
City Block Distance for Identification of Co-expressed MicroRNAs . . . . . 387
Sushmita Paul and Pradipta Maji
Extreme Learning Machine Approach for On-Line Voltage Stability
Assessment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 397
P. Duraipandy and D. Devaraj
Quadratic Fuzzy Bilevel Chance Constrained Programming
with Parameters Following Weibull Distribution . . . . . . . . . . . . . . . . . . . . . 406
Animesh Biswas and Arnab Kumar De
Message Passing Methods for Estimation of Distribution Algorithms
Based on Markov Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 419
Roberto Santana, Alexander Mendiburu, and Jose A. Lozano
Application of Neural Networks to Automatic Load Frequency
Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 431
Soumyadeep Nag and Namitha Philip
RNN Based Solar Radiation Forecasting Using Adaptive
Learning Rate . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 442
Ajay Pratap Yadav, Avanish Kumar, and Laxmidhar Behera
Energy Efficient Aggregation in Wireless Sensor Networks for Multiple
Base Stations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453
Nagarjuna Reddy Busireddy and Siba K. Udgata
An Intelligent Method for Handoff Decision in Next Generation
Wireless Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 465
Laksha Pattnaik, Mihir Narayan Mohanty, and Bibhuprasad Mohanty
Path Planning for the Autonomous Underwater Vehicle . . . . . . . . . . . . . . . 476
Andrey Kirsanov, Sreenatha G. Anavatti, and Tapabrata Ray
A Game Theoretic Approach for Reliable Power Supply in Islanded DG
Grids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 487
Rohan Mukherjee, Rupam Kundu, Sanjoy Das,
Bijaya Ketan Panigrahi, and Swagatam Das
Classification of Day-Ahead Deregulated Electricity Market Prices
Using DCT-CFNN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 499
S. Anbazhagan and Narayanan Kumarappan
Multi-Objective Approach for Protein Structure Prediction . . . . . . . . . . . . 511
S. Sudha, S. Baskar, and S. Krishnaswamy
 Table of Contents – Part II XXV

Clustering Based Analysis of Spirometric Data Using Principal

Component Analysis and Self Organizing Map . . . . . . . . . . . . . . . . . . . . . . . 523
Mythili Asaithambi, Sujatha C. Manoharan, and
Srinivasan Subramanian

Feature Selection of Motor Imagery EEG Signals Using Firefly

Temporal Difference Q-Learning and Support Vector Machine . . . . . . . . . 534
Saugat Bhattacharyya, Pratyusha Rakshit, Amit Konar,
D.N. Tibarewala, and Ramadoss Janarthanan

Optimal Build-or-Buy Decision for Component Selection of Application

Package Software . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 546
P.C. Jha, Ramandeep Kaur, Shivani Bali, and Sushila Madan

Text and Data Mining to Detect Phishing Websites and Spam

Emails . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 559
Mayank Pandey and Vadlamani Ravi

Intelligent Fault Tracking by an Adaptive Fuzzy Predictor

and a Fractional Controller of Electromechanical System – A Hybrid
Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 574
Tribeni Prasad Banerjee and Swagatam Das

Differential Evolution and Bacterial Foraging Optimization Based

Dynamic Economic Dispatch with Non-smooth Fuel Cost Functions . . . . 583
Kanchapogu Vaisakh, Pillala Praveena, and Kothapalli Naga Sujatha

Permutation Flowshop Scheduling Problem Using Classical NEH,

ILS-ESP Operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 595
Vanita G. Tonge and Pravin Kulkarni

Analysis of Human Retinal Vasculature for Content Based Image

Retrieval Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 606
Sivakamasundari J. and Natarajan V.

Activity Recognition Using Multiple Features, Subspaces

and Classifiers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 617
M.M. Sardeshmukh, M.T. Kolte, and D.S. Chaudahri

Advanced Optimization by Progressive Mapping Search Method

of PSO and Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 625
Dong Hwa Kim, Jin Ill Park, and X.Z. Gao

Optimal Placement of DG in Distribution System Using Genetic

Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 639
D. Sattianadan, M. Sudhakaran, S.S. Dash, K. Vijayakumar, and
P. Ravindran
XXVI Table of Contents – Part II

Intelligent Controllers in Path Tracking of a Manipulator with Bounded

Disturbance Torque . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 648
Neha Kapoor and Jyoti Ohri

Multiscale and Multilevel Wavelet Analysis of Mammogram Using

Complex Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 658
E. Malar, A. Kandaswamy, and M. Gauthaam

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 669

A Populated Iterated Greedy Algorithm with Inver-Over
Operator for Traveling Salesman Problem

M. Fatih Tasgetiren1, Ozge Buyukdagli1, Damla Kızılay1, and Korhan Karabulut2

1
Industrial Engineering Department, Yasar University, Izmir, Turkey
2
Software Engineering Department, Yasar University, Izmir, Turkey
{fatih.tasgetiren,[email protected],
damla.kızı[email protected],[email protected]}

Abstract. In this study, we propose a populated iterated greedy algorithm with

an Inver-Over operator to solve the traveling salesman problem. The iterated
greedy (IG) algorithm is mainly based on the central procedures of destruction
and construction. The basic idea behind it is to remove some solution compo-
nents from a current solution and reconstruct them in the partial solution to ob-
tain the complete solution again. In this paper, we apply this idea in a populated
manner (IGP) to the traveling salesman problem (TSP). Since the destruction
and construction procedure is computationally expensive, we also propose an
iteration jumping to an Inver-Over operator during the search process. We ap-
plied the proposed algorithm to the well-known 14 TSP instances from
TSPLIB. The computational results show that the proposed algorithm is very
competitive to the recent best performing algorithms from the literature.

Keywords: traveling salesman problem, iterated greedy algorithm, inver-over

operator, memetic algorithm, genetic algorithm, meta-heuristics.

1 Introduction

Symmetric traveling salesman problem (TSP) is well-known and widely studied com-
binational optimization problem which bases on the idea of finding the shortest tour
between cities that has to be visited once by the salesman. Euclidean TSP is a sub-
set of TSP in which distances are on Euclidean plane. Mathematically speaking, the
distance of any two vertices = ( , ) and = , is given by

, = + (1)

If a distance matrix , contains a distance from city to city , then the tour length
is given by
=∑ , +1 + ,1 (2)
TSP is stated as an NP-hard optimization problem by Arora [4]. In order to solve
NP-hard combinational optimization problems, many heuristic or meta-heuristic algo-
rithms have proposed: Simulated Annealing [8], [23], Tabu Search [14], Genetic

B.K. Panigrahi et al. (Eds.): SEMCCO 2013, Part I, LNCS 8297, pp. 1–12, 2013.
© Springer International Publishing Switzerland 2013
2 M. Fatih Tasgetiren et al.

Algorithms [1], [19], [28], Variable Neighborhood Search [33], Iterated Local Search
[3], Neural Networks [11], [26], Ant Colony Optimization [12], [52], Particle Swarm
Optimization [10], [47], Harmony Search [16], Differential Evolution [36], Honey
Bees Mating Optimization [30], Memetic Algorithm [11], [31].
TSP algorithms are classified as exact and approximate. Finding the optimal solu-
tion in a limited number of steps can be guaranteed by the exact ones such as cutting
plane or facet finding algorithm [39] that has solved the large instances. Performance
of the TSP can be evaluated by solution time and error value, and these exact algo-
rithms are stated to have higher time complexity [21]. In recent years, for approximate
algorithms, solutions have several percentage low error value, they are produced
quickly and provide good solutions, but do not guarantee the optimal solution. In
order to find approximate solutions some heuristic methods were arisen [12], [22],
[32], [45-46], [48]. In the approximate algorithms, some of them have a small devia-
tion from the optimal solution and if this can be accepted, it may be appropriate to use
the approximate algorithm [2], [21]. The approximate algorithms for TSP can be ex-
amined in two different classes such as tour construction methods [5], [9], [42] and
tour improvement methods [3], [17], [27]. According to tour construction method,
new city is added at each step of a tour that is built but for the tour improvement me-
thod, an initial solution is generated and then this initial one is tried to be improved by
applying the various exchanges. Several meta-heuristic algorithms are included in the
tour improvement methods [8], [14], [19], [23], [31]. Very recently, a genetic algo-
rithm with a Greedy Sub Tour Mutation (GSTM) is presented in [1] whereas a me-
metic algorithm with the improved Inver–Over operator is presented in [38]. In this
paper, we present a populated iterated greedy (IGP) algorithm with Inver-Over opera-
tor (IGP_IO) to solve the traveling salesman problem (TSP). To the best of our know-
ledge, this is the first reported application of iterated greedy algorithm to the TSP in
the literature.
The rest of the paper is organized as follows. In Section 2, iterated greedy algo-
rithm with Inver-Over operator is given in detail. The computational results are given
in Section 3. Finally, conclusions are given in Section 4.

2 Iterated Greedy Algorithm With Inver-Over Operator

As mentioned before, the basic idea behind the IG algorithm is to remove some solu-
tion components from a current solution and reconstruct them in the partial solution to
obtain the complete solution again. In this paper, we apply this idea in a populated
manner (IGP) to the traveling salesman problem (TSP). Since the destruction and
construction procedure is computationally expensive even though we employ a speed-
up procedure for insertion, we also propose an iteration jumping to an Inver-Over
operator during the search process in order to take advantage of both algorithms. Fol-
lowing subsections describe the IG algorithm and the IO operator briefly, and then we
describe the IG with the IO operator in detail.
 A Populated Iterated Greedy Algorithm with Inver-Over Operator for TSP 3

2.1 Iterated Greedy Algorithm

The IG algorithm is presented in Ruiz and Stützle [43], which has successful applica-
tions in discrete/combinatorial optimization problems such as in [7], [13], [15], [18],
[24-25], [29], [35], [37], [41], [44], [49], [51], [53]. The IG algorithm is fascinating in
terms of its conceptual simplicity, which makes it easily tunable and extendible to any
combinatorial optimization problem. In an IG algorithm, there are two central proce-
dures consisting of the destruction and the construction phases. The algorithm starts
from some initial solution and then iterates through a main loop where a partial can-
didate solution is first obtained by removing a number of solution components from a
complete candidate solution. This is called the destruction phase. Next a complete
solution is reconstructed with a constructive insertion heuristic by inserting each node
in the partial candidate solution. Before continuing with the next loop, an acceptance
criterion is then used to decide whether or not the re-constructed solution will replace
the incumbent one. This is called construction phase. These simple steps are iterated
until some predetermined termination criterion such as a maximum number of itera-
tions or a computation time limit is met. An outline of the IG algorithm is given in
Figure 1.

()
π= ()
=
( )
= ( , )
( )< ( )
=
( )< ( )
=

Fig. 1. Iterated Greedy Algorithm

Regarding the
destruction and construction procedure denoted as
( , ), nodes are randomly taken from the solution without
repetition in the destruction step. We use the tournament selection with size 2 to select
each node in such a way that two edges are chosen and distances of these two edges
are computed. Then the worst one with the first node is removed from the solution. In
the construction phase, the second phase of the NEH insertion heuristic [34] is used to
complete the solution. To do so, the first node is inserted into all possible +1
positions in the destructed solution generating + 1 partial solutions.
Among these + 1 partial solutions, the best partial solution with the minimum
tour length is chosen and kept for the next iteration. Then the second node is consi-
dered and so on until a final solution is obtained.
4 M. Fatih Tasgetiren et al.

These insertions are computationally very expensive especially for larger instances.
However, insertion cost can be evaluated by a nearest-neighbor criterion as follows: If
a node is to be inserted in an edge ( , ), the insertion cost can be achieved by
= + . It significantly accelerates the insertions necessary for the con-
struction phase of the IG algorithm.

2.2 Inver-Over Operator

Inver over (IO) operator is a state-of-the-art algorithm for the TSP and proposed by
Tao and Michalewicz [49]. This operator is based on inversion moves and aims to
further improve the solution quality while using the information obtained from the
current population. This makes the algorithm very adaptive and efficient. Figure 2
provides a detailed description of the algorithm. The algorithm starts with a randomly
selected city from the individual and then the second city, that the inversion will be
applied until, is selected in two different ways. With probability , algorithm random-
ly selects the second city for inversion from the current individual. If ( ) < , then
another individual is randomly selected from the population and a part of the pattern
(at least 2 cities) of that individual is used as a reference to obtain better solutions. In
this work, we employ a tournament selection (TS) with size 2 to determine another
individual from the population instead of choosing randomly.

( )

( )
( =1 )
=

( )
( () < )

( )

( )< ( )
=

Fig. 2. Inver-Over Operator

 A Populated Iterated Greedy Algorithm with Inver-Over Operator for TSP 5

2.3 Iterated Greedy Algorithm with Inver-Over Operator

In the proposed populated iterated greedy algorithm with Inver-Over operator
(IGP_IO), the main idea is to jump into another operator at each iteration of a genera-
tion with a jumping probability . If a uniform random number (0,1) is less than
, then the IGP_IO algorithm jump into the IO operator, otherwise, IG is applied to
the individual on hand. By doing so, the search process of the IG algorithm is
enriched and computational time is reduced.
The IGP_IO algorithm starts with an initial population. The permutation represen-
tation is used. We employ the Nearest Neighbor (NN) heuristic proposed in [42].
Figure 3 shows the construction of the initial population.

( )
=1 =
=1
1 =
1 =
=2
= _
=1
( = )
1 <
= 1
=

=
=

, = 1,2, . . ,
, = 1,2, . . ,

Fig. 3. Initial Population with NN Heuristic

In the ( ) procedure, NN heuristic generates solutions. We sort them

according to their fitness values. Then we only take solutions for the initial popu-
lation. This procedure provides a good initial population with sufficient diversity.
Then, for each individual in the population, we apply either the IG algorithm or the
IO operator depending on the jumping probability . There are two critical parame-
ters of the IGP_IO algorithm. These are the jumping probability and the destruc-
tion size . After some experiments, the destruction size is taken as < 0.25 .
Regarding the jumping probability . We tried the following values as =
0.0,0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9,1.0 . Then we decided to take the jumping
Another Random Scribd Document
with Unrelated Content
sent to prison in the course of his duty—she would have given her
oath for it. He had been unaffectedly taken off his guard, and yet
there had been no vestige of fear or suspicion in his puzzlement.
Could a guilty man have accomplished such a feat—even if he were
the most consummate actor that was ever born?
The girl felt a crying need for Simon Templar’s superior knowledge
and acuter judgment. She was helpless—beaten. But for the
amusement she had detected in Lapping’s eyes, she would not have
hesitated to acquit him. Even now she was strongly impelled to do
so, in the light of developments subsequent to that, and she was
casting around for some theory that would eliminate any malevolent
motive and still account satisfactorily for the indisputable fact that he
had seen at once what she had been driving at and had calmly and
effectively refused to allow himself to be inveigled into saying any
more than he chose to say.
But then—the realisation only came to her with stunning conviction
when she was walking up the drive to the Manor—if Lapping were
blameless, then the only person who could be the Tiger was Agatha
Girton!
 Chapter XIII.
The Brand
She was aghast at the thought.
Could she have been living for months and years in the home of
the Tiger? It seemed impossible, and yet the theory seemed to get
more watertight with every second. It would account for Agatha
Girton’s continual absences abroad, and the letters which came from
the Riviera could easily have been fake alibis. But in that case the
trip to South Africa would have been real enough—the Tiger would
naturally have gone there to look for a derelict gold mine to salt with
his plunder, as the Saint had explained. And she remembered that
Agatha Girton had been away just about the time when the Tiger had
broken the Confederate Bank.
So the Tiger was a woman! That was not outside the bounds of
credibility, for Miss Girton would have had no trouble in
impersonating a man.
Patricia had to fight down her second panic that afternoon before
she could open the front door and enter the house. It struck her as
being unpleasantly like walking into the Tiger’s jaws as well as
walking into his den—or her den. If Miss Girton were the Tiger, she
would already be suspicious of Patricia’s sudden friendship with
Simon Templar; and that suspicion would have been fortified by the
girl’s adventure of the previous night and her secretiveness about it.
Then, if Lapping was suspect also, it would not be long before the
Tiger’s fears would be confirmed, and she would be confronted with
the alternatives of making away with Patricia or chancing the girl’s
power to endanger her security. And, from all Simon’s accounts of
the Tiger, there seemed little doubt on which course the choice
would fall.
 The Tiger must be either Lapping or Miss Girton. The odds about
both stared Patricia in the face—and it looked as if Aunt Agatha won
hands down.
At that moment the girl was very near to flying precipitately back to
the Pill Box and surrendering all the initiative to Simon: the thought
of his trust in her checked that instinct. She had been so stubbornly
insistent on being allowed to play her full part, so arrogantly certain
of her ability to do it justice, so impatient of his desire to keep her out
of danger—what would he think of her if she ran squealing to his
arms as soon as the fun looked like becoming too fast and furious?
To have accepted his offer of sanctuary would not necessarily have
lowered her in his eyes; but to have refused it so haughtily and then
to change her mind as soon as she winded the first sniff of battle
would be a confession of faint-heartedness which he could not
overlook.
“No, Patricia Holm,” she said to herself, “that’s not in the book of
the rules, and never has been. You would have a taste of the soup,
and now you’ve fallen in you’ve jolly well got to swim. He wouldn’t
say anything, I know, and he’d be as pleased as Punch—for a day or
two. But after a bit he’d begin to think a heap. And then it’d all be
over—smithereened! And that being so we’ll take our medicine
without blubbering, even if the jam has worn a trifle thin. . . .
Therefore, Patricia Holm, as our Saint would say, where do we go
from here?”
Well, she’d done all she could about Lapping, and she must wait
to see what he thought of the evidence. There remained Agatha
Girton, and the Saint’s orders must be obeyed under that heading
the same as under the other. Patricia braced herself for the ordeal,
and just then her hand touched something hard in her pocket. She
brought it out and took a peep at it—the automatic which Simon had
given her. It was marvellously encouraging to remember that that
little toy could at a touch of her finger splutter a hail of sudden death
into anyone who tried to put over any funny business. She put it back
in her pocket and patted it affectionately.
The housekeeper, emerging from the kitchen to see who had
come in, informed her that Miss Girton had returned half an hour
since, and Patricia felt her heart pounding unevenly as she went to
the drawing-room.
To her surprise, the door was locked. She rattled the handle, and
presently Agatha Girton answered.
“Who’s that?”
“Me—Patricia.”
“I can’t see you now.”
The girl frowned.
“It’s important,” she persisted. “I want to talk to you.”
“Well, I’m busy, and I can’t spare the time. Come back presently—
or if you’re upstairs I’ll call you when I’m ready.”
Patricia’s fist clenched, but it was no use making a scene. She
would have to wait till Agatha Girton came out.
But what was this secrecy for? Miss Girton had never before
locked herself up in the drawing-room. Nor, before last night, had
she even spoken so abruptly without cause—it seemed as if she was
actually frightened and jumpy. And what was this new occupation
which demanded such privacy and such complete isolation?
Patricia went slowly up to her room, racking her brain to fit the
pieces in the jig-saw together. Was the Tiger rattled after all? Had
Simon succeeded as well as that, and was the Tiger even then
concentrating on evolving some master-stroke of strategy that would
release the Tiger Cubs from the net which was drawing round them
and at the same time destroy the man who had come so near to
defeating them? They were not beaten yet, but the final struggle was
only a few hours away—and was it dawning upon the Tiger Cubs
that they had almost fatally underestimated their opponent?
There was no time to lose. Already it was getting late, and Aunt
Agatha had to be interviewed and a light dinner bolted before Orace
arrived to take her back to the Saint punctually for the attack they
had planned. The girl kicked off her shoes, stripped to her stockings,
and pulled on her bathing costume. She discarded the light dress
she had worn and replaced it with a serviceable tweed skirt and a
pullover. The automatic went into a pocket in the skirt, and a pair of
brogues completed the outfit. So clad, she felt ready for anything.
It was as she was lacing her shoes that she heard a sound which
she had not noticed while moving about the room. It came from
beneath the floor, muffled and very faint—a murmur of voices. And
the drawing-room was right under her feet.
She stood up quickly and tiptoed to the window, but the windows
of the drawing-room must have been shut, for she was able to hear
better inside than by leaning out. Then Miss Girton was not alone!
But the mutter was so low that Patricia could not even distinguish the
voices, though she pressed her ear against the floor, except that she
was able to make out that both had a masculine timbre. Aunt
Agatha’s would be one. Whose was the other?
The girl realised at once the importance of finding out further
details about this conference. If she could get a look at the visitor,
and overhear some of the conversation, the result might be of
inestimable value, for there could be no disputing the fact that all the
circumstances combined to adorn the incident with a distinctly fishy
aspect. And if the clue provided were as damning as she hoped it
would be, and she were caught eavesdropping . . . The girl drew a
long breath and felt again for the reassuring heavy sleekness of her
weapon. She had told the Saint that she could be more help than
hindrance to him, and now was the time to prove it. The risk attached
to the enterprise would have to be faced in the Saintly manner—with
a devil-may-care smile and a shrug and a pious hope that the Lord
would provide.
“Carry on, brave heart,” said Patricia, and opened the door.
She crept noiselessly down the stairs, but on the last flight she had
to stop and deliberate. There were two ways: the door or the
windows. The keyhole seemed easier, but she had just remembered
that every board in the floor of the old hall had its own vociferous
creak. She would have to spy from the garden.
She listened, leaning over the banisters, but the walls and the door
were more solid affairs than the floor, and the people in the drawing-
room must have been talking in subdued tones—perhaps they had
just realised the possibility of their being overheard. She could barely
catch a whisper of their speech.
As silently as she had descended she climbed the stairs again.
The door of Miss Girton’s room stood open, and she went in,
crossed swiftly, and opened the casement windows. This room was
on the opposite side of the house to the drawing-room, and just
beneath the windows was a kind of shed with a sloping roof. As a
schoolgirl, Patricia had often clambered through those windows and
taken perilous toboggan-rides down the slates, saving herself from
the drop by catching her heels in the gutter. Now she was bigger,
and the stunt had no terrors for her.
Slithering swiftly over the sill she gathered up her skirt, held on for
a second, and then let herself slide. Rotten as it was, the gutter
stopped her as safely as it had ever done, in spite of her increased
weight. Then she worked herself over the edge, let herself down as
far as she could, and let herself fall the remaining five feet, landing
lightly on the grass below.
She doubled round the house, and then she had a set-back, for
the curtains of the drawing-room windows were drawn, and the
windows themselves were closed. This had not been so when she
came in. Returning from Lapping’s, she approached the house from
the drawing-room side, and she could not have failed to notice
anything so out of the ordinary, for Aunt Agatha verged on the cranky
in her passion for fresh air and light even in the most unseasonable
weather. Had the visitor, then, arrived after Patricia, or had the
curtains been drawn for fear of her nosing round in the garden?
That, however, could be debated later. She stole up and examined
both the French windows, but even from the outside she could see
that they were fastened, and the hangings had been so carefully
arranged that not even a hair’s breadth of the room was visible. She
could have cried with vexation.
She meditated smashing a pane of glass and bursting in, but a
moment’s reflection showed her the futility of that course. Simon
Templar might have brought it off, but she did not feel so confident of
her own power to force the pace. And with two of them against her,
in spite of the automatic she might be tricked and over-powered. At a
pinch she would have made the attempt, but the issue was too great
to take such a chance when a man far more competent to deal with
the matter was waiting to do his stuff if she could learn enough to
show him where to make the raid. And the one certain thing in a
labyrinth of mystery was that a man who visits somebody else’s
house generally leaves it again sooner or later.
 She looked around for a hiding place, and saw at once the
summer-house in a corner of the garden. From there she could
watch both the drawing-room windows and the front door—no
observation post could have been better placed. She sprinted across
to it. There was a window ideally placed, half overgrown with
creeper, and through that she could see without being seen. Patricia
settled down to her vigil.
It was about then that her name cropped up in the conversation
which was taking place in the drawing-room, but that she could not
know.
“One little pill—and such a little one!” remarked the man who was
talking to Agatha Girton, and he placed the tiny white tablet carefully
in the centre of the table. “You wouldn’t think it could make a grown
woman sleep like a log for about six hours, would you? But that’s
what it’ll do. Just put it in her coffee after dinner—it’ll dissolve in no
time—and she’ll pass out within five minutes. Lay her out
comfortably on the sofa, and I’ll collect her about eleven.”
He was a tall, sparsely-built man, and although they were alone he
kept his soft hat pulled low down over his eyes and his coat collar
was turned up to his chin so that only part of his face was visible.
“You can do your own murdering,” snapped Agatha Girton in a
strained voice, but the man only laughed.
“Not murder, I promise you. She’s strong, and all she’ll get will be
a slight headache to-morrow morning. You can’t imagine I’d kill such
a charming girl!”
Miss Girton leaned across the table, thrusting her face down close
to his, but in the gloom the shadow of his hat brim fell across his
features like a mask.
“Swine!” she hissed.
He moved his hand protestingly.
“Your newly-acquired righteousness isn’t wanted,” he said. “I’m
honestly very fond of Patricia, but I’m afraid she wouldn’t take me
seriously as things are. So let us say that I propose to apply the
rather unconventional methods of Miss Holm’s sheiks.”
“I am also very fond of Patricia,” said Miss Girton.
“You ought to tell her,” replied the man sardonically. “But mind you
break it to her gently. No, my dear, that shouldn’t trouble you very
much. On a suitable occasion I shall ask Patricia to marry me, and
nothing could be more respectable than that.”
Miss Girton stared.
“Why lie?” she asked bitterly. “There are no witnesses.”
“But I mean it,” persisted the man.
The woman’s gaunt face twisted in a sneer, and there was a
venomous hatred in her eyes.
“Some people say that all crooks are slightly mad,” she answered.
“I’m beginning to think they’re right.”
The man lifted his face a trifle, so that he could look reproachfully
at her. He ignored her sally, but he spoke again in a soft, dreamy,
sing-song tone.
“I was never more serious in my life. I have succeeded in my
profession. In my way I am a great man. I am educated, clever,
cultured, travelled, healthy, entertaining. I have all the wealth that a
man could desire. My youth is passing away, though I still look very
young. But I see the best years slipping past and leaving me alone. I
love Patricia. I must do this to show her that I am in earnest;
afterwards she will refuse me nothing. . . .”
The voice trailed away, and Miss Girton wrenched a chair round
savagely.
“Mad!” she muttered, and he sat up with a start.
“What was I saying?” His eye fell on the glistening white pellet
marooned in the expanse of polished walnut. “Oh, yes. Do you
understand?”
Agatha Girton came close to him again.
“You’re mad,” she rasped—“I’ll tell you so again. With all this
money, all this wealth you boast about, why did you have to put the
black on me? If you’re so rich, what was a mere twenty thousand to
you?”
“One can never have too much,” said the man. “And now, as
things have fallen out, it is all going back where it belongs—as a
dowry. Anyhow, is twenty thousand so much to pay for liberty, and
even life? They might manage to get you for murder, you know, Aunt
Agatha.”
“Don’t call me Aunt Agatha.”
“Then——”
 “Nor that, either.”
The man shrugged.
“Very well, O Nameless One,” he said with calculated insolence.
“Remember this, Nameless One, that I have taken a lot of money
from you, but now I want something that money cannot buy. And you
will give it to me. . . . Otherwise—but you dare not be stupid!”
Miss Girton still looked at him with those deep-set eyes of hate.
“I don’t know,” she said slowly. “For years you’ve made my life a
misery. I’ve a mind to end it. And putting you where you belong might
make them forget some of the things they know about me. The
busies are always kind to squeakers.”
The man was silent for a short space; then he put up his hand and
pulled his hat a little further over his eyes. He turned his head, but he
could only have seen her feet.
“I am not like the busies,” he returned in a voice that was cold and
flat and hard like a sheet of ice. “Don’t talk like that—or I might be
tempted to put you where you will have no power to threaten me.”
He stood up and walked to the door, his hands in the side-pockets
of his coat and his shoulders hunched up. He turned the key and
pulled the door open quickly and silently. Leaning out, he glanced up
and down the hall, then half pulled the door to while he spoke to
Miss Girton.
“I can let myself out. The lady is upstairs, isn’t she?”
“I heard her moving about overhead a little while ago.”
He waited a moment as though listening.
“Your ears are better than mine,” he said, and looked at her
warningly. “Do exactly as I told you, and don’t try to double-cross me.
You mightn’t succeed. Good-evening.”
The door closed behind him, and she could hear him moving
across the hall.
For a moment she hesitated.
Then she crossed the room swiftly and pulled out the drawer of the
writing bureau. She felt in the cavity and tugged. When she
straightened up there was a small automatic pistol in her hand. She
went to the windows at the front, snapping back the jacket of the gun
as she did so and pushing over the safety catch.
 The heavy curtains swung away as she jerked at the cord that
controlled them, and she saw the man hurrying down the drive.
Without looking round, he turned and went down the road to the left,
and Agatha Girton opened the french windows and stepped out on to
the terrace. The range was about twenty-five yards, but the hedge at
the bottom of the garden was a low one, and his body could be seen
above it from the waist upwards.
Miss Girton raised the gun and extended her arm slowly and
steadily, as she might have done in a Bisley competition. At that
moment the man turned to the right again into a field, and so his
back was squarely presented to her.
The echoes of the two rapid shots rattled clamorously in the still air
of the evening. She saw the man fling up his arms, stagger, and fall
out of sight.
Suddenly she found Patricia beside her.
“Who was it?” gasped the girl, white-faced and shaking. “What
have you done?”
“Killed him, I hope,” said Agatha Girton coolly.
She was standing on tiptoe, gazing out into the gathering dusk,
trying to see the result of her shooting. But there was the hedge at
the end of the Manor garden and the hedge that lined the field into
which the man had passed, both hiding the more distant ground from
her, and she could see no sign of him.
“Stay here while I go and see,” she commanded.
She walked quickly down the drive, and the automatic still swung
in her hand. Patricia saw her enter the field.
The man was lying on the grass, sprawled out on his back. His hat
had fallen off, and he stared at the sky with wide eyes. Miss Girton
put down her gun and bent over him, feeling for the beating of his
heart. . . .
Patricia heard the woman’s shrill scream; and then she saw
Agatha Girton standing up, swaying, with her hands over her face.
The girl’s fingers closed over the butt of the automatic in her
pocket as she raced down the drive and out into the road. Miss
Girton was still standing up with her face in her hands, and Patricia
saw with a sudden dread that blood was streaming down between
the woman’s fingers. There was no trace of the man.
 “He was shamming,” gasped Agatha Girton. “I put down my gun—
he caught me—he had a knife. . . .”
“What’s he done?”
Miss Girton did not answer at once. Then she pointed to a clump
of trees and bushes in the far corner of the field, which was not a big
one.
“He took the gun and ran that way—there’s a sunken lane
beyond.”
“I’ll go after him,” said Patricia without stopping to think of the
consequences, but Agatha Girton caught her arm in a terrible grip.
“Don’t be a little fool, child!” she grated. “That’s death. . . . I lost my
head. . . . All he said was: ‘Don’t do it again!’ ”
The woman’s hands were dripping red, and Patricia had to lead
her back to the house and up the stairs.
Agatha Girton went to the basin and filled it. She bathed her face,
and the water was hideously dyed. Then she turned so that the girl
could see, and Patricia had to bite back an involuntary cry of horror,
for Miss Girton’s forehead was cut to the bone in the shape of a
capital T.
 Chapter XIV.
Captain Patricia
“He branded me—the Tiger——” Agatha Girton’s voice was
pitched hysterically. “By God . . .”
Her face had become the face of a fiend. Hard and grim it always
was—now, with smears of blood from brow to chin and her hair
straggling damply over her temples, it was devilish.
“I’ll get even for this one day. . . . I’ll make him crawl. . . . Red-hot
irons are too good for that——”
“But, Aunt Agatha——”
Patricia was full of questions, and it seemed the right moment to
let some of them off, but Miss Girton turned on her like a wild beast,
and the girl recoiled a step from the blaze of fury in those
smouldering eyes.
“Go away.”
“Was that the man who’s been blackmailing you?”
“Go away.”
“And is he the Tiger?”
Miss Girton took a pace forward and pointed to the door.
“Leave me, child,” she said in a terrible voice. “Go back to your
Saint before I forget—— If you aren’t outside in a second I’ll throw
you out.”
She meant it. Patricia had never seen and hoped she would never
see again the face of a woman so contorted with passion. There was
nothing to do.
“Very well,” said Patricia steadily. “I’ll go. I hope you won’t be
sorry.”
“Go, then.”
The girl flung up her head and marched to the door.
 Go back to Simon? She would. There wasn’t much risk about
walking over to the Pill Box, she thought, and the feel of the
automatic in her pocket gave her all the courage she needed. The
Saint wouldn’t be expecting her, but he could hardly object,
considering the news she was bringing him. It had been an eventful
afternoon—more eventful than he could possibly have foreseen—
and, since there was nothing more that she could achieve on her
own, it was essential that he should be provided with all the news up
to date.
The time had passed quickly. It was twenty to seven when she set
out; she came in sight of the Pill Box towards a quarter past, having
taken it easy, and by that time it was nearly dark.
The sea shone like dull silver, reflecting all the last rays of twilight,
and from the top of the cliff Patricia strained to see the ship they had
observed that morning. She thought she could make out the tiniest of
black dots on the horizon, but she would not have sworn to it. That
was the ship that the Saint and Orace and she were scheduled to
capture by themselves, and the monumental audacity of the scheme
made her smile. But it was just because the scheme was so
impossible that the prospect of attempting to carry it out did not
bother her at all: it was the sort of reckless daredevil thing that
people did in books and films, the forlorn hope that always
materialised in time to provide a happy ending. She could think of no
precedent for it in real life, and therefore the only thing to go by was
the standard of fiction—according to which it was bound to succeed.
But she wondered if any man living except the Saint—her Saint—
would have had the imagination to think of it, the courage to work out
the idea in all seriousness, the heroic foolhardiness to try and bring it
off, and the personality to captain the adventure. She and Orace
were nothing but his devoted lieutenants: the whole fate of the long
hazard rested on the Saint’s broad shoulders.
With a shrug and a smile that showed her perfect teeth—a smile of
utter fearlessness that Simon would have loved to see—the girl
turned away and strolled across to the Pill Box. There was a light in
the embrasure which she knew served for a window in the dining-
drawing-smoking-sitting-room, but when she peeped in she saw only
Orace laying dinner. She went in, and he swung round at the sound
of her footsteps.
She was amused but perplexed to see his face light up and then
fall again as he recognised her.
“Where’s Mr. Templar?” she asked, and he almost glared at her.
“Back ut arf pas’ sevin,” he growled.
He picked up his tray and stalked off towards the kitchen, and the
girl stared after him in puzzlement. Orace, though a martinet, was
only actually rude to Tiger Cubs and detectives: she had already
seen through his mask of ferocity and discovered the kindly
humanist underneath. On the last occasion of his escorting her home
his manner had been even paternal, for Simon Templar’s friends
were Orace’s friends. But this, now, was a ruffled Orace.
She followed him to the kitchen.
“Can I help with anything?” she inquired cheerfully.
“Naow, don’t think sa, miss,” he replied gruffly. “I’m use ter
mannidging alone—thanks.”
“Then could you tell me where Mr. Templar’s gone? I could walk
on and meet him.”
Orace hammered the point of a tin-opener into a can of salmon
with quite unnecessary violence.
“Dunno anythink about it,” he said. “You can betcha life, miss, ’e’ll
be ’ome when ’e said ’e would, if ’e can ’umanly possibly do ut. Most
thunderin’ punctual man alive, ’e is, an ’e’ll come in the door just
when the clock strikes. So yer got nuffin ta worry about.”
He ended on a more gentle note, but there was no doubt that he
was very upset.
“Why—has anything happened to make you think I’d be likely to
worry?” Patricia queried, with her heart thumping a little faster. “Was
he going to do anything special this afternoon?”
“Naaow!” snarled Orace, unconvincingly derisive, and went on
hacking at the tin.
The girl went back to the sitting-room and dropped into a chair.
The Saint’s cigarette-box was handy to her elbow, and she took a
cigarette and lighted it thoughtfully.
Whether she was intended to worry or not, there could be no
denying the obvious fact that Orace was distinctly agitated. She
found it was twenty minutes and a bit past seven, and wondered if
the Saint would be as punctual as Orace had predicted, and whether
they would have to assume that something had happened to him if
he hadn’t arrived within five minutes of the half-hour. Where could he
have gone? There was nothing to be done about the Tiger’s ship at
that hour. Had he gone on a preliminary reconnaissance of the
island? Had he taken it into his head to inspect the Old House at
closer quarters? Or had he gone over to beard Bittle or Bloem again
—the sort of senseless bravado that would give a man like him a
thrill?
She watched the minute hand of her watch travel down to the
twenty-five-past mark, and reflected that she had been spending a
good deal of her time lately with one eye on the clock, wondering if
the Saint was going to be punctual or not. Heavens, he wasn’t the
only one who could be worried!
Orace came in and laid a place for her. Then he tugged an
enormous silver turnip from his trousers pocket.
“In a minnit er two,” he said. “Thunderin’ punctual, ’e always is.”
He nodded to her encouragingly, and strutted out. She heard his
boots on the concrete floor outside, and guessed that he had gone to
the entrance to see if he could spot the Saint coming up the hill.
At twenty-five to eight there was still no sign of the Saint.
Patricia took to moving restlessly about the room. She felt
suddenly depressed. The Saint had gone swashbuckling off into the
blue, without a word to anyone—and had blasted his reputation for
punctuality. He might have been in so many different places, trying to
do so many different things: she raged at her helplessness. She
could only wait and wait and wait, and he’d either turn up or he
wouldn’t. No clue. . . . Anything might have happened to him. She
racked her brains to deduce where he would be most likely to have
gone, and an appalling number of possibilities made faces at her and
invited her to take her pick.
Orace came in again. He had taken off his apron and put on his
coat and a cap. One of his pockets bulged and sagged.
“I’m gonna see if I can find ’im, miss,” he said. “But wiv yore
permission I’ll see you ’ome fust.”
She stood up.
 “Where are you going?”
“Jus lookin rahnd, miss. ’E tole me wun or two plyces ta try. I’ll find
’im orlright—don chew worry.”
“I’ll come with you,” she said at once.
He shook his head.
“Carnt ave ya doin that. Fennything wuz ta appen to yer, ’e’d kill
me.”
“Where do we go first?” she demanded, ignoring his reply.
“Where do I go fust?” he amended. “Well, I can tell ya that.”
He fished the Saint’s note out of his pocket and gave it to her. She
read it through with growing apprehension. It had somehow failed to
occur to her that he would automatically spend the time before
evening in investigating the second possibility of the other Old House
—the disused inn behind the village. That was where he must have
gone. Perhaps he had been trapped there. . . .
“Come on,” she rapped, and led the way.
Outside, she took the path which led down to the inland end of the
village, instead of the one which led to the opposite tor by way of the
quay, and Orace hurried after her and caught her arm.
“Wrong wy, miss,” he said.
She looked at him.
“This is the way I’m going.”
“Sorry, miss,” he persisted. “I carnt letcha do that.”
“Can’t you?” she said slowly. “I’m sorry, but I must. I’ll show you
——”
With a lightning twist she shook off his hand and ran. She could
hear him racing lamely after her, shouting and imploring her to stop
and think what the Saint would say, but she ran on like the wind. She
went down the slope at break-neck speed, surefooted as a cat, but
Orace limped along behind doggedly, sliding and stumbling in the
steep darkness. Then a stone rolled under her foot: she jumped to
save herself, caught her other foot in a tuft of grass, floundered, and
went down in a heap. He had grabbed her before she could rise.
“I’m sorry, miss, but it’s me dooty, an ’e’d sy the syme.”
She got to her feet, shaken and breathless, but relieved to find that
she had not even slightly twisted her ankle.
Orace felt something hard dig into his ribs, and knew what it was.
 “Will this show you I’m serious?” she panted. “I’d hate to have to
hurt you, Orace; but I will if you drive me to it. I’ve got to go.”
He waited without stirring for a long time. He could easily have
grabbed her wrist and taken the gun from her, but it was the sob in
her voice that stopped him.
“Orlright,” he said at last. “If it’ll myke it easier for yer. . . .”
She knew then that he feared the worst.
They hurried on down the hill. She remembered his limp and let
him set the pace, but he managed to struggle on at a good jog-trot in
spite of his lameness. They went through the village until the black
bulk of the Old House loomed before them.
“Will ya lead the wy, miss, since yer ere? I dunno this plice too
well.”
She took him round by the approach the Saint had used, but there
was no need for the same caution, for the moon would not rise for
another three hours. He stopped her at the door.
“Lemme go fust.”
He thrust her behind him and blocked the way by his greater
strength and weight, and she had to obey. She heard him fumble in
his pockets, and then he kicked open the door and at the same
moment a beam of light stabbed down the passage from the electric
torch in his hand.
“See them footmarks?” he whispered. “Men’s bin ’ere lytely, and I’ll
betcha they wuz Tiger Cubs.”
The shaft of luminance broke on the table at the end of the
corridor. The Saint had turned the box round, and from the side
elevation its function was more easily deducible. Even so, it was
creditably astute of Orace to stop dead in his tracks and turn
suddenly to an examination of the door through which they had just
come. He found the scar in the wood where the bullet had splintered
it, and went back to make a study of the ground outside.
“Naow!” he announced at length. “That didn’t catch Mr. Templar,
like it ud uv cort me fee adn’t put it ahter action.”
He went down the passage again, keeping to the centre, so that
she was forced to walk behind him and be shielded by his body. Her
hand was on the automatic in her pocket, and, though every one of
her nerves was tense and tingling, her muscles felt strangely cold
and calm. Just as a boxer, trained to a milligramme, is a bundle of
tortured nerves up to the moment he enters the ring, when all at
once his brain becomes clear and ice-cold as an Arctic sky and his
body soothes down in a second into smooth efficiency—so Patricia’s
agony of fear and anxiety had frozen into a grim chilled-steel
determination. The Saint had been there: they were on his track. The
suspense and anguish of inaction was over.
Orace had halted just before he came to the open door.
“We better lookaht ’ere,” he said.
She was looking round his shoulder as he turned the ray of the
torch into the room, and they both saw the emptiness of it and the
yawning square hole in the floor just inside the threshold.
Orace heard the girl give a strangled cry that choked in her throat.
She would have rushed past him, but he caught and held her, though
she fought him like a fury.
“Wyte—in a minnit!” he urged hoarsely.
He kept her back and edged towards the trap-door, testing the
soundness of the floor inch by inch as he advanced. It was not until
he had thus satisfied himself about the safety of the footing right up
to the edge of the opening that he would allow her to approach it.
They knelt down and turned the light of the torch into the gap. It
shot down far into the blackness till it lost itself in space. Higher up
they could see that the shaft was circular and lined with green, slimy
brick. Evidently they were looking down the remains of a well over
which the Old House had been built: Patricia thought that she could
detect a faint glimmer of reflection of the torch’s light from the
surface of the water. Orace fetched one of the empty beer bottles
from across the room, and they dropped it down the pit. It seemed
an eternity before the hollow sound of the splash returned to their
ears.
“Bouter nundred feet,” Orace guessed, and in this he was
approximately right, being no more than sixty feet out.
The girl leaned over and cupped her hands.
“Simon!” she called. “Simon!”
Only the echo answered her.
“Mr. Templar, sir—Orace speakin,” bellowed the man, but it was
only his own voice that boomed back out of the darkness in reply.
 Patricia’s face was bowed in her hands.
“Saint, Saint. . . . Oh, God. . . . My darling. . . .” The words came
brokenly, dazedly. “Dear God, if you can save him now, give me his
life!”
Presently she looked at Orace.
“Are you sure he went that way? The other trap didn’t catch him.”
Orace had been examining the pitfall, and now, by the light of the
torch, he pointed to the evidence. A square of the flooring had been
cut out with a keyhole saw, leaving only the flimsiest connections at
the corners which the weight of a man would destroy at once. The
jagged ends of broken wood could be seen at once, and from one of
these Orace plucked a shred of tweed and brought it close to the
light.
“That there’s is,” he said huskily. “Looks like ’e weren’t expectin’
it. . . . But don chew lose art, miss—’e always wuz the luckiest man
wot ever stepped. P’raps ’e’s as right as ryne, lyin aht comfitible
somewhere jus’ lettin the Tiger think ’e’s a goner an get keerless, an
orl set ready ter pop up an’ ’av the larf on ’im lyter.”
It was not Orace’s fault if he did not sound very convincing. His
arm went clumsily about her, and drew her gently away and outside
the room.
“One thing,” he observed in an exaggeratedly commonplace tone,
“ther carn’t be no Tiger Cubs angin arahnd ’ere naow—the noise
we’ve myde, they’d uv bin buzzin in like ornets be this time, if ther
’ad bin.”
“Could we get a rope and go down?” she asked, striving to master
her voice.
“I’ll git sum men from the village to ’av a look,” he promised. “Ain’t
nothink we can do fer im fee is dahn there—’e’d uv gorn howers
ago. . . .”
She leaned weakly against the wall, eyes closed and the tears
starring on her cheeks, while Orace tried in his rough but kindly
manner to console her. She hardly heard a word he said.
The Saint gone? A terrifying emptiness ached her heart. It was
horrible to think of. Could a man like him be meant for such an end—
to die alone in the unanswering darkness, drowned like a rat? He
would have kept afloat for a long time, but if he had been alive and
down there then he would have shouted back to them. Perhaps he
had struck his head in the fall. . . .
And then, slowly, a change came over her.
There was still that hurtful lump in her throat, and the dead
numbness of her heart, but she was no longer trembling. Instead,
she found herself cold and quiet. The darkness was speckled with
dancing, dizzy splashes of red. . . .
This was the Tiger’s doing—he was the man who had sent Simon
Templar to his death. And, with a bitter, dead, icy certainty, Patricia
Holm knew that she would never rest until she had found the Tiger.
“Come along, Miss Patricia,” pleaded Orace. “It aint so bad—we
don’t know ’e ever went dahn. Lemme tyke yer back, anjer can lie on
the bed while I go explorin; an’ as soons ever I ears anythink I’ll
come an tell ya.”
“No.”
She snapped out the word in a voice that was as clear and strong
as a tocsin.
“There ain’t nothink——”
“There is,” said Patricia. Her hands closed fiercely on Orace’s
shoulders. “There is. We’ve got to go on with the job. It’s up to us. It’s
what he’d have wished—he wouldn’t have had any patience with our
going home to weep in our corner and chuck in the towel and let the
Tiger get away. If the Saint gave his life to get the Tiger, we can’t
waste the sacrifice. Orace,” she said—“will you carry on with me?”
He only hesitated a moment; then she heard him suck in his
breath.
“Yes, Miss Patricia,” said Orace. “I guess yer right—we carn’t let
the Tiger get awy wiv it, and we carn’t let Mr. Templar ave gorn under
fer nuffin. An fees gorn, I guess yer must inerit Orace, miss. I’m on.”
He paused. “But adn’t we better get told uv Dr. Carn, miss? ’E’s a
detective, really, Mr. Templar tole me, an ’e’s after the Tiger.”
“I suppose so. . . . We must hurry!”
They passed through the village, and Patricia set off up the hill at a
raking pace, with Orace toiling gamely along just behind.
Carn’s cottage was in darkness, and the girl fairly flew to the front
door and tugged at the bell furiously. She kept it up for a full minute,
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