search algorithms research paper

Skip to Main Content

IEEE Account

Purchase Details

Profile Information

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. © Copyright 2023 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

Your purchase has been completed. Your documents are now available to view.

Research on the application of search algorithm in computer communication network

This article mitigates the challenges of previously reported literature by reducing the operating cost and improving the performance of network. A genetic algorithm-based tabu search methodology is proposed to solve the link capacity and traffic allocation (CFA) problem in a computer communication network. An efficient modern super-heuristic search method is used to influence the fixed cost, delay cost, and variable cost of a link on the total operating cost in the computer communication network are discussed. The article analyses a large number of computer simulation results to verify the effectiveness of the tabu search algorithm for CFA problems and also improves the quality of solutions significantly compared with traditional Lagrange relaxation and subgradient optimization algorithms. The experimental results show that with the increase of the weighted coefficient of variable cost, the proportion of variable cost in the total cost increases from 10 to 35%. The growth is relatively slow, and the fixed cost is still the main component. In addition, due to the increase in the variable cost, the tabu search algorithm will also choose the link with large luxury to reduce the variable cost, which makes the fixed cost slightly increase, while the network delay cost and average delay slightly decrease. The proposed method, when compared with the genetic algorithm, has more advantages for large-scale or heavy-load networks.

1 Introduction

With the development of information technology, computer communication networks have been widely used in various fields. When designing and optimizing computer communication networks, link capacity allocation and message routing (i.e., link traffic distribution) are important issues that need to be considered [ 1 ]. Reasonably to solve the problem of capacity and flow distribution (CFA) in computer communication networks ( Figure 1 ), it is of great significance for reducing network operating costs, reducing the average delay of the network, and improving the cost–performance ratio of the network [ 2 ]. With the rapid development of mobile communications, competition among operators has become increasingly fierce, and the pace of network construction is quite fast, so that part of the network is put into operation without adjustment; this causes some waste of resources or insufficient resource allocation, which affects the quality of the user’s call. However, in mobile communication networks, the most important resource is the frequency resource. At present, the limited frequency resources are becoming tenser; therefore, the rational use of spectrum resources affects the development of mobile communications [ 3 ].

Figure 1
Capacity and flow distribution in the computer communication network.

Capacity and flow distribution in the computer communication network.

In recent years, there is a continuous advancement in the IT sector with significant expansion in networking. There have been a large number of software as well as applications that play different roles in this domain [ 4 , 5 ]. Such applications are specifically data-driven, and the users are able to generate big data by using these applications. There is a rapid growth of data which is to be detected effectively [ 6 ].

The state-of-the-artwork in the field of data optimization has several shortcomings, like increased operational cost and reduced network performance. This article is highly motivated to mitigate these challenges by reducing the operating cost and improve the performance of the network. An efficient modern super-heuristic search genetic algorithm-based tabu search methodology solves the link CFA problem in a computer communication network that influences the fixed cost, delay cost, and variable cost of link on total operating cost. This work saves costs and improves profits, and it was decided to optimize the existing GSM network. The data of the computer communication network is analyzed, and the frequency resources are allocated reasonably according to the analysis results. The optimal carrier frequency allocation scheme can improve the utilization rate of wireless channels, save money, increase profits, and obtain the best benefits. A reasonable carrier frequency allocation scheme is of great significance to the optimization of the network. The design and optimization of computer communication networks and a large number of other nonlinear combinatorial optimization problems provide a new idea and method. In the planning, design, performance optimization, and evaluation of computer communication networks and other networks such as telecommunications, power, and transportation. It has important theoretical and practical value and broad application prospects. The article observes a large number of computer simulation results to verify the effectiveness of the tabu search algorithm for CFA.

2 Literature review

