Data fusion using Tabu crossover genetic algorithm in information retrieval

2020 ◽  
Vol 39 (4) ◽  
pp. 5407-5416
Author(s):  
Murugan Sivaram ◽  
K. Batri ◽  
Amin Salih Mohammed ◽  
V. Porkodi ◽  
N.V. Kousik
Keyword(s):  
Genetic Algorithm ◽  
Information Retrieval ◽  
Data Fusion ◽  
Optimal Solution ◽  
Fine Tuning ◽  
Exploration And Exploitation ◽  
Single Entity ◽  
Search Optimization ◽  
Crossover Probability

This article explores the odd and even point crossover based Tabu Genetic Algorithm. The search optimization tools equipped with exploration and exploitation operators. Those operators assist the optimization tools for finding the optimal solution. Few problems demand vigorous exploration and minimal exploitation. The vigorous exploration needs some specialized operators, which is capable of carrying out the task. In this article, we explore one such possible operator using odd and even point (OEP) crossover. The resultant hybrid GA namely OEP crossover based Tabu GA has two tuning factors namely tenure period and OEP crossover probability (Podd). The tenure period may be a single entity or a group of entities. However, Podd is single, as the tenure period is involved with group of entities, it demands some fine tuning. The fine tuning may alter the proportion of exploration and exploitation. Hence, we proposed a method for selecting the tenure period. The proposed exploration operator and the method for fixing the tenure period has been tested over the data fusion problem in information retrieval. The results look promising.

scholarly journals Relevance Feedback using Genetic Algorithm on Information Retrieval for Indonesian Language Documents

2019 ◽  
Vol 5 (2) ◽  
pp. 171
Author(s):  
Salman Dziyaul Azmi ◽  
Retno Kusumaningrum
Keyword(s):  
Genetic Algorithm ◽  
Information Retrieval ◽  
Population Size ◽  
Relevance Feedback ◽  
Mean Average Precision ◽  
Average Precision ◽  
Mutation Probability ◽  
Average Recall ◽  
Crossover Probability ◽  
Standard Information

Background: The Rapid growth of technological developments in Indonesia had resulted in a growing amount of information. Therefore, a new information retrieval environment is necessary for finding documents that are in accordance with the user’s information needs.Objective: The purpose of this study is to uncover the differences between using Relevance Feedback (RF) with genetic algorithm and standard information retrieval systems without relevance feedback for the Indonesian language documents.Methods: The standard Information Retrieval (IR) System uses Sastrawi stemmer and Vector Space Model, while Genetic Algorithm-based (GA-based) relevance feedback uses Roulette-wheel selection and crossover recombination. The evaluation metrics are Mean Average Precision (MAP) and average recall based on user judgments.Results: By using two Indonesian language document datasets, namely abstract thesis and news dataset, the results show 15.2% and 28.6% increase in the corresponding MAP values for both datasets as opposed to the standard Information Retrieval System. A respective 7.1% and 10.5% improvement on the recall value at 10th position was also observed for both datasets. The best obtained genetic algorithm parameters for abstract thesis datasets were a population size of 20 with 0.7 crossover probability and 0.2 mutation probability, while for news dataset, the best obtained genetic algorithm parameters were a population size of 10 with 0.5 crossover probability and 0.2 mutation probability.Conclusion: Genetic Algorithm-based relevance feedback increases both values of MAP and average recall at 10th position of retrieved document. Generally, the best genetic algorithm parameters are as follows, mutation probability is 0.2, whereas the size of population size and crossover probability depends on the size of dataset and length of the query.Keywords: Genetic Algorithm, Information Retrieval, Indonesian language document, Mean Average Precision, Relevance Feedback 

scholarly journals An Improved Hybrid Genetic Algorithm with a New Local Search Procedure

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Wen Wan ◽  
Jeffrey B. Birch
Keyword(s):  
Genetic Algorithm ◽  
Local Search ◽  
Hybrid Genetic Algorithm ◽  
Optimal Solution ◽  
Global Optimum ◽  
Good Choice ◽  
Fine Tuning ◽  
Learning Procedure ◽  
Local Search Procedure ◽  
Important Challenge

