• Industrial Engineering and Management Systems
• /
• 제11권3호
• /
• pp.288-298
• /
• 2012

Lot sizing and shipment scheduling are two interrelated decisions made by a manufacturing plant and a third-party logistics distribution center. This paper analyzes a dynamic inbound ordering problem and shipment problem with a freight container cost, in which the order size of multiple products and single container type are simultaneously considered. In the problem, each ordered product placed in a period is immediately shipped by some freight containers in the period, and the total freight cost is proportional to the number of containers employed. It is assumed that the load size of each product is equal and backlogging is not allowed. The objective of this study is to simultaneously determine the lot-sizes and the shipment schedule that minimize the total costs, which consist of production cost, inventory holding cost, and freight cost. Because the problem is NP-hard, we propose three meta-heuristic algorithms: a simulated annealing algorithm, a genetic algorithm, and a new population-based evolutionary meta-heuristic called self-evolution algorithm. The performance of the meta-heuristic algorithms is compared with a local search heuristic proposed by the previous paper in terms of the average deviation from the optimal solution in small size problems and the average deviation from the best one among the replications of the meta-heuristic algorithms in large size problems.

• International Journal of Precision Engineering and Manufacturing
• /
• 제2권2호
• /
• pp.65-72
• /
• 2001

The design of multi-stage gear drives is a time-consuming process, since on includes more complicated problems, which are not considered in the design of single-stage gear drives. The designer has th determine the number of reduction stages and the gear ratios of each reduction state. In addition, the design problems include not only the dimensional design but also the configuration design of gear drive elements. There is no definite rule and principle for these types of design problems. Thus the design practices largely depend on the sense and the experiences of the designer , and consequently result in undesirable design solution. We propose a new generalized design algorithm to support the designer at the preliminary design phase of multi-stage gear drives. The proposed design algorithm automates the design process by integrating the dimensional design and the configuration design process. The algorithm consists of four steps. In the first step, a designer determines the number of reduction stage. In the second step. gear ratios se chosen by using the random search method. In the third step, the values of basic design parameter are chosen by using the generate and test method. Then, the values of other dimension, such ad pitch diameter, outer diameter, and face width, are calculated for the configuration design in the final step. The strength and durability of a gear is guaranteed by the bending strength and the pitting resistance rating practices by using the AGMA rating formulas. In the final step, the configuration design is carried out b using the simulated annealing algorithm. The positions of gears and shafts are determined to minimize the geometrical volume(size) of a gearbox, while satisfying spatial constraints between them. These steps are carried out iteratively until a desirable solution is acquired. The propose design algorithm has been applied to the preliminary design of four-stage gear drives in order to validate the availability. The design solution have shown considerably good results in both aspects of the dimensional and the configuration design.

• 지질공학
• /
• 제25권1호
• /
• pp.67-81
• /
• 2015

선형 또는 군집형으로 배치된 양수정 배열 조건에서 최적의 복수 주입정 위치를 결정하는 최적화 프로그램을 개발하였다. 다양한 목적함수를 제시하였으며 담금질모사 기법을 이용하여 목적함수를 만족시키는 주입정의 최적 위치를 평가하였다. 주입수의 회수율의 최대화를 목적함수로 설정할 경우, 우물 배열에 관계없이 두 개의 주입정을 모두 우물 군집 내부에 설치하는 것이 가장 효율적인 것으로 나타났다. 회수율의 최대화와 동시에 기존 양수정의 양수량을 고르게 증가시키는 통합목적함수를 고려하여 두 개의 주입정을 설치할 경우, 우물 배열에 관계없이 우물 배열의 양측면부가 주입정 위치로 적합한 것으로 분석되었다. 주입정 위치 최적화를 위한 다수의 시나리오 분석 결과, 최적의 결과에 근접하는 지역적 최솟값 또는 최댓값이 다수 존재하는 것으로 나타났으며, 이는 주입정의 최적 위치를 현장의 조건에 맞게 선택적으로 결정할 수 있는 개연성이 존재하는 것을 의미한다. 결론적으로, 본 연구는 담금질모사 기법이 다양한 목적함수에 부합하는 복수 주입정의 최적 위치 평가에 성공적으로 이용될 수 있음을 보여 주었다.

• Advances in Computational Design
• /
• 제1권4호
• /
• pp.315-327
• /
• 2016

Damage detection and localisation in structures is essential since it can be a means for preventive maintenance of those structures under service conditions. The use of structural modal data for detecting the damage is one of the most efficient methods. This paper presents comparative performance of various state-of-the-art meta-heuristics for use in structural damage detection based on changes in modal data. The metaheuristics include differential evolution (DE), artificial bee colony algorithm (ABC), real-code ant colony optimisation (ACOR), charged system search (ChSS), league championship algorithm (LCA), simulated annealing (SA), particle swarm optimisation (PSO), evolution strategies (ES), teaching-learning-based optimisation (TLBO), adaptive differential evolution (JADE), evolution strategy with covariance matrix adaptation (CMAES), success-history based adaptive differential evolution (SHADE) and SHADE with linear population size reduction (L-SHADE). Three truss structures are used to pose several test problems for structural damage detection. The meta-heuristics are then used to solve the test problems treated as optimisation problems. Comparative performance is carried out where the statistically best algorithms are identified.

• 전자공학회논문지C
• /
• 제35C권12호
• /
• pp.23-30
• /
• 1998

