Applications of Artificial Intelligence

Techniques in Engineering SIGMA 2018

Volume 2 Hasmat Malik
Visit to download the full and correct content document:
https://textbookfull.com/product/applications-of-artificial-intelligence-techniques-in-eng
ineering-sigma-2018-volume-2-hasmat-malik/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Applications of Artificial Intelligence Techniques in

Engineering SIGMA 2018 Volume 1 Hasmat Malik

https://textbookfull.com/product/applications-of-artificial-
intelligence-techniques-in-engineering-
sigma-2018-volume-1-hasmat-malik/

Metaheuristic and Evolutionary Computation: Algorithms

and Applications Hasmat Malik

https://textbookfull.com/product/metaheuristic-and-evolutionary-
computation-algorithms-and-applications-hasmat-malik/

Artificial Intelligence and Industrial Applications:

Artificial Intelligence Techniques for Cyber-Physical,
Digital Twin Systems and Engineering Applications
Tawfik Masrour
https://textbookfull.com/product/artificial-intelligence-and-
industrial-applications-artificial-intelligence-techniques-for-
cyber-physical-digital-twin-systems-and-engineering-applications-
tawfik-masrour/

Advances in Artificial Intelligence 18th Conference of

the Spanish Association for Artificial Intelligence
CAEPIA 2018 Granada Spain October 23 26 2018
Proceedings Francisco Herrera
https://textbookfull.com/product/advances-in-artificial-
intelligence-18th-conference-of-the-spanish-association-for-
artificial-intelligence-caepia-2018-granada-spain-
Engineering of Nanobiomaterials. Applications of
Nanobiomaterials Volume 2 1st Edition Grumezescu

https://textbookfull.com/product/engineering-of-nanobiomaterials-
applications-of-nanobiomaterials-volume-2-1st-edition-grumezescu/

AI and Machine Learning Paradigms for Health Monitoring

System: Intelligent Data Analytics Hasmat Malik

https://textbookfull.com/product/ai-and-machine-learning-
paradigms-for-health-monitoring-system-intelligent-data-
analytics-hasmat-malik/

PRICAI 2018 Trends in Artificial Intelligence 15th

Pacific Rim International Conference on Artificial
Intelligence Nanjing China August 28 31 2018
Proceedings Part II Xin Geng
https://textbookfull.com/product/pricai-2018-trends-in-
artificial-intelligence-15th-pacific-rim-international-
conference-on-artificial-intelligence-nanjing-china-
august-28-31-2018-proceedings-part-ii-xin-geng/

Trends in Artificial Intelligence Theory and

Applications. Artificial Intelligence Practices: 33rd
International Conference on Industrial, Engineering and
Other Applications of Applied Intelligent Systems,
IEA/AIE 2020, Kitakyushu, Japan, September 22-25,
https://textbookfull.com/product/trends-in-artificial-
intelligence-theory-and-applications-artificial-intelligence-
Hamido Fujita
practices-33rd-international-conference-on-industrial-
engineering-and-other-applications-of-applied-intelligent-sys/

2020 International Conference on Applications and

Techniques in Cyber Intelligence: Applications and
Techniques in Cyber Intelligence (ATCI 2020) Jemal H.
Abawajy
https://textbookfull.com/product/2020-international-conference-
on-applications-and-techniques-in-cyber-intelligence-
applications-and-techniques-in-cyber-intelligence-
Advances in Intelligent Systems and Computing 697

Hasmat Malik · Smriti Srivastava

Yog Raj Sood · Aamir Ahmad Editors

Applications
of Artificial
Intelligence
Techniques in
Engineering
SIGMA 2018, Volume 2
Advances in Intelligent Systems and Computing

Volume 697

Series editor
Janusz Kacprzyk, Polish Academy of Sciences, Warsaw, Poland
e-mail: kacprzyk@ibspan.waw.pl
The series “Advances in Intelligent Systems and Computing” contains publications on theory,
applications, and design methods of Intelligent Systems and Intelligent Computing. Virtually all
disciplines such as engineering, natural sciences, computer and information science, ICT, economics,
business, e-commerce, environment, healthcare, life science are covered. The list of topics spans all the
areas of modern intelligent systems and computing such as: computational intelligence, soft computing
including neural networks, fuzzy systems, evolutionary computing and the fusion of these paradigms,
social intelligence, ambient intelligence, computational neuroscience, artificial life, virtual worlds and
society, cognitive science and systems, Perception and Vision, DNA and immune based systems,
self-organizing and adaptive systems, e-Learning and teaching, human-centered and human-centric
computing, recommender systems, intelligent control, robotics and mechatronics including
human-machine teaming, knowledge-based paradigms, learning paradigms, machine ethics, intelligent
data analysis, knowledge management, intelligent agents, intelligent decision making and support,
intelligent network security, trust management, interactive entertainment, Web intelligence and multimedia.
The publications within “Advances in Intelligent Systems and Computing” are primarily proceedings
of important conferences, symposia and congresses. They cover significant recent developments in the
field, both of a foundational and applicable character. An important characteristic feature of the series is
the short publication time and world-wide distribution. This permits a rapid and broad dissemination of
research results.

Advisory Board
Chairman
Nikhil R. Pal, Indian Statistical Institute, Kolkata, India
e-mail: nikhil@isical.ac.in
Members
Rafael Bello Perez, Universidad Central “Marta Abreu” de Las Villas, Santa Clara, Cuba
e-mail: rbellop@uclv.edu.cu
Emilio S. Corchado, University of Salamanca, Salamanca, Spain
e-mail: escorchado@usal.es
Hani Hagras, University of Essex, Colchester, UK
e-mail: hani@essex.ac.uk
László T. Kóczy, Széchenyi István University, Győr, Hungary
e-mail: koczy@sze.hu
Vladik Kreinovich, University of Texas at El Paso, El Paso, USA
e-mail: vladik@utep.edu
Chin-Teng Lin, National Chiao Tung University, Hsinchu, Taiwan
e-mail: ctlin@mail.nctu.edu.tw
Jie Lu, University of Technology, Sydney, Australia
e-mail: Jie.Lu@uts.edu.au
Patricia Melin, Tijuana Institute of Technology, Tijuana, Mexico
e-mail: epmelin@hafsamx.org
Nadia Nedjah, State University of Rio de Janeiro, Rio de Janeiro, Brazil
e-mail: nadia@eng.uerj.br
Ngoc Thanh Nguyen, Wroclaw University of Technology, Wroclaw, Poland
e-mail: Ngoc-Thanh.Nguyen@pwr.edu.pl
Jun Wang, The Chinese University of Hong Kong, Shatin, Hong Kong
e-mail: jwang@mae.cuhk.edu.hk

More information about this series at http://www.springer.com/series/11156

Hasmat Malik Smriti Srivastava
•

Yog Raj Sood Aamir Ahmad

•

Editors

Applications of Artificial
Intelligence Techniques
in Engineering
SIGMA 2018, Volume 2

123
Editors
Hasmat Malik Yog Raj Sood
Department of Instrumentation National Institute of Technology
and Control Engineering Puducherry, India
Netaji Subhas Institute of Technology
New Delhi, Delhi, India Aamir Ahmad
Perceiving Systems Department
Smriti Srivastava Max Planck Institute for Intelligent
Department of Instrumentation Systems
and Control Engineering Tübingen, Germany
Netaji Subhas Institute of Technology
New Delhi, Delhi, India

ISSN 2194-5357 ISSN 2194-5365 (electronic)

Advances in Intelligent Systems and Computing
ISBN 978-981-13-1821-4 ISBN 978-981-13-1822-1 (eBook)
https://doi.org/10.1007/978-981-13-1822-1

Library of Congress Control Number: 2018949630

© Springer Nature Singapore Pte Ltd. 2019

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.
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.
The publisher, the authors and the editors are safe to assume that the advice and information in this
book are believed to be true and accurate at the date of publication. Neither the publisher nor the
authors or the editors give a warranty, express or implied, with respect to the material contained herein or
for any errors or omissions that may have been made. The publisher remains neutral with regard to
jurisdictional claims in published maps and institutional affiliations.

This Springer imprint is published by the registered company Springer Nature Singapore Pte Ltd.
The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721,
Singapore
Preface

