For multi-objective optimization in the QoS routing, this paper combines the artificial fish swarm algorithm and ant colony algorithm and tabu search algorithm, proposes a new improved algorithm, and delves into the application of solving the QoS routing. One main work in this paper is to put forward a mixed algorithm integrating artificial fish swarm and ant colony. Firstly, we randomly genera...

This paper presents an intelligent approach to identify parameters of single-phase induction motors. Because of the complication of space-phasor equations describing its dynamic behaviors, the parameters of single-phase induction motors could be roughly estimated via conventional tests based on the steady-state analysis. Therefore, they may cause inaccurate estimation. In this paper, some effic...

The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptive Tabu Search–ATS), which is aimed at minimizing violations of soft constraints. Within ATS, a new neighborhood and a mechanism for dynamically integrating Tabu Search with perturbation (from Iterated Local Search) are proposed ...

First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...

A memetic algorithm (MA), i.e. an evolutionary algorithm making use of local search, for the quadratic assignment problem is presented. A new recombination operator for realizing the approach is described, and the behavior of the MA is investigated on a set of problem instances containing between 25 and 100 facilities/locations. The results indicate that the proposed MA is able to produce high ...

This paper deals with the strongly NP-hard minmax regret version of the minimum spanning tree problem with interval costs. The best known exact algorithms solve the problem in reasonable time for rather small graphs. In this paper an algorithm based on the idea of tabu search is constructed. Some properties of the local minima are shown. Exhaustive computational tests for various classes of gra...

Determining amino acid sequences of protein molecules is one of the most important issues in molecular biology. These sequences determine protein structure and functionality. Unfortunately, direct biochemical methods for reading amino acid sequences can be used for reading short sequences only. This is the reason, which makes peptide assembly algorithms an important complement of these methods....