• Structural Engineering and Mechanics
• /
• 제71권2호
• /
• pp.139-151
• /
• 2019

In a project schedule, it is possible to reduce the time required to complete a project by allocating extra resources for critical activities. However, accelerating a project causes additional expense. This issue is addressed by finding optimal set of time-cost alternatives and is known as the time-cost trade-off problem in the literature. The aim of this study is to identify the optimal set of time-cost alternatives using a multiobjective teaching-learning-based optimization (TLBO) algorithm integrated with the non-dominated sorting concept and is applied to successfully optimize the projects ranging from a small to medium large projects. Numerical simulations indicate that the utilized model searches and identifies optimal / near optimal trade-offs between project time and cost in construction engineering and management. Therefore, it is concluded that the developed TLBO-based multiobjective approach offers satisfactorily solutions for time-cost trade-off optimization problems.

• 산업경영시스템학회지
• /
• 제42권1호
• /
• pp.8-20
• /
• 2019

The vehicle routing problem is one of the vibrant research problems for half a century. Many studies have extensively studied the vehicle routing problem in order to deal with practical decision-making issues in logistics. However, developments of new logistics strategies have inevitably required investigations on solution methods for solving the problem because of computational complexity and inherent constraints in the problem. For this reason, this paper suggests a simulated annealing (SA) algorithm for a variant of vehicle routing problem introduced by a previous study. The vehicle routing problem is a multi-depot and multi-trip vehicle routing problem with multiple heterogeneous vehicles restricted by the maximum permitted weight and the number of compartments. The SA algorithm generates an initial solution through a greedy-type algorithm and improves it using an enhanced SA procedure with three local search methods. A series of computational experiments are performed to evaluate the performance of the heuristic and several managerial findings are further discussed through scenario analyses. Experiment results show that the proposed SA algorithm can obtain good solutions within a reasonable computation time and scenario analyses show that a transportation system visiting non-dedicated factories shows better performance in truck management in terms of the numbers of vehicles used and trips for serving customer orders than another system visiting only dedicated factories.

• 한국정보통신학회논문지
• /
• 제12권9호
• /
• pp.1689-1695
• /
• 2008

저전력 무선 통신의 발전과 다기능, 저가의 스마트 센서는 원격에서 상태정보를 감지할 수 있는 센서네트워크의 실현을 가능하게 하였다. 센서 노드는 소형 배터리를 사용해 에너지를 공급받는데 일반적으로 배터리 교환이 용이하지 않은 위치에 설치되기 때문에 센서 노드의 평균 소모 전력을 최소화할 필요가 있다. 알려진 바에 따르면 센서 노드의 전체 소모 전력의 20-60%를 무선 통신에 사용하는 RF 모듈이 차지하고 있다. 본 논문에서는 센싱된 데이터의 송신에 소비되는 에너지를 개선하기 위해 센싱 데이터의 변동 특성에 실시간 적응하여 확률적 계산값이 임의의 랜덤값보다 클 경우 기지국 노드로 전송하는 확률추론 휴리스틱기반 비주기적 전송 방법을 제안한다. 제안하는 전송 방법에서는 확률추론 휴리스틱 알고리즘에 따라 센싱된 데이터와 직전 센싱된 데이터를 평가하여 전송 여부를 결정하며 알고리즘에 필요한 계수값은 알고리즘 검증 데이터의 재현율을 통하여 결정한다.

• Nuclear Engineering and Technology
• /
• 제55권2호
• /
• pp.452-459
• /
• 2023

The core power control is an important issue for the study of dynamic characteristics in China initiative accelerator driven subcritical system (CiADS), which has direct impact on the control strategy and safety analysis process. The CiADS is an experimental facility that is only controlled by the proton beam intensity without considering the control rods in the current engineering design stage. In order to get the optimized operation scheme with the stable and reliable features, the variation of beam intensity using the continuous and periodic control approaches has been adopted, and the change of collimator and the adjusting of duty ratio have been proposed in the power control process. Considering the neutronics and the thermal-hydraulics characteristics in CiADS, the physical model for the core power control has been established by means of the point reactor kinetics method and the lumped parameter method. Moreover, the multi-inputs single-output (MISO) logical structure for the power control process has been constructed using proportional integral derivative (PID) controller, and the meta-heuristic algorithm has been employed to obtain the global optimized parameters for the stable running mode without producing large perturbations. Finally, the verification and validation of the control method have been tested based on the reference scenarios in considering the disturbances of spallation neutron source and inlet temperature respectively, where all the numerical results reveal that the optimization method has satisfactory performance in the CiADS core power control scenarios.

• 한국인터넷방송통신학회논문지
• /
• 제13권5호
• /
• pp.173-181
• /
• 2013

