• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.3
• /
• pp.201-207
• /
• 2018

There is no known polynomial time algorithm for random-type quadratic assignment problem(RQAP) that is a NP-complete problem. Therefore the heuristic or meta-heuristic approach are solve the approximated solution for the RQAP within polynomial time. This paper suggests polynomial time algorithm for random type quadratic assignment problem (QAP) with time complexity of $O(n^2)$. The proposed algorithm applies one-to-one matching strategy between ascending order of sum of distance for each location and descending order of sum of quantity for each facility. Then, swap the facilities for reflect the correlation of distances of locations and quantities of facilities. For the experimental data, this algorithm, in spite of $O(n^2)$ polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.175-181
• /
• 2014

This paper suggests O(m) polynomial time heuristic algorithm to obtain the solution for the driver scheduling problem, DSP, that has been classified as NP-complete problem. The proposed algorithm gets the initial assignment of n minimum number of drivers from given m schedules. Nextly, this algorithm gets the minimum total time (TC) using 5 rules of swap and insert for decrease of over times (OT) and idle times (IT). Although this algorithm is a heuristic polynomial time algorithm with O(m) time complexity rules to be find a optimal (or approximate) solution, this algorithm is equal to metaheuristic methods for the 5 experimental data. To conclude, this paper shows the DSP is not NP-complete problem but Polynomial time (P)-problem with polynomial time rules.

• Advances in Computational Design
• /
• v.1 no.1
• /
• pp.87-103
• /
• 2016

This paper adopts and investigates the non-dominated sorting approach for extending the single-objective Cuckoo Search (CS) into a multi-objective framework. The proposed approach uses an archive composed of primary and secondary population to select and keep the non-dominated solutions at each generation instead of pairwise analogy used in the original Multi-objective Cuckoo Search (MOCS). Our simulations show that such a low computational complexity approach can enrich CS to incorporate multi-objective needs instead of considering multiple eggs for cuckoos used in the original MOCS. The proposed MOCS is tested on a set of multi-objective optimization problems and two well-studied engineering design optimization problems. Compared to MOCS and some other available multi-objective algorithms such as NSGA-II, our approach is found to be competitive while benefiting simplicity. Moreover, the proposed approach is simpler and is capable of finding a wide spread of solutions with good coverage and convergence to true Pareto optimal fronts.

• Transactions on Electrical and Electronic Materials
• /
• v.18 no.6
• /
• pp.345-349
• /
• 2017

Reconfiguration is an important method to minimize power loss and load interruption by creating an optimal configuration of a system. Furthermore, by increasing demand and value of consumption, construction of new power plants can be postponed in networks by reconfiguration and proper arrangement of linkage switches. This method is feasible for radial networks, which create meshes of linkage switches. One convenient way to achieve a system with minimal power loss and interruption is to utilize capacitors. Optimal placement and sizing of capacitors in such applications is an important issue in the literature. In this paper, cat swarm optimization is introduced as a new metaheuristic algorithm to achieve this purpose. Simulation has been carried out in two feasible networks, 69-bus and 33-bus systems.

• Advances in Computational Design
• /
• v.1 no.2
• /
• pp.175-194
• /
• 2016

Nature has provided inspiration for most of the man-made technologies. Scientists believe that dolphins are the second to humans in smartness and intelligence. Echolocation is the biological sonar used by dolphins for navigation and hunting in various environments. This ability of dolphins is mimicked in this paper to develop a new optimization method. Dolphin Echolocation Optimization (DEO) is an optimization method based on dolphin's approach for hunting food and exploration of environment. DEO has already been developed for discrete optimization search space and here it is extended to continuous search space. DEO has simple rules and is adjustable for predetermined computational cost. DEO provides the optimum results and leads to alternative optimality curves suitable for the problem. This algorithm has a few parameters and it is applicable to a wide range of problems like other metaheuristic algorithms. In the present work, the efficiency of this approach is demonstrated using standard benchmark problems.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.147-148
• /
• 2018

네트워크 제어 기능과 데이터 전송 기능을 물리적으로 분리하는 SDN 기술을 광범위하게 구현하기 위해서는 분산된 다중 컨트롤러가 필요하다. 이를 효과적으로 구현하기 위해 최적화 문제를 푸는 데 적합한 메타휴리스틱 알고리즘 중 하나인 타부 서치 알고리즘에 관해 설명하였다.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.3
• /
• pp.119-124
• /
• 2014

Let G = (V, E) be a graph. Maximum Bipartite Subgraph Problem is to convert a graph G into a bipartite graph by removing minimum number of edges. This problem belongs to NP-complete; hence, in this research, we are suggesting a new metaheuristic algorithm which combines Tabu search and GRASP.

• Structural Engineering and Mechanics
• /
• v.76 no.6
• /
• pp.781-797
• /
• 2020

In recent years, there is an increasing interest to optimize the fuzzy logic controller with different methods. This paper focuses on the optimization of a fuzzy logic controller applied to a seismically excited nonlinear building. In most cases, this problem is formulated based on the linear behavior of the structure, however in this paper, four sets of objective functions are considered with respect to the nonlinear responses of the structure as the peak interstory drift ratio, the peak level acceleration, the ductility factor and the maximum control force. The Improved Charged System Search is used to optimize the membership functions and the rule base of the fuzzy controller. The obtained results of the optimized and the non-optimized fuzzy controllers are compared to the uncontrolled responses of the structure. Also, the performance of the utilized method is compared with various classical and advanced optimization algorithms.

• Steel and Composite Structures
• /
• v.47 no.4
• /
• pp.513-521
• /
• 2023

The goal of this work is to create a new and improved GWO (Grey Wolf Optimizer), the so-called Robot GWO (RGWO), for dynamic and static target tracking involving multiple robots in unknown environmental conditions. From applying ourselves with the Gray Wolf Optimization Algorithm (GWO) and how it works, as the name suggests, it is a nature-inspired metaheuristic based on the behavior of wolf packs. Like other nature-inspired metaheuristics such as genetic algorithms and firefly algorithms, we explore the search space to find the optimal solution. The results also show that the improved optimal control method can provide superior power characteristics even when operating conditions and design parameters are changed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.1
• /
• pp.1-9
• /
• 2009

OFDM(Orthogonal Frequency Division Multiplexing) system is robust to frequency selective fading and narrowband interference in high-speed data communications. However, an OPDM signal consists of a number of independently modulated subcarriers and the superposition of these subcarriers causes a problem that can give a large PARR(Peak-to-Average Power Ratio). PTS(Partial Transmit Sequence) scheme can reduce the PAPR by dividing OFDM signal into subblocks and then multiplying the phase weighting factors to each subblocks, but computational complexity for selecting of phase weighting factors increases exponentially with the number of subblocks. Therefore, in this paper, MG-PSO(Modified Greedy algorithm-Particle Swarm Optimization) algorithm that combines modified greedy algorithm and PSO(Particle Swarm Optimization) algorithm is proposed to use for the phase control method in PTS scheme. This method can solve the computational complexity and guarantee to reduce PAPR. We analyzed the performance of the PAPR reduction when we applied the proposed method to telecommunication systems.