본 논문에서는 시스템 수준에서의 전력 최적화를 위한 한가지 방법으로 부분 버스 반전 부호화를 제안한다. 제안하는 방법에서는 버스 부호화가 버스선의 일부분에만 행해지는데, 이것은 버스선 전체를 부호화 함으로써 필요 없는 버스반전이 생기는 것을 피하기 위해서이다. 부분 버스 반전화를 위해서는 어떠한 버스선들을 선택하여 부호화하는가가 중요한데, 본 논문에서는 이러한 선택을 위한 알고리즘을 제안한다. 벤치마크 예제를 통한 모의 실험에서 부분 버스 반전 부호화 방법을 사용해 버스의 천이수를 평균 62.6% 줄일 수 있다는 것을 보였다. 또한 제안한 알고리즘의 성능을 평가하기 위해 시뮬레이티드 어닐링 방법과 비교하였다.

• Structural Engineering and Mechanics
• /
• 제60권5호
• /
• pp.795-807
• /
• 2016

This study tries to examine the effect of different parameters on stress analysis of infinite plates with central quasi-triangular cutout using particle swarm optimization (PSO) algorithm and also an attempt has been made to introduce general optimum parameters in order to achieve the minimum amount of stress concentration around this type of cutout on isotropic and orthotropic plates. Basis of the presented method is expansion of analytical method conducted by Lekhnitskii for circular and elliptical cutouts. Design variables in this study include fiber angle, load angle, curvature radius of the corner of the cutout, rotation angle of the cutout and at last material of the plate. Also, diagrams of convergence and duration time of the desired problem are compared with Simulated Annealing algorithm. Conducted comparison is indicative of appropriateness of this method in optimization of the plates. Finite element numerical solution is employed to examine the results of present analytical solution. Overlap of the results of the two methods confirms the validity of the presented solution. Results show that by selecting the aforementioned parameters properly, less amounts of stress can be achieved around the cutout leading to an increase in load-bearing capacity of the structure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4197-4219
• /
• 2017

Cloud computing is a new service to provide dynamic, scalable virtual resource services via the Internet. Cloud market is available to multiple cloud computing resource providers and users communicate with each other and participate in market transactions. However, since cloud computing is facing with more and more security issues, how to complete the allocation process effectively and securely become a problem urgently to be solved. In this paper, we firstly analyze the cloud resource allocation problem and propose a mathematic model based on combinatorial double auction. Secondly, we introduce a trust evaluation mechanism into our model and combine genetic algorithm with simulated annealing algorithm to increase the efficiency and security of cloud service. Finally, by doing the overall simulation, we prove that our model is highly effective in the allocation of cloud resources.

• 해양환경안전학회지
• /
• 제1권2호
• /
• pp.69-82
• /
• 1995

This study is concerned with developing a heuristic algorithm for solving a class of ninlinear integer programs(NLIP). Exact algrithm for solving a NLIP either may not exist, or may take an unrealistically large amount of computing time. This study develops a new heuristic, the Excursion Algorithm(EA), for solving a class of NLIP's. It turns out that excursions over a bounded feasible and/or infeasible region is effective in alleviation the risks of being trapped at a lical optimum. The developed EA is applied to the redundancy optimization problems for improving the system safety, and is compared with other existing heuristic methods. We also include simulated annealing(SA) method in the comparision experiment due to ist populatrity for solving complex combinatorial problems. Computational results indicate that the proposed EA performs consistently better than the other in terms of solution quality, with moderate increase in computing time. Therefore, the proposed EA is believed to be an attractive alternative to other heuristic methods.

• 통합자연과학논문집
• /
• 제3권1호
• /
• pp.49-53
• /
• 2010

Molecular docking is a critical event which mostly forms Van der waals complex in molecular recognition. Since the majority of developed drugs are small molecules, docking them into proteins has been a prime concern in drug discovery community. Since the binding pose space is too vast to cover completely, many search algorithms such as genetic algorithm, Monte Carlo, simulated annealing, distance geometry have been developed. Proper evaluation of the quality of binding is an essential problem. Scoring functions derived from force fields handle the ligand binding prediction with the use of potential energies and sometimes in combination with solvation and entropy contributions. Knowledge-based scoring functions are based on atom pair potentials derived from structural databases. Forces and potentials are collected from known protein-ligand complexes to get a score for their binding affinities (e.g. PME). Empirical scoring functions are derived from training sets of protein-ligand complexes with determined affinity data. Because non of any single scoring function performs generally better than others, some other approaches have been tried. Although numerous scoring functions have been developed to locate the correct binding poses, it still remains a major hurdle to derive an accurate scoring function for general targets. Recently, consensus scoring functions and target specific scoring functions have been studied to overcome the current limitations.

• 제어로봇시스템학회논문지
• /
• 제4권2호
• /
• pp.256-263
• /
• 1998

Among process synthesis problems, the heat exchanger network (HEN) has been subjected to the most concentrated effort because this kind of problems was well defined for solving it and 20-30% energy savings could be realized in the present chemical processes. In this paper, we use an evolutionary approach for HEN synthesis because this approach can overcome the local optimum and combine some heuristic rules. The basic evolutionary approach is composed of three parts, that is, initialization step, growth step and mutation step, as in the simulated annealing and genetic algorithm. This algorithm uses the ecological rule that a better cell will live and worse cell should decompose after repeated generations. With this basic concept, a new procedure is developed and a more efficient method is proposed to generate initial solutions. Its effectiveness is shown using test examples.