In some instances of production supply chain problems, triangular inequality constraint does not hold for the cost functions. This study aims at solving a special case of these problems, where the triangular inequality constraint still remains valid for the delivery cost within districts. After transforming the particular problem to the second kind of Generalized Travelling Salesman Problem (GTSP), an innovative genetic algorithm using generalized chromosomes with void vertices is employed to solve the special GTSP problem. Case study of simulation for benchmark test problems shows that the proposed algorithm is considerably successful.

Nowadays, swirling around most businesses is not structure information but semi-structure information, such as spreadsheets, and documents created by an individual or company. However, in spite of success of data management of structure data by using databases, current enterprise information infrastructure is poorly suited for dealing with the continuing, rapid explosion of semi-structure data in enterprise. In this paper we discuss a system based on the integration between XML and RDB in a three- tiered framework, which undertakes research at the intersection of XML and RDB, exploits their strengths in a common framework, and expands their applicability in the area of semi-structure data management. Through a discussion of the fundamental architecture in general and its components in particular, we depict the basic principles that should form the basis for the design of the architecture based on the integration of XML and RDB. The key contribution of this paper is the framework for semi-structure data management, which is orchestrated through the transformation of representation, query and updating between XML data and RDB data.

Contour line is the main linear feature on topographic maps. Extraction of contour lines is tedious and time-consuming process, and is still an interesting problem. A novel method for extraction of contour lines from paper-based topographic maps is presented in this paper. In our approach, we firstly segment color topographic maps for achieving the binary image of brown color contour lines. Then, mathematic morphology method is used to filter the binary image. Next, Utilizing c-means algorithm to look for initial seed point on thinning contour lines. Fourthly, utilizing improved active contour model to extract non- thinning contour lines. Last, we have analyzed the directional field of contour lines near the gap, and then reconnected broken contour lines. The performance of the algorithm is tested on several topographic maps and comparing with other algorithms.

By using quasi-group, we introduce some kinds of special quasi-rings and discuss their characteristics. According to the concept of monogenic semigroup we introduce definition of monogenic semiring and discuss the numbers and structures of monogenic semiring .Then we display their relations as following:

Recently, the complementary behavior of restarted GMRES has been studied. We observed that successive cycles of restarted block BGMRES (BGMRES(m,s)) can also complement one another harmoniously in reducing the iterative residual. In the present paper, this characterization of BGMRES(m,s) is exploited to form a hybrid block iterative scheme. In particular, a product hybrid block GMRES algorithm for nonsymmetrical systems with multiple right-hand sides is proposed. The new algorithm combines the advantage of Simoncini’s Hybrid Block GMRES and Zhong’s Product Hybrid GMRES. Numerical experiments are conducted to show that the new algorithm can offer significant improvement over the hybrid block GMRES.

In the present paper, we propose new smoothing procedures for iterative block methods for solving nonsymmetric linear systems of equations with multiple right-hand sides. These procedures generalize those known for solving linear systems with one right-hand. We first give some properties of these new algorithms. Then new methods such as the global minimal residual smoothing (GMRS) algorithm and the smoothed global biconjugate gradient (SGL-BCG) algorithm are introduced. Finally, numerical examples are given.