Peker et al. used the traditional Lagrangian relaxation and sub-gradient optimization algorithm to study the CFA problem [ 7 ]. Ma et al. made improvements to this algorithm [ 8 ]. However, Tanaka et al. believed that, in essence, the optimization of the CFA problem is a non-linear programming problem with multiple constraints; it belongs to the complete category of NP in combinatorial optimization using traditional mathematical optimization methods; the solution process is relatively complicated; and the quality of the solution is not ideal, which can no longer meet the needs of actual engineering [ 9 ]. In recent years, modern hyper-heuristic algorithms represented by simulated annealing, genetic algorithm, tabu search, and artificial neural network have been extensively researched and applied. He et al. used genetic algorithms to solve CFA problems and proved the feasibility of genetic algorithms, and a more satisfactory result was obtained [ 10 ]. Wei et al. believed that cellular mobile communication adopts frequency reuse technology, and the frequency utilization rate has been improved, the system capacity has been increased, and the network has realized handover and roaming functions; the scope of customer service has also expanded [ 11 ]. Therefore, Zhou et al. established a public system in order to allow mobile phones to be used uniformly [ 12 ]. Xu et al. proposed the concept of tabu search for the first time and then formed a complete set of algorithms; in recent years, it has been greatly developed and received much attention [ 13 ]. Changming et al. considered the tabu search algorithm to be a restrictive local search technique. Its basic idea is to record the local optimal points that have been reached through a taboo table, and in the next search, use the information in the taboo table to no longer or selectively search for these points in order to avoid the local optimal solution [ 14 ]. The current GSM network also introduces the General Packet Radio Service (GPRS), which is a brand-new data transmission service based on the existing (Group Special Mobile, GSM) network. Some devices have been added to the network, such as service GPRS support nodes and gateway GPRS support nodes, which can realize FTP file transfer, web browsing, and other services. With the rapid development of GPRS services, the existing transmission rate cannot meet the needs of services, so EDGE technology has also been introduced. The introduction of EDGE technology does not change the structure of the entire GSM network. This technology adopts a new modulation technology to make the data transmission rate faster.

Tabu search algorithm, an efficient modern super-heuristic search method, is used for the first time to solve the link CFA problem in the computer communication network. Then, the influence of fixed cost, delay cost, and variable cost of the link on the total operating cost in the computer communication network is discussed. Finally, a large number of computer simulation results not only verify the effectiveness of the tabu search algorithm for CFA problems but also improve the quality of solutions significantly compared with traditional Lagrange relaxation and subgradient optimization algorithms. This paper not only provides new ideas and methods for the design and optimization of computer communication networks, but also provides new ideas and methods for the planning, design, performance optimization and evaluation of telecommunications, power, transportation and other networks. It has important theoretical and practical value and broad application prospects.

3 Materials and methods

This section provides the description of the network communication optimization approach in search algorithms.

3.1 Network communication optimization in search algorithms

Network optimization refers to the investigation and analysis of network data after the existing network is officially put into operation, and then the network is reasonably adjusted according to the analysis results. Through the collection of traffic data of the base station, voice test, drive test, carrier frequency planning of the cell, etc., to investigate. Then it carry out statistics, analysis and summarization on the acquired data. This work finds out the problem that affects the quality of the network and works out the corresponding network adjustment plan. Then adjust the parameters of the base station and switching network according to the plan. The ultimate goal is to make the operation of the network reach the best state, so that the existing network resources can be better and fully utilized, and the best benefits can be obtained [ 15 ]. Traditional network construction ideas are divided into three stages: planning, engineering construction, and maintenance; the most important part of maintenance is network optimization, and it is the work carried out on the basis of daily maintenance. It is different from planning and engineering construction, but it is closely connected with planning and engineering construction. Network optimization is a very complex and recurring task. All expansions and network adjustments since the network was successfully constructed and put into operation, all are part of network optimization. With the expansion of the network scale and the increase in the number of users, the construction of indoor stations and the introduction of micro-cell technology, the task of network optimization is even more arduous [ 16 ].

