This research is concerning mathematical modeling of the practical problems from the following fields of applied mathematics: Scheduling, Discrete and continuos location; Hub location; Optimization on networks and graphs; Data mining; Clustering; Bioinformatics; Geoinformation Sciences, etc. These models are specific and there is not a general model that is appropriate for all potential or existing applications. The studied models are often extremely difficult to solve, at least optimally. Therefore, the second important area of our research is directed to developing metaheuristic solution methods for solving NP-hard combinatorial and global optimization problems, their computer implementation and their testing on real word or benchmark data from the literature. Research would include the following modern meta-heuristic methods: Variable neighborhood search; Genetic and Evolutionary algorithms; Neural networks; Tabu search; etc. Significant part of this research will be hybridization of the mentioned meta-heuristics, combining with exact methods, parallelization and executing on a multi-processor systems. By using these approaches we will attempt to solve large-scale problem instances for which no solution is known up to now.
The basic subject of our project is developing methods for solving NP-hard Combinatorial and Global Optimization problems that could be used in industry, in public sector, etc. The first topic would be a heuristic approach since exact methods are not able to solve the most of real word problems. For some combinatorial problems we would also develop exact methods in order to check the solution quality of our new heuristics. Moreover, we would try to solve exactly larger instances than previously treated in the literature. In more detail, the context of our research would include the following:
The problems that belong to Multi-criteria or multi-attribute decision models we would treat in more details are:
1) New approaches in Data envelopment analysis;
2) Fuzzy multicriteria approach in ranking strategies in production/distribution system;
3) Optimal control in traffic and transportation;
4) Optimization in public sector (garbage collection, arc routing, post delivery, supply chain management);
5) Optimization of telecommunication and computer networks.
The other optimization problem we would pay attention are:
1) Location theory;
2) Oil pipeline design problem;
3) Bioinformatics, disordered proteins and function;
4) Data reduction for spatial-temporal knowledge discovery.
After the mathematical model of some real problem has been formed, the class including that model is recognized and the existing methods are analyzed or some new are proposed. The next phase is implementation these methods on computers, and then testing by using instances from literature or real problem data. As different problems might have the same mathematical models, it follows that problems are classified according to their mathematical characteristics (linear, nonlinear, convex, global, continual, discrete, combinatorial, etc). On the other side, the models could be classified by the field of applying (location, optimization of public sectors, saving in electrical power, hydroeconomy, traffic, transportation, military sciences, and so on). Finally the result of our research should be software directed to some combinatorial or global optimization. The results of this project could be offerring direct services to the domestic and foreign market and applying the developed softwares for solving many practical problems.
The research goal of our project includes: