• 대한산업공학회지
• /
• 제43권1호
• /
• pp.1-11
• /
• 2017

Stochastic resource-constrained project scheduling problem is an extension of resource-constrained project scheduling problem such that activity duration has stochastic nature. In real situation where activity duration is not known until the activity is finished, open-loop based static policies such as activity-based policy and priority-based policy will not well cope with duration variability. Then, a dynamic policy based on closed-loop decision making will be regarded as an alternative toward achievement of minimal makespan. In this study, a dynamic policy designed to select activities to start at each decision time point is illustrated. The performance of static and dynamic policies based on variable neighborhood search is evaluated under the discrete-event simulation environment. Experiments with J120 sets in PSPLIB and several probability distributions of activity duration show that the dynamic policy is superior to static policies. Even when the variability is high, the dynamic policy provides stable and good solutions.

• 한국경영과학회지
• /
• 제41권1호
• /
• pp.41-53
• /
• 2016

Static repositioning is a well-known and commonly used strategy to maximize customer satisfaction in public bike-sharing systems. Repositioning is performed by trucks at night when no customers are in the system. In models that represent the static repositioning problem, the decision variables are truck routes and the number of bikes to pick up and deliver at each rental station. To simplify the problem, the decision on the number of bikes to pick up and deliver is implicitly included in the truck routes. Two relocation-based local search algorithms (1-relocate and 2-relocate) with the best-accept strategy are incorporated into a variable neighborhood search (VNS) to obtain high-quality solutions for the problem. The performances of the VNS algorithm with the effect of local search algorithms and shaking strength are evaluated with data on Tashu public bike-sharing system operating in Daejeon, Korea. Experiments show that VNS based on the sequential execution of two local search algorithms generates good, reliable solutions.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.29-36
• /
• 2009

We present two local-search based metaheuristics for the multi-source capacitated facility location problem. In such a problem, each customer's demand can be supplied by one or more facilities. The problem is NP-hard and the number of locations in the optimal solution is unknown. To keep the search process effective, the proposed methods adopt the following features: (1) a multi-exchange neighborhood structure, (2) a tabu list that keeps track of recently visited solutions, and (3) a multi-start to enhance the diversified search paths. The transportation simplex method is applied in an efficient manner to obtain the optimal solutions to neighbors of the current solution under the algorithm framework. Two in-and-out selection rules are also proposed in the algorithms with the purpose of finding promising solutions in a short computational time. Our computational results for some of the benchmark instances, as well as some instances generated using a method in the literature, have demonstrated the effectiveness of this approach.

• 한국산업정보학회논문지
• /
• 제27권1호
• /
• pp.37-48
• /
• 2022

본 연구에서는 공학설계 최적화 문제 해결을 위한 혼합 메타휴리스틱(Hybrid Meta-heuristic) 접근법을 제안된다. 공학 설계 최적화 문제는 다양한 형태의 변수를 가지며, 복잡한 제약조건들하에서 그 최적해를 구하는 문제로 이미 많은 기존 연구들을 통해 다양한 접근법들이 개발되어져 왔다. 하지만 그 효율성은 아직까지 크게 개선되지 못하고 있는 실정이다. 따라서 본 연구에서는 이러한 효율성을 개선하기 위한 새로운 접근법을 제안한다. 제안된 혼합 메타휴리스틱 접근법은 탐색 공간에 대한 전역적 탐색을 위해 유전알고리즘(Genetic Algorithm: GA) 접근법, 지역적 탐색을 위해 변동이웃탐색(Variable Neighborhood Search: VNS) 접근법과 언덕오르기(Hill Climbing: HC) 접근법을 혼합(GA-VNS-HC)하였다. 사례 연구에서는 다양한 형태의 공학설계 최적화 문제를 이용하여 본 연구에서 제안한 GA-VNS-HC 접근법의 우수성을 입증하였다.

• 산업경영시스템학회지
• /
• 제44권2호
• /
• pp.36-42
• /
• 2021

This paper deals with a vehicle routing problem with resource repositioning (VRPRR) which is a variation of well-known vehicle routing problem with pickup and delivery (VRPPD). VRPRR in which static repositioning of public bikes is a representative case, can be defined as a multi-objective optimization problem aiming at minimizing both transportation cost and the amount of unmet demand. To obtain Pareto sets for the problem, famous multi-objective optimization algorithms such as Strength Pareto Evolutionary Algorithm 2 (SPEA2) can be applied. In addition, a linear combination of two objective functions with weights can be exploited to generate Pareto sets. By varying weight values in the combined single objective function, a set of solutions is created. Experiments accomplished with a standard benchmark problem sets show that Variable Neighborhood Search (VNS) applied to solve a number of single objective function outperforms SPEA2. All generated solutions from SPEA2 are completely dominated by a set of VNS solutions. It seems that local optimization technique inherent in VNS makes it possible to generate near optimal solutions for the single objective function. Also, it shows that trade-off between the number of solutions in Pareto set and the computation time should be considered to obtain good solutions effectively in case of linearly combined single objective function.