The main process of network optimization is to conduct system investigation, data collection and analysis, formulate an optimization plan, and implement an optimization plan, and the process is shown in Figure 2 .

Figure 2
Network optimization process.

Network optimization process.

OMC data collection

Collect relevant data about BSS and NSS in OMC, such as the number of base stations, system messages, neighbor cell configuration, power control, and other data.

Other data collection

If you want to fully understand a network, in addition to collecting the above-mentioned data, it also requires mobile phone calls to test, drive test, antenna data, and customer service to accept customer complaints. Combining all the data can make a comprehensive analysis of the status of the network.

Figure 3
The structure of the taboo table.

The structure of the taboo table.

3.2 Search algorithm

The basic harmony search algorithm is continuous, however, for a typical combinatorial optimization problem such as channel allocation is a discrete space [ 18 ]; therefore, it is necessary to use the harmony search algorithm to allocate the channels, and the harmony search algorithm must be discretized. Among them, the harmonic generation operation in the discrete domain is shown in formula ( 1 ):

where X ′ stands for the temporary solution, h ( x ) represents a new individual generated by exchanging information between two harmony variables, and g means that all the solutions in the harmony memory bank interact to produce a new harmony.

In the discrete domain, the harmonic disturbance operation is performed according to equation ( 2 ):

Among them, the function F ( X ′) represents the perturbation operation of the individual independent variable.

Because the basic harmony algorithm has unstable convergence, and it is easy to fall into the defect of local optimal solution, in order to improve the stability of the searched global optimization solution [ 19 ], at the same time, the robustness and universality of the algorithm are enhanced, and the following improvements are made to the discrete harmony search algorithm:

Dynamically adjust HMCR and PAR according to formulas ( 3 ) and ( 4 ).

Initialize the parameters, set the size HMS of the harmony library, the number of iterations Ite, the maximum HMCR max and minimum HMCR min of the retention probability of harmony memory, the maximum value PAR max and minimum value PAR min of the syllable adjustment probability.

Initialize the population, calculate fitness according to the objective function, if the calculation result is 0, exit and output the result. Otherwise step 3 will be executed.

Use the three rules of HMCR, PAR and random selection to generate each harmony variable.

Calculate the fitness value again. If the calculation result is 0, exit the algorithm and output the result. Otherwise, repeat step (3).

The algorithm ends when the conditions for the end of the algorithm are met.

4 Computer simulation experiment results and discussion

4.1 computer simulation experiment.

For the sake of comparison, the experimental objects adopt ARPA net and RING net, the number on the link is the length in km, and the number in the box represents the node number [ 20 ]. The ARPA network has 21 nodes (420 communication node pairs), 26 links, and the communication volume between each node pair is 4 packets/s; The RING network has a total of 32 nodes (992 communication node pairs), there are 60 links, and the communication volume between each node pair is 1 min/s and 4 packets/s, respectively. The candidate routes between each pair of nodes are selected as five, which are generated in advance by the route generation program, and numbered from 0 to 4 according to the path length. Table 1 shows the candidate link capacity and its cost.

Link capacity and its cost

4.2 Analysis of simulation results

Table 2 shows the different packet lengths, experimental results of computer simulation with network operating expenses. Among them, D = 2,000 yuan/(month group), G = V = 1. The network delay cost and the total network cost obtained by the author’s method are both small, that is, the performance–price ratio of the entire network is higher; especially in the RING network [ 21 ], the total network cost is reduced by 60%. Comparing the results, in the ARPA network, the result of the author’s method is similar to the optimization result of genetic algorithm; and in the RING network, the network delay cost and the total network cost are both small, and the total network cost is reduced by 5%. It can also be seen from the table that the algorithm is more superior to large-scale or heavy-loaded networks.

Experimental results of computer simulation under different packet lengths

