TABU PROGRAMMING: A NEW PROBLEM SOLVER THROUGH ADAPTIVE MEMORY PROGRAMMING OVER TREE DATA STRUCTURES

2011 ◽  
Vol 10 (02) ◽  
pp. 373-406 ◽  
Author(s):  
ABDEL-RAHMAN HEDAR ◽  
EMAD MABROUK ◽  
MASAO FUKUSHIMA
Keyword(s):  
Search Algorithm ◽  
Benchmark Problems ◽  
Problem Solver ◽  
Learning Tools ◽  
Mutation Operators ◽  
Tree Data ◽  
Tree Data Structure ◽  
Comprehensive Framework ◽  
Rate Of Success ◽  
Crossover And Mutation

Since the first appearance of the Genetic Programming (GP) algorithm, extensive theoretical and application studies on it have been conducted. Nowadays, the GP algorithm is considered one of the most important tools in Artificial Intelligence (AI). Nevertheless, several questions have been raised about the complexity of the GP algorithm and the disruption effect of the crossover and mutation operators. In this paper, the Tabu Programming (TP) algorithm is proposed to employ the search strategy of the classical Tabu Search algorithm with the tree data structure. Moreover, the TP algorithm exploits a set of local search procedures over a tree space in order to mitigate the drawbacks of the crossover and mutation operators. Extensive numerical experiments are performed to study the performance of the proposed algorithm for a set of benchmark problems. The results of those experiments show that the TP algorithm compares favorably to recent versions of the GP algorithm in terms of computational efforts and the rate of success. Finally, we present a comprehensive framework called Meta-Heuristics Programming (MHP) as general machine learning tools.

The Effect of Crossover and Mutation Operators on Genetic Algorithm for Job Shop Scheduling Problem

2012 ◽  
Vol 542-543 ◽  
pp. 1251-1259
Author(s):  
Long Xu ◽  
Wen Bin Hu
Keyword(s):  
Genetic Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Benchmark Problems ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Mutation Operators ◽  
Scheduling Plan ◽  
Crossover And Mutation

Job Shop Scheduling Problem (JSSP) is a famous NP-hard problem in scheduling field. The concentration of JSSP is to find a feasible scheduling plan to figure out the earliest completion time under machine and processing sequence constraints. At present, genetic algorithm has been widely adopted in varies of operation research problems including JSSP, and good performance have been achieved. However, few work have stress the selection of varies operators when implemented for JSSP. Using benchmark problems, this paper compares the effect of crossover and mutation operators on genetic algorithm for JSSP.

scholarly journals Conjugate Schema and Basis Representation of Crossover and Mutation Operators

1998 ◽  
Vol 6 (2) ◽  
pp. 129-160 ◽  
Author(s):  
Sanza T. Kazadi
Keyword(s):  
Search Algorithm ◽  
Canonical Basis ◽  
Search Algorithms ◽  
Test Suite ◽  
Original Function ◽  
Genetic Search ◽  
Mutation Operators ◽  
Crossover And Mutation ◽  
Mathematical Derivation ◽  
Mathematical Construct

In genetic search algorithms and optimization routines, the representation of the mutation and crossover operators are typically defaulted to the canonical basis. We show that this can be influential in the usefulness of the search algorithm. We then pose the question of how to find a basis for which the search algorithm is most useful. The conjugate schema is introduced as a general mathematical construct and is shown to separate a function into smaller dimensional functions whose sum is the original function. It is shown that conjugate schema, when used on a test suite of functions, improves the performance of the search algorithm on 10 out of 12 of these functions. Finally, a rigorous but abbreviated mathematical derivation is given in the appendices.

Finding Community of Brain Networks Based on Neighbor Index and DPSO with Dynamic Crossover

2020 ◽  
Vol 15 (4) ◽  
pp. 287-299
Author(s):  
Jie Zhang ◽  
Junhong Feng ◽  
Fang-Xiang Wu
Keyword(s):  
Brain Function ◽  
Brain Networks ◽  
Discrete Particle Swarm Optimization ◽  
Mri Brain ◽  
Mutation Operators ◽  
Neural Unit ◽  
Crossover And Mutation ◽  
The Brain ◽  
Index Table ◽  
Dynamic Crossover

Background: : The brain networks can provide us an effective way to analyze brain function and brain disease detection. In brain networks, there exist some import neural unit modules, which contain meaningful biological insights. Objective:: Therefore, we need to find the optimal neural unit modules effectively and efficiently. Method:: In this study, we propose a novel algorithm to find community modules of brain networks by combining Neighbor Index and Discrete Particle Swarm Optimization (DPSO) with dynamic crossover, abbreviated as NIDPSO. The differences between this study and the existing ones lie in that NIDPSO is proposed first to find community modules of brain networks, and dose not need to predefine and preestimate the number of communities in advance. Results: : We generate a neighbor index table to alleviate and eliminate ineffective searches and design a novel coding by which we can determine the community without computing the distances amongst vertices in brain networks. Furthermore, dynamic crossover and mutation operators are designed to modify NIDPSO so as to alleviate the drawback of premature convergence in DPSO. Conclusion: The numerical results performing on several resting-state functional MRI brain networks demonstrate that NIDPSO outperforms or is comparable with other competing methods in terms of modularity, coverage and conductance metrics.

Logical Structure for User Friendly dynamic Web Page Visualization for Small Screen Terminals Promoting E-Business

