Benchmark problems

The proposed algorithm utilizes the migration method to identify local extremes and then relocates the population to explore new solution spaces for further evolution. The MIMEM algorithm is evaluated on the iMOPSE benchmark dataset, and the results demonstrate that it outperforms.

8p visystrom 22-11-2023 8 3   Download

This makes comparing the performance among different methods and developing solutions for various problems challenging. To address this issue, we have constructed two standardized datasets of thyroid scintigraphy images for identifying and quantifying the depth. The purpose of designing the models is to establish a benchmark assessment for developing CADx models on the datasets in the future.

8p viwarmachine 01-07-2023 6 2   Download

The Virtual Environment for Reactor Applications (VERA) core physics benchmark problem #6, 3D Hot Full Power (HFP) assembly, from the Consortium for Advanced Simulation of Light Water Reactors (CASL) was simulated using the MC21 continuous energy Monte Carlo code coupled with the COBRA-IE subchannel thermal-hydraulics code using the R5EXEC coupling framework.

14p vironald 15-12-2022 7 4   Download

In assessing whether nuclear plant components such as T-Junctions are likely to suffer thermal fatigue problems in service, CFD techniques need to provide accurate predictions for wall temperature fluctuations.

12p vironald 15-12-2022 6 3   Download

Childhood behavioural problems are the most common mental health disorder worldwide and represent a major public health concern, particularly in socially disadvantaged communities. Treatment barriers mean that up to 70% of children do not receive recommended parenting interventions.

10p viferrari 28-11-2022 9 2   Download

Rotary Inverted Pendulum (RIP) is a non-linear system that is considered a benchmark in control theory problem. It represents a broader class of under-actuated systems. Rotary inverted pendulum is a complex system, widely studied in many areas due to its complexity, nonlinearities and nonminimum-phase system. In this work, the authors implement the inputoutput feedback linearization techniques (IOFL) for the control of rotary inverted pendulum.

10p visherylsandber 28-06-2022 16 4   Download

In this work, discrete dynamic optimization problems (DOPs) are theoretically analysed according to the modifications produced in the fitness landscape during the optimization process.

23p guernsey 28-12-2021 7 0   Download

The proposed methods are experimentally compared with the state-of-the-art greedy algorithms for solving the OBOP by using a large benchmark of real-world databases. Furthermore, we provide a complete statistical analysis of the experimental study, which shows that several of the proposed algorithms outperform the current state-of-the-art greedy algorithms.

28p guernsey 28-12-2021 10 0   Download

The performance of BPLSH is benchmarked against four approaches on different classification problems. The experimental results indicate that BPLSH outperforms the other methods in terms of classification accuracy, preservation rate, and execution time.

20p guernsey 28-12-2021 11 0   Download

Local optimization agents are used to ¯nd solutions for the local projects, and global optimization agents are responsible for the coordination of the local projects and for ¯nding the global solutions. The approach has been tested experimentally using 140 benchmark problem instances from MPSPLIB library with minimizing the Average Project Delay (APD) as global optimization criterion.

15p redemption 20-12-2021 8 0   Download

This paper deals with the Traveling Salesman Problem with Multi-Visit Drone (TSPMVD) in which a truck works in collaboration with a drone that can serve up to q ≥ 1 customers consecutively during each sortie. We propose a Mixed Integer Linear Programming (MILP) formulation and a metaheuristic based on Iterated Local Search (ILS) to solve the problem. Benchmark instances collected from the literature of the special case with q = 1 are used to test the performance of our algorithms.

29p spiritedaway36 25-11-2021 9 2   Download

Dictionary learning (DL) for sparse coding has been widely applied in the field of computer vision. Many DL approaches have been developed recently to solve pattern classification problems and have achieved promising performance. In this paper, to improve the discriminability of the popular dictionary pair learning (DPL) algorithm, we propose a new method called discriminative dictionary pair learning (DDPL) for image classification.

17p nguaconbaynhay11 07-04-2021 10 1   Download

In this paper, a new hybrid meta-heuristic algorithm for FCP called BHHS which combines the power of existing meta-heuristic frameworks such as Black Hole and Harmony Search is proposed. These two algorithms cooperate and support each other. The Black Hole part of the algorithm has the goal to find good candidate solution while the Harmony Search part has the goal to generate new candidate solutions for Black Hole when the event horizon of the Black Hole occurs. In addition, new best solutions of these two components are exchanged with each other to improve the quality of the search.

7p chauchaungayxua11 23-03-2021 15 1   Download

Many problems in bioinformatics involve classification based on features such as sequence, structure or morphology. Given multiple classifiers, two crucial questions arise: how does their performance compare, and how can they best be combined to produce a better classifier? A classifier can be evaluated in terms of sensitivity and specificity using benchmark, or gold standard, data, that is, data for which the true classification is known.

11p viwyoming2711 16-12-2020 11 0   Download

The Multi-stripe Travelling Salesman Problem (Ms-TSP) is an extension of the Travelling Salesman Problem (TSP). In the q-stripe TSP with q ≥ 1, the objective function sums the costs for traveling from one vertex to each of the next q vertices along the tour. To solve medium to large-sized instances, a metaheuristic approach is proposed. The proposed method has two main components, which are construction and improvement phases. The construction phase generates an initial solution using the Greedy Randomized Adaptive Search Procedure (GRASP).

18p nguathienthan9 08-12-2020 13 2   Download

In this paper, we present a novel global protein-protein interaction network alignment algorithm, which is enhanced with an extended large neighborhood search heuristics. Evaluated on benchmark datasets of yeast, fly, human and worm, the proposed algorithm outperforms state-of-the-art algorithms. Furthermore, the complexity of ours is polynomial, thus being scalable to large biological networks in practice.

11p tamynhan4 06-09-2020 13 3   Download

The proposed algorithm is tested on 76 unconstrained benchmark functions with different characteristics and the performance of the algorithm is compared with that of other well known optimization algorithms. A statistical test is also performed to investigate the results obtained using different algorithms. The results have proved the effectiveness of the proposed elitist TLBO algorithm.

22p toritori 11-05-2020 13 1   Download

The factual train schedule is based on the modified train speeds and on the modified departure times of the trains. The experimental running of the DR-algorithm on the benchmark instances showed this algorithm can solve train scheduling problems in a close to optimal way. In particular, the total train tardiness was reduced about 20% due to controlling train speeds and the departure times of the trains.

14p toritori 11-05-2020 16 1   Download

In this paper, a revised version of the discrete particle swarm optimization algorithm is proposed for solving Quadratic Assignment Problems (QAP). Instead of using the general velocity and position update procedures in particle swarm optimization algorithms, four different possible positions are found out for each particle and the best among them is accepted as the updated position.

18p toritori 11-05-2020 10 0   Download

The proposed approach is based on a modified genetic algorithm, which generates an initial population with heuristic solutions obtained from the well-known (LKH) heuristic algorithm for the TSP together with the solution of a mathematical model for the shortest path problem. In addition, two recombination methods and a mutation operator are considered. Computational experiments on benchmark instances show that the proposed algorithm can obtain high-quality solutions within short computing times.

18p toritori 11-05-2020 17 0   Download