The Fundamentals Of Search Algorithms

114 Pages·2021·9.884 MB·English

by  Robert A. Bohm (ed.)

COMPUTER SCIENCE, TECHNOLOGY AND APPLICATIONS

T F
HE UNDAMENTALS OF
SEARCH ALGORITHMS

No part of this digital document may be reproduced, stored in a retrieval system or transmitted in any form or
by any means. The publisher has taken reasonable care in the preparation of this digital document, but makes no
expressed or implied warranty of any kind and assumes no responsibility for any errors or omissions. No
liability is assumed for incidental or consequential damages in connection with or arising out of information
contained herein. This digital document is sold with the clear understanding that the publisher is not engaged in
rendering legal, medical or any other professional services.
C S , T
OMPUTER CIENCE ECHNOLOGY
A
AND PPLICATIONS

Additional books and e-books in this series can be found
on Nova’s website under the Series tab.
COMPUTER SCIENCE, TECHNOLOGY AND APPLICATIONS

T F
HE UNDAMENTALS OF
SEARCH ALGORITHMS

ROBERT A. BOHM
EDITOR
Copyright © 2021 by Nova Science Publishers, Inc.

All rights reserved. No part of this book may be reproduced, stored in a retrieval system or transmitted
in any form or by any means: electronic, electrostatic, magnetic, tape, mechanical photocopying,
recording or otherwise without the written permission of the Publisher.

We have partnered with Copyright Clearance Center to make it easy for you to obtain permissions to
reuse content from this publication. Simply navigate to this publication’s page on Nova’s website and
locate the “Get Permission” button below the title description. This button is linked directly to the title’s
permission page on copyright.com. Alternatively, you can visit copyright.com and search by title, ISBN,
or ISSN.

For further questions about using the service on copyright.com, please contact:
Copyright Clearance Center
Phone: [phone] Fax: [phone] E-mail: [email protected].

NOTICE TO THE READER
The Publisher has taken reasonable care in the preparation of this book, but makes no expressed or
implied warranty of any kind and assumes no responsibility for any errors or omissions. No liability is
assumed for incidental or consequential damages in connection with or arising out of information
contained in this book. The Publisher shall not be liable for any special, consequential, or exemplary
damages resulting, in whole or in part, from the readers’ use of, or reliance upon, this material. Any parts
of this book based on government reports are so indicated and copyright is claimed for those parts to the
extent applicable to compilations of such works.

Independent verification should be sought for any data, advice or recommendations contained in this
book. In addition, no responsibility is assumed by the Publisher for any injury and/or damage to persons
or property arising from any methods, products, instructions, ideas or otherwise contained in this
publication.

This publication is designed to provide accurate and authoritative information with regard to the subject
matter covered herein. It is sold with the clear understanding that the Publisher is not engaged in
rendering legal or any other professional services. If legal or any other expert assistance is required, the
services of a competent person should be sought. FROM A DECLARATION OF PARTICIPANTS
JOINTLY ADOPTED BY A COMMITTEE OF THE AMERICAN BAR ASSOCIATION AND A
COMMITTEE OF PUBLISHERS.

Additional color graphics may be available in the e-book version of this book.

Library of Congress Cataloging-in-Publication Data

ISBN: (cid:28)(cid:26)(cid:27)(cid:16)(cid:20)(cid:16)(cid:24)(cid:22)(cid:25)(cid:20)(cid:28)(cid:16)(cid:21)(cid:23)(cid:25)(cid:16)(cid:28)(cid:11)(cid:72)(cid:37)(cid:82)(cid:82)(cid:78)(cid:12)

Published by Nova Science Publishers, Inc. † New York
CONTENTS

Preface vii
Chapter 1 The Fundamentals of Heuristic Local Search
Algorithms for the Traveling Salesman Problem 1
Weiqi Li
Chapter 2 Biometric Data Search Algorithm 45
Stella Metodieva Vetova
Chapter 3 Differential Evolution for Solving Continuous
Search Space Problems 75
Omar Andres Carmona Cortes
and Hélder Pereira Borges
Index 99

PREFACE

Heuristic local search algorithms are used to find “good” solutions to
the NP-hard combinatorial optimization problems that cannot be solved
using analytical methods. Chapter one discusses the characterization and
computation of heuristic local search algorithm for the Traveling Salesman
Problem (TSP) from the perspective of dynamical systems. The purpose of
chapter 2 is to show the practical application of CBIR technology in the
security and protection of personal data, access to classified documents and
objects, identification of illegal attacks that are part of the social life of the
present and future of mankind. Continuous search space problems are
difficult problems to solve because the number of solutions is infinite.
Moreover, the search space gets more complex as we add constraints to the
problem. In this context, chapter 3 aims to show the usage of the differential
evolution algorithm for solving continuous search space problems using
unconstrained functions and a constrained real-world problem.
Chapter 1 - Heuristic local search algorithms are used to find “good”
solutions to the NP-hard combinatorial optimization problems that cannot
be solved using analytical methods. This chapter discusses the
characterization and computation of heuristic local search algorithm for the
Traveling Salesman Problem (TSP) from the perspective of dynamical
systems. A heuristic local search system is essentially in the domain of
dynamical systems. Like many other dynamical systems, a local search
viii Robert A. Bohm
system has an attracting property that drives the search trajectories to
converge to a small region, called a solution attractor, in the solution space.
The study of the solution attractor in the solution space can provide the
answer to the question: “Where do the search trajectories go in a heuristic
local search system?” The solution attractor collects all locally optimal
solutions around the globally optimal solutions. This chapter, using the TSP
as the study problem, describes the behavior of search trajectories and
properties of the solution attractor in a local search system. Based on these
properties of the solution attractor, a novel global optimization algorithm –
Attractor-Based Search System (ABSS) – is introduced. This algorithm
provides the answer to the question: “How can we use efficient heuristic
local search for global optimization?” The ABSS combines a local search
process and an exhaustive search procedure. The local search process
constructs the solution attractor of the local search system, and the
exhaustive search procedure identifies the best solutions in the solution
attractor. This chapter describes how the ABSS meets the requirements of
global optimization system. The computational complexity of the ABSS for
the TSP is also discussed.
Chapter 2 - The purpose of the outlined content is to show the practical
application of CBIR technology in the security and protection of personal
data, access to classified documents and objects, identification of illegal
attacks that are part of the social life of the present and future of mankind. It
involves comparison of the disadvantages and advantages of content-based
image retrieval techniques with the use of local and global features in
biometric data. The main idea is to offer the optimal application for security
and protection. In pursuit of this goal, the following tasks are envisaged:
1. Design of algorithms with the use of local characteristics and
2. different similarity distance measures;
3. Design of algorithms with the use of global characteristics using
4. different similarity distance measures;
5. Conducting experimental studies on the algorithms of items 1
and 2;
6. Comparative analysis of the data obtained in item 3.