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.

An Effective Exact Algorithm for One Particular Case of the Travelling-Salesman Problem

The article presents the exact algorithm for solving one case of the job-scheduling problem for the case when the source matrix is ordered by rows.

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.

Mathematical Optimization for the Train Timetabling Problem

AMS Subj. Classification: 90C57; 90C10;

On Solving the Maximum Betweenness Problem Using Genetic Algorithms

In this paper a genetic algorithm (GA) is applied on Maximum Betweennes Problem (MBP). The maximum of the objective function is obtained by finding a permutation which satisfies a maximal number of betweenness constraints. Every permutation considered is genetically coded with an integer representation. Standard operators are used in the GA. Instances in the experimental results are randomly generated. For smaller dimensions, optimal solutions of MBP are obtained by total enumeration. For those instances, the GA reached all optimal solutions except one. The GA also obtained results for larger instances of up to 50 elements and 1000 triples. The running time of execution and finding optimal results is quite short.

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.

Multiple Dipole Source Models for Scalp-Recorded Event-Related Potentials: Example from Complex Visual Processing in the Human Brain

2000 Mathematics Subject Classification: 62P10, 92C20

A solution of the trigonometric moment problem via Tagamlitzki's "Theorem of the Cones"

In 1952 Y. Tagamlitzki gave an elegant proof of the classical Bochner’s theorem on the positively definite functions. Unfortunately, he never published his proof. In this paper we consider a related but simpler problem, the trigonometric moment problem, by using Tagamlitzki’s approach.

On an ODE Relevant for the General Theory of the Hyperbolic Cauchy Problem

2000 Mathematics Subject Classification: 34E20, 35L80, 35L15.

Cauchy-Type Problem for Diffusion-Wave Equation with the Riemann-Liouville Partial Derivative

2000 Mathematics Subject Classification: 35A15, 44A15, 26A33