Figure 4 shows that when the units are grouped in the RING network, the impact of the change in the weighting coefficient of the delay cost on the various operating costs of the network, the average packet length is 400 bits, and G = V = 1. As can be seen from Figure 4 , with the increase of the weighting coefficient of the unit grouping delay cost, the total network cost, delay cost, and fixed cost are also increasing [ 22 ]. When the weighting coefficient is very low (such as 0), it means that the packet delay, that is, the real-time performance of the network is not important; therefore, in the optimization process, the tabu search algorithm will select a link with a smaller capacity, in order to reduce the fixed cost of the link, the average delay of the network is very high. When the weighting coefficient increases, too high delay will increase the delay cost; at this time, the algorithm will select a large-capacity link, in order to reduce the increasing network cost due to the increase of delay cost [ 23 , 24 , 25 ]. At the same time, due to the increase in link capacity, the fixed cost will increase, the average delay of the network will continue to drop, and the real-time performance of the network will be improved. In the process of increasing the weighting coefficient of the unit grouping delay cost, the proportion of latency costs to the total network costs continues to increase, increase from 0 to about 20%; fixed link costs still account for the main share, but its proportion dropped slightly from 75 to about 65%. The variable cost has not changed very much, but due to the gradual increase in link capacity, through route optimization, the traffic of the link is reduced, and the variable cost is also slightly reduced.

Figure 4
Computer simulation results of the weighting coefficients of different unit grouping delay costs.

Computer simulation results of the weighting coefficients of different unit grouping delay costs.

Figure 5 shows the changes in the weighting coefficient of fixed costs in the RING network, the impact on network costs. Among them, D = 2,000 yuan/(month group), the average packet length is 400 bits, and V = 1. As can be seen from Figure 5 , the fixed cost weighting coefficient has a great influence on the total network cost. When this weighting coefficient is very low, the delay cost accounts for a considerable proportion of the total cost, in order to reduce the total cost in the optimization process, the tabu search algorithm, tend to choose large-capacity links to reduce network delay costs, this also reduces the average delay of the network, real-time performance is improved. When this weighting factor increases, the fixed cost of the link continues to rise, the proportion is gradually increasing, in order to reduce the total cost, the algorithm can only select links with small capacity, by reducing the fixed cost, the total cost is reduced, but at the same time, the average delay increases and the real-time performance of the network deteriorates. At the same time, the reduction of link capacity will lead to an increase in the traffic cost coefficient. At this time, the traffic volume in the link will increase relatively, and the variable cost has a slight upward trend, but the change is not significant. This shows that the routing strategy is not greatly affected by the weighted coefficient of the fixed cost. With the increase in the weighting coefficient of fixed costs, the proportion of fixed costs in the total network costs is increasing, the proportion of delay costs is gradually decreasing, and the proportion of variable costs has declined. In these two networks, when the fixed cost weighting coefficient is 0.1, delay fees, fixed fees, and variable fees account for 23, 35, and 42% of the total cost, respectively, when the coefficient increases to 2.0, its proportions are about 19, 70, and 11%, respectively.

Figure 5
Computer simulation results of different weighted coefficients of fixed costs.

Computer simulation results of different weighted coefficients of fixed costs.

Figure 6 shows the RING network, the impact of the change of the variable cost weighting coefficient on various network costs, where D = 2,000 yuan/(month group), the average packet length is 400 bits, V = 1. As can be seen from Figure 6 , with the increase of the variable cost weighting coefficient, the proportion of variable cost in the total cost has increased from 10% to about 35%, the growth is relatively slow, fixed costs are still the main component. In addition, due to the increase in the proportion of variable costs, the tabu search algorithm will also choose a larger amount of extravagant links to reduce the variable cost, which makes the fixed cost slightly increase; the delay cost and average delay of the network showed a slight downward trend. However, in general, the change of the weighting coefficient does not have a great impact on the delay cost, fixed cost, and average delay, increasing this coefficient will not cause the redistribution of the entire network traffic, that is, the routing strategy will not undergo major adjustments. Obviously, the variable cost in Figure 6 has a roughly linear growth relationship with its weighting coefficient, while the growth of the total network cost is basically due to the increase in variable costs.

