• International Journal of Computer Science & Network Security
• /
• v.21 no.5
• /
• pp.35-38
• /
• 2021

The article discusses approaches to the definition and understanding of artificial intelligence, research directions in the field of artificial intelligence; artificial intelligence in the anthropological dimension; the importance of the systems approach as a methodological basis for the design of intelligent systems; structural and functional components of intelligent systems; intelligent systems in the technological aspect; problems and prospects of relations in the system "man - intellectual system".

• Kyungpook Mathematical Journal
• /
• v.64 no.1
• /
• pp.95-111
• /
• 2024

The filled function method is useful in solving unconstrained global optimization problems. However, depending on the type of function, and parameters used, there are limitations that cause difficultiies in implemenations. Exponential and logarithmic functions lead to the overflow effect, requiring iterative adjustment of the parameters. This paper proposes a polynomial-filled function that has a general form, is non-exponential, nonlogarithmic, non-parameteric, and continuously differentiable. With this newly proposed filled function, the aforementioned shortcomings of the filled function method can be overcome. To confirm the superiority of the proposed filled function algorithm, we apply it to a set of unconstrained global optimization problems. The data derived by numerical implementation shows that the proposed filled function can be used as an alternative algorithm when solving unconstrained global optimization problems.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.19 no.5
• /
• pp.637-644
• /
• 2010

This paper presents a reliability-based shape optimization (RBSO) using the growth-strain method. An actual design involves uncertain conditions such as material property, operational load, Poisson's ratio and dimensional variation. The purpose of the RBSO is to consider the variations of probabilistic constraint and performances caused by uncertainties. In this study, the growth-strain method was applied to shape optimization of reliability analysis. Even though many papers for reliability-based shape optimization in mathematical programming method and ESO (Evolutionary Structural Optimization) were published, the paper for the reliability-based shape optimization using the growth-strain method has not been applied yet. Growth-strain method is applied to performance measure approach (PMA), which has probabilistic constraints that are formulated in terms of the reliability index, is adopted to evaluate the probabilistic constraints in the change of average mises stress. Numerical examples are presented to compare the DO with the RBSO. The results of design example show that the RBSO model is more reliable than deterministic optimization. It was verified that the reliability-based shape optimization using growth-strain method are very effective for general structure. The purpose of this study is to improve structure's safety considering probabilistic variable.

• Journal of the Korean Society for Railway
• /
• v.10 no.2 s.39
• /
• pp.179-185
• /
• 2007

In large station with high density traffic, trains can be hardly controlled by CTC but by station dispatcher because CTC has difficulties in monitoring all states of affairs happening within each station such as departures, arrivals of many trains from different lines and shunting of trains to move between yards and platforms, etc. Therefore the station's dispatcher has to make quick decision about how to reschedule the times and routes for all the trains scheduled within a specific time window. And such decision becomes harder when an unexpected delay occurs because a delay occurring in a train propagates other trains as time goes on. Generally, it is called the conflict detection and resolution to adjust beforehand the distorted schedule due to a delay to original schedule. Our research is different from the state of the arts in that ours determines simultaneously the routes and the times of arrival and departure of trains, although others do only the arrival and departure time of the trains without considering the alternative routes and shunting of the station. This study suggests a mathematical approach for how to detect in advance and resolve efficiently the conflicts occurring within a station and it will be shown how to reduce delay using our approach by means of analysing the schedule of ChyungRyangRi station.

• Structural Engineering and Mechanics
• /
• v.4 no.1
• /
• pp.25-35
• /
• 1996

This paper describes a continuum variational formulation for design optimization of nonlinear structures in the elastic-plastic domain, where unloading and reloading of the structures are allowed to occur. The Total Lagrangian procedure is used for the description of the structural deformation. The direct differentiation approach is used to derive the sensitivities of the various structural response measures with respect to the design parameters. Since the material goes into the inelastic range and unloading and reloading of the structure are allowed to occur, the structural response is path dependent and an additional step is needed to integrate the constitutive equations. It can be shown, consequently, that design sensitivity analysis is also path-dependent. The theory has been discretized by the finite element technique and implemented in a structural analysis code. Mathematical programming approach is used for the optimization process. Numerical applications on trusses are performed, where cross-sectional areas and nodal point coordinates are treated as design variables. Optimal designs have been obtained and compared by using two different strategies: a two level strategy where the levels are defined accordingly the type of design variables, cross sectional areas or node coordinates, and optimizing simultaneously with respect to both types of design variables.

• Journal of the Korean Institute of Navigation
• /
• v.14 no.1
• /
• pp.21-38
• /
• 1990

This paper discusses the various modes of operations of cargo ships which are liner operations, tramp shipping and industrial operations, and mathematical programming, simulation , and heuristic method that can be used to solve ships routing and scheduling problems for each of these operations. In particular, this paper put emphasis on a crude oil tanker scheduling problem. The problem is to achieve an optimal sequence of cargoes or an optimal schedule for each ship in a given fleet during a given period. Each cargo is characterized by its type, size, loading and discharging ports, loading and discharging dates, cost, and revenue. Our approach is to enumerate all feasible candidate schedate schedules for each ship, where a candidate schedule specifies a set of cargoes that can be feasibly carried by a ship within the planning horizon , together with loading and discharging dates for each cargo in the set. Provided that candidate schedules have been generated for each ship, the problem of choosing from these an optimal schedule for each ship is formulated as a set partitioning problem, a set packing problem, and a integer generalized network problem respectively. We write the PASCAL programs for schedule generator and apply our approach to the crude oil tanker scheduling problem similar to a realistic system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.109-116
• /
• 2015

