• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.113-116
• /
• 2000

The purpose of this study is to present a method for determining the k most vital arcs in shortest path problem using an evolutionary algorithm. The problem of finding the k most vital arcs in shortest path problem is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of shortest path. The problem determining the k most vital arcs in shortest path problem has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithm is needed. In this study we propose to the method of finding the k-MVA in shortest path problem using an evolutionary algorithm which known as the most efficient algorithm among heuristics. For this, the expression method of individuals compatible with the characteristics of shortest path problem, the parameter values of constitution gene, size of the initial population, crossover rate and mutation rate etc. are specified and then the effective genetic algorithm will be proposed. The method presented in this study is developed using the library of the evolutionary algorithm framework (EAF) and then the performance of algorithm is analyzed through the computer experiment.

• International Journal of Computer Science & Network Security
• /
• v.24 no.3
• /
• pp.12-22
• /
• 2024

The travelling salesman problem is very famous and very difficult combinatorial optimization problem that has several applications in operations research, computer science and industrial engineering. As the problem is difficult, finding its optimal solution is computationally very difficult. Thus, several researchers have developed heuristic/metaheuristic algorithms for finding heuristic solutions to the problem instances. In this present study, a new hybrid genetic algorithm (HGA) is suggested to find heuristic solution to the problem. In our HGA we used comprehensive sequential constructive crossover, adaptive mutation, 2-opt search and a new local search algorithm along with a replacement method, then executed our HGA on some standard TSPLIB problem instances, and finally, we compared our HGA with simple genetic algorithm and an existing state-of-the-art method. The experimental studies show the effectiveness of our proposed HGA for the problem.

• Communications for Statistical Applications and Methods
• /
• v.22 no.5
• /
• pp.401-413
• /
• 2015

In this article, we review the statistical methods and theory for dose finding in early phase clinical trials, where the primary objective is to identify an acceptable dose for further clinical investigation. The dose finding literature is initially motivated by applications in phase I clinical trials, in which dose finding is often formulated as a percentile estimation problem. We will present some important phase I methods and give an update on new theoretical developments since a recent review by Cheung (2010), with an aim to cover a broader class of dose finding problems and to illustrate how the general dose finding theory may be applied to evaluate and improve a method. Specifically, we will illustrate theoretical techniques with some numerical results in the context of a phase I/II study that uses trinary toxicity/efficacy outcomes as basis of dose finding.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.04a
• /
• pp.260-267
• /
• 1999

In this paper, We propose the initial shape finding and dynamic analysis of cable dome structure are presented. Cable dome that is consist of three component such as cable, strut and fabric membrane have complex structural characteristics. Main structural system of cable dome is cable-strut tensegric system, and fabric membrane element Is conceived as cladding roof material. One of the important problem of cable dome is shape finding of those subjected to cable and membrane forces, which stabilize the structures. And the other is structural response from external load effect such as snow and wind When cable dome are subjected to dynamic load such as wind load each structural component has many important problem because of their special structural characteristics. One problem is that geometrical nonlinearity should be considered in the dynamic analysis because large deformation is occurred from their flexible characteristic. The other problem is that wrinkling occurs occasionally because cable and membrane elements can not transmit compressive forces. So this paper describe the physical structural response of cable dome structure.

• ETRI Journal
• /
• v.20 no.4
• /
• pp.327-345
• /
• 1998

This paper deals with the problem of one-to-one mapping of 2$^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize the total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. First we show that the mapping problem in a hypercube multicomputer can be transformed into the problem of finding a set of maximum cutsets on a given task graph using a graph modification technique. Then we propose a repeated mapping scheme, using an existing graph bipartitioning algorithm, for the effective mapping of task modules onto the processors of a hypercube multicomputer. The repeated mapping scheme is shown to be highly effective on a number of test task graphs; it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increases. Our repeated mapping scheme is shown to be very effective for regular graphs, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mappings on almost all the regular task graphs considered.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.2
• /
• pp.140-149
• /
• 2001

The paper discusses the problem of finding the Origin-Destination(O-D) shortest paths in internodal transportation networks with time-schedule constraints. The shortest path problem on the internodal transportation network is concerned with finding a path with minimum distance, time, or cost from an origin to a destination using all possible transportation modalities. The time-schedule constraint requires that the departure time to travel from a transfer station to another node takes place only at one of pre-specified departure times. The scheduled departure times at the transfer station are the times when the passengers are allowed to leave the station to another node using the relative transportation modality. Therefore, the total time of a path in an internodal transportation network subject to time-schedule constraints includes traveling time and transfer waiting time. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. The effectiveness of the GA approach is evaluated using several test problems.

• The Korean Nurse
• /
• v.17 no.2 s.94
• /
• pp.52-52
• /
• 1978

• Journal of The Korean Association For Science Education
• /
• v.28 no.2
• /
• pp.139-149
• /
• 2008

The purpose of this study is to develop a valid and reliable instrument for measuring scientific problem-finding ability for the scientifically-gifted student. On the basis of an operational definition of scientific problem-finding ability, this instrument consists of five sections(appropriateness, flexibility, originality, elaboration, and valuation) which are designed for measuring the ability of the scientifically-gifted. This instrument was checked the validity of content and evaluation criteria by the five experienced specialists in science education, and then was administered to 38 students of science high school. Because the validity of content and evaluation criteria, construct validity, inter-rater reliability, item difficulty, and item discrimination are suitable for the criteria of good test, this developed instrument in this study is considered valid and reliable.

• East Asian mathematical journal
• /
• v.27 no.1
• /
• pp.1-9
• /
• 2011

In this paper, we consider an iterative scheme for finding a common element of the set of fixed points of a asymptotically quasi nonexpansive mapping and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common fixed point of a asymptotically quasi-nonexpansive mapping and strictly pseudocontractive mapping and the problem of finding a common element of the set of fixed points of a asymptotically quasi-nonexpansive mapping and the set of zeros of an inverse-strongly monotone mapping.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.10
• /
• pp.61-68
• /
• 2015

This paper deals with the pre-marshalling problem that the containers of container yard at container terminal are relocated in consensus sequence of loading schedule of container vessel. This problem is essential to improvement of competitive power of terminal. This problem has to relocate the all of containers in a bay with minimum number of movement. There are various algorithms such as metaheuristic as genetic algorithm and heuristic algorithm in order to find the solution of this problem. Nevertheless, there is no unique general algorithm that is suitable for various many data. And the main drawback of metaheuristic methods are not the solution finding rule but can be find the approximated solution with many random trials and by coincidence. This paper can be obtain the solution with O(m) time complexity that this problem deals with bin packing problem for m stack bins with descending order of take out ranking. For various experimental data, the proposed algorithm can be obtain the optimal solutions for all of data. And to conclude, this algorithm can be show that most simple and general algorithm with simple optimal solution finding rule.