본 논문은 복합상품 운송 문제의 최적해를 구하는 단순한 발견적 방법을 제안한다. 제안 알고리즘은 첫 번째로, 복합상품 중개운송 문제인 경우 일반적인 운송 문제로 변환시킨다. 이 과정에서 중개지를 공급지로, 중개지의 수용량 제약조건을 공급량으로 치환한다. 다음으로 단일 상품으로 분해한다. 두 번째로, 복합상품 운송문제인 경우 상품별로, 복합상품 중개운송 문제인 경우는 직접 열 (수요지) 기준으로 최소 비용을 선택한다. 행 (공급지) 기준으로 선택된 비용 오름차순으로 공급량, 수용량과 요구량 제약조건을 만족하도록 수송량을 배정한다. 주어진 요구량을 모두 만족할 때까지 이 과정을 반복한다. 이렇게 얻은 초기해에 대해 세 번째로, 수송비용을 감소시킬 수 있는 조건을 만족하면 배정량을 조정한다. 이와 같이 단순한 알고리즘을 2개의 복합상품 운송 문제와 3개의 복합상품 중개운송 문제에 적용한 결과, 선형계획법으로 최적해를 제시한 3개 문제 중 2개 문제에서 최적해를 개선하는 효과를 얻었다. 결국, 제안된 알고리즘은 선형계획법을 적용하는 방법보다 좋은 알고리즘으로 판명되었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
• /
• pp.161-164
• /
• 2000

We propose the genetic algorithm to apply three kinds of FFT data flows to be considered the overhead for the data exchange between processors that have the multi-scheduling problem on parallel computer In the design of genetic algorithm, we propose the chromosome representation which can simply encode and decode a solution without any heuristic information, the evaluation function to be considered an efficiency of processor, and the genetic operator to inherit a superior gene from their parents. And we saw that the simulation result can verify better performance than the existing algorithm(BEA : binary exchange algorithm)in the face of execution time.

• 산업공학
• /
• 제20권1호
• /
• pp.58-68
• /
• 2007

This research deals with a vehicle scheduling problem for the sludge collection strategies which might be solved via quantitative analysis and cost evaluations schemes. This problem can be modeled as a kind of capacitated vehicle routing pick-up problems. With the aim of establishing operation schedule of vehicles and analyzing the total cost under considering various assumptions and realistic restrictions of the sludge collection problem, we propose a heuristic method based on the genetic algorithm in conjunction with the sweep algorithm and the 4-opt algorithm. Finally, we present the cost effective operation schedule that can be used as the managing tool for the sludge treatment plant of the multi-purpose dam.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권4호
• /
• pp.188-196
• /
• 2001

This paper presents and efficient algorithm for the loss minimization by automatic sectionalizing switch operation in distribution systems. Ant colony algorithm is multi-agent system in which the behaviour of each single agent, called artificial ant, is inspired by the behaviour of real ants. Ant colony algorithm is suitable for combinatiorial optimization problem as network reconfiguration because it use the long term memory, called pheromone, and heuristic information with the property of the problem. The proposed methodology with some adoptions have been applied to improve the computation time and convergence property. Numerical examples demonstrate the validity and effectiveness of the proposed methodology using a KEPCO's distribution system.

• Advances in Computational Design
• /
• 제5권3호
• /
• pp.209-231
• /
• 2020

In order to evaluate the performance of three heuristic optimization algorithms, namely, simulated annealing (SA), genetic algorithm (GA) and particle swarm optimization (PSO) for optimal stacking sequence of laminated composite plates with respect to critical buckling load and non-dimensional natural frequencies, a multi-objective optimization procedure is developed using the weighted summation method. Classical lamination theory and first order shear deformation theory are employed for critical buckling load and natural frequency computations respectively. The analytical critical buckling load and finite element calculation schemes for natural frequencies are validated through the results obtained from literature. The comparative study takes into consideration solution and computational time parameters of the three algorithms in the statistical evaluation scheme. The results indicate that particle swarm optimization (PSO) considerably outperforms the remaining two methods for the special problem considered in the study.

• 산업경영시스템학회지
• /
• 제12권19호
• /
• pp.39-47
• /
• 1989

This paper considers a multi-stage flowshop scheduling Problem where the setup times of jots depend on immediately preceding jobs. Three heuristics algorithms, CAMPBELL, PEIDAN and CAMRING are proposed. The performance measure is a minimization of makespan. The parameters of simulation model are PS(ratio of the processing times to setup times), M(number of machines), and N(number of job). This simulation model for each algorithm is a 4$\times$3$\times$3 factorial design with 360 observations. The makespan of the proposed heuristic algorithms is compared with the optimal makespan obtained by the complete enumeration of schedules. This yardstick of comparison is defined as a relative error. The mean relative error of CAMPBELL, PEIDAN, and CAMRING algorithms are 4.353%, 7.908%, and 8.578% respectively. The SPSS, is used to analyse emphirical results. The experimental results show that the three factors are statistically significant at 5% level.