This Conference Proceedings Volume 2 contains the written versions of most of the
contributions presented at the International Conference SIGMA 2018. The con-
ference was held at Netaji Subhas Institute of Technology (NSIT), New Delhi,
India, during February 23–25, 2018. NSIT is an autonomous institute under the
Government of NCT of Delhi and affiliated to University of Delhi, India. The
International Conference SIGMA 2018 aimed to provide a common platform to the
researchers in related fields to explore and discuss various aspects of artificial
intelligence applications and advances in soft computing techniques. The confer-
ence provided excellent opportunities for the presentation of interesting new
research results and discussion about them, leading to knowledge transfer and the
generation of new ideas.
The conference provided a setting for discussing recent developments in a wide
variety of topics including power system, electronics and communication, renew-
able energy, tools and techniques, management and e-commerce, motor drives,
manufacturing process, control engineering, health care and biomedical, cloud
computing, image processing, environment and robotics. This book contains
broadly 13 areas with 59 chapters that will definitely help researchers to work in
different areas.
The conference has been a good opportunity for participants coming from all
over the globe (mostly from India, Qatar, South Korea, USA, Singapore, and so
many other countries) to present and discuss topics in their respective research
areas.
We would like to thank all the participants for their contributions to the con-
ference and for their contributions to the proceedings. Many thanks go as well to the
NSIT participants for their support and hospitality, which allowed all foreign
participants to feel more at home. Our special thanks go to our colleagues for their
devoted assistance in the overall organization of the conference.

v
vi Preface

It is our pleasant duty to acknowledge the financial support from Defence Research
and Development Organisation (DRDO), Gas Authority of India Limited (GAIL),
MARUTI SUZUKI, CISCO, Power Finance Corporation (PFC) Limited,
CommScope, Technics Infosolutions Pvt. Ltd., Bank of Baroda, and Jio India.
We hope that it will be interesting and enjoying at least as all of its predecessors.

New Delhi, India Hasmat Malik

New Delhi, India Smriti Srivastava
Puducherry, India Yog Raj Sood
Tübingen, Germany Aamir Ahmad
Contents

A New Approach for Power Loss Minimization in Radial Distribution

Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
Sarfaraz Nawaz, Manish Sharma, and Ankush Tandon
Security-Constrained Unit Commitment for Joint Energy and Reserve
Market Based on MIP Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
Pranda Prasanta Gupta, Prerna Jain, Suman Sharma, and Rohit Bhakar
In-Depth Analysis of Charge Leakage Through Vegetation
in Transmission and Distribution Lines . . . . . . . . . . . . . . . . . . . . . . . . . 21
Hari Shankar Jain, Swati Devabhaktuni, and T. Sairama
Comparative Study of Different Neural Networks for 1-Year Ahead
Load Forecasting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
Hasmat Malik and Manisha Singh
Reliability of PMU Using Fuzzy Markov Dynamic Method . . . . . . . . . . 43
Pramod Kumar, Poonam Juneja, and Rachna Garg
A Hybrid Intelligent Model for Power Quality Disturbance
Classification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
Hasmat Malik, Paras Kaushal, and Smriti Srivastava
Voltage Stability Enhancement of Primary Distribution System
by Optimal DG Placement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65
Vani Bhargava, S. K. Sinha, and M. P. Dave
Demand Forecasting Using Artificial Neural Networks—A Case Study
of American Retail Corporation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79
Aditya Chawla, Amrita Singh, Aditya Lamba, Naman Gangwani,
and Umang Soni

vii
viii Contents

Comparative Analysis of Reliability Optimization Using a New

Approach of Redundancy Optimization Under Common Cause
Failure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91
Kalpana Hazarika and G. L. Pahuja
Brain Health Assessment via Classification of EEG Signals
for Seizure and Non-seizure Conditions Using
Extreme Learning Machine (ELM) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
Nuzhat Fatema
An Optimization Algorithm for Unit Commitment Economic
Emission Dispatch Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
Jitendra Kumar, Ashu Verma, and T. S. Bhatti
Comparison of Throughput Metrics Based on Transmission Content
in Cognitive Radio Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131
Atul Verma, Navpreet Kaur, and Inderdeep Kaur Aulakh
A New Electronically Tunable CM/VM Oscillator Using All
Grounded Components . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
Soumya Gupta, Manpreet Sandhu, Manish Gupta,
and Tajinder Singh Arora
An Advance Forward Pointer-Based Routing in Wireless
Mesh Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
Abhishek Hazra and Prakash Choudhary
No-Reference Image Corrosion Detection of Printed
Circuit Board . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165
Anandita Bhardwaj and Pragya Varshney
Extraction of Equivalent Circuit Parameters of Metamaterial-Based
Bandstop Filter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173
Priyanka Garg and Priyanka Jain
Design of a Narrow-Band Pass Asymmetric Microstrip
Coupled-Line Filter with Distributed Amplifiers at 5.5 GHz
for WLAN Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181
Karteek Viswanadha and N. S. Raghava
Cooperative Spectrum Sensing Using Eigenvalue-Based
Double-Threshold Detection Scheme for Cognitive
Radio Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
Chhagan Charan and Rajoo Pandey
Impact of Mathematical Optimization on OSPF Routing
in WDM Optical Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
Himanshi Saini and Amit Kumar Garg
Contents ix

Optimized Power Allocation in Selective Decode-and-Forward

Cooperative Communication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209
E. Bindu and B. V. R. Reddy
Design of Flip-Flops Using Reversible DR Gate . . . . . . . . . . . . . . . . . . . 223
Anurag Govind Rao and Anil Kumar Dhar Dwivedi
Utilizing CMOS Low-Noise Amplifier for Bluetooth Low Energy
Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 239
Malti Bansal and Jyoti
Steady-State Analysis of Permanent Magnet Synchronous Generator
with Uncertain Wind Speed . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 253
Vikas Kumar Sharma and Lata Gidwani
Short-Term Wind Speed Forecasting for Power Generation
in Hamirpur, Himachal Pradesh, India, Using Artificial Neural
Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 263
Amit Kumar Yadav and Hasmat Malik
Cost-Effective Power Management of Photovoltaic-Fuel Cell Hybrid
Power System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 273
Tushar Sharma, Gaurav Kumar, and Nidhi Singh Pal
Long-Term Solar Irradiance Forecast Using Artificial Neural
Network: Application for Performance Prediction of Indian Cities . . . . 285
Hasmat Malik and Siddharth Garg
Operation of DC Drive by Solar Panel Using Maximum Power
Point Tracking Technique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295
Alok Jain, Sarvesh Kumar, Suman Bhullar, and Nandan Kumar Navin
Feature Extraction Using EMD and Classifier Through Artificial
Neural Networks for Gearbox Fault Diagnosis . . . . . . . . . . . . . . . . . . . . 309
Hasmat Malik, Yogesh Pandya, Aakash Parashar, and Rajneesh Sharma
PSO-NN-Based Hybrid Model for Long-Term Wind Speed Prediction:
A Study on 67 Cities of India . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 319
Hasmat Malik, Vinoop Padmanabhan, and R. Sharma
Intelligent Traffic Light Scheduling Using Linear Regression . . . . . . . . . 329
Ajinkya Khadilkar, Kunal Sunil Kasodekar, Priyanshu Sharma,
and J. Priyadarshini
A Novel p-Norm-like-Set Membership Affine Projection Algorithm
in Sparse System Identification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 337
Rajni and C. S. Rai
x Contents

Space Shuttle Landing Control Using Supervised

Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 349
Sunandini Singla and Niyati Baliyan
Realization of Recursive Algorithm for One-Dimensional Discrete
Sine Transform and Its Inverse . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 357
Pragati Dahiya and Priyanka Jain
Identification of Dynamic Systems Using Intelligent Water Drop
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 369
Anuli Dass, Smriti Srivastava, and Monika Gupta
Weighted Percentile-Based Context-Aware Recommender System . . . . . 377
Veer Sain Dixit and Parul Jain
Classification of PASCAL Dataset Using Local Features
and Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 389
Ritu Rani, Amit Prakash Singh, and Ravinder Kumar
Comparative Study of Random Forest and Neural Network
for Prediction in Direct Marketing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 401
Arushi Gupta and Garima Gupta
Analyzing Risk in Dynamic Supply Chains Using Hybrid Fuzzy
AHP Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 411
Umang Soni and Vaishnavi
Optimal Bidding Strategy in Deregulated Power Market Using
Invasive Weed Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 421
A. V. V. Sudhakar, Chandram Karri, and A. Jaya Laxmi
Adaptive Fuzzy Logic Controller for the Minimum Power Extraction
Under Sensor-Less Control of Doubly Fed Induction Motor (DFIM)
Feeding Pump Storage Turbine . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 431
Arunesh Kumarsingh and Abhinav Saxena
Performance Evaluation of Brushless DC Motor Drive Supplied
from Hybrid Sources . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443
S. P. Singh, Krishna Kumar Singh, and Bhavnesh Kumar
Performance Analysis of Supercapacitor-Integrated PV-Fed
Multistage Converter with SMC Controlled VSI for Variable Load
Conditions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455
Shruti Pandey, Bharti Dwivedi, and Anurag Tripathi
Optimization of Process Parameters of Abrasive Water Jet Machining
Using Variations of Cohort Intelligence (CI) . . . . . . . . . . . . . . . . . . . . . 467
Vikas Gulia and Aniket Nargundkar
Contents xi

