• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.1
• /
• pp.79-84
• /
• 2009

In this paper, a best-first branch and bound algorithm based upon the bottom-up approach for the unweighted unconstrained two-dimensional cutting problem is proposed to find the optimal solution to the problem. The algorithm uses simple and effective methods to prevent constructing duplicated patterns and reduces the searching space by dividing the branched node set. It also uses a efficient bounding strategy to fathom the set of patterns. Computational results are compared with veil-known exact algorithms and demonstrate the efficiency of the proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.1069-1084
• /
• 2011

This paper considers an optimal base station clustering problem for designing a mobile (wireless) communication network. For a given network with a set of nodes (base stations), the problem is to optimally partition the set of nodes into subsets (each called a cluster) such that the associated inter-cluster traffic is minimized under certain topological constraints and cluster capacity constraints. In the problem analysis, the problem is formulated as an integer programming problem. The integer programming problem is then transformed into a binary integer programming problem, for which the associated linear programming relaxation is solved in a column generation approach assisted by a branch-and-bound procedure. For the column generation, both a heuristic algorithm and a valid inequality approach are exploited. Various numerical examples are solved to evaluate the effectiveness of the LP (Linear Programming) based branch-and-bound algorithm.

• Journal of Sensor Science and Technology
• /
• v.14 no.6
• /
• pp.369-373
• /
• 2005

High quality CdTe single crystal for the solar cell fabrication was grown by vertical Bridgman method. The etch pits patterns of (111) surfaces of CdTe etched by Nakagawa solution was observed the (111)A compesed of Cd atoms with typical triangle etch pits of pyramid mode. From the photoluminescence measurement on (111)A, we observed free exciton ($E_{x}$) existing only high quality crystal and neutal acceptor bound exciton ($A^{0}$,X) having very strong peak intensity. Then, the full width at half maximum and binding energy of neutral acceptor bound exciton were 7 meV and 5.9 meV, respectively. By Haynes rule, an activation enery of impurity was 59 meV. Therefore, the origins on impurity level acting as a neutral acceptor were associated Ag or Cu elements.

• International Journal of Precision Engineering and Manufacturing
• /
• v.2 no.4
• /
• pp.23-29
• /
• 2001

The compression behavior of semi-solid materials is studied from a viewpoint of yield criteria and analysis methods. To describe the behavior of materials in semi-solid state, several theories have been proposed by extending the concept of plasticity of porous compressible materials. In the present work, the upper-bound method and the finite element method are used to model the simple compression process using yield criteria of Kuhn and Doraivelu. Segregation between solid and liquid which cause defect of product is analysed for Sn-15%Pb and A356 alloys during deformation in semi-solid state. The comparison of analyses is made according to yield criteria and analysis methods. In addition, the analysis result for semi-solid dendritic Sn-15%Pb alloy is compared with the experimental result of Charreyron et al..

• International Journal of Precision Engineering and Manufacturing
• /
• v.1 no.2
• /
• pp.94-104
• /
• 2000

A kinematically admissible velocity field for near-net shape forging of a crown gear form is proposed. This takes into account the profiled shape of the teeth chosen by approximating these kinematically as radially straight taper teeth, (rectangular and trapezoidal teeth). The upper bound to the forging load, the relative forging pressure and the deformed configurations, with both the initially solid circular cylindrical and hollow billets, are predicted using the velocity field at varying incremental punch movements considering differing frictional factors. These and other results are given and commented upon.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1998.03a
• /
• pp.214-219
• /
• 1998

Analytic and experimental methods have been used for the characterization of flow behavior of semi-solid Al2024 alloy. Backward extrusion experimnet was chosen to avoid the crack on the unconstrained surface. The material constants for the flow stress by the upper bound technique that agreed with experimental results were determined. The various material constants obtained for al temperature range above the solidus temperature have been fitted and represented in the function of temperature and solid fraction. The obtained result has good agreement only in the high solid fraction.

• The Korean Journal of Applied Statistics
• /
• v.17 no.1
• /
• pp.75-88
• /
• 2004

The Support Vector Machine(SVM) algorithm has paid attention on maximizing the shortest distance between sample points and discrimination hyperplane. This paper suggests the total margin algorithm which considers the distance between all data points and the separating hyperplane. The method extends existing support vector machine algorithm. In addition, this newly proposed method improves the generalization error bound. Numerical experiments show that the total margin algorithm provides good performance, comparing with the previous methods.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.213-220
• /
• 2007

This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in stages, each of which has multiple identical parallel machines. The problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also suggested to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2012.05a
• /
• pp.253-254
• /
• 2012

In this study, it carried out measurement experiment Ca(OH)₂ and chemically bound water to verify Ca(OH)₂ and chemically bound water prediction model out of hydration model of cement incorporating blast furnace slag. It compared and analyzed prediction results using prediction model with measurement results of Ca(OH)₂ quantity using thermogravimetric differential temperature analysis and chemically bound water quantity using electronic furnace. It agrees well experiments results with prediction results.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.153-168
• /
• 1994

This paper is concerned with the development of tree-search algorithm for the exact solution to the vehicle problem (VRP), where set of vehicles of known capacity based at depot, have to be routed in order to supply customers with known requirements. When is required is to design routes, so that the total cost (i. e. total route length or time duration, ect.) is minimized. For obtianing the exact solution, the most important factors are the value of bound and branching strategy. Using the bound based on with bound ascent procedures from subgradient and state-space ascents, the incorporation of bounds into tree search algorithm to solve the problem is shown. Computational results of the corresponding algorithm show that VRPs with up to 40 customers can be solved optimally with this algorithm.