This paper is concerned with the single vendor single buyer integrated production inventory problem. To make this problem more practical, space restriction and lead time proportional to lot size are considered. Since the space for the inventory is limited in most practical inventory system, the space restriction for the inventory of a vendor and a buyer is considered. As product's quantity to be manufactured by the vendor is increased, the lead time for the order is usually increased. Therefore, lead time for the product is proportional to the order quantity by the buyer. Demand is assumed to be stochastic and the continuous review inventory policy is used by the buyer. If the buyer places an order, then the vendor will start to manufacture products and the products will be transferred to the buyer with equal shipments many times. The mathematical formulation with space restriction for the inventory of a vendor and a buyer is suggested in this paper. This problem is constrained nonlinear integer programming problem. Order quantity, reorder points for the buyer, and the number of shipments are required to be determined. A Lagrangian relaxation approach, a popular solution method for constrained problem, is developed to find lower bound of this problem. Since a Lagrangian relaxation approach cannot guarantee the feasible solution, the solution method based on the Lagrangian relaxation approach is proposed to provide with a good feasible solution. Total costs by the proposed method are pretty close to those by the Lagrangian relaxation approach. Sensitivity analysis for space restriction for the vendor and the buyer is done to figure out the relationships between parameters.

• The Journal of Information Systems
• /
• v.29 no.1
• /
• pp.75-91
• /
• 2020

Purpose Retrofit, defined to be addition of new technologies or features to the old system to increase efficiency or to abate GHG emissions, is considered as an important alternative for the old coal-fired power plant. The purpose of this study is to propose mathematical method to model multiple alternative retrofit in Generation Capacity Expansion Planning(GCEP) problem, and to get insight to the retrofit patterns from realistic case studies. Design/methodology/approach This study made a multi-alternative retrofit GECP model by adopting some new variables and equations to the existing GECP model. Added variables and equations are to ensure the retrofit feature that the life time of retrofitted plant is the remaining life time of the old power plant. We formulated such that multiple retrofit alternatives are simultaneously compared and the best retrofit alternative can be selected. And we found that old approach to model retrofit has a problem that old plant with long remaining life time is retrofitted earlier than the one with short remaining life time, fixed the problem by some constraints with some binary variables. Therefore, the proposed model is formulated into a mixed binary programming problem, and coded and run using the GAMS/cplex. Findings According to the empirical analysis result, we found that approach to model the multiple alternative retrofit proposed in this study is comparing simultaneously multiple retrofit alternatives and select the best retrofit satisfying the retrofit features related to the life time. And we found that retrofit order problem is cleared. In addition, the model is expected to be very useful in evaluating and developing the national policies concerning coal-fired power plant retrofit.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.1
• /
• pp.98-104
• /
• 2016

With the development of modern science and technology, weapon systems such as tanks, submarines, combat planes, radar are also dramatically advanced. Among these weapon systems, the ballistic missile, one of the asymmetric forces, could be considered as a very economical means to attack the core facilities of the other country in order to achieve the strategic goals of the country during the war. Because of the current ballistic missile threat from the North Korea, establishing a missile defense (MD) system becomes one of the major national defense issues. This study focused on the optimization of air defense artillery units' deployment for effective ballistic missile defense. To optimize the deployment of the units, firstly this study examined the possibility of defense, according to the presence of orbital coordinates of ballistic missiles in the limited defense range of air defense artillery units. This constraint on the defense range is originated from the characteristics of anti-ballistic missiles (ABMs) such as PATRIOT. Secondly, this study proposed the optimized mathematical model considering the total covering problem of binary integer programming, as an optimal deployment of air defense artillery units for defending every core defense facility with the least number of such units. Finally, numerical experiments were conducted to show how the suggested approach works. Assuming the current state of the Korean peninsula, the study arbitrarily set ballistic missile bases of the North Korea and core defense facilities of the South Korea. Under these conditions, numerical experiments were executed by utilizing MATLAB R2010a of the MathWorks, Inc.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.5
• /
• pp.535-543
• /
• 2014

In the robust optimization field, the robustness of the objective function emphasizes an insensitive design. In general, the robustness of the objective function can be achieved by reducing the change of the objective function with respect to the variation of the design variables and parameters. However, in conventional methods, when an insensitive design is emphasized, the performance of the objective function can be deteriorated. Besides, if the numbers of the design variables are increased, the numerical cost is quite high in robust optimization for nonlinear programming problems. In this research, the robustness index for the objective function and a process of robust optimization are proposed. Moreover, a method using the supremum of linearized functions is also proposed to reduce the computational cost. Mathematical examples are solved for the verification of the proposed method and the results are compared with those from the conventional methods. The proposed approach improves the performance of the objective function and its efficiency.