Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics.     

A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms.     

Marking Games and the Oriented Game Chromatic Number of Partial <Emphasis Type="Italic">k</Emphasis>-Trees

 Nešetřil and Sopena introduced the concept of oriented game chromatic number. They asked whether the oriented game chromatic number of partial k-trees was bounded. Here we answer their question positively. Received: January 12, 2001 Final version received: February 25, 2002     

Crossover from high-temperature vortex-liquid to low-temperature vortex-glass behavior in single phase HgBa2Ca2Cu3O8+δ superconductor

The ρ-T curves in our single phase HgBa₂Ca₂Cu₃O_8+δ superconductor were measured as a function of temperature and magnetic field, ρ=ρ₀exp(−U_eff/κ_BT). It can be transformed to another form d(lnρ)/d(1/T)=−U_eff+TdU_eff/dT, then this becomes a plot of the activation energy U_eff as a function of temperature. Our data plotted in these ways show a clear crossover from high-temperature two-dimensional vortex-liquid to a critical region associated with the low-temperature three-dimensional vortex-glass phase transition. The critical exponents v(z−1)=3.9±1.9 in this system are little different with previous measurements in BSCCO and YBCO systems.     

Single-electron charging spectra: from natural to artificial atoms

We present a theoretical study of the charging spectra in natural and artificial atoms. We apply a model electrostatic potential created by a homogenously charged sphere. This model potential allows for a continuous passage from the Coulomb potential of the nucleus to parabolic confinement potential of quantum dots. We consider electron systems with N=1,…,10 electrons with the use of the Hartree–Fock method. We discuss the qualitative similarities and differences between the chemical potential spectrum of electron systems bound to nucleus and confined in quantum dots.     

Reconstruction of the fine structure of an acoustic scatterer against the distorting influence of its large-scale inhomogeneities

In the ultrasonic diagnostics of small-size neoplasms of biological tissues at the earliest stage of their development, an efficient way to eliminate the distorting influence of high-contrast or large inhomogeneities of the biological medium is to apply the iterative technique. A simple approach is proposed, which makes it possible with only two iteration steps to achieve an efficient focusing of the tomograph array. At the first step, the unknown distribution of the large-scale inhomogeneities of sound velocity and absorption over the scatterer is reconstructed, where the large-scale inhomogeneities are those whose size exceeds several wavelengths. At the second step, the fine structure of the scatterer is reconstructed against the large-scale background, which can be performed with a high accuracy owing to the evaluation of the background at the first step. The possibility of simultaneous reconstruction of the large-scale and fine structures by the noniterative Grinevich-Novikov algorithm is considered as an alternative. This algorithm reconstructs in an explicit form two-dimensional refractive-absorbing acoustic scatterers of almost arbitrary shape and strength. Taking into account the effects of multiple scattering, this algorithm provides resolution of the fine structure almost as good as that achieved in reconstructing the same structure against an undistorting homogeneous background. The results of numerical simulations of both algorithms are presented.