The Fundamentals of Search Algorithms


Robert A. Bohm (Editor)

Series: Computer Science, Technology and Applications

BISAC: COM014000

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.

Table of Contents


Chapter 1. The Fundamentals of Heuristic Local Search Algorithms for the Traveling Salesman Problem
(Weiqi Li – School of Management, University of Michigan-Flint, Flint, USA)

Chapter 2. Biometric Data Search Algorithm
(Stella Metodieva Vetova, PhD – Department of Informatics, Technical University of Sofia, Sofia, Bulgaria)

Chapter 3. Differential Evolution for Solving Continuous Search Space Problems
(Omar Andres Carmona Cortes and H´elder Pereira Borges – Computer Department (DComp), Instituto Federal de Educação, Ciência e Tecnologia do Maranhão (IFMA), Monte Castelo, São Luis, MA, Brazil


Additional information



Publish with Nova Science Publishers

We publish over 800 titles annually by leading researchers from around the world. Submit a Book Proposal Now!