2020 ◽  
Vol 14 ◽  
Author(s):  
Shefali Singhal ◽  
Poonam Tanwar
Keyword(s):  
Logical Structure ◽  
Vital Role ◽  
Web Pages ◽  
Main Concern ◽  
Web Page ◽  
Large Screen ◽  
Tree Data ◽  
Tree Data Structure ◽  
User Friendly ◽  
Small Screen

Abstract:: Now-a-days when everything is going digitalized, internet and web plays a vital role in everyone’s life. When one has to ask something or has any online task to perform, one has to use internet to access relevant web-pages throughout. These web-pages are mainly designed for large screen terminals. But due to mobility, handy and economic reasons most of the persons are using small screen terminals (SST) like mobile phone, palmtop, pagers, tablet computers and many more. Reading a web page which is actually designed for large screen terminal on a small screen is time consuming and cumbersome task because there are many irrelevant content parts which are to be scrolled or there are advertisements, etc. Here main concern is e-business users. To overcome such issues the source code of a web page is organized in tree data-structure. In this paper we are arranging each and every main heading as a root node and all the content of this heading as a child node of the logical structure. Using this structure, we regenerate a web-page automatically according to SST size. Background:: DOM and VIPS algorithms are the main background techniques which are supporting the current research. Objective:: To restructure a web page in a more user friendly and content presenting format. Method Backtracking:: Method Backtracking: Results:: web page heading queue generation. Conclusion:: Concept of logical structure supports every SST.

scholarly journals A Modified Harmony Search Algorithm for Solving the Dynamic Vehicle Routing Problem with Time Windows

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Shifeng Chen ◽  
Rong Chen ◽  
Jian Gao
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Time Windows ◽  
Harmony Search ◽  
Population Diversity ◽  
Benchmark Problems ◽  
Dynamic Vehicle Routing ◽  
Dynamic Vehicle Routing Problem ◽  
Routing Problem

The Vehicle Routing Problem (VRP) is a classical combinatorial optimization problem. It is usually modelled in a static fashion; however, in practice, new requests by customers arrive after the initial workday plan is in progress. In this case, routes must be replanned dynamically. This paper investigates the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) in which customers’ requests either can be known at the beginning of working day or occur dynamically over time. We propose a hybrid heuristic algorithm that combines the harmony search (HS) algorithm and the Variable Neighbourhood Descent (VND) algorithm. It uses the HS to provide global exploration capabilities and uses the VND for its local search capability. In order to prevent premature convergence of the solution, we evaluate the population diversity by using entropy. Computational results on the Lackner benchmark problems show that the proposed algorithm is competitive with the best existing algorithms from the literature.

A Scalable Algorithm for Constructing Frequent Pattern Tree

2014 ◽  
Vol 10 (1) ◽  
pp. 42-56 ◽  
Author(s):  
Zailani Abdullah ◽  
Tutut Herawan ◽  
A. Noraziah ◽  
Mustafa Mat Deris
Keyword(s):  
Data Structure ◽  
Frequent Pattern ◽  
Frequent Patterns ◽  
Scalable Algorithm ◽  
Tree Construction ◽  
Frequent Pattern Tree ◽  
Support Threshold ◽  
Benchmark Datasets ◽  
Tree Data ◽  
Tree Data Structure

Frequent Pattern Tree (FP-Tree) is a compact data structure of representing frequent itemsets. The construction of FP-Tree is very important prior to frequent patterns mining. However, there have been too limited efforts specifically focused on constructing FP-Tree data structure beyond from its original database. In typical FP-Tree construction, besides the prior knowledge on support threshold, it also requires two database scans; first to build and sort the frequent patterns and second to build its prefix paths. Thus, twice database scanning is a key and major limitation in completing the construction of FP-Tree. Therefore, this paper suggests scalable Trie Transformation Technique Algorithm (T3A) to convert our predefined tree data structure, Disorder Support Trie Itemset (DOSTrieIT) into FP-Tree. Experiment results through two UCI benchmark datasets show that the proposed T3A generates FP-Tree up to 3 magnitudes faster than that the benchmarked FP-Growth.

Simulation of the Pressure-Bearing Capacity Test Model in Architectural Decoration Design

2014 ◽  
Vol 716-717 ◽  
pp. 391-394
Author(s):  
Li Mei Guo ◽  
Ai Min Xiao
Keyword(s):  
Genetic Algorithm ◽  
Bearing Capacity ◽  
Test Method ◽  
Test Model ◽  
Improved Genetic Algorithm ◽  
Good Convergence ◽  
Mutation Operators ◽  
Process Pressure ◽  
Calculation Process ◽  
Crossover And Mutation

in architectural decoration process, pressure-bearing capacity test is the foundation of design, and is very important. To this end, a pressure-bearing capacity test method in architectural decoration design is proposed based on improved genetic algorithm. The selection, crossover and mutation operators in genetic algorithm are improved respectively. Using its fast convergence characteristics eliminate the pressure movement in the calculation process. The abnormal area of pressure-bearing existed in buildings which can ensure to be tested is added, to obtain accurate distribution information of the abnormal area of pressure-bearing. Simulation results show that the improved genetic algorithm has good convergence, can accurately test the pressure-bearing capacity in architectural decoration.

Sign in / Sign up

Export Citation Format

Share Document