• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.63-70
• /
• 2013

Many real world optimization problems are discrete and multi-valued. Meta heuristics including Genetic Algorithm and Particle Swarm Optimization have been effectively used to solve these multi-valued optimization problems. However, extensive comparative study on the performance of these algorithms is still required. In this study, performance of these algorithms is evaluated with multi-modal and multi-dimensional test functions. From the experimental results, it is shown that Discrete Particle Swarm Optimization (DPSO) provides better and more reliable solutions among the considered algorithms. Also, additional experiments shows that solution quality of DPSO is not lowered significantly when bit size representing a solution increases. It means that bit representation of multi-valued discrete numbers provides reliable solutions instead of becoming barrier to performance of DPSO.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.58-68
• /
• 2010

Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.9
• /
• pp.55-61
• /
• 2009

This paper presents a modified Phasor Discrete Particle Swarm Optimization (PDPSO) algorithm to configure Community Energy Systems(CESs) in the distribution system. The CES obtains electric power from its own Distributed Generations(DGs) and purchases insufficient power from the competitive power market, to supply power for customers contracted with the CES. When there are two or more CESs in a network, the CESs will continue the competitive expansion to reduce the total operation cost. The particles of the proposed PDPSO algorithm have magnitude and phase angle values, and move within a circle area. In the case study, the results by PDPSO algorithm was compared with that by the conventional DPSO algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.792-797
• /
• 2011

This paper discusses the application of a hybrid discretiziation method for the discretization procedure that needs to be included in discrete particle swarm optimization (DPSO) for the problem of allocating PV (photovoltaic) systems onto distribution power systems. For this purpose, this paper proposes a rule-based expert system considering the objective function value and its optimizing speed as the input parameters and applied it to the PV allocation problem including discrete decision variables. For multi-level discretization, this paper adopts a hybrid method combined with a simple rounding and sigmoid funtion based 3-step and 5-step quantization methods, and the application of the rule based expert system proposing the adequate discretization method at each PSO iteration so that the DPSO with the hybrid discretization can provide better performance than the previous DPSO.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.1
• /
• pp.95-104
• /
• 2017

This paper deals with solution methods for discrete and multi-valued optimization problems. The objective function of the problem incorporates noise effects generated in case that fitness evaluation is accomplished by computer based experiments such as Monte Carlo simulation or discrete event simulation. Meta heuristics including Genetic Algorithm (GA) and Discrete Particle Swarm Optimization (DPSO) can be used to solve these simulation based multi-valued optimization problems. In applying these population based meta heuristics to simulation based optimization problem, samples size to estimate the expected fitness value of a solution and population (particle) size in a generation (step) should be carefully determined to obtain reliable solutions. Under realistic environment with restriction on available computation time, there exists trade-off between these values. In this paper, the effects of sample and population sizes are analyzed under well-known multi-modal and multi-dimensional test functions with randomly generated noise effects. From the experimental results, it is shown that the performance of DPSO is superior to that of GA. While appropriate determination of population sizes is more important than sample size in GA, appropriate determination of sample size is more important than particle size in DPSO. Especially in DPSO, the solution quality under increasing sample sizes with steps is inferior to constant or decreasing sample sizes with steps. Furthermore, the performance of DPSO is improved when OCBA (Optimal Computing Budget Allocation) is incorporated in selecting the best particle in each step. In applying OCBA in DPSO, smaller value of incremental sample size is preferred to obtain better solutions.

• Journal of the Korea Society for Simulation
• /
• v.27 no.2
• /
• pp.83-90
• /
• 2018

This paper describes the method of hull shape optimization to improve the resistance performance of planing hulls when a reference hull shape and its principal dimensions are given. First, the planing hull of precedent research is adopted as the reference hull and an optimization problem is formulated by defining hull shape parameters. The search space of this research is discretized for computing cost and DPSO(Discrete binary version of Particle Swarm Optimization) method is used to solve the optimization problem. As the result of optimization, the decrease of resistance is confirmed from the comparison between the reference hull's and the modified hull's planing performance from computational results.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.2
• /
• pp.185-193
• /
• 2009

This paper presents a methodology for photovoltaic (PV) system allocation in distribution systems using a discrete particle swarm optimization (DPSO). The PV allocation problem is in the category of mixed integer nonlinear programming and its formulation may include multi-valued dis-crete variables. Thus, the PSO requires a scheme to deal with multi-valued discrete variables. This paper introduces a novel multi-level quantization scheme using a sigmoid function for discrete particle swarm optimization. The technique is employed to a standard PSO architecture; the same velocity update equation as in continuous versions of PSO is used but the particle's positions are updated in an alternative manner. The set of multi-level quantization is defined as integer multiples of powers-of-two terms to efficiently approximate the sigmoid function in transforming a particle's position into discrete values. A comparison with a genetic algorithm (GA) is performed to verify the quality of the solutions obtained.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.1
• /
• pp.9-16
• /
• 2012

The present study presents the Phasor Discrete Particle Swarm Optimization (PDPSO) algorithm, an effective optimization technique, the multi-dimensional vectors of which consist of magnitudes and phase angles. PDPSO is employed in the configuration of micro-grids. Micro-grids are concepts of distribution system that directly unifies customers and distributed generations (DGs). Micro-grids could supply electric power to customers and conduct power transaction via a power market by operating economic dispatch of diverse cost functions through several DGs. If a large number of micro-grids exist in one distribution system, the algorithm needs to adjust the configuration of numerous micro-grids in order to supply electric power with minimum generation cost for all customers under the distribution system.

• ETRI Journal
• /
• v.40 no.6
• /
• pp.726-735
• /
• 2018

Femtocells are good examples of the ultimate networking technology, offering enhanced indoor coverage and higher data rate. However, the dense deployment of femto base stations (FBSs) and the exploitation of subcarrier reuse between macrocell base stations and FBSs result in significant co-tier and cross-tier interference, thus degrading system performance. Therefore, appropriate resource allocations are required to mitigate the interference. This paper proposes a discrete bacterial foraging optimization (DBFO) algorithm to find the optimal resource allocation in two-tier networks. The simulation results showed that DBFO outperforms the random-resource allocation and discrete particle swarm optimization (DPSO) considering the small number of steps taken by particles and bacteria.

• Journal of the Korea Society for Simulation
• /
• v.24 no.2
• /
• pp.1-9
• /
• 2015

The tactical employment is a critical factor to win the war in the modern battlefield. To apply optimized tactics, it needs analyses related to a battle system. Normally, M&S (Modeling & Simulation) has been studied to analyze data in general problems. However, this method is not suitable for military simulations because there are many variables which make complex interaction in the system. For this reason, we suggested the optimized simulation framework based on the M&S by using DPSO (Discrete binary version of PSO) algorithm. This optimized simulation framework makes the best tactical employment to reduce the searching time compared with the normal M&S used by Monte Carlo search method. This paper shows an example to find the best combination of anti-torpedo scenario in a short searching time. From the simulation example, the optimized simulation framework presents the effectiveness.