Figure 6
Computer simulation results of different variable cost weighting coefficients.

Computer simulation results of different variable cost weighting coefficients.

5 Conclusion

This article proposes an efficient modern super-heuristic search method which is used for the first time to solve the link CFA problem in the computer communication network. The influence of fixed cost, delay cost, and variable cost of link on total operating cost in computer communication network is discussed. This article uses a large number of computer simulation results not only to verify the effectiveness of the tabu search algorithm for CFA problems but also to improve the quality of solutions significantly compared with traditional Lagrange relaxation and subgradient optimization algorithms. The design and optimization of computer communication networks and a large number of other nonlinear combinatorial optimization problems provide a new idea and method. Moreover, in the planning, design, performance optimization, and evaluation of computer communication networks and other networks such as telecommunications, power, and transportation, it has important theoretical and practical value and broad application prospects.

The two improved algorithms proposed in this paper are used in the problem of frequency allocation and have strong solving ability.

However, the future scope of this article lies in the development of an optimized approach, which further provide improved network performance, and there is still a lot of room for development.

Funding information: This work was funded by the Science and Technology Research and Development Plan of Langfang in 2021, “Research on collaborative innovation development path of Beijing-Tianjin-Hebei Artificial intelligence industry,” Project No.: 2021029060.

Conflict of interest: The authors declare that they have no competing interest.

Informed consent: Informed consent was obtained from all individuals included in this study.

Data availability statement: The dataset and stimuli of this study are available upon reasonable request from the corresponding author.

[1] Ahmad A, Razali S, Mohamed ZS, El-Shafie A. The application of artificial bee colony and gravitational search algorithm in reservoir optimization. Water Resour Manag. 2016;30(7):2497–516. 10.1007/s11269-016-1304-z Search in Google Scholar

[2] Hao L, Chen T, Yu J. Research on the application of cordic algorithm in the field of space-borne on-board signal processing. Proc Comput Sci. 2021;183(3):361–71. 10.1016/j.procs.2021.02.072 Search in Google Scholar

[3] He S, Shen X, Yang Y, He R, Yan W. Research on mri brain segmentation algorithm with the application in model-based eeg/meg. IEEE Trans Magnetics. 2001;37(5):3741. 10.1109/20.952703 Search in Google Scholar

[4] Huang TS, Li X, Cao Q. Research on an evaluation algorithm of sensing node reliability in cognitive networks. IEEE Access. 2020;8:11848–55. 10.1109/ACCESS.2020.2965292 Search in Google Scholar

[5] Hu X, Zhao J, Seet BC, Leung V, Chu T, Chan H. S-aframe: Agent-based multilayer framework with context-aware semantic service for vehicular social networks. IEEE Trans Emerg Top Comput. 2015;3(1):44–63. 10.1109/TETC.2015.2395959 Search in Google Scholar

[6] Tanaka Y, Berlage O. A fast dynamic algorithm for storage allocation in telecommunication networks. IEICE Trans Commun. 2018;78(7):1025–32. Search in Google Scholar

[7] Peker M, En B, Delen D. Computer-aided diagnosis of parkinson’s disease using complex-valued neural networks and mrmr feature selection algorithm. J Healthc Eng. 2015;6(3):281–302. 10.1260/2040-2295.6.3.281 Search in Google Scholar PubMed

[8] Ma Y, Li L, Yin Z, Chai A, Bi Z. Research and application of network status prediction based on bp neural network for intelligent production line. Proc Computer Sci. 2021;183(20):189–96. 10.1016/j.procs.2021.02.049 Search in Google Scholar