Evaluation of Performance of Electrochemical Honing Process

by ANOVA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 475
Md. Mushid, Ravi Kumar, and Mohd Musheerahmad
Prediction of the Material Removal Rate and Surface Roughness in
Electrical Discharge Diamond Grinding Using Best-Suited Artificial
Neural Network Training Technique . . . . . . . . . . . . . . . . . . . . . . . . . . . 487
Siddharth Choudhary, Raveen Doon, and S. K. Jha
Step-Back Control of Pressurized Heavy Water Reactor by Infopid
Using DA Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 497
Sonalika Mishra and Biplab Kumar Mohanty
Implementation of Current Mode Integrator for Fractional
Orders n/3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 509
Divya Goyal and Pragya Varshney
CSTR Control Using IMC-PID, PSO-PID, and Hybrid
BBO-FF-PID Controller . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519
Neha Khanduja and Bharat Bhushan
Analysis of EEG Signals for Emotion Recognition Using Different
Computational Intelligence Techniques . . . . . . . . . . . . . . . . . . . . . . . . . 527
Papia Ray and Debani Prasad Mishra
Improvization of Arrhythmia Detection Using Machine Learning
and Preprocessing Techniques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 537
Sarthak Babbar, Sudhanshu Kulshrestha, Kartik Shangle, Navroz Dewan,
and Saommya Kesarwani
Identification of Hidden Information Using Brain Signals . . . . . . . . . . . 551
Navjot Saini, Saurabh Bhardwaj, and Ravinder Agarwal
Raw Sequence to Target Gene Prediction: An Integrated Inference
Pipeline for ChIP-Seq and RNA-Seq Datasets . . . . . . . . . . . . . . . . . . . . 557
Nisar Wani and Khalid Raza
An Improvement in DSR Routing Protocol of MANETs
Using ANFIS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 569
Vivek Sharma, Bashir Alam, and M. N. Doja
Building Domain Familiarity for Elicitation: A Conceptual
Framework Based on NLP Techniques . . . . . . . . . . . . . . . . . . . . . . . . . 577
Syed Taha Owais, Tanvir Ahmad, and Md. Abuzar
Optical Character Recognition on Bank Cheques Using 2D
Convolution Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 589
Shriansh Srivastava, J. Priyadarshini, Sachin Gopal, Sanchay Gupta,
and Har Shobhit Dayal
xii Contents

An Approach to Color Image Coding Based on Adaptive Multilevel

Block Truncation Coding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 597
Nadeem Ahmad, Zainul Abdin Jaffery, and Irshad
Extreme Learning Machine-Based Image Classification Model Using
Handwritten Digit Database . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 607
Hasmat Malik and Nilanjan Roy
Tracking Control of Robot Using Intelligent-Computed Torque
Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 619
Manish Kumar, Ashish Gupta, and Neelu Nagpal
Tracking Control of 4-DOF Robotic Arm Using Krill Herd-Optimized
Fuzzy Logic Controller . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 629
Neelu Nagpal, Hardik Nagpal, Bharat Bhushan, and Vijyant Agarwal
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 645
About the Editors

Hasmat Malik (M’16) received his B.Tech. degree in

electrical and electronics engineering from GGSIP
University, New Delhi, India, and M.Tech. degree in
electrical engineering from NIT Hamirpur, Himachal
Pradesh, India, and he is currently doing his Ph.D.
degree in Electrical Engineering Department, Indian
Institute of Technology Delhi, New Delhi, India.
He is currently Assistant Professor in the Department
of Instrumentation and Control Engineering, Netaji
Subhas Institute of Technology, New Delhi, India. His
research interests include power systems, power quality
studies, and renewable energy. He has published more
than 100 research articles, including papers in interna-
tional journals, conferences, and chapters. He was a
Guest Editor of Special Issue of Journal of Intelligent &
Fuzzy Systems, 2018 (SCI Impact Factor 2018:1.426)
(IOS Press), and Special Issue of International Journal
of Intelligent Systems Design and Computing (IJISDC)
(Inderscience—three times).
He received the POSOCO Power System Award
(PPSA-2017) for his Ph.D. work on research and
innovation in the area of power system in 2017. His
interests are in artificial intelligence/soft computing
applications to fault diagnosis, signal processing, power
quality, renewable energy, and microgrids.
He is a life member of the Indian Society for
Technical Education (ISTE); International Association
of Engineers (IAENG), Hong Kong; International
Society for Research and Development (ISRD),

xiii
xiv About the Editors

London; and he is a member of the Institute of

Electrical and Electronics Engineers (IEEE), USA, and
MIR Labs, Asia.

Smriti Srivastava received her B.E. degree in electri-

cal engineering and her M.Tech. degree in heavy
electrical equipment from Maulana Azad College of
Technology [now Maulana Azad National Institute of
Technology (MANIT)], Bhopal, India, in 1986 and
1991, respectively, and Ph.D. degree in intelligent
control from the Indian Institute of Technology Delhi,
New Delhi, India, in 2005. From 1988 to 1991, she was
Faculty Member at MANIT, and since August 1991,
she has been with the Department of Instrumentation
and Control Engineering, Netaji Subhas Institute of
Technology, University of Delhi, New Delhi, India,
where she is working as Professor in the same division
since September 2008 and as Dean of Undergraduate
Studies. She also worked as Associate Head of the
Instrumentation and Control Engineering Division at
NSIT, New Delhi, India, from April 2004 to November
2007 and from September 2008 to December 2011. She
was Dean of Postgraduate Studies from November
2015 to January 2018. She is Head of the division since
April 2016. She is the author of a number of
publications in transactions, journals, and conferences
in the areas of neural networks, fuzzy logic, control
systems, and biometrics. She has given a number of
invited talks and tutorials mostly in the areas of fuzzy
logic, process control, and neural networks. Her current
research interests include neural networks, fuzzy logic,
and hybrid methods in modeling, identification, and
control of nonlinear systems and biometrics.
She is Reviewer of IEEE Transactions on
Systems, Man and Cybernetics (SMC), Part-B, IEEE
Transactions on Fuzzy Systems, International Journal of
Applied Soft Computing (Elsevier), International
Journal of Energy, Technology and Policy
(Inderscience).
Her paper titled ‘Identification and Control of a
Nonlinear System using Neural Networks by Extracting
the System Dynamics’ was selected by the Institution of
Electronics and Telecommunication Engineers for
IETE K S Krishnan Memorial Award for the best
system-oriented paper. She was also nominated for
About the Editors xv

‘International Engineer of the Year 2008’ by

International Biographical Center of Cambridge,
England, in 2008. Her name appeared in Silver Jubilee
edition of ‘Marquis Who’s Who in the World’ in
November 2007, 2008, and 2009. Her paper titled ‘New
Fuzzy Wavelet Neural Networks for System
Identification and Control’ was the second most down-
loadable paper of the year 2006 from the list of journals
that come under ‘ScienceDirect’.

Prof. Yog Raj Sood (SM’10) is a member of DEIS.

He obtained his B.E. degree in electrical engineering
with ‘Honors’ and M.E. degree in power system from
Punjab Engineering College, Chandigarh (UT), in 1984
and 1987, respectively. He obtained his Ph.D. degree
from Indian Institute of Technology Roorkee in 2003.
He is Director of the National Institute of Technology
Puducherry, Karaikal, India. He joined Regional
Engineering College, Kurukshetra, in 1986. Since
2003, he has been working as Professor in the
Department of Electrical Engineering, National
Institute of Technology Hamirpur, Himachal Pradesh,
India. He has published a number of research papers.
He has received many awards, prizes, and appreciation
letters for his excellence in research academic and
administration performance. His research interests are
deregulation of power system, power network opti-
mization, condition monitoring of power transformers,
high-voltage engineering, nonconventional sources of
energy.

Aamir Ahmad is Research Scientist at the Perceiving

Systems Department, Max Planck Institute for
Intelligent Systems, Tübingen, Germany. He received
his Ph.D. degree in electrical and computer engineering
from the Institute for Systems and Robotics, Instituto
Superior Técnico, Lisbon, Portugal. His main research
interests lie in Bayesian sensor fusion and optimization-
based state estimation. The core application focus of his
research is vision-based perception in robotics. He has
worked with several ground robots in the recent past.
Currently, he is focusing on aerial robots and active
perception in multiple aerial vehicle systems. He has
published 5 peer-reviewed journal articles, 2 chapters,
11 conference papers, and 2 workshop papers.
A New Approach for Power Loss
Minimization in Radial Distribution
Networks

Sarfaraz Nawaz, Manish Sharma and Ankush Tandon

