• Elastomers and Composites
• /
• v.34 no.4
• /
• pp.321-331
• /
• 1999

The curing process is the final step in tire manufacturing whereby a green tire built from layers of rubber compounds is formed to the desired shape and the compounds are converted to a strong, elastic materials to meet tire performance needs under elevated pressure and temperature in a press. A numerical optimization procedure was developed to improve product quality in a tire curing process. First, a dynamic constrained optimization problem was formulated to determine the optimal condition of the supplied cure media during a curing process. The objective function is subject to an equality constraint representing the process model that describes the heat transfer and cures kinetic phenomena in a cure press and is subject to inequality constraints representing temperature limits imposed on cure media. Then, the optimization problem was solved to determine optimal condition of the supplied cure media for a tire using the complex algorithm along with a finite element model solver.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.7 no.2
• /
• pp.270-287
• /
• 2015

According to the increase of the operating cost and material cost of a ship due to the change of international oil price, a demand for the lightening of the ship weight is being made from various parties such as shipping companies, ship owners, and shipyards. To satisfy such demand, many studies for a light ship are being made. As one of them, an optimal design method of an existing hull structure, that is, a method for lightening the ship weight based on the optimization technique was proposed in this study. For this, we selected a hatch cover of a bulk carrier as an optimization target and formulated an optimization problem in order to determine optimal principal dimensions of the hatch cover for lightening the bulk carrier. Some dimensions representing the shape of the hatch cover were selected as design variables and some design considerations related to the maximum stress, maximum deflection, and geometry of the hatch cover were selected as constraints. In addition, the minimization of the weight of the hatch cover was selected as an objective function. To solve this optimization problem, we developed an optimization program based on the Sequential Quadratic Programming (SQP) using C++ programming language. To evaluate the applicability of the developed program, it was applied to a problem for finding optimal principal dimensions of the hatch cover of a deadweight 180,000 ton bulk carrier. The result shows that the developed program can decrease the hatch cover's weight by about 8.5%. Thus, this study will be able to contribute to make energy saving and environment-friendly ship in shipyard.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.7
• /
• pp.1823-1840
• /
• 2023

In order to improve spectral efficiency and reduce power consumption for reconfigurable intelligent surface (RIS) assisted wireless communication systems, a joint design considering irregular RIS topology, RIS on-off switch, power allocation and phase adjustment is investigated in this paper. Firstly, a multi-dimensional variable joint optimization problem is established under multiple constraints, such as the minimum data requirement and power constraints, with the goal of maximizing the system energy efficiency. However, the proposed optimization problem is hard to be resolved due to its property of nonlinear nonconvex integer programming. Then, to tackle this issue, the problem is decomposed into four sub-problems: topology design, phase shift adjustment, power allocation and switch selection. In terms of topology design, Tabu search algorithm is introduced to select the components that play the main role. For RIS switch selection, greedy algorithm is used to turn off the RISs that play the secondary role. Finally, an iterative optimization algorithm with high data-rate and low power consumption is proposed. The simulation results show that the performance of the irregular RIS aided system with topology design and RIS selection is better than that of the fixed topology and the fix number of RISs. In addition, the proposed joint optimization algorithm can effectively improve the data rate and energy efficiency by changing the propagation environment.

• Journal of the Korea Society for Simulation
• /
• v.22 no.4
• /
• pp.149-156
• /
• 2013

In this research, we dealt with an optimization problem which aims to minimize total cost of resources usage and network routing in a smart node environment. Toward this, we briefly introduced technology trends in smart nodes, methods in resource optimization fields, economic effects of smart network and content delivery (or distribution) network (CDN). Moreover, based on CDN we proposed and implemented a mathematical (mixed integer) programming model to combine replica placement and requests distribution problem (RPRDP) and routing problem. Computational result of an example on RPRDP+Routing problem is also provided.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.7
• /
• pp.684-692
• /
• 2010

Based on the planar restricted three body problem formulation, optimized trajectories for the Earth-Moon transfer are obtained. Mixed impulsive and continuous thrust are assumed to be used, respectively, during the Earth departure and Earth-Moon transfer/Moon capture phases. The continuous, dynamic trajectory optimization problem is reformulated in the form of discrete optimization problem by using the method of direct transcription and collocation, and then is solved using the nonlinear programming software. Representative results show that the shape of optimized trajectory near the Earth departure and the Moon capture phases is dependent upon the relative weight between the impulsive and the continuous thrust.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.3
• /
• pp.490-498
• /
• 2013