One important challenge of a hybrid genetic algorithm (HGA) (also called memetic algorithm) is the tradeoff between global and local searching (LS) as it is the case that the cost of an LS can be rather high. This paper proposes a novel, simplified, and efficient HGA with a new individual learning procedure that performs a LS only when the best offspring (solution) in the offspring population is also the best in the current parent population. Additionally, a new LS method is developed based on a three-directional search (TD), which is derivative-free and self-adaptive. The new HGA with two different LS methods (the TD and Neld-Mead simplex) is compared with a traditional HGA. Four benchmark functions are employed to illustrate the improvement of the proposed method with the new learning procedure. The results show that the new HGA greatly reduces the number of function evaluations and converges much faster to the global optimum than a traditional HGA. The TD local search method is a good choice in helping to locate a global “mountain” (or “valley”) but may not perform the Nelder-Mead method in the final fine tuning toward the optimal solution.

scholarly journals Optimal Solutions of Multiproduct Batch Chemical Process Using Multiobjective Genetic Algorithm with Expert Decision System

2009 ◽  
Vol 2009 ◽  
pp. 1-9 ◽  
Author(s):  
Diab Mokeddem ◽  
Abdelhafid Khellaf
Keyword(s):  
Genetic Algorithm ◽  
Decision Maker ◽  
Optimization Problem ◽  
Optimal Solution ◽  
Solution Space ◽  
Fine Tuning ◽  
Plant Design ◽  
Optimal Solutions ◽  
Nsga Ii ◽  
Promethee Ii

Optimal design problem are widely known by their multiple performance measures that are often competing with each other. In this paper, an optimal multiproduct batch chemical plant design is presented. The design is firstly formulated as a multiobjective optimization problem, to be solved using the well suited non dominating sorting genetic algorithm (NSGA-II). The NSGA-II have capability to achieve fine tuning of variables in determining a set of non dominating solutions distributed along the Pareto front in a single run of the algorithm. The NSGA-II ability to identify a set of optimal solutions provides the decision-maker DM with a complete picture of the optimal solution space to gain better and appropriate choices. Then an outranking with PROMETHEE II helps the decision-maker to finalize the selection of a best compromise. The effectiveness of NSGA-II method with multiojective optimization problem is illustrated through two carefully referenced examples.

scholarly journals PENJADWALAN MATA KULIAH MENGGUNAKAN ALGORITMA GENETIKA DI STT WASTUKANCANA PURWAKARTA

2018 ◽  
Vol 8 (2) ◽  
Author(s):  
Umar Hasan ◽  
Teguh Iman Hermanto ◽  
M. Rafi Muttaqin
Keyword(s):  
Genetic Algorithm ◽  
Optimal Schedule ◽  
Optimal Solution ◽  
Selection Method ◽  
Mutation Probability ◽  
Crossover Probability ◽  
Primary Key ◽  
Room Service ◽  
Crossover Method

Generating a study at STT Wastukancana Purwakarta is strongly important to get an effective way to study. As the allocation of rooms to the schedule made is still manual, it is possible there are some room service clashes. To solve that problem, a study scheduling using computerization is needed in order to make no clash of room service. The use of genetic algorithm to solve the problem is able to get the optimal solution in generating the schedule with chromosome representative as an integer from each of data primary key, the beginning of population initialization, the selection with rank-selection method, two-points crossover method, and mutation. From the test, the result points out that the optimal schedule with 416 pengampu data is generated when a number of population are 30, a number of generations are 150, the crossover probability value (Pc) is 0.4, and the mutation probability value (Pm) is 0.37.

scholarly journals Inclusion of Hydraulic Controls in Rehabilitation Models of Drainage Networks to Control Floods