[9] Lim S, Lee WC, Cao G, Das CR. Cache invalidation strategies for internet-based mobile ad hoc networks. Comput Commun. 2012;30(8):1854–69. 10.1016/j.comcom.2007.02.020 Search in Google Scholar

[10] He S, Shen X, Yang Y, He R, Yan W. Research on mri brain segmentation algorithm with the application in model-based EEG/MEG. IEEE Trans Magnetics. 2021;37(5):3741–4. Search in Google Scholar

[11] Wei P, Zhen Z. Research on security of information sharing in internet of things based on key algorithm. Future Gener Comput Syst. 2018;88(NOV):599–605. 10.1016/j.future.2018.04.035 Search in Google Scholar

[12] Zhou W, Yu S. Research on the communication method of mobile network shadow fading based on interference alignment algorithm. J Supeuting. 2016;72(7):2891–909. 10.1007/s11227-016-1705-z Search in Google Scholar

[13] Xu L, Tan GZ, Xia Z. Probabilistic inference-based service level objective-sensitive virtual network reconfiguration. Comput Commun. 2015;57:25–36. 10.1016/j.comcom.2014.10.005 Search in Google Scholar

[14] Changming JI, Chuangang LI, Liu X, Wang B, Zhang P. Research and application of dynamic programming algorithm in reservoir operation based on functional analysis. J Hydraulic Eng. 2016;47(1):1–9. Search in Google Scholar

[15] Cui Y, Chen S, Meng QU, Shanhong HE. Research and application of new threshold de-noising algorithm for monitoring data analysis in nuclear power plant. J Shanghai Jiaotong Univ. 2017;22(3):355–60. 10.1007/s12204-017-1843-3 Search in Google Scholar

[16] Castano F, Bourreau E, Velasco N, Rossi A, Sevaux M. Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks. Eur J Oper Res. 2015;241(1):28–38. 10.1016/j.ejor.2014.08.013 Search in Google Scholar

[17] Steiner T, Verborgh R, Gabarro J, Mannens E, Walle R. Clustering media items stemming from multiple social networks. Comput J. 2015;58(9):1861. 10.1093/comjnl/bxt147 Search in Google Scholar

[18] Xiao J, Liu Z, Yang H, Hu X. The invariant features-based target tracking across multiple cameras. Multimed Tools Appl. 2017;76(10):1–15. 10.1007/s11042-015-3067-6 Search in Google Scholar

[19] Ali W, Li Y, Ahmed N, Ali W, Kashif M. A novel application of pattern search algorithm for efficient estimation of channel state information in mimo network. Wirel Personal Commun. 2021;116(1):325–40. 10.1007/s11277-020-07717-0 Search in Google Scholar

[20] Jiang P, Li P. Research and application of a new hybrid wind speed forecasting model on bso algorithm. J Energy Eng. 2017;143(1):04016019.1–04016019.13. 10.1061/(ASCE)EY.1943-7897.0000362 Search in Google Scholar

[21] Qian P, Shang T, Gao Y, Ding G. Research on dynamic handover decision algorithm based on fuzzy logic control in mobile fso networks. Photonic Netw Commun. 2021;41(2):136–47. 10.1007/s11107-020-00920-w Search in Google Scholar

[22] Seref O, Razzaghi T, Xanthopoulos P. Weighted relaxed support vector machines. Ann Oper Res. 2017;249(1–2):1–37. 10.1007/s10479-014-1711-6 Search in Google Scholar

[23] Xu L, Zhou XZ, Li QM, Zhang XF. Energy-efficient resource allocation for multiuser ofdma system based on hybrid genetic simulated annealing. Soft Comput. 2017;21(14):3969–76. 10.1007/s00500-016-2047-8 Search in Google Scholar

[24] Zhou S, Meng X. A location and time-aware resource searching scheme in mobile p2p ad hoc networks. J Supercomputing. 2020;76(9):6809–33. 10.1007/s11227-019-03139-3 Search in Google Scholar