This paper discusses the application of evolutionary multi-objective optimization algorithms namely Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and Modified NSGA-II (MNSGA-II) for solving the Combined Economic Emission Dispatch (CEED) problem with valve-point loading. The valve-point loading introduce ripples in the input-output characteristics of generating units and make the CEED problem as a non-smooth optimization problem. IEEE 57-bus and IEEE 118-bus systems are taken to validate its effectiveness of NSGA-II and MNSGA-II. To compare the Pareto-front obtained using NSGA-II and MNSGA-II, reference Pareto-front is generated using multiple runs of Real Coded Genetic Algorithm (RCGA) with weighted sum of objectives. Furthermore, three different performance metrics such as convergence, diversity and Inverted Generational Distance (IGD) are calculated for evaluating the closeness of obtained Pareto-fronts. Numerical results reveal that MNSGA-II algorithm performs better than NSGA-II algorithm to solve the CEED problem effectively.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.150-159
• /
• 2009

The heterogeneous fleet vehicle routing problem(HVRP) is a variant of the classical vehicle routing problem in which customers are served by a heterogeneous fleet of vehicles with various capacities, fixed costs and variable costs. We propose a new conceptual HVRPCR(HVRP with customer restriction) model including additional customer restrictions in HVRP. In this paper, we develop hybrid particle swarm optimization(HPSO) algorithm with 2-opt and node exchange technique for HVRP. The solution representation is a n-dimensional particle for HVRP with N customers. The decoding method for this representation starts with the transformation of particle into a priority list of customer to enter route and limit of vehicle to serve each customer. The vehicle routes are then constructed based on the customer priority list and limit of vehicle to serve. The proposed algorithm is tested using 8 benchmark problems and it consistently produces high-quality solutions, including new best solutions. The numerical results show that the proposed algorithm is robust and efficient.

• Computers and Concrete
• /
• v.12 no.4
• /
• pp.553-563
• /
• 2013

The present study aims to show how the problem of reproducing, as closely as possible, binders of historic mortars by mixing raw materials which are commercially available, can be formulated as a linear optimization problem. The study points out that by mixing five standard raw materials (end-members) it is possible to obtain mortar binders with the almost same chemical compositions of those determined on the historic and archaeological mortar samples studied in some recent scientific papers. An advanced function of the Microsoft Excel spreadsheet, the Solver add-in, was used for the calculation of the right amount of each raw material to be mixed for producing the new binders. This approach could be useful to provide an optimal solution in the process of restoration of ancient monuments, where it is necessary to replace the historic mortars with new highly compatible repair mortars.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1286-1302
• /
• 2012

In this paper, the resource allocation problem with proportional fairness rate in cognitive OFDM-based wireless network is studied. It aims to maximize the total system throughput subject to constraints that include total transmit power for secondary users, maximum tolerable interferences of primary users, bit error rate, and proportional fairness rate among secondary users. It is a nonlinear optimization problem, for which obtaining the optimal solution is known to be NP-hard. An efficient bio-inspired suboptimal algorithm called immune clonal optimization is proposed to solve the resource allocation problem in two steps. That is, subcarriers are firstly allocated to secondary users assuming equal power assignment and then the power allocation is performed with an improved immune clonal algorithm. Suitable immune operators such as matrix encoding and adaptive mutation are designed for resource allocation problem. Simulation results show that the proposed algorithm achieves near-optimal throughput and more satisfying proportional fairness rate among secondary users with lower computational complexity.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.6
• /
• pp.1389-1403
• /
• 1993

A procedure has be developed to optimize the product's tipping position in designing a die face for manufacturing automobile outer panels. Two design requirements are considered in optimizing the tipping position. One is to satisfy that all the points on the product should have a uniform distribution of drawing depths. The other is to guarantee that the user-specified area on the product should first contact with the binder wrap. The problem to satisfy the design requirements described above is analogous to the flatness calculation problem in the area of metrology if some constraints can be imposed. Thus the problem can be solved by the simulated annealing method, which is one of the optimization methods. The developed procedure was tested with the real die face design problem and the usefulness was verified by the diagram of the drawing depth.