University Timetabling using Genetic Algorithm

The field of automated timetabling and scheduling meeting all the requirementsthat we call constraints is always difficult task and already proved as NPComplete. The idea behind my research is to implement Genetic Algorithm ongeneral scheduling problem under predefined constraints and check the validityof results, and then I will explain the possible usage of other approaches likeexpert systems, direct heuristics, network flows, simulated annealing and someother approaches. It is observed that Genetic Algorithm is good solutiontechnique for solving such problems. The program written in C++ and analysisis done with using various tools explained in details later.

Extended local labor markets due to high speed trains : Visualization of estimations in the Swedish national travel demand forecasting tool, SAMPERS

Wider economic benefits resulting from extended geographical mobility is one argument for investments in high-speed rail. More specifically, the argument for high-speed trains in Sweden has been that they can help to further spatially extend labor market regions which in turn has a positive effect on growth and development. In this paper the aim is to cartographically visualize the potential size of the labor markets in areas that could be affected by possible future high-speed trains. The visualization is based on the forecasts of labor mobility with public transport made by the Swedish national mobility transport forecasting tool, SAMPERS, for two alternative high-speed rail scenarios. The analysis, not surprisingly, suggests that the largest impact of high-speed trains results in the area where the future high speed rail tracks are planned to be built. This expected effect on local labor market regions of high-speed trains could mean that possible regional economic development effects also are to be expected in this area. However, the results, in general, from the SAMPERS forecasts indicaterelatively small increases in local labor market potentials.

Evidence Algorithm and Processing Formalized Mathematical Texts

The goal of a research programme Evidence Algorithm is a development of an open system of automated proving that is able to accumulate mathematical knowledge and to prove theorems in a context of a self-contained mathematical text. By now, the first version of such a system called a System for Automated Deduction, SAD, is implemented in software. The system SAD possesses the following main features: mathematical texts are formalized using a specific formal language that is close to a natural language of mathematical publications; a proof search is based on special sequent-type calculi formalizing natural reasoning style, such as application of definitions and auxiliary propositions. These calculi also admit a separation of equality handling from deduction that gives an opportunity to integrate logical reasoning with symbolic calculation.