Russian Arctic Ports : Problems with the development and management of tourist flows

The potential changes to the territory of the Russian Arctic open up unique possibilities for the development of tourism. More favourable transport opportunities along the Northern Sea Route (NSR) create opportunities for tourism development based on the utilisation of the extensive areas of sea shores and river basins. A major challenge for the Russian Arctic sea and river ports is their strong cargo transport orientation originated by natural resource extraction industries. A careful assessment of the prospects of current and future tourism development is presented here based on the development of regions located along the shores of the Arctic ocean (including Murmansk and Arkhangelsk oblast, Nenets Autonomous okrug (AO), Yamal-Nenets AO, Taymyr AO, Republic of Sakha, Chykotsky AO). An evaluation of the present development of tourism in maritime cities suggests that a considerable qualitative and quantitative increase of tourism activities organised by domestic tourism firms is made virtually impossible. There are several factors contributing to this. The previously established Soviet system of state support for the investments into the port facilities as well as the sea fleet were not effectively replaced by creation of new structures. The necessary investments for reconstruction could be contributed by the federal government but the priorities are not set towards the increased passenger transportation. Having in mind, increased environmental pressures in this highly sensitive area it is especially vital to establish a well-functioning monitoring and rescue system in the situation of ever increasing risks which come not only from the increased transports along the NSR, but also from the exploitation of the offshore oil and gas reserves in the Arctic seas. The capacity and knowledge established in Nordic countries (Norway, Finland) concerning cruise tourism should not be underestimated and the already functioning cooperation in Barents Region should expand towards this particular segment of the tourism industry. The current stage of economic development in Russia makes it clear that tourism development is not able to compete with the well-needed increase in the cargo transportation, which means that Russia’s fleet is going to be utilised by other industries. However, opening up this area to both local and international visitors could contribute to the economic prosperity of these remote areas and if carefully managed could sustain already existing maritime cities along the shores of the Arctic Ocean.

Statistical bound of genetic solutions to quadratic assignment problems

Quadratic assignment problems (QAPs) are commonly solved by heuristic methods, where the optimum is sought iteratively. Heuristics are known to provide good solutions but the quality of the solutions, i.e., the confidence interval of the solution is unknown. This paper uses statistical optimum estimation techniques (SOETs) to assess the quality of Genetic algorithm solutions for QAPs. We examine the functioning of different SOETs regarding biasness, coverage rate and length of interval, and then we compare the SOET lower bound with deterministic ones. The commonly used deterministic bounds are confined to only a few algorithms. We show that, the Jackknife estimators have better performance than Weibull estimators, and when the number of heuristic solutions is as large as 100, higher order JK-estimators perform better than lower order ones. Compared with the deterministic bounds, the SOET lower bound performs significantly better than most deterministic lower bounds and is comparable with the best deterministic ones. 

A stopping rule while searching for optimal solution of facility-location

Solutions to combinatorial optimization, such as p-median problems of locating facilities, frequently rely on heuristics to minimize the objective function. The minimum is sought iteratively and a criterion is needed to decide when the procedure (almost) attains it. However, pre-setting the number of iterations dominates in OR applications, which implies that the quality of the solution cannot be ascertained. A small branch of the literature suggests using statistical principles to estimate the minimum and use the estimate for either stopping or evaluating the quality of the solution. In this paper we use test-problems taken from Baesley's OR-library and apply Simulated Annealing on these p-median problems. We do this for the purpose of comparing suggested methods of minimum estimation and, eventually, provide a recommendation for practioners. An illustration ends the paper being a problem of locating some 70 distribution centers of the Swedish Post in a region.

How does data quality in a network affect heuristic solutions?

To have good data quality with high complexity is often seen to be important. Intuition says that the higher accuracy and complexity the data have the better the analytic solutions becomes if it is possible to handle the increasing computing time. However, for most of the practical computational problems, high complexity data means that computational times become too long or that heuristics used to solve the problem have difficulties to reach good solutions. This is even further stressed when the size of the combinatorial problem increases. Consequently, we often need a simplified data to deal with complex combinatorial problems. In this study we stress the question of how the complexity and accuracy in a network affect the quality of the heuristic solutions for different sizes of the combinatorial problem. We evaluate this question by applying the commonly used p-median model, which is used to find optimal locations in a network of p supply points that serve n demand points. To evaluate this, we vary both the accuracy (the number of nodes) of the network and the size of the combinatorial problem (p). The investigation is conducted by the means of a case study in a region in Sweden with an asymmetrically distributed population (15,000 weighted demand points), Dalecarlia. To locate 5 to 50 supply points we use the national transport administrations official road network (NVDB). The road network consists of 1.5 million nodes. To find the optimal location we start with 500 candidate nodes in the network and increase the number of candidate nodes in steps up to 67,000 (which is aggregated from the 1.5 million nodes). To find the optimal solution we use a simulated annealing algorithm with adaptive tuning of the temperature. The results show that there is a limited improvement in the optimal solutions when the accuracy in the road network increase and the combinatorial problem (low p) is simple. When the combinatorial problem is complex (large p) the improvements of increasing the accuracy in the road network are much larger. The results also show that choice of the best accuracy of the network depends on the complexity of the combinatorial (varying p) problem.

Health problems in elderly patients during the first post-stroke year

BACKGROUND: A wide range of health problems has been reported in elderly post-stroke patients. AIM: The aim of this study was to analyse the prevalence and timing of health problems identified by patient interviews and scrutiny of primary health care and municipality elderly health care records during the first post-stroke year. METHODS: A total of 390 consecutive patients, ≥65 years, discharged alive from hospital after a stroke event, were followed for 1 year post-admission. Information on the health care situation during the first post-stroke year was obtained from primary health care and municipal elderly health care records and through interviews with the stroke survivors, at 1 week after discharge, and 3 and 12 months after hospital admission. RESULTS: More than 90% had some health problem at some time during the year, while based on patient record data only 4-8% had problems during a given week. The prevalence of interview-based health problems was generally higher than record-based prevalence, and the ranking order was moderately different. The most frequently interview-reported problems were associated with perception, activity, and tiredness, while the most common record-based findings indicated pain, bladder and bowel function, and breathing and circulation problems. There was co-occurrence between some problems, such as those relating to cognition, activity, and tiredness. CONCLUSIONS: Almost all patients had a health problem during the year, but few occurred in a given week. Cognitive and communication problems were more common in interview data than record data. Co-occurrence may be used to identify subtle health problems.

Optimization of cable cycles : a trade-off between reliability and cost

This paper elaborates the routing of cable cycle through available routes in a building in order to link a set of devices, in a most reasonable way. Despite of the similarities to other NP-hard routing problems, the only goal is not only to minimize the cost (length of the cycle) but also to increase the reliability of the path (in case of a cable cut) which is assessed by a risk factor. Since there is often a trade-off between the risk and length factors, a criterion for ranking candidates and deciding the most reasonable solution is defined. A set of techniques is proposed to perform an efficient and exact search among candidates. A novel graph is introduced to reduce the search-space, and navigate the search toward feasible and desirable solutions. Moreover, admissible heuristic length estimation helps to early detection of partial cycles which lead to unreasonable solutions. The results show that the method provides solutions which are both technically and financially reasonable. Furthermore, it is proved that the proposed techniques are very efficient in reducing the computational time of the search to a reasonable amount.