Abstract A new methodology is presented in this paper to reduce active power

losses achieved in the distribution system. The multiple DG units are placed to
solve the problem. A new mathematical expression, Power Voltage Sensitivity
Constant (PVSC), has been formulated to solve the DG placement problem.
The PVSC determines the site and size of multiple DG units. The size of DG units
is also restricted up to 50% of total system load. IEEE 69-bus reconfigured dis-
tribution system at three different loading conditions is considered to validate the
results. The obtained results are compared to the results of the latest approaches to
evaluate its robustness.

Keywords Radial distribution system (RDS)
Real power loss

Distributed generation (DG)

1 Introduction

In India, the distribution losses are around 20–25%. Therefore, myriads of efforts
have been made for the reduction of losses in distribution networks like network
reconfiguration, optimal allocation of distributed generation. Network reconfigu-
ration is done by modifying the feeder topologies by proper handling of operation
of sectionalizing and tie-switches and taking care of their open/close status at the
time of emergency or normal operation. Modification of feeder topologies is an
adequate and effective technique to minimize losses, enhance voltage stability, and
better load balance. The authors suggested various techniques to solve the problem
of reconfiguration of existing network [1–20]. Merlin et al. [1] were the first to
evolve a scheme to minimize feeder loss using distribution network reconfiguration.
They solved the problem using discrete branch and bound technique by formulating

S. Nawaz
M. Sharma (&)
A. Tandon

Swami Keshvanand Institute of Technology, Management and Gramothan,
Jaipur, India
e-mail: manishpandya67@gmail.com

© Springer Nature Singapore Pte Ltd. 2019 1

H. Malik et al. (eds.), Applications of Artificial Intelligence Techniques
in Engineering, Advances in Intelligent Systems and Computing 697,
https://doi.org/10.1007/978-981-13-1822-1_1
2 S. Nawaz et al.

it as mixed-integer nonlinear optimization problem. Civanlar et al. [2] estimated the

loss reduction by deriving a simple formula and performing switching operation
between two feeders and adopted a branch exchange procedure for this. Lin and
Chin [3] suggested a modern technique to resolve the problem of reconfiguration of
distribution feeder through which an effective network configuration could be
developed to minimize losses. Shirmohammadi et al. [4] introduced a technique that
depends on an optimal flow pattern in which switches were made open one after
another starting from a complete meshed system. Amanulla et al. [5] reformed the
pattern of switches in the system using PSO technique.
In DG technology, the small generating units (1 kW–50 MW) are connected
near the load side. Both renewable and nonrenewable energy source can be served
as DG units. As fossil fuels are getting depleted day by day, the outcome of this has
lead to incorporate renewable-based distribution generating units, which is the
topmost priority. The biggest asset of using DG device is that it minimizes both real
and reactive power losses and it also revamps the voltage profile while conserving
reliability and efficiency of the power system. To utilize the benefits of DG tech-
nology, it is required to determine optimal place and size of DG units in RDS;
otherwise, it causes some unfavorable effects like increased real power losses, poor
voltage profile, increased cost, etc. Various approaches have been proposed in the
literature to solve the DG allocation problem. DG units were determined by particle
swarm optimization (PSO) in [6]. Acharya et al. [7] incorporated an analytical
methodology to decipher DG placement problem in the distribution system. Solve.
DG placement problem is solved using analytical approach by Gozel and Hocaoglu
[8]. In [9, 10], the author suggested GA-based method to get the optimal position
and amount of DG units. Kean and Omalley [11] proposed the constrained linear
programming (LP) approach to solve the problem in Irish system. Zhang et al. [12]
proposed a novel approach to solve the above problem. In [13], Injeti and Kumar
formulated an objective function to decrease active power losses and to get better
voltage stability. Loss sensitivity factor (LSF) is the key to determine optimal
location of DG and the size is determined by simulated annealing (SA) technique.
Nawaz et al. [14] presented a sensitivity analysis technique and tested it on a
standard 33 bus test system under different loading conditions. Viral et al. [15]
proposed an analytical technique to get the best place and size of DG units in the
balanced distribution system to reduce real power. The various types of DG units
are [16]:
Type-I: Generate active power
Type-II: Generate reactive power
Type-III: Conjure both kW and kVAr
Type-IV: Consume reactive power by conjure active power.
In this paper, multiple DG (Type-I) units are placed for boosting voltage profile
and maximizing the percentage of active power loss reduction. A new method is
projected to determine site and size of multiple DG units. A pristine mathematical
expression is investigated that is called PVSC (Power Voltage Sensitivity Constant).
A New Approach for Power Loss Minimization in Radial … 3

The constant evaluates size and location of any type of DGs at the same time. DG
Type-I (PV solar module) is used to solve the problem. Upto 50% penetration level
of DG units is also taken into consideration, so that less size of DG units produces
maximum loss reduction. Standard IEEE 69 bus reconfigured distribution system is
considered as a test system. It has been observed that the proposed approach gives
optimum results than other approaches mentioned in this paper.
The rest of the paper is organized as follows: Sect. 2 states problem formulation
with constraints. Then, the proposed approach is discussed in Sect. 3. The com-
parative analysis of the numerical results of the proposed approach on 69 bus test
system is reported in Sect. 4 and finally, the conclusion is given in Sect. 5.

2 Problem Formulation

The DG’s placement problem can be mathematically expressed as [17] (Fig. 1):

Min f ¼ WLoss ð1Þ

The distribution network power loss is calculated by using

 2  
Xn X n
jVi j2 þ Vj  2jVi jVj  cos dij
PLoss ¼ R ð2Þ
i¼1 j¼1
Z2

Subjected to:
(i) Network total power balancing.
Pmin
DGj  PDGj  PDGj
max
(ii)
Qmin
DGj  QDGj  QDGj
max

(iii) Bus voltage limits 0:95 pu  Vi  1:0 pu

(iv) Thermal limit constraint of line.
where
R Line section resistance;
X Line section reactance;
Z Line section impedance;
Vi, Vj voltage at bus i and j;

Fig. 1 Single line diagram of Vi Vj

DG connected network
P+jQ

R+jX

DG
4 S. Nawaz et al.

di , dj Voltage angle at bus i and j;

P and Q kW and kVAr flow in the section.

3 Approach

A new method is proposed here for the allocation of multiple DG units. The Power
Voltage Sensitivity Constant (PVSC) determines the size and position of DG units.

Vrated Pdgloss
PVSC ¼ þ ð3Þ
Vmin Prealloss

where
Prealloss active real power loss (base case).
Pdgloss power loss after DG placement.
Vrated rated bus voltage in pu (always be 1 pu).
Vmin minimum bus voltage after DG placement.
The following constraints are to be met for optimal allocation of DG units: (i) Vmin
should be maximum (ii) Pdgloss should be minimum and (iii) PVSC should be
minimum. The algorithm of the proposed technique is as follows:
Step 1: Calculate Prealloss by executing load flow program.
Step 2: Start with 5% DG size of total load and run load flow program.
Step 3: Compute Pdgloss and “PVSC” values.
Step 4: Proliferate DG size in small steps and calculate Pdgloss.
Step 5: Restore the DG size which corresponds to least value of Pdgloss.
Step 6: Minimum value of “PVSC” yields optimal location of DG unit.
Step 7: Next location of DG is identified by repeating steps from 3.

4 Results

The proposed methodology is tested on IEEE 69-bus (12.66 kV and 100 MVA base
value) distribution system. The real power loss of 69-bus system 225 kW (before
reconfiguration) and minimum bus voltage is 0.9092 pu. After reconfiguration [20]
the loss at nominal load is 98.6 kW. Three different loading conditions light (50%
load), nominal (100% load), and heavy (160% load) load levels are used here.
The following cases are considered here:
I: Base Case
II: After Network Reconfiguration
III: DGs placement after network reconfiguration.
A New Approach for Power Loss Minimization in Radial … 5

Table 1 Results of the proposed method for 69-bus system at various load levels
Case Items Load level
Light Nominal Heavy
(50%) (100%) (160%)
Base case Tie switches 69, 70, 69, 70, 71, 69, 70,
71, 72, 73 72, 73 71, 72, 73
Power loss (kW) 51.61 225 652.47
Minimum bus 0.956 0.9092 0.845
voltage (pu)
After feeder Tie switches 14, 58, 14, 58, 61, 14, 58,
reconfiguration (FR) [19] 61, 69, 70 69, 70 61, 69, 70
Power loss (kW) 23.60 98.6 264.6
Minimum bus 0.9753 0.9497 0.917
voltage (pu)
% Loss reduction 54.24% 56.17% 59.44%
(from base case)
DG placement after FR DG size (location) 600 (61) 1350 (61) 1800 (61)
(proposed method) 180 (64) 310 (64) 650 (64)
140 (27) 210 (27)
Size of DG (kW) 920 1870 2450
PLoss (kW) 9.8 37 108
Vmin (pu) 0.99 0.98 0.956
% Loss reduction 81% 83.55% 83.3%

