Heuristic optimization of the p-median problem and population re-distribution

This thesis contributes to the heuristic optimization of the p-median problem and Swedish population redistribution.   The p-median model is the most representative model in the location analysis. When facilities are located to a population geographically distributed in Q demand points, the p-median model systematically considers all the demand points such that each demand point will have an effect on the decision of the location. However, a series of questions arise. How do we measure the distances? Does the number of facilities to be located have a strong impact on the result? What scale of the network is suitable? How good is our solution? We have scrutinized a lot of issues like those. The reason why we are interested in those questions is that there are a lot of uncertainties in the solutions. We cannot guarantee our solution is good enough for making decisions. The technique of heuristic optimization is formulated in the thesis.   Swedish population redistribution is examined by a spatio-temporal covariance model. A descriptive analysis is not always enough to describe the moving effects from the neighbouring population. A correlation or a covariance analysis is more explicit to show the tendencies. Similarly, the optimization technique of the parameter estimation is required and is executed in the frame of statistical modeling. 

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.

Simulation model using meta heuristic algorithms for achieving optimal arrangement of storage bins in a sawmill yard

Bin planning (arrangements) is a key factor in the timber industry. Improper planning of the storage bins may lead to inefficient transportation of resources, which threaten the overall efficiency and thereby limit the profit margins of sawmills. To address this challenge, a simulation model has been developed. However, as numerous alternatives are available for arranging bins, simulating all possibilities will take an enormous amount of time and it is computationally infeasible. A discrete-event simulation model incorporating meta-heuristic algorithms has therefore been investigated in this study. Preliminary investigations indicate that the results achieved by GA based simulation model are promising and better than the other meta-heuristic algorithm. Further, a sensitivity analysis has been done on the GA based optimal arrangement which contributes to gaining insights and knowledge about the real system that ultimately leads to improved and enhanced efficiency in sawmill yards. It is expected that the results achieved in the work will support timber industries in making optimal decisions with respect to arrangement of storage bins in a sawmill yard.

A heuristic framework for ratio-based modelling of corporate collapse

This paper draws on empirical evidence to demonstrate that a heuristic framework signals collapse with significantly higher accuracy than the traditional static approach. Using a sample of 494 US publicly listed companies comprising 247 collapsed matched with 247 financially healthy ones, a heuristic framework is decisively superior the closer one gets to the event of collapse, culminating in 12.5% more overall accuracy than a static approach during
the year of collapse. An even more dramatic improvement occurs in relation to reduction of Type I error, with a heuristic framework delivering an improvement of 66.7% over its static counterpart.

A heuristic algorithm for carton to pallet loading problem

This paper presents an algorithm used to solve a carton to pallet packing problem in a drink manufacturing firm. The aim was to determine the cartons loading sequence and the number pallets required, prior to dispatch by truck. The algorithm consists of a series of nine parts to solve this industrial application problem. The pallet loading solution relatively computationally efficient and reduces the number pallets required, compared to other 'trail and error' or manual spreadsheet calculation methods.

Affect : initiating heuristic life

This paper re-examines the relationship between affect and effect, discussing them as research values that have emerged from the life sciences, the arts and philosophy and, more importantly, considering them as systems of relations underpinning experiential orientation by which to initiate change and hold the world in place. The notion of æffect may be defined as the continuous measure performed upon the systems of affect/effect and reapplied to events and things. Æffect is a coordinated system of cognition where concurrent measures impact on each other. In doing so, they specify perception and action on multiple registers and scales of events. It is important to recognise that the functioning of affective and effective systems in the body allows, and even requires, paradoxical logics to coexist and be deployed as processes that shape the organism-person-environment. Discussion of selected works from Arakawa and Gins will supply examples of tactics that combine built environments with discursive constraints to guide embodied attention. The practice of embodied cognition dilates the thresholds separating the organism from person and the person from environment, and moves towards an atmospheric intricateness (Arakawa and Gins 2003a:25) that may become the blocs of a new materialism for heuristic life.

A heuristic model selection scheme for representing hot flow data using the hot torsion test results

The problem of "model selection" for expressing a wide range of constitutive behaviour adequately using hot torsion test data was considered here using a heuristic approach. A model library including several nested parametric linear and non-linear models was considered and applied to a set of hot torsion test data for API-X 70 micro-alloyed steel with a range of strain rates and temperatures. A cost function comprising the modelled hot strength data and that of the measured data were utilized in a heuristic model selection scheme to identify the optimum models. It was shown that a non-linear rational model including ten parameters is an optimum model that can accurately express the multiple regimes of hardening and softening for the entire range of the experiment. The parameters for the optimum model were estimated and used for determining variations of hot strength of the samples with deformation.

A simple motion heuristic for controlling mobile sinks in delay tolerant sensor networks

Optimising energy consumption in wireless sensor networks is of dominant importance. Sink mobility is introduced to deal with this problem by approaching the sensor nodes and collecting their data buffers using the less energy demanding single-hop communication. The sink route is very crucial for the data collection operation performed in the network especially when the collection requests generated by the sensors are revealed dynamically to the sink and not known ahead. This paper presents a practical motion heuristic for constructing the sink route based on the dynamic arrival of the collection requests. Three control schemes are proposed for coordinating the interaction of multiple mobile sinks collectively performing the data collection in the network. The main objective is maximising the data collected by each mobile sink while minimising the sleeping time of each sensor awaiting the collection service. Simulation results show the performance of the mobile sinks under the proposed control schemes and the impact of the motion heuristic on the sensors' sleeping time in the network.