[25] Sharma A, Kumar R. Risk-energy aware service level agreement assessment for computing quickest path in computer networks. Int J Reliab Saf. 2019;13(1/2):96–124. 10.1504/IJRS.2019.097019 Search in Google Scholar

© 2022 Hua Ai et al ., published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

Supplementary Materials

Please login or register with De Gruyter to order this product.

Journal of Intelligent Systems

Journal and Issue

Articles in the same issue.

Please note that Internet Explorer version 8.x is not supported as of January 1, 2016. Please refer to this support page for more information.

Download full issue

Procedia Computer Science

Comparative research of random search algorithms and evolutionary algorithms for the optimal control problem of the mobile robot.

An experimental comparison of evolutionary algorithms and random search algorithms for the optimal control problem is carried out. The problem is solved separately by several representatives of each type of algorithms. The simulation is performed on a mobile robot model. The results of each algorithm performance are compared according to the best found value of the fitness function, the mean value and the standard deviation.

Cited by (0)

The Mixed Blessings of Search Algorithms as Research Tools

What is a Search Algorithm?

In layman’s terms, an algorithm is a set of coding instructions or rules for a computer to follow in completing a calculation or problem-solving operation. A search algorithm, as the name implies, is written to find items with specific properties within an increasingly large database of items.

A linear search looks at each item in sequence until it finds the items it was written to look for and then stops. As the size of the database increases, the algorithms get more sophisticated. Binary searches look for records tagged by a numerical key or field such as your driver’s license number or social security number. Depending on how the data has been structured, a “tree” search will start at a root item and build results in a tree pattern. At the top of the list is a genetic algorithm that searches for an “optimum solution” based on available data by testing strings of data and discarding the worst ones in multiple iterations until the “best” is left.

A Vital Research Tool

The most familiar search algorithm is probably Google’s, and the non-threatening names given to its frequent updates—Panda, Penguin, Pigeon—help to minimize the nerd factor for the non-techies that use it multiple times every day. However, when a simple search for the term “penguin” on Google delivers 165 million results in only 0.35 seconds, the size of the databases being searched and the dire need for an accurate tool to search them becomes evident.

In Academia, there are estimated to be over 110 million scholarly documents available in English on the Internet, with the majority of them containing topic-specific terminology. Google Scholar has already started to make inroads into the vast trove of knowledge, but critics are already complaining that the algorithm makes no effort to distinguish between refereed and non-refereed sources. As a result, questionable research work gets listed in the same results as peer-reviewed research of established quality.

Failing to Keep-Up

If you subscribe to the old axiom that “a rising tide raises all boats,” you would think that the rapid advances in digital technology that are facilitating the construction of mega databases with petabytes and yottabytes of data, are also being matched with the coding knowledge to expertly navigate through all that data. That is not the case. In the early days of computing, the old adage of Garbage In Garbage Out (GIGO) reminded programmers that the computer could only function as efficiently as the code written. In other words, stupid code made the computer do stupid things. The sheer volume of data , with which we are now working has escalated that problem to an exponential level. In academic terms, a poorly structured search string in a database with tens, if not hundreds, of thousands of entries, could produce results that could totally derail your research before the literature is even complete.

From Searching to Predicting

We are already seeing multiple examples of questionable use of powerful algorithms. Edward Snowden’s revelations of the complex algorithms developed by the National Security Administration (NSA) to track suspected terrorists, demonstrated just how much information was available on American citizens, and how detailed the developed profiles of those citizens could be, based on known information and predicted data built on statistical calculations of relevant averages.

For academic research, the sheer volume of data is now attracting increasingly complex meta-analyses of specific areas of research that are, in turn, driving the development of predictive software to help institutions and corporations to decide which specific areas of research will have the greatest chance of success. Critics argue that we’re one step away from treating research like a Las Vegas “system,” but one thing is clear, unless personnel are trained in the correct use of these powerful algorithms, there’s going to be even more questionable data floating around to waste increasingly scarce research funding.