• Journal of Advanced Marine Engineering and Technology
• /
• 제40권2호
• /
• pp.138-145
• /
• 2016

This paper proposes an improved tabu search method for subset selection in multiple linear regression models. Variable selection is a vital combinatorial optimization problem in multivariate statistics. The selection of the optimal subset of variables is necessary in order to reliably construct a multiple linear regression model. Its applications widely range from machine learning, timeseries prediction, and multi-class classification to noise detection. Since this problem has NP-complete nature, it becomes more difficult to find the optimal solution as the number of variables increases. Two typical metaheuristic methods have been developed to tackle the problem: the tabu search algorithm and hybrid genetic and simulated annealing algorithm. However, these two methods have shortcomings. The tabu search method requires a large amount of computing time, and the hybrid algorithm produces a less accurate solution. To overcome the shortcomings of these methods, we propose an improved tabu search algorithm to reduce moves of the neighborhood and to adopt an effective move search strategy. To evaluate the performance of the proposed method, comparative studies are performed on small literature data sets and on large simulation data sets. Computational results show that the proposed method outperforms two metaheuristic methods in terms of the computing time and solution quality.

• 산업경영시스템학회지
• /
• 제43권2호
• /
• pp.79-86
• /
• 2020

To make a satisfactory decision regarding project scheduling, a trade-off between the resource-related cost and project duration must be considered. A beneficial method for decision makers is to provide a number of alternative schedules of diverse project duration with minimum resource cost. In view of optimization, the alternative schedules are Pareto sets under multi-objective of project duration and resource cost. Assuming that resource cost is closely related to resource leveling, a heuristic algorithm for resource capacity reduction (HRCR) is developed in this study in order to generate the Pareto sets efficiently. The heuristic is based on the fact that resource leveling can be improved by systematically reducing the resource capacity. Once the reduced resource capacity is given, a schedule with minimum project duration can be obtained by solving a resource-constrained project scheduling problem. In HRCR, VNS (Variable Neighborhood Search) is implemented to solve the resource-constrained project scheduling problem. Extensive experiments to evaluate the HRCR performance are accomplished with standard benchmarking data sets, PSPLIB. Considering 5 resource leveling objective functions, it is shown that HRCR outperforms well-known multi-objective optimization algorithm, SPEA2 (Strength Pareto Evolutionary Algorithm-2), in generating dominant Pareto sets. The number of approximate Pareto optimal also can be extended by modifying weight parameter to reduce resource capacity in HRCR.

• 한국산학기술학회논문지
• /
• 제18권12호
• /
• pp.126-134
• /
• 2017

심전도(ECG) 신호에서 R-피크를 추출하는 기법에 대하여 많은 연구가 진행 되어 왔으며, 다양한 방법으로 구현되어 왔다. 그러나 이러한 검출 방법 대부분은 실시간 휴대용 심전도 장치에서 구현하기가 복잡하고 어려운 단점이 있다. R-피크 검출을 위해서는 심전도 데이터에 대하여 베이스라인 드리프트 및 상용전원 잡음 제거 등의 적절한 전처리 및 후가공이 필요하며, 특히 적응형 필터를 활용한 기법에서는 적절한 임계값을 선택하는 것이 중요하다. 적응형 필터의 임계값을 추출하는 방식에서는 고정형(Fixed) 및 적응형(adaptive)으로 구분할 수 있다. 고정 임계 값 추출 방식은 고정된 임계값 보다 낮은 값의 입력이 들어오는 경우에 R-피크 값을 감지하지 못하는 경우가 있으며, 적응 임계값 추출 방식은 때때로 잡음에 의한 잘못된 임계값을 도출하여, 다른 파형(P혹은 T파)의 피크를 감지하는 경우도 나타난다. 본 논문에서는 계산상의 복잡성이 적고, 코드 구현이 단순하면서도 잡음에 강인한 R-피크 검출 알고리즘을 제안한다. 제안된 방식은 앞서 설명한 임계값 추출 문제를 해결하기 위해서, 적응형 필터를 사용해, 심전도 신호에서 베이스 라인 드리프트 제거를 하여 적절한 임계값을 계산하도록 한다. 그리고 필터 처리된 심전도 신호의 최소 값과 최대 값을 사용하여 적절한 임계값이 자동으로 추출 되도록 한다. 그런 다음 심전도 신호로부터 R-피크를 검출하기 위해 임계값 아래에서 'neighborhood searching' 기법이 적용된다. 제안된 방법은 R-피크 검출의 정확도를 향상시키고, 계산 량을 줄여 검출 속도가 보다 빨라지도록 하였다. 다음으로 R-피크 값이 검출 되면, R-R interval 등의 값을 이용해 심박 수를 계산할 수 있도록 한다. 실험결과 심박 수 검출 정확도와 감도가 약 100%로 매우 높았음을 확인할 수 있었다.