Water ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 514
Author(s):  
Leonardo Bayas-Jiménez ◽  
F. Javier Martínez-Solano ◽  
Pedro L. Iglesias-Rey ◽  
Daniel Mora-Melia ◽  
Vicente S. Fuertes-Miquel
Keyword(s):  
Genetic Algorithm ◽  
Drainage System ◽  
Optimal Solution ◽  
Hydraulic Control ◽  
Drainage Systems ◽  
Storm Water Management Model ◽  
Drainage Networks ◽  
Extreme Rain ◽  
Rain Events ◽  
The Cost

A problem for drainage systems managers is the increase in extreme rain events that are increasing in various parts of the world. Their occurrence produces hydraulic overload in the drainage system and consequently floods. Adapting the existing infrastructure to be able to receive extreme rains without generating consequences for cities’ inhabitants has become a necessity. This research shows a new way to improve drainage systems with minimal investment costs, using for this purpose a novel methodology that considers the inclusion of hydraulic control elements in the network, the installation of storm tanks and the replacement of pipes. The presented methodology uses the Storm Water Management Model for the hydraulic analysis of the network and a modified Genetic Algorithm to optimize the network. In this algorithm, called the Pseudo-Genetic Algorithm, the coding of the chromosomes is integral and has been used in previous studies of hydraulic optimization. This work evaluates the cost of the required infrastructure and the damage caused by floods to find the optimal solution. The main conclusion of this study is that the inclusion of hydraulic controls can reduce the cost of network rehabilitation and decrease flood levels.

scholarly journals Business E-NeGotiAtion: A Method Using a Genetic Algorithm for Online Dispute Resolution in B2B Relationships

2021 ◽  
Vol 16 (5) ◽  
pp. 1186-1216
Author(s):  
Nikola Simkova ◽  
Zdenek Smutny
Keyword(s):  
Genetic Algorithm ◽  
Dispute Resolution ◽  
Single Case ◽  
Computer Mediated Communication ◽  
Optimal Solution ◽  
Mediated Communication ◽  
Online Dispute Resolution ◽  
B2b Relationships ◽  
Definition Of ◽  
E Mail

An opportunity to resolve disputes as an out-of-court settlement through computer-mediated communication is usually easier, faster, and cheaper than filing an action in court. Artificial intelligence and law (AI & Law) research has gained importance in this area. The article presents a design of the E-NeGotiAtion method for assisted negotiation in business to business (B2B) relationships, which uses a genetic algorithm for selecting the most appropriate solution(s). The aim of the article is to present how the method is designed and contribute to knowledge on online dispute resolution (ODR) with a focus on B2B relationships. The evaluation of the method consisted of an embedded single-case study, where participants from two countries simulated the realities of negotiation between companies. For comparison, traditional negotiation via e-mail was also conducted. The evaluation confirms that the proposed E-NeGotiAtion method quickly achieves solution(s), approaching the optimal solution on which both sides can decide, and also very importantly, confirms that the method facilitates negotiation with the partner and creates a trusted result. The evaluation demonstrates that the proposed method is economically efficient for parties of the dispute compared to negotiation via e-mail. For a more complicated task with five or more products, the E-NeGotiAtion method is significantly more suitable than negotiation via e-mail for achieving a resolution that favors one side or the other as little as possible. In conclusion, it can be said that the proposed method fulfills the definition of the dual-task of ODR—it resolves disputes and builds confidence.

scholarly journals Carbon Emission Reduction of Apparel Material Distribution Based on Multi-Objective Genetic Algorithm (NSGA-II)

2019 ◽  
Vol 11 (9) ◽  
pp. 2571
Author(s):  
Xujing Zhang ◽  
Lichuan Wang ◽  
Yan Chen
Keyword(s):  
Genetic Algorithm ◽  
Carbon Emissions ◽  
Optimal Solution ◽  
Material Distribution ◽  
Low Carbon ◽  
Nsga Ii ◽  
Management Objectives ◽  
Multi Objective Genetic Algorithm ◽  
Distribution Process ◽  
The Cost