The results of 69 bus system after DG allocation is shown in Table 1. The

optimal location is found at bus no. 27, 61, and 64. At light, nominal and heavy
load level, the real power losses are reduced to 9.8, 37, and 108 kW, respectively.
The bus voltage profile is also enhanced at each load level as shown in Fig. 2.

0.99
0.98

0.97
Bus Voltage in pu

0.96

0.95
0.94

0.93 Base
0.92 After FR
FR & DG
0.91
0.9
10 20 30 40 50 60 70
Bus Number

Fig. 2 Comparison of bus voltage at nominal load for 69 bus system

6 S. Nawaz et al.

Table 2 Comparison of results for 69-bus systems at nominal load

Technique Tie DG size in Total DG Real % Loss Min. bus
switches kW size in Power loss reduction from voltage
(location) kW in kW base case (pu)
Integrated 69, 18, 1066 (61) 1846 51.3 77 0.9619
approach 13, 56, 355 (60)
[20] 61 425 (58)
UVDA 14, 58, 1378 (61) 2720 37.84 83.18 0.9801
[20] 61, 69, 620 (11)
70 722 (64)
Proposed 14, 58, 1350 (61) 1870 37 83.55 0.98
61, 69, 310 (64)
70 210 (27)

The overall size of DG unit is tethered upto 50% of system load. The obtained
results are compared with the results of the latest optimization approaches as
mentioned in Table 2. It is obvious from Table 2 that the proposed analytical
approach yields minimum losses while optimizing DG size also.

5 Conclusion

This paper presents a new approach for minimizing losses by placing of DG unit at
the optimal location. Solar PV module (Type-I DG) is used for placement. A new
mathematical expression, PVSC, is proposed which yields both optimal size and
location of DG unit. The developed approach is tested on IEEE 69 bus reconfigured
system at three diverse loading of total load and heavy conditions mainly nominal
similar to base case, light load with a decrement of 50% of total load and heavy
loading which an increment of 50% of the total load. The overall size of DG unit is
tethered upto 50% of system load. The results are compared with the latest algo-
rithms. It can be justified by Table 2 that the proposed methodology gives maxi-
mum loss reduction while considering DG size also. The voltage profile is also
equal to or higher than other mentioned methods. The proposed approach can be
easily implemented in the real distribution system.

References

1. Merlin, A., Back, H.: Search for a minimal-loss operating spanning tree configuration in urban
power distribution systems. In: Proceedings of 5th Power Systems Computer Conference,
Cambridge, U.K., 1–5 Sept 1975
2. Civanlar, S., Grainger, J.J., Yin, H., Lee, S.H.: Distribution feeder reconfiguration for loss
reduction. IEEE Trans. Power Deliv. 3(3), 1217–1223 (1988)
A New Approach for Power Loss Minimization in Radial … 7

3. Lin, M.W., Chin, H.-C.: A new approach for distribution feeder reconfiguration for loss
reduction and service restoration. IEEE Trans. Power Deliv. 13(3), 870–875 (1988)
4. Shirmohammadi, D., Hong, H.W.: Reconfiguration of electric distribution networks for
resistive losses reduction. IEEE Trans. Power Deliv. 4, 1402–1498 (1989)
5. Amanulla, B., Chakrabarti, S.: Reconfiguration of power distribution systems considering
reliability and power loss. IEEE Trans. Power Deliv. 27(2) (April 2012)
6. Katsigiannis, Y.A., Georgilakis, P.S.: Optimal sizing of small isolated hybrid power systems
using Tabu search. J. Optoelectron. Adv. Mater. 10(5), 1241–1245 (2008)
7. Acharya, N., Mahat, P., Mithulananthan, N.: An analytical approach for DG allocation in
primary distribution network. Int. J. Electr. Power Energy Syst. 28, 669–678 (2006)
8. Gozel, T., Hocaoglu, M.H.: An analytical method for the sizing and siting of distributed
generators in radial systems. Electr. Power Syst. Res. 79, 912–918 (2009)
9. Kim, K.H., Lee, Y.J., Rhee, S.B., Lee, S.K.: Dispersed generator placement using fussy-GA
in distribution systems. In: Proceeding of IEEE Power Engineering Society Summer Meeting,
USA vol. 2, pp. 1148–1153 (2002)
10. Kim, J.O., Nam, S.W., Park, S.K., Singh, C.: Dispersed generation planning using improved
Hereford Ranch algorithm. Electr. Power Syst. Res. 47(1), 47–55 (1998)
11. Kean, A., Omalley, M.: Optimal allocation of embedded generation on distribution networks.
IEEE Trans. Power Syst. (2006)
12. Zhang, X., Karady, G.G., Ariaratnam, S.T.: Optimal allocation of CHP-based distributed
generation on urban energy distribution networks. IEEE Trans. Sustain. Energy 5(1), 246–253
(2014)
13. Injeti, S.K., Kumar, N.P.: A novel approach to identify optimal access point and capacity of
multiple DGs in a small, medium and large scale radial distribution systems. Int. J. Electr.
Power Energy Syst. 45, 142–151 (2013)
14. Nawaz, S., Imran, M., Sharma, A., Jain, A.: Optimal feeder reconfiguration and DG
placement in distribution network. Int. J. Appl. Eng. Res. 11(7), 4878–4885 (2016)
15. Viral, R., Khatod, D.K.: An analytical approach for sizing and siting of DGs in balanced
radial distribution networks for loss minimization. Electr. Power Energy Syst. 67, 191–201
(2015)
16. Devi, S., Geethanjali, M.: Application of modified bacterial foraging optimization algorithm
for optimal placement and sizing of distributed generation. Expert Syst. Appl. 41, 2772–2781
(2014)
17. El-Fergany, Attia: Study impact of various load models on DG placement and sizingusing
backtracking search algorithm. Appl. Soft Comput. 30, 803–811 (2015)
18. Savier, J.S., Das, D.: Impact of network reconfiguration on loss allocation of radial
distribution systems. IEEE Trans. Power. Deliv. 2(4), 2473–2480 (2007)
19. Tandon, A., Saxena, D.: A comparative analysis of SPSO and BPSO for power loss
minimization in distribution system using network reconfiguration. In: IEEE Conference on
Computational Intelligence on Power, Energy and Controls with their impact on Humanity
(CIPECH), 28–29 Nov 2014
20. Bayat, A., Bagheri, A., Noroozian, R.: Optimal siting and sizing of distributed generation
accompanied by reconfiguration of distribution networks for maximum loss reduction by
using a new UVDA-based heuristic method. Electr. Power Energy Syst. 77, 360–371 (2016)
Security-Constrained Unit Commitment
for Joint Energy and Reserve Market
Based on MIP Method

Pranda Prasanta Gupta, Prerna Jain, Suman Sharma

and Rohit Bhakar

Abstract In this work, a Security-Constrained Unit Commitment (SCUC) is pro-

posed for day-ahead scheduling with joint energy and reserve markets. Independent
System Operator (ISO) executes SCUC to optimize reserve requirements in
restructured power system. Though, SCUC structure determines reserve require-
ments for simulating UC necessities and line contingency with DC optimal power
flow (DCOPF) for adequate purpose of energy market. In this context, proposed
SCUC problem is formulated using Mixed Integer Programming (MIP) in which
schedule and dispatch of generating units is considered to be deterministic. The
overall objective of this paper, ISO is to minimize the cost of supply energy and
reserve requirement over the optimization horizon (24 h) subject to satisfying all
the operating and network security constraints. However, comprehensive Benders
decomposition (BD) is new to explain SCUC formulation and simulation results are
compare without and by inclusion of network security. In order to show that
effective reach of the proposed model, it is executed on a transmission system of
modified IEEE-30 bus system with seven generating units on Zone A and two
generating units on Zone B. Moreover various, test cases are investigated and
compared, which shows that the proposed optimization model is promising.

Keywords Security-constrained unit commitment Benders decomposition



Mixed integerprogramming MIP Method IEEE-30 bus system
DCOPF

P. P. Gupta (&)
P. Jain
S. Sharma
R. Bhakar

Department of Electrical Engineering, Malaviya National Institute
of Technology, Jaipur, India
e-mail: prandaprasantagupta@gmail.com
P. Jain
e-mail: pjain.ee@mnit.ac.in
S. Sharma
e-mail: sharma_sumi@yahoo.comand
R. Bhakar
e-mail: rohitbhakar@gmail.com

© Springer Nature Singapore Pte Ltd. 2019 9

