Nested heuristic methods for the location-routeing problem

The concept of 'nested methods' is adopted to solve the location-routeing problem. Unlike the sequential and iterative approaches, in this method we treat the routeing element as a sub-problem within the larger problem of location. Efficient techniques that take into account the above concept and which use a neighbourhood structure inspired from computational geometry are presented. A simple version of tabu search is also embedded into our methods to improve the solutions further. Computational testing is carried out on five sets of problems of 400 customers with five levels of depot fixed costs, and the results obtained are encouraging.

Multilevel approaches applied to the capacitated clustering problem

This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aiding the solution process for optimisation problems. The central methodologies of the technique are filtering solutions from the search space and reducing the level of problem detail to be considered at each level of the solution process. The first multilevel algorithm uses a simple tabu search while the other executes a standard local search procedure. Both algorithms demonstrate that the multilevel technique is capable of aiding the solution process for this combinatorial optimisation problem.

A combined evolutionary search and multilevel optimisation approach to graph-partitioning

The graph-partitioning problem is to divide a graph into several pieces so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges is minimised. Important applications of the problem arise, for example, in parallel processing where data sets need to be distributed across the memory of a parallel machine. Very effective heuristic algorithms have been developed for this problem which run in real-time, but it is not known how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. A distinctive feature is the use of a multilevel heuristic algorithm to provide an effective crossover. The technique is tested on several example graphs and it is demonstrated that our method can achieve extremely high quality partitions significantly better than those found by the state-of-the-art graph-partitioning packages.

Cold crucible melting of reactive metals using combined DC and AC magnetic fields

Cold crucible furnace is widely used for melting reactive metals for high quality castings. Although the water cooled copper crucible avoids contamination, it produces a low superheat of the melt. Experimental and theoretical investigations of the process showed that the increase of the supplied power to the furnace leads to a saturation in the temperature rise of the melt, and no significant increase of the melt superheat can be obtained. The computer model of theprocess has been developed to simulate the time dependent turbulent flow, heat transfer with phase change, and AC and DC magnetohydrodynamics in a time varying liquid metal envelope. The model predicts that the supermimposition of a strong DC field on top of the normal AC field reduces the level of turbulience and stirring in the liquid metal, thereby reducing the heat loss through the base of the crucible and increasing the superheat. The direct measurements of the temperature in the commercial size cold crucbile has confirmed the computer redictions and showed that the addition of a DC field increased the superheat in molten TiAl from ~45C (AC field only) to ~81C (DC+AC fields). The present paper reports further predictions of the effect of a dDC field on top of the AC field and compares these with experimental data.

Matching search in fractal video compression and its parallel implementation in distributed computing environments

Fractal video compression is a relatively new video compression method. Its attraction is due to the high compression ratio and the simple decompression algorithm. But its computational complexity is high and as a result parallel algorithms on high performance machines become one way out. In this study we partition the matching search, which occupies the majority of the work in a fractal video compression process, into small tasks and implement them in two distributed computing environments, one using DCOM and the other using .NET Remoting technology, based on a local area network consists of loosely coupled PCs. Experimental results show that the parallel algorithm is able to achieve a high speedup in these distributed environments.

Prooxidant action of knipholone anthrone: Copper dependent reactive oxygen species generation and DNA damage

Knipholone (KP) and knipholone anthrone (KA) are natural 4-phenylanthraquinone structural analogues with established differential biological activities including in vitro antioxidant and cytotoxic properties. By using DNA damage as an experimental model, the comparative Cu(II)-dependent prooxidant action of these two compounds were studied. In the presence of Cu(II) ions, the antioxidant KA (3.1-200 [mu]M) but not KP (6-384 [mu]M) caused a concentration-dependent pBR322 plasmid DNA strand scission. The DNA damage induced by KA could be abolished by reactive oxygen species scavengers, glutathione and catalase as well as EDTA and a specific Cu(I) chelator bathocuproine disulfonic acid. In addition to Cu(II) chelating activity, KA readily reduces Cu(II) to Cu(I). Copper-dependent generation of reactive oxygen species and the subsequent macromolecular damage may be involved in the antimicrobial and cytotoxic activity of KA.