Collision Avoidance in Bi-Directional AGV Systems

The use of a bi-directional, as opposed to a one-way, transportation system, can increase the operational efficiency of automated guided vehicles in both manufacturing and warehousing environments. However, the full potential will only be realized if the routeing algorithms pay particular attention to the problem of collision avoidance. This paper is concerned with the development of such an algorithm. The method is based on the use of delays and deviations to avoid collisions that could arise when using the shortest routes for each vehicle, and is applicable to any transportation system which can be represented as a network with known travel times.     

Riccati-based preconditioner for computing invariant subspaces of large matrices

Summary. This paper introduces and analyzes the convergence properties of a method that computes an approximation to the invariant subspace associated with a group of eigenvalues of a large not necessarily diagonalizable matrix. The method belongs to the family of projection type methods. At each step, it refines the approximate invariant subspace using a linearized Riccati's equation which turns out to be the block analogue of the correction used in the Jacobi-Davidson method. The analysis conducted in this paper shows that the method converges at a rate quasi-quadratic provided that the approximate invariant subspace is close to the exact one. The implementation of the method based on multigrid techniques is also discussed and numerical experiments are reported. Received June 15, 2000 / Revised version received January 22, 2001 / Published online October 17, 2001     

Pion pair production in photon-photon collisions

The process γγ→π⁺π^? was measured using the detector MD-1 at VEPP-4. The two-photon reactionse ⁺ e ^?, μ⁺ μ^? and π⁺ π^? pair production were separated using scintillation counters, Cherenkov counters and shower-range chambers. A radiation widthГ _γγ(f ₂(1270))=3.1±0.35±0.35 keV was obtained.     

An approach to deducing approximate solutions to the Cauchy problem for nonlinear differential equations

A new technique for the construction of numerical methods based on continued fractions is proposed. A characteristic feature of these algorithms is the fact that for certain values of the parameters it is possible to obtain both novel and traditional (explicit and implicit) numerical methods for the solution of the Cauchy problem for ordinary differential equations. Two-sided formulas are proposed by means of which it is possible to obtain on each integration step not only upper and lower approximations to the exact solution, but also information concerning the magnitude of the leading term of the error without the need for additional calculations of the right-hand side of the initial differential equation.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 44, No. 12, pp. 1695–1701, December, 1992.     

A Practical Solution to a Cargo Loading Problem at Bethlehem Steel

The optimum assignment of structural steel shapes to rail cars is an important logistical problem in the steel industry. In this paper, we discuss an application at Bethlehem Steel that not only involves weight and dimensional constraints, but also customer unloading constraints. The formulation is a generalized bin packing problem which is solved by modifying and extending the first fit decreasing algorithm. The solution algorithm, SOLID (for Structural Optimal Loading IDentification), has been used extensively for one of Bethlehem's high tonnage customers providing very good practical (implementable) results that achieve the desired goals. Bethlehem has enhanced this approach for use with other customers.     

Exact ground state of the generalized three-dimensional Shastry-Sutherland model

We generalize the Shastry-Sutherland model to three dimensions. By representing the model as a sum of the semidefinite positive projection operators, we exactly prove that the model has exact dimer ground state. Several schemes for constructing the three-dimensional Shastry-Sutherland model are proposed. Received 20 February 2002 / Received in final form 27 May 2002 Published online 17 September 2002     

A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland

In this paper, we consider a real-life vehicle routeing problem that occurs in a major Swiss company producing pet food and flour. In contrast with usual hypothetical problems, a large variety of restrictions has to be considered. The main constraints are relative to the accessibility and the time windows at customers, the carrying capacities of vehicles, the total duration of routes and the drivers' breaks. To find good solutions to this problem, we propose two heuristic methods: a fast straightforward insertion procedure and a method based on tabu search techniques. Next, the produced solutions are compared with the routes actually covered by the company. Our outcomes indicate that the total distance travelled can be reduced significantly when such methods are used.