Rate this article Cancel Reply

Your email address will not be published.

search algorithms research paper

Enago Academy's Most Popular

publishing thesis as a book

9 Effective Tips for Publishing Thesis As a Book

While they may look alike, a thesis is not a book! The process of publishing…

best essay writing service

4 Best Essay Writing Services in 2022 – A Comparative Study

If we are all asked to narrate how school life is, we all would probably…

Selecting Journals

What Is a Preprint? 5 Step Guide to Successfully Publish Yours!

The article is also available in: Turkish, Spanish, Portuguese, and Russian “I think you should…

Understanding Ethics

Interesting Science vs. Sound Science – All About the Rigor and Transparency Index (RTI)

This guest post is drafted by Martijn Roelandse and Anita Bandrowski from SciCrunch. It highlights…

search algorithms research paper

A Guide to Academic Book Writing and Publishing

Types of academic books How to write a compelling book How to publish an edited…

Interesting Science vs. Sound Science – All About the Rigor and Transparency…

How Can Researchers Get the Most From Wiley Online Library?

Sign-up to read more

Subscribe for free to get unrestricted access to all our resources on research writing and academic publishing including:

We hate spam too. We promise to protect your privacy and never spam you.

I am looking for Editing/ Proofreading services for my manuscript Tentative date of next journal submission:

search algorithms research paper

For what are you most likely to depend on AI-assistance?

We apologize for the inconvenience...

To ensure we keep this website safe, please can you confirm you are a human by ticking the box below.

If you are unable to complete the above request please contact us using the below link, providing a screenshot of your experience.

https://ioppublishing.org/contacts/

Please solve this CAPTCHA to request unblock to the website

IMAGES

Algorithms and Data Structures
Searching Algorithms
Introduction to Search Algorithms
A* Search Algorithm
Uninformed Search Algorithms
Comparison of search algorithm

VIDEO

Searching Algorithms
Lecture 6: Online Search Algorithms
Searching Algorithms
01204313/63 Algorithms EP04.3
Search Algorithms
Searching Algorithms

COMMENTS

A brief study and analysis of different searching algorithms
Abstract: This paper presents the review of certain important and well discussed traditional as well as proposed search algorithms with respect to their
A Brief Study and Analysis of Different Searching Algorithms
As it is well known that every sorted or unsorted list of elements requires searching technique so many search algorithms have been invented.
Research on the application of search algorithm in computer
A genetic algorithm-based tabu search methodology is proposed to solve the ... The article analyses a large number of computer simulation
A Survey on Different Searching Algorithms
International Research Journal of Engineering and Technology (IRJET) ... This paper also ... Key Words: Searching algorithms, binary search, linear.
Search algorithms, hidden labour and information control
Original Research Article. Search algorithms, hidden labour and information control. Paško Bilic. Abstract. The paper examines some of the processes of the
Comparative Research of Random Search Algorithms and
An experimental comparison of evolutionary algorithms and random search algorithms for the optimal control problem is carried out.
The Research on Search Algorithms in the Machine Learning
We focus on Two search algorithms are introduced to learn the structure of a Bayesian network in the paper. The heuristic search algorithm is simple and
The Mixed Blessings of Search Algorithms as Research Tools
The article is also available in: Turkish, Spanish, Portuguese, and Russian “I think you should… February 3, 2022 4 minutes. Rigor.
Comparison Searching Process of Linear, Binary and Interpolation
Paper • The following article is Open access ... [3] Kareem B S. 2016 Matrix Search Algorithm Using Binary Search Trees Research & Reviews: Journal of
Tri-Search: A New and Efficient Searching Algorithm
3: Sorting and Searching. Reading, MA: Addiso. Wesley,1973 Structures.. [2]Quadratic Research Paper International Journal of. Computer Applications (975