Low-carbon production has become one of the top management objectives for every industry. In garment manufacturing, the material distribution process always generates high carbon emissions. In order to reduce carbon emissions and the number of operators to meet enterprises’ requirements to control the cost of production and protect the environment, the paths of material distribution were analyzed to find the optimal solution. In this paper, the model of material distribution to obtain minimum carbon emissions and vehicles (operators) was established to optimize the multi-target management in three different production lines (multi-line, U-shape two-line, and U-shape three-line), while the workstations were organized in three ways: in the order of processes, in the type of machines, and in the components of garment. The NSGA-II algorithm (non-dominated sorting genetic algorithm-II) was applied to obtain the results of this model. The feasibility of the model and algorithm was verified by the practice of men’s shirts manufacture. It could be found that material distribution of multi-line layout produced the least carbon emissions when the machines were arranged in the group of type.

Grid Resource Allocation with Genetic Algorithm Using Population Based on Multisets

2017 ◽  
Vol 26 (1) ◽  
pp. 169-184 ◽  
Author(s):  
Absalom E. Ezugwu ◽  
Nneoma A. Okoroafor ◽  
Seyed M. Buhari ◽  
Marc E. Frincu ◽  
Sahalu B. Junaidu
Keyword(s):  
Genetic Algorithm ◽  
Resource Allocation ◽  
Grid Computing ◽  
Resource Selection ◽  
Computing System ◽  
Population Based ◽  
Fine Tuning ◽  
Grid Resource ◽  
Performance Results ◽  
Grid Resources

AbstractThe operational efficacy of the grid computing system depends mainly on the proper management of grid resources to carry out the various jobs that users send to the grid. The paper explores an alternative way of efficiently searching, matching, and allocating distributed grid resources to jobs in such a way that the resource demand of each grid user job is met. A proposal of resource selection method that is based on the concept of genetic algorithm (GA) using populations based on multisets is made. Furthermore, the paper presents a hybrid GA-based scheduling framework that efficiently searches for the best available resources for user jobs in a typical grid computing environment. For the proposed resource allocation method, additional mechanisms (populations based on multiset and adaptive matching) are introduced into the GA components to enhance their search capability in a large problem space. Empirical study is presented in order to demonstrate the importance of operator improvement on traditional GA. The preliminary performance results show that the proposed introduction of an additional operator fine-tuning is efficient in both speed and accuracy and can keep up with high job arrival rates.

scholarly journals Service Composition in IoT using Genetic algorithm and Particle swarm optimization

2020 ◽  
Vol 10 (1) ◽  
pp. 56-64 ◽  
Author(s):  
Neeti Kashyap ◽  
A. Charan Kumari ◽  
Rita Chhikara
Keyword(s):  
Genetic Algorithm ◽  
Quality Of Service ◽  
Particle Swarm Optimization ◽  
Service Composition ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Critical Issue ◽  
Swarm Optimization

AbstractWeb service compositions are commendable in structuring innovative applications for different Internet-based business solutions. The existing services can be reused by the other applications via the web. Due to the availability of services that can serve similar functionality, suitable Service Composition (SC) is required. There is a set of candidates for each service in SC from which a suitable candidate service is picked based on certain criteria. Quality of service (QoS) is one of the criteria to select the appropriate service. A standout amongst the most important functionality presented by services in the Internet of Things (IoT) based system is the dynamic composability. In this paper, two of the metaheuristic algorithms namely Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are utilized to tackle QoS based service composition issues. QoS has turned into a critical issue in the management of web services because of the immense number of services that furnish similar functionality yet with various characteristics. Quality of service in service composition comprises of different non-functional factors, for example, service cost, execution time, availability, throughput, and reliability. Choosing appropriate SC for IoT based applications in order to optimize the QoS parameters with the fulfillment of user’s necessities has turned into a critical issue that is addressed in this paper. To obtain results via simulation, the PSO algorithm is used to solve the SC problem in IoT. This is further assessed and contrasted with GA. Experimental results demonstrate that GA can enhance the proficiency of solutions for SC problem in IoT. It can also help in identifying the optimal solution and also shows preferable outcomes over PSO.

Sign in / Sign up

Export Citation Format

Share Document