Genetic Algorithm Approach for Solving the Task Assignment Problem

This research was partially supported by the Serbian Ministry of Science and Ecology under project 144007. The authors are grateful to Ivana Ljubić for help in testing and to Vladimir Filipović for useful suggestions and comments.

On the Isoenergetical Non-Degeneracy of the Problem of two Centers of Gravitation

* Partialy supported by contract MM 523/95 with Ministry of Science and Technologies of Republic of Bulgaria.

Active Monitoring and Decision Making Problem

Active monitoring and problem of non-stable of sound signal parameters in the regime of piling up response signal of environment is under consideration. Math model of testing object by set of weak stationary dynamic actions is offered. The response of structures to the set of signals is under processing for getting important information about object condition in high frequency band. Making decision procedure by using researcher’s heuristic and aprioristic knowledge is discussed as well. As an example the result of numerical solution is given.

Signal Processing under Active Monitoring

This paper describes a method of signal preprocessing under active monitoring. Suppose we want to solve the inverse problem of getting the response of a medium to one powerful signal, which is equivalent to obtaining the transmission function of the medium, but do not have an opportunity to conduct such an experiment (it might be too expensive or harmful for the environment). Practically the problem can be reduced to obtaining the transmission function of the medium. In this case we can conduct a series of experiments of relatively low power and superpose the response signals. However, this method is conjugated with considerable loss of information (especially in the high frequency domain) due to fluctuations of the phase, the frequency and the starting time of each individual experiment. The preprocessing technique presented in this paper allows us to substantially restore the response of the medium and consequently to find a better estimate for the transmission function. This technique is based on expanding the initial signal into the system of orthogonal functions.

Some Fractional Extensions of the Temperature Field Problem in Oil Strata

This survey is devoted to some fractional extensions of the incomplete lumped formulation, the lumped formulation and the formulation of Lauwerier of the temperature field problem in oil strata. The method of integral transforms is used to solve the corresponding boundary value problems for the fractional heat equation. By using Caputo’s differintegration operator and the Laplace transform, new integral forms of the solutions are obtained. In each of the different cases the integrands are expressed in terms of a convolution of two special functions of Wright’s type.

Solving the Task Assignment Problem with a Variable Neighborhood Search

In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem. The computational results are presented for the instances from the literature, and compared to optimal solutions obtained by the CPLEX solver and heuristic solutions generated by the genetic algorithm. It can be seen that the proposed VNS approach reaches all optimal solutions in a quite short amount of computational time.

An Electromagnetism Metaheuristic for the Uncapacitated Multiple Allocation Hub Location Problem

In this article, the results achieved by applying an electromagnetism (EM) inspired metaheuristic to the uncapacitated multiple allocation hub location problem (UMAHLP) are discussed. An appropriate objective function which natively conform with the problem, 1-swap local search and scaling technique conduce to good overall performance.Computational tests demonstrate the reliability of this method, since the EM-inspired metaheuristic reaches all optimal/best known solutions for UMAHLP, except one, in a reasonable time.

On the Quotient Function Employed in the Blind Source Separation Problem

MSC 2010: 42C40, 94A12

The Darboux Problem for a Class of 3-D Weakly Hyperbolic Equations

Недю Попиванов, Цветан Христов - Изследвани са някои тримерни аналози на задачата на Дарбу в равнината. През 1952 М. Протер формулира нови тримерни гранични задачи както за клас слабо хиперболични уравнения, така и за някои хиперболично-елиптични уравнения. За разлика от коректността на двумерната задача на Дарбу, новите задачи са некоректни. За слабо хиперболични уравнения, съдържащи младши членове, ние намираме достатъчни условия както за съществуване и единственост на обобщени решения с изолирана степенна особеност, така и за единственост на квази-регулярни решения на задачата на Протер.

Singular Solutions of Protter’s Problem for a Class of 3-D Hyperbolic Equations

Недю Иванов Попиванов, Алексей Йорданов Николов - През 1952 г. М. Протър формулира нови гранични задачи за вълновото уравнение, които са тримерни аналози на задачите на Дарбу в равнината. Задачите са разгледани в тримерна област, ограничена от две характеристични конуса и равнина. Сега, след като са минали повече от 50 години, е добре известно, че за безброй гладки функции в дясната страна на уравнението тези задачи нямат класически решения, а обобщеното решение има силна степенна особеност във върха на характеристичния конус, която е изолирана и не се разпространява по конуса. Тук ние разглеждаме трета гранична задача за вълновото уравнение с младши членове и дясна страна във формата на тригонометричен полином. Дадена е по-нова от досега известната априорна оценка за максимално възможната особеност на решенията на тази задача. Оказва се, че при по-общото уравнение с младши членове възможната сингулярност е от същия ред като при чисто вълновото уравнение.

A Mixed Integer Quadratic Programming Model for the Low Autocorrelation Binary Sequence Problem

In this paper the low autocorrelation binary sequence problem (LABSP) is modeled as a mixed integer quadratic programming (MIQP) problem and proof of the model’s validity is given. Since the MIQP model is semidefinite, general optimization solvers can be used, and converge in a finite number of iterations. The experimental results show that IQP solvers, based on this MIQP formulation, are capable of optimally solving general/skew-symmetric LABSP instances of up to 30/51 elements in a moderate time. ACM Computing Classification System (1998): G.1.6, I.2.8.

A Fast Algorithm for Weber Problem on a Grid

AMS subject classification: 90B80.

Monte Carlo Study of Particle Transport Problem in Air Pollution

2002 Mathematics Subject Classification: 65C05.

Optimization Problem in a Class of Linear System. Application to Multiple Drug Administration

2000 Mathematics Subject Classification: 62H15, 62P10.

Optimum Chemical Balance Weighing Design under Certain Condition

2000 Mathematics Subject Classification: 62K05, 05B05.