H. Malik et al. (eds.), Applications of Artificial Intelligence Techniques
in Engineering, Advances in Intelligent Systems and Computing 697,
https://doi.org/10.1007/978-981-13-1822-1_2
10 P. P. Gupta et al.

1 Introduction

Provision of energy and reserve markets over the restructured situation would not
immediately promote as it is described in vertically integrated utilities [1]. Though a
lot of reasons would be to figure elsewhere, the major motive is that entity provided
that reserve market might not be over-straight managed for the operator. The issues
are emphasized by two examples. Generator in the ready-for-action market is dis-
patched as for each bids provided by those to the market operator. The markets
were unoccupied consecutively in a series determined by the rate of response of the
service. Energy is the major product which can be traded in electricity market.
There are different types of products in competitive bidding, for example regulation
reserve, spinning reserve, and non-spinning reserve and other types of ancillary
markets [2]. The thermal units must have condition for extra generation all through
contingencies similar to outage of generator. The purpose of this paper is for joint
optimization of cross commodities dispatch energy and reserve decision taking into
consideration the availability of resources and the overall cost. Another product is
ancillary reserve which is single reserve requirements that is crucial for ensuring the
reliability process for electric grid [3, 4]. Here in few markets, simultaneous
application is to apply for procure energy and spinning reserve (SR), even as new as
one of these two markets are clear independently and successively [5, 6]. In [3], the
above literature, it is clear that both energy and reserve markets could be called by
ISO of different amount based on benchmark system under consideration and there
in after obtaining the order of SR market. Moreover, probabilistic and deterministic
scale is executed with ISO to determine the desired stage of SR. During deter-
ministic perspective, SR ability is regularly presumed to be approximately equiv-
alent on a particular fraction of the generator load hourly, or else ability of the
enormous existence generator [7–9]. In [10], present a MILP intended for reim-
bursement of the ancillary service and energy markets on which the essential
regulation down (REGD), regulation up (REGU), automatic generation control
(AGC), 30-minute operating reserve (TMOR), 10-minute non-spinning reserve
(TMNR) and 10-minute spinning reserve (TMSR), and are assumed to be set and
predefined.
In deregulated power system, security is superior to supply adequate SR on the
system [1, 11]. SCUC define to UC explicitly considering security constraints in
equally normal operation and contingency situation to guarantee that transmission
flows are within limits. The straight method for considering network constraints
establishes Lagrangian relaxation (LR) which is used to explain SCUC [12, 13].
With additional SCUC model which prominence to concurrent the optimization of
ancillary service and energy market is presented in [14]. In [8], the probabilistic
approach is used, while taking into account of transmission and line contingency to
optimize the generation schedule. A lot of work in these part utilities for solving
optimization technique in SCUC problem efficiently (such as mixed integer linear
programming (MILP)-based method, Lagrangian relaxation method [15–17]. In
[18] UC derived from uncertainty and an amalgamation of BD and proposed the
Security-Constrained Unit Commitment for Joint Energy … 11

outer approximation technique. BD is a popular optimization method for solving

SCUC problem presented, example in [15]. The BD moves toward the master
problem in UC and subproblem in network security separately. The job for deter-
ministic UC apparatus signifies the network classically incorporating DC power
flow equations as an alternative of AC constraint [19]. Novel contribution of this
paper is incorporation of contingency line in the model of SCUC by network
constraint and solve by operating DCOPF. The approximation of DC model is
operating as a simplification in the computation of power flow [20]. This paper also
suggests contingency analysis ranking based as is performed with DCOPF solution
[23]. The main contribution of this research work, with respect to previous work in
this region, proposed SCUC model for joint optimization of energy and reserve
markets as a MIP method and solved using CPLEX solver in General Algebraic
Modeling System (GAMS). To achieve this objective, constraints are introduced to
alleviate the effect of variable power generation such as power flow limits on
preferred line, bus voltage limits, etc. The problem is solved for a benchmark of
IEEE 30-bus system such that simulation results are found to be inspiring.
Organization of this work is as follows: Sect. 2 explains the mathematical
modeling of SCUC problem based on MIP formulation; Sect. 3 describe the pro-
posed SCUC framework; Sect. 4 describes the simulation portion to show the effect
of SCUC on mutually technical and economical feature and Sect. 5 represents
termination and future work.

2 Mathematical Formulation of SCUC Based on MIP

Considering the above literature facts, in this paper, the SCUC model are formu-
lated as optimization problem that minimizes the total cost of supply ancillary
services and energy requirements. The objective function (OF) is formulated as
follows:
" #
XNG XNT h
FCg;t ðPg;t Þ þ FCg;t
d
ðRdg;t Þ þ FCg;t
u
ðRug;t Þ
min OF ¼ Ug;t
g¼1 t¼1
s
FCg;t ðRsg;t Þ
ð1Þ
X NT h
NG X i XNG X
NT
n
FCg;t ðRng;t Þ þ FCg;t
o
ðRog;t Þ þ Sg;t
g¼1 t¼1 g¼1 t¼1

In Eq. (1), the first term indicates the costs of supplying REGU, REGD, TMSR,
and energy of the generating unit is on; second term indicates the costs of supplying
TMOR and TMNR. On the other hand, last third term indicates shutdown and
x
startup costs, which incur if the unit is turned on or off. Where, Fg;t ð:Þ indicates the
generator bidding cost of unit g at time t for product x. Pg;t indicates energy of
generator unit g at time t, Sg;t represents shutdown/startup cost of generator unit g at
12 P. P. Gupta et al.

time t, and Ug;t represents commitment status of generator unit g at time t. In the
above Eq. (1) the constraints are included as
Constraints
Power energy balance constraint

X
NG
Pg;t ¼ PDt þ PLt ; 8t ð2Þ
g¼1

In Eq. (2), the power balance constraint of the system is represented. Here, PDt
is the system load demand at time t, and PLt represents the system losses at time t.
Ancillary service requirement

X
NG
Rdg;t  Ddt ; 8t ð3Þ
g¼1

X
NG
Rug;t  Dut ; 8t ð4Þ
g¼1

X
NG
Rug;t þ Rsg;t  Dut þ Dst ; 8t ð5Þ
g¼1

X
NG
Rug;t þ Rsg;t þ Rng;t  Dut þ Dst þ Dnt ; 8t ð6Þ
g¼1

X
NG
Rug;t þ Rsg;t þ Rng;t þ Rog;t  Dut þ Dst þ Dnt þ Dot ; 8t ð7Þ
g¼1

Ancillary service supplies for REGD, TMSR, REGU, TMOR, and TMNR are
specified in (3)–(7), correspondingly. For illustration, (7) show that the additional
REGU might be used to assure TMSR supplies.

2.1 Formulation of Thermal UC Model

In this sector, SCUC model proposed MIP method for thermal unit commitment
problem considering joint energy and reserve markets. Normally, the thermal unit
OF can be spoken as follows:
Security-Constrained Unit Commitment for Joint Energy … 13

X NT h
NG X i NG X
X NT
h
FCg;t ðPg;t Þ Ug;t þ Sg;t ð8Þ
g¼1 t¼1 g¼1 t¼1

A generation output of each unit in Eq. (9), ought to be among its maximum and
minimum limit which is subsequent inequality used for all generator is fulfilled.

Pg;min Ug;t  Pg;t  Pg;max Ug;t ; 8g; 8t ð9Þ

The above Eq. (8) indicates the constraints and OF (10–13) for a MIP solution.
Generator constraints scheduled subsequently contain ramp down/up limits (10),
(11) minimum ON/OFF limits (12), (13).

Pg;t  Pg;t1  URg ; 8g; 8t ð10Þ

Pg;t1  Pg;t  DRg ; 8g; 8t ð11Þ

h i 
on
UMg;t1  Tgon Ug;t1  Ug;t  0; 8g; 8t ð12Þ
h i 
off
UMg;t1  Tgoff Ug;t  Ug;t1  0; 8g; 8t ð13Þ

on
Wherever DRg and URg indicates ramp down and up rate limit of unit g. UMg;t
off
and UMg;t indicates is time duration for which unit g has been ON and OFF at time
t, Tg and Tgoff indicates is minimum ON and OFF time of unit g. To reach this OF
on

expressed in (8) is subjected to following constraint.

System spinning and operating reserve requirement

X
NG
ORg;t Ug;t  Rot ; 8t ð14Þ
g¼1

X
NG
SRg;t Ug;t  Rst ; 8t ð15Þ
g¼1

Security constraints

FLmax
ij  FLij;t  FLij
max
ð16Þ

DC power flow constraints

hj;t  hi;t
FLij;t ¼ ð17Þ
Xij
14 P. P. Gupta et al.

In Eqs. (14), (15), (16), and (17) ORg;t , SRg;t denoting operating and spinning
reserve of unit g at time t. FLij;t are the line flow at node i and j at hour t. Xij are the
branch connecting line reactance of node j and i. Further Fijmax represent maximum
flow of line at node j and i correspondingly.

3 Proposed Algorithm

In this part, the proposed algorithm and strategies have been discussed and
explained for optimum SCUC among energy and reserve market in power system.
In short to explain the MIP formulation in Portion 2, a BD has been adopting to
answer this problem. BD concert should be relevant to integrate that optimization
problem expressing master problem for solving ED and UC, network constraint
subproblem are revealed in Fig. 1. The master problem of UC, which includes
Eqs. (9–15), of (8) give the schedule and dispatch result to minimize operation cost
apart from energy and reserve market. Subsequent to the answer of master problem,
the network constraint check is applied for every hour, which is shown in Fig. 1.
The vector outputs Eq. (18) are existing dispatch and commitment solution acquire
since the problem are check with the transmission line violation. If any line vio-
lation appears on the subproblem, the benders cuts created and associated to the

Fig. 1 SCUC algorithm Basic Data Input (Load forecast, unit data, energy and reserve
market data and transmission line data)

Generation Dispatch and Optimal UC (MIP)

UC and ED
Infeasible Problem Feasible Solution?
Master
Problem

Network Security Check

SS == Subproblem
Subproblem
Hourly
Hourly network
network security
security evaluation
evaluation for
for DC
DC constraint
constraint

Yes
Violations? Benders cuts
No

End
Another random document with
no related content on Scribd:
1645.
 ===1645===

A— John Winthrop, Gov.

D— Robert Harding.
E— William Brenton.
G— First Church.
K— Burying Ground.
M— Thomas Meekins.
P— Prison.
S— First School-house.
X— Richard Peapes.
5— Richard Bellingham.
6— Thomas Fowle.
7— William Hibbins.
8— Edward Gibbons.
8— Atherton Haugh.
9— Rev. John Cotton.
10 — Robert Keayne.
10 — William Tyng.
11 — Rev. John Wilson.
11 — Henry Dunster.
12 — John Newgate.
12 — Daniel Maud.
13 — Thomas Oliver.
13 — Robert Howen.
13a — Nicholas Shapleigh.
14 — Thomas Leverit.
14 — Edmund Jackson.
15 — John Mellows.
15 — William Copp.
16 — Gabriel Fish.
16 — Edward Goodwin.
17 — Henry Pease.
17 — John Sweete.
18 — John Seabury.
18 — John Smith.
19 — Walter Merry.
19 — John Davies.
20 — William Beamsley.
20 — James Johnson.
21 — Richard Tuttle.
21 — Bartholomew Cheever.
22 — Nehemiah Bourne.
22 — John Arnold.
23 — John Jackson.
23 — Thomas Hawkins.
24 — John Oliver.
24 — Thomas Savage.
25 — William Werdall.
25 — Edmund Grosse.
26 — Samuel Cole.
26 — John Hill, Blacksmith.
27 — Thomas Marshall.
27 — Thomas Clarke, Merchant.
28 — John Lowe.
28 — Thomas Joy.
29 — Richard Rollins.
29 — Henry Symons.
30 — Isaac Cullimore.
30 — John Mylom.
31 — Bartholomew Passmer.
31 — David Phippini.
32 — Francis Hudson.
32 — John Cole.
33 — Nathaniel Chappell.
33 — Matthew Chaffee.
 34 — James Hawkins.
34 — John Gallop.
35 — William Kirkby.
35 — Sampson Shoar.
36 — Richard Sanford.
36 — Robert Meeres.
37 — Jeremy Houtchin.
37a — Israel Stoughton.
37 — Henry Fane.
38 — Thomas Makepeace.
38 — Benjamin Thwing.
39 — Joshua Scotto.
39 — William Wilson.
40 — John Biggs.
40 — Alexander Beck.
41 — James Brown.
41 — Thomas Hawkins.
42 — Thomas Buttolph.
43 — Christopher Stanley.
44 — John Glover.
44 — Hugh Gunnison.
45 — William Hudson, Jr.
45 — George Burden.
46 — Sarah Knight.
46 — Samuel Greames.
47 — George Bates.
47 — Francis Dowse.
48 — John Button.
48 — George Hunne.
49 — Nicholas Willis.
49 — George Barrill.
50 — James Everill.
50 — Thomas Painter.
51 — John Coggan.
 51 — Gov. John Leverit.
52 — William Franklin.
52 — Robert Nash.
53 — Edward Bendell.
53 — [1]George Foxcroft.
54 — James Oliver.
54 — Edward Tyng.
55 — William Pierce.
55 — David Sellick.
56 — Isaac Grosse.
56 — William Davis, Jr.
57 — William Hudson, Sr.
57 — William Davis, Sr.
58 — Robert Scott.
58 — William Parsons.
59 — Henry Webb.
59 — James Davies.
60 — Richard Fairbanks.
60 — William Corser.
61 — Philemon Pormot.
61 — Richard Parker.
62 — Richard Truesdale.
62 — Valentine Hill.
63a — Robert Turner, Vintner.
63 — Richard Hutchinson.
63 — Robert Sedgwick.
64 — Thomas Scotto.
64 — Henry Messinger.
65 — Richard Tapping.
65 — Richard Croychley.
66 — Benjamin Gillom.
66 — Benjamin Ward.
67 — Nathaniel Woodward.
67 — John Compton.
68 — Richard Sherman.
68 — Edward Hutchinson.
69 — William Pell.
69 — John Spoore.
70 — Robert Rice.
70 — William Dinsdale.
71 — John Kenrick.
71 — James Penn.
72 — Nicholas Parker.
72 — Nathaniel Bishop.
73 — Zaccheus Bosworth.
73 — John Stevenson.
74 — Richard Cooke.
74 — John Synderland.
75 — John Lugg.
75 — Arthur Perry.
76 — Francis Lyle.
76 — Thomas Millard.
77 — William Aspinwall.
77 — Thomas Grubb.
78 — Edmund Dennis.
78 — Ephraim Pope.
79 — Edward Jacklin.
79 — William Townsend.
80 — Jane Parker.
80 — Robert Blott.
81 — Henry Flint.
81 — Thomas Flint.
82 — Anthony Harker.
82 — Thomas Clark, Blacksmith.
83 — Robert Wing.
83 — Ralph Mason.
84 — Richard Carter.
84 — Jacob Leger.
 85 — William Colbron.
85 — Edward Belcher.
86 — William Talmage.
86 — Robert Walker.
87 — Ralph Roote.
87 — William Brisco.
88 — Jacob Eliot.
88 — William Salter.
89 — Garret Bourne.
89 — John Cranwell.
90 — Edward Rainsford.
90 — David Offley.
91 — John Pelton.
92 — Griffeth Bowen.
92 — Clement Cole.
93 — Walter Sinet.
93 — John Odlin.
94 — Thomas Wheeler.
94 — Robert Woodward
95 — John Hurd.
95 — William Blantaine.
96 — Job Judkins.
96 — Robert Hull, Mastmaker.
97 — John Marshall.
97 — Nathaniel Woodward.
98 — Richard Hogg.
98 — Nathaniel Eaton.
99 — Francis East.
99 — Charity White.
100 — Richard Waite.
100 — Edward Fletcher.
101 — Robert Reynolds.
101 — John Palmer, Jr.
102 — John Palmer, Sr.
 102 — Amos Richardson.
103 — Gamaliel Waite.
103 — Benjamin Negoos.
104 — William Deming.
104 — Madid Engles.
105 — Richard Gridley.
105 — John Harrison.
106 — Edward Brown.
106 — Nicholas Baxter.
107 — William Lytherland.
107 — Matthew Iyons.
108 — Thomas Munt.
108 — William Teft.
109 — Jonathan Negoos.
109 — Thomas Foster.
110 — George Griggs.
110 — Richard Woodhouse.
111 — Thomas Bell.
111 — Richard Hollich.
112 — Christopher Lawson.

FOOTNOTES:
[1] Probably did not come.
 Plan of
BOSTON
—showing—
EXISTING WAYS AND OWNERS
—on—
December 25, 1630
—Compiled by—
GEORGE LAMB
 Plan of
BOSTON
—showing—
EXISTING WAYS AND OWNERS
—on—
December 25, 1635
—Compiled by—
GEORGE LAMB
 Plan of
BOSTON
—showing—
EXISTING WAYS AND OWNERS
—on—
December 25, 1640
—Compiled by—
GEORGE LAMB
Scale 600 feet to an inch
 Plan of
BOSTON
—showing—
EXISTING WAYS AND OWNERS
—on—
December 25, 1645
—Compiled by—
GEORGE LAMB
Scale 600 feet to an inch
 *** END OF THE PROJECT GUTENBERG EBOOK SERIES OF
PLANS OF BOSTON SHOWING EXISTING WAYS AND OWNERS
OF PROPERTY 1630-1635-1640-1645 ***

Updated editions will replace the previous one—the old editions will
be renamed.

Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States copyright in
these works, so the Foundation (and you!) can copy and distribute it
in the United States without permission and without paying copyright
royalties. Special rules, set forth in the General Terms of Use part of
this license, apply to copying and distributing Project Gutenberg™
electronic works to protect the PROJECT GUTENBERG™ concept
and trademark. Project Gutenberg is a registered trademark, and
may not be used if you charge for an eBook, except by following the
terms of the trademark license, including paying royalties for use of
the Project Gutenberg trademark. If you do not charge anything for
copies of this eBook, complying with the trademark license is very
easy. You may use this eBook for nearly any purpose such as
creation of derivative works, reports, performances and research.
Project Gutenberg eBooks may be modified and printed and given
away—you may do practically ANYTHING in the United States with
eBooks not protected by U.S. copyright law. Redistribution is subject
to the trademark license, especially commercial redistribution.

START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
 PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK

To protect the Project Gutenberg™ mission of promoting the free

distribution of electronic works, by using or distributing this work (or
any other work associated in any way with the phrase “Project
Gutenberg”), you agree to comply with all the terms of the Full
Project Gutenberg™ License available with this file or online at
www.gutenberg.org/license.

Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand, agree
to and accept all the terms of this license and intellectual property
(trademark/copyright) agreement. If you do not agree to abide by all
the terms of this agreement, you must cease using and return or
destroy all copies of Project Gutenberg™ electronic works in your
possession. If you paid a fee for obtaining a copy of or access to a
Project Gutenberg™ electronic work and you do not agree to be
bound by the terms of this agreement, you may obtain a refund from
the person or entity to whom you paid the fee as set forth in
paragraph 1.E.8.

1.B. “Project Gutenberg” is a registered trademark. It may only be

used on or associated in any way with an electronic work by people
who agree to be bound by the terms of this agreement. There are a
few things that you can do with most Project Gutenberg™ electronic
works even without complying with the full terms of this agreement.
See paragraph 1.C below. There are a lot of things you can do with
Project Gutenberg™ electronic works if you follow the terms of this
agreement and help preserve free future access to Project
Gutenberg™ electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright law in
the United States and you are located in the United States, we do
not claim a right to prevent you from copying, distributing,
performing, displaying or creating derivative works based on the
work as long as all references to Project Gutenberg are removed. Of
course, we hope that you will support the Project Gutenberg™
mission of promoting free access to electronic works by freely
sharing Project Gutenberg™ works in compliance with the terms of
this agreement for keeping the Project Gutenberg™ name
associated with the work. You can easily comply with the terms of
this agreement by keeping this work in the same format with its
attached full Project Gutenberg™ License when you share it without
charge with others.

1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside the
United States, check the laws of your country in addition to the terms
of this agreement before downloading, copying, displaying,
performing, distributing or creating derivative works based on this
work or any other Project Gutenberg™ work. The Foundation makes
no representations concerning the copyright status of any work in
any country other than the United States.

1.E. Unless you have removed all references to Project Gutenberg:

1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project Gutenberg™
work (any work on which the phrase “Project Gutenberg” appears, or
with which the phrase “Project Gutenberg” is associated) is
accessed, displayed, performed, viewed, copied or distributed:
 This eBook is for the use of anyone anywhere in the United
States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it away
or re-use it under the terms of the Project Gutenberg License
included with this eBook or online at www.gutenberg.org. If you
are not located in the United States, you will have to check the
laws of the country where you are located before using this
eBook.

1.E.2. If an individual Project Gutenberg™ electronic work is derived

from texts not protected by U.S. copyright law (does not contain a
notice indicating that it is posted with permission of the copyright
holder), the work can be copied and distributed to anyone in the
United States without paying any fees or charges. If you are
redistributing or providing access to a work with the phrase “Project
Gutenberg” associated with or appearing on the work, you must
comply either with the requirements of paragraphs 1.E.1 through
1.E.7 or obtain permission for the use of the work and the Project
Gutenberg™ trademark as set forth in paragraphs 1.E.8 or 1.E.9.

1.E.3. If an individual Project Gutenberg™ electronic work is posted

with the permission of the copyright holder, your use and distribution
must comply with both paragraphs 1.E.1 through 1.E.7 and any
additional terms imposed by the copyright holder. Additional terms
will be linked to the Project Gutenberg™ License for all works posted
with the permission of the copyright holder found at the beginning of
this work.

1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files containing a
part of this work or any other work associated with Project
Gutenberg™.

1.E.5. Do not copy, display, perform, distribute or redistribute this

electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1 with
active links or immediate access to the full terms of the Project
Gutenberg™ License.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if you
provide access to or distribute copies of a Project Gutenberg™ work
in a format other than “Plain Vanilla ASCII” or other format used in
the official version posted on the official Project Gutenberg™ website
(www.gutenberg.org), you must, at no additional cost, fee or expense
to the user, provide a copy, a means of exporting a copy, or a means
of obtaining a copy upon request, of the work in its original “Plain
Vanilla ASCII” or other form. Any alternate format must include the
full Project Gutenberg™ License as specified in paragraph 1.E.1.

1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™ works
unless you comply with paragraph 1.E.8 or 1.E.9.

1.E.8. You may charge a reasonable fee for copies of or providing

access to or distributing Project Gutenberg™ electronic works
provided that:

• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”

• You provide a full refund of any money paid by a user who

notifies you in writing (or by e-mail) within 30 days of receipt that
s/he does not agree to the terms of the full Project Gutenberg™
License. You must require such a user to return or destroy all
 copies of the works possessed in a physical medium and
discontinue all use of and all access to other copies of Project
Gutenberg™ works.

• You provide, in accordance with paragraph 1.F.3, a full refund of

any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.

• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.

1.E.9. If you wish to charge a fee or distribute a Project Gutenberg™

electronic work or group of works on different terms than are set
forth in this agreement, you must obtain permission in writing from
the Project Gutenberg Literary Archive Foundation, the manager of
the Project Gutenberg™ trademark. Contact the Foundation as set
forth in Section 3 below.

1.F.

1.F.1. Project Gutenberg volunteers and employees expend

considerable effort to identify, do copyright research on, transcribe
and proofread works not protected by U.S. copyright law in creating
the Project Gutenberg™ collection. Despite these efforts, Project
Gutenberg™ electronic works, and the medium on which they may
be stored, may contain “Defects,” such as, but not limited to,
incomplete, inaccurate or corrupt data, transcription errors, a
copyright or other intellectual property infringement, a defective or
damaged disk or other medium, a computer virus, or computer
codes that damage or cannot be read by your equipment.

1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES - Except

for the “Right of Replacement or Refund” described in paragraph
1.F.3, the Project Gutenberg Literary Archive Foundation, the owner
of the Project Gutenberg™ trademark, and any other party
distributing a Project Gutenberg™ electronic work under this
agreement, disclaim all liability to you for damages, costs and
expenses, including legal fees. YOU AGREE THAT YOU HAVE NO
REMEDIES FOR NEGLIGENCE, STRICT LIABILITY, BREACH OF
WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE
PROVIDED IN PARAGRAPH 1.F.3. YOU AGREE THAT THE
FOUNDATION, THE TRADEMARK OWNER, AND ANY
DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE
TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL,
PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE
NOTICE OF THE POSSIBILITY OF SUCH DAMAGE.

1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND - If you

discover a defect in this electronic work within 90 days of receiving it,
you can receive a refund of the money (if any) you paid for it by
sending a written explanation to the person you received the work
from. If you received the work on a physical medium, you must
return the medium with your written explanation. The person or entity
that provided you with the defective work may elect to provide a
replacement copy in lieu of a refund. If you received the work
electronically, the person or entity providing it to you may choose to
give you a second opportunity to receive the work electronically in
lieu of a refund. If the second copy is also defective, you may
demand a refund in writing without further opportunities to fix the
problem.

1.F.4. Except for the limited right of replacement or refund set forth in
paragraph 1.F.3, this work is provided to you ‘AS-IS’, WITH NO
OTHER WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.

1.F.5. Some states do not allow disclaimers of certain implied

warranties or the exclusion or limitation of certain types of damages.
If any disclaimer or limitation set forth in this agreement violates the
law of the state applicable to this agreement, the agreement shall be
interpreted to make the maximum disclaimer or limitation permitted
by the applicable state law. The invalidity or unenforceability of any
provision of this agreement shall not void the remaining provisions.