DOCSLIB.ORG

Firefly Algorithm Applied to Integer Programming Problems

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Firefly Algorithm Applied to Integer Programming Problems Recent Advances in Mathematics Firefly Algorithm Applied to Integer Programming Problems Nebojsa BACANIN, Ivona BRAJEVIC, Milan TUBA Faculty of Computer Science Megatrend University Belgrade Bulevar umetnosti 29, N. Belgrade SERBIA [email protected], [email protected], [email protected], Abstract: - Firefly algorithm is a recently added member of the swarm intelligence heuristics family. In this paper the firefly algorithm is adjusted and applied to integer programming problems. In order to deal with integer programming problems, firefly algorithm rounds the parameter values to the closest integer after producing new solutions. The performance of firefly algorithm is tested on seven problems widely used in the literature. Artificial bee colony algorithm is also implemented for comparison with the results of the firefly algorithm. Experimental results show that the firefly algorithm proved to be superior in almost all tested problems. Key-Words: - Firefly algorithm, Optimization metaheuristics, Integer programming, Swarm intelligence 1 Introduction Delaunay triangulation of the free configuration Linear programming optimization can find optimal space [3] are also solvable by integer programming solution to problems with hundreds of thousands of method. The entire class of problems referred to as constraints and variables. Modeling strength and sequencing, scheduling and routing is inherently solvability makes linear programming technique integer programs. This class of problems might for applicable in real life problems. Integer example deal with the scheduling of students and programming is a form of mathematical classrooms in such a way that the number of optimization program where some or all employed students who cannot take their first choice of classes variables are required to have integer values. This is minimized [2]. method adds additional constraints to linear There are many variants of integer programming programming. This change increases the number of methods. In pure integer programming problems, all problems that can be modeled, but also makes the variables are integers. These problems can be models more difficult to solve [1]. One interesting formulated as follows: aspect of integer programming is that two similar minimize f(x), x F Zn (1) formulations of the same problem can produce different computational results – one formulation where F is the feasible region of the search space, can quickly converge to the optimal solution, while and Z is the set of integer values. One instance of the other may take long time to solve the problem in integer programming programs, where the integer hand [1]. variables can be only 0 or 1 is called binary integer Integer programming models arise in almost every programming [3]. There are also mixed binary area of applied mathematical programming [2]. integer programming problems where some decision Warehouse location problem deals with the variables are binary, and other variables are either tradeoffs between transportation costs and general integer or continuous valued. operational costs of distribution centers. Capital Exact integer programming techniques such as budgeting problem refers to the assessment of long Branch and Bound or dynamic programming have term investments, such as new machinery, new high computational cost, since they explore a search plants, products, etc. VLSI (very large scale tree containing hundreds or more nodes on large- integration) circuits design problems and robot path scale real-life problems [4]. On the other side planning problems with variables taken from heuristic methods can be used for solving integer programming problems. Swarm intelligence metaheuristics [5], among which ant colony This research is supported by Ministry of Education and optimization [6], [7], artificial bee colony Science, Republic of Serbia, Project No. III-44006 ISBN: 978-1-61804-158-6 143 Recent Advances in Mathematics optimization [8], [9], [10] and cuckoo search [11] 3. The brightness of a firefly is affected or are prominent and were used successfully for determined by the landscape of the objective similar problems. Heuristics typically have function to be optimized. polynomial computational complexity, but they do not guarantee that the optimal solution will be The attractiveness of the firefly and the movement captured. In order to solve integer programming towards the attractive firefly are two significant problems, the most of heuristics truncate or round points in the firefly algorithm. Suppose there are n the real valued solutions to the nearest integer fireflies and that xi corresponds to the solution for values. Particle swarm optimization (PSO) firefly i. The brightness of the firefly i, is associated algorithm, inspired by the social behavior of birds or with the objective function f (xi ) . The brightness I fishes and artificial bee colony (ABC) algorithm, of a firefly is chosen to reveal its recent position of based on honey bee foraging behavior were its fitness value or objective function f (x) : successfully applied in solving integer programming problems [5], [6], [14]. Ii f (xi ) (2) Firefly Algorithm (FA) is a very promising recent developed metaheuristic algorithm inspired by the The less bright (attractive) firefly is attracted and flashing behavior of fireflies [15]. The basic firefly moved to the brighter one. At the source, the algorithm is proposed to solve unconstrained brightness is higher than at some distant point. Also, optimization problems. There are object-oriented the brightness decreases while environment absorbs software implementations [16], as well as the light while it is travelling. Therefore the parallelized versions for unconstrained optimization attractiveness of firefly is relative. Therefore, it problems of the FA [17]. Since its invention will vary with the distance between firefly i and different variants of FA have been developed and firefly j. In addition it should be allowed the used in many practical fields [18], [19], [20]. In this attractiveness to vary with the degree of absorption paper, firefly algorithm is applied to integer because light intensity decreases with the distance programming problems. The performance of the from its source, and light is also absorbed in the proposed firefly algorithm was compared with those media. It is known that the light intensity I(r) of ABC algorithm. varies following the inverse square law: This paper is organized as follows. Section 2 presents firefly algorithm. A brief description of I ABC is provided in Section 3. Section 4 describes I(r) 0 (3) r 2 seven benchmark problem formulations. Section 5 presents the experimental setup adopted and where I 0 represents the light intensity at the source. provides an analysis of the results obtained from our The combined effect the inverse square law and empirical study. Our conclusions and some possible absorption can be approximated using the following plans for future research are provided in Section 5. Gaussian form: 2 Firefly algorithm r2 I(r) I0e (4) The Firefly algorithm proposed by Xin-She Yang is based on the idealized behavior of the flashing As a firefly’s attractiveness is proportional to the characteristics of fireflies [15]. These flashing light intensity seen by adjacent fireflies, the characteristics can be summarized by the following attractiveness function of the firefly is established three rules: by: 1. All fireflies are unisex so that one firefly will be 2 (r) e r (5) attracted to other fireflies regardless of their sex. 0 2. Attractiveness is proportional to firefly where is the firefly attractiveness value at r = 0 brightness. For any couple of flashing fireflies, 0 the less bright one will move towards the and is the media light absorption coefficient. brighter one. The brightness decreases when the Fireflies movement is based on the principles of distance between fireflies is increased. The attractiveness: when firefly j is more attractive than brightest firefly moves randomly, because there firefly i the movement is determined by the is no other bug to attract it. following equation: ISBN: 978-1-61804-158-6 144 Recent Advances in Mathematics 2 rij Initialize algorithm's parameters , , xik xik 0 e (xik x jk ) (6) 1 while (t <MaxGeneration) S k randik 2 for i = 1 : n for j = 1 : i where k 1,2,..., D (D is dimension of problem). In if ( ( ) ){move firefly i towards j} Eq. (6) third term is randomization term where xi [0,1], S are the scaling parameters and Obtain attractiveness which varies with k distance r via exp[- r] by Eq.(5) rand is random number between 0 and 1. In our ik firefly algorithm employed for integer programming Move firefly i towards j in all D dimensions by Eq.(6) problems, as in the version of FA proposed to solve structural optimization problems [19], it was found Evaluate and update the new solution that the solution quality can be improved by end if reducing the randomization parameter with a end for j geometric progression reduction scheme similar to end for i the cooling schedule of simulated annealing which can be described by: Reduce the randomization parameter by Eq.(7) t Rank the fireflies and find the current best 0 (7) end while where 0 1 is the reduction factor of randomization. In addition, the scaling parameters in all D dimensions are determined by: 3 Artificial bee colony algorithm In ABC algorithm the colony of artificial bees S k uk lk (8) consists of three groups of bees: employed bees, onlookers and scouts Error! Reference source not where and are the lower and upper bound of found.. The number of the employed bees is equal the parameter xik . to the number of food sources and an employed bee is assigned to one of the sources. The employed Distance r between fireflies i and j is obtained by ij bees search the food around the food source in their Cartesian distance form by: memory and also they share their food information with onlookers. The onlookers tend to select good D 2 food sources from those founded by the employed rij xi,k x j,k (9) bees and then they calculate a new solution from the k1 selected food source.
Load more

Recommended publications
  • Application of the Firefly Algorithm for Optimal Production and Demand Forecasting at Selected Industrial Plant
    Open Journal of Business and Management, 2020, 8, 2451-2459 https://www.scirp.org/journal/ojbm ISSN Online: 2329-3292 ISSN Print: 2329-3284 Application of the Firefly Algorithm for Optimal Production and Demand Forecasting at Selected Industrial Plant Abdulhadi Altherwi Industrial and Systems Engineering Department, Oakland University, Rochester, MI, USA How to cite this paper: Altherwi, A. (2020). Abstract Application of the Firefly Algorithm for Optimal Production and Demand Fore- Many production companies continue to face financial difficulties. The main casting at Selected Industrial Plant. Open purpose of this paper is to present an effective method for these companies to Journal of Business and Management, 8, maximize profits and minimize production costs. The problem presented 2451-2459. https://doi.org/10.4236/ojbm.2020.86151 here is initially developed as a linear programming model. To achieve the best results, the firefly algorithm (FA) is applied to solve the model and obtain an Received: October 15, 2020 optimum solution. In order to test the efficiency of the algorithm, Lindo Accepted: November 13, 2020 software is used, and the results of both algorithms are compared. A sensitiv- Published: November 16, 2020 ity analysis is applied to determine which products a company should pro- Copyright © 2020 by author(s) and duce in order to maximize profits. The result reveals that the FA, when com- Scientific Research Publishing Inc. pared with Lindo, can help achieve maximum profits by producing only one This work is licensed under the Creative product, thus minimizing production costs. For demand forecasting, the Commons Attribution International License (CC BY 4.0).
    [Show full text]
  • Distributed Cognition As the Basis for Adaptation and Homeostasis In
    DISTRIBUTEDCOGNITIONASTHEBASISFORADAPTATION ANDHOMEOSTASISINROBOTS james henry stovold Doctor of Philosophy University of York Computer Science July 2016 ABSTRACT Many researchers approach the problem of building autonomous systems by looking to biology for inspiration. This has given rise to a wide-range of artificial systems mimicking their biological counterparts—artificial neural networks, artificial endocrine systems, and artificial musculoskeletal systems are prime examples. While these systems are succinct and work well in isolation, they can become cumbersome and complicated when combined to perform more complex tasks. Autonomous behaviour is one such complex task. This thesis considers autonomy as the complex behaviour it is, and proposes a bottom-up approach to developing autonomous beha- viour from cognition. This consists of investigating how cognition can provide new approaches to the current limitations of swarm systems, and using this as the basis for one type of autonomous behaviour: artificial homeostasis. Distributed cognition, a form of emergent cognition, is most often described in terms of the immune system and social insects. By taking inspiration from distributed cognition, this thesis details the development of novel algorithms for cognitive decision-making and emergent identity in leaderless, homogenous swarms. Artificial homeostasis is provided to a robot through an architecture that combines the cognitive decision-making algorithm with a simple associative memory. This architecture is used to demonstrate how a simple architecture can endow a robot with the capacity to adapt to an unseen environment, and use that information to proactively seek out what it needs from the environment in order to maintain its internal state. iii CONTENTS Abstract iii Table of Contents v List of Figures viii List of Tables xi List of Code Listings xii Acknowledgements xiii Declaration xv 1 introduction 1 1.1 Motivation .
    [Show full text]
  • An Improved Bees Algorithm Local Search Mechanism for Numerical Dataset
    An Improved Bees Algorithm Local Search Mechanism for Numerical dataset Prepared By: Aras Ghazi Mohammed Al-dawoodi Supervisor: Dr. Massudi bin Mahmuddin DISSERTATION SUBMITTED TO THE AWANG HAD SALLEH GRADUATE SCHOOL OF COMPUTING UUM COLLEGE OF ARTS AND SCIENCES UNIVERSITI UTARA MALAYSIA IN PARITIAL FULFILLMENT OF THE REQUIREMENT FOR THE DEGREE OF MASTER IN (INFORMATION TECHNOLOGY) 2014 - 2015 Permission to Use In presenting this dissertation report in partial fulfilment of the requirements for a postgraduate degree from University Utara Malaysia, I agree that the University Library may make it freely available for inspection. I further agree that permission for the copying of this report in any manner, in whole or in part, for scholarly purpose may be granted by my supervisor(s) or, in their absence, by the Dean of Awang Had Salleh Graduate School of Arts and Sciences. It is understood that any copying or publication or use of this report or parts thereof for financial gain shall not be allowed without my written permission. It is also understood that due recognition shall be given to me and to University Utara Malaysia for any scholarly use which may be made of any material from my report. Requests for permission to copy or to make other use of materials in this project report, in whole or in part, should be addressed to: Dean of Awang Had Salleh Graduate School of Arts and Sciences UUM College of Arts and Sciences University Utara Malaysia 06010 UUM Sintok i Abstrak Bees Algorithm (BA), satu prosedur pengoptimuman heuristik, merupakan salah satu teknik carian asas yang berdasarkan kepada aktiviti pencarian makanan lebah.
    [Show full text]
  • Application of the Firefly Algorithm for Solving the Economic Emissions
    Hindawi Publishing Corporation International Journal of Combinatorics Volume 2011, Article ID 523806, 23 pages doi:10.1155/2011/523806 Research Article Application of the Firefly Algorithm for Solving the Economic Emissions Load Dispatch Problem Theofanis Apostolopoulos and Aristidis Vlachos Department of Informatics, University of Piraeus, 80 Karaoli and Dimitriou Street, 18534 Piraeus, Greece Correspondence should be addressed to Aristidis Vlachos, [email protected] Received 30 August 2010; Accepted 14 November 2010 Academic Editor: Hajo Broersma Copyright q 2011 T. Apostolopoulos and A. Vlachos. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Efficient and reliable power production is necessary to meet both the profitability of power systems operations and the electricity demand, taking also into account the environmental concerns about the emissions produced by fossil-fuelled power plants. The economic emission load dispatch problem has been defined and applied in order to deal with the optimization of these two conflicting objectives, that is, the minimization of both fuel cost and emission of generating units. This paper introduces and describes a solution to this famous problem using a new metaheuristic nature-inspired algorithm, called firefly algorithm, which was developed by Dr. Xin-She Yang at Cambridge University in 2007. A general formulation of this algorithm is presented together with an analytical mathematical modeling to solve this problem by a single equivalent objective function. The results are compared with those obtained by alternative techniques proposed by the literature in order to show that it is capable of yielding good optimal solutions with proper selection of control parameters.
    [Show full text]
  • Comparison of Hybrid Firefly Algorithms for Power Allocation in a TV White Space Network
    International Journal of Computer Applications (0975 – 8887) Volume 178 – No. 38, August 2019 Comparison of Hybrid Firefly Algorithms for Power Allocation in a TV White Space Network Kennedy K. Ronoh George Kamucha Tonny K. Omwansa School of Computing and Department of Electrical and School of Computing and Informatics Information Engineering Informatics University of Nairobi University of Nairobi University of Nairobi Nairobi, Kenya Nairobi, Kenya Nairobi, Kenya ABSTRACT 1GHz spectrum. TV white spaces (TVWS) can be used by Secondary Users Regulatory authorities worldwide have mandated the use of (SUs) through Dynamic Spectrum Access (DSA) as long as geo-location database (GLDB) for protection of incumbent they do not cause harmful interference to Primary Users users in TVWS network. GLDB is used by a SU or White (PUs). Due spectrum scarcity, there is increasing demand for Space Device (WSD) to find the set of frequency channels DSA. When there is a high density of SUs in a TVWS that can be used on a secondary basis at a given area and at network such as cellular access to TVWS, problem of any given time [5], [6], [7]. GLDB is populated through the interference among SUs will arise. Possibility of harmful use of a propagation model. The database contains estimated interference to PUs may also arise. Optimization of power power levels of PUs for any point in a particular region of allocation is therefore necessary to reduce the level of interest. The WSD, which has a Cognitive Radio System interference among SUs and to protect PUs against harmful (CRS), queries a central database.
    [Show full text]
  • Synchronization of Fireflies Can Improve Or Inspire Robotic Swarm
    elligenc International Journal of Swarm nt e I an rm d a E w v S o f l u o t l i o a n n a r u r Intelligence and Evolutionary y o C J l o a m n p ISSN:o 2090-4908 i t u a t a n t r i o e t n I n Computation Editorial Synchronization of Fireflies can Improve or Inspire Robotic Swarm Seelu Palai* Department of Computer Science, Parul University, Limda, Waghodia, Gujarat DESCRIPTION issue within the scientific community, many researchers believe Despite their simple brains, synchronized fireflies have that it helps fireflies for locating mates, protecting themselves something to show us about AI. A recent discovery on the from their predators and attracting their potential prey. within insect's amazing light shows could help researchers acquire fresh the firefly algorithm, the target function of a given optimization insight into swarm robotics. It seems, the synchronized fireflies' problem is related to this flashing light or candlepower which light displays are even more subtle than scientists realized, and helps the swarm of fireflies to maneuver to brighter and more it's to try to with the insect's three-dimensional positioning. They attractive locations so as to get efficient optimal solutions. found that fireflies behave differently after they are alone versus Multiple conflicting objectives arise naturally in most real-world in groups. In seems, synchronized fireflies what their neighbors combinatorial optimization problems. Several principles and do, rather than blinking consistent with any inherent rhythm. methods are developed and proposed for over a decade so as to Then they modify their blinking pattern to match those around resolve problems.
    [Show full text]
  • Three Novel Quantum-Inspired Swarm Optimization Algorithms Using
    www.nature.com/scientificreports OPEN Three novel quantum‑inspired swarm optimization algorithms using diferent bounded potential felds Manuel S. Alvarez‑Alvarado1*, Francisco E. Alban‑Chacón2, Erick A. Lamilla‑Rubio2, Carlos D. Rodríguez‑Gallegos3 & Washington Velásquez1 Based on the behavior of the quantum particles, it is possible to formulate mathematical expressions to develop metaheuristic search optimization algorithms. This paper presents three novel quantum‑ inspired algorithms, which scenario is a particle swarm that is excited by a Lorentz, Rosen–Morse, and Coulomb‑like square root potential felds, respectively. To show the computational efcacy of the proposed optimization techniques, the paper presents a comparative study with the classical particle swarm optimization (PSO), genetic algorithm (GA), and frefy algorithm (FFA). The algorithms are used to solve 24 benchmark functions that are categorized by unimodal, multimodal, and fxed‑ dimension multimodal. As a fnding, the algorithm inspired in the Lorentz potential feld presents the most balanced computational performance in terms of exploitation (accuracy and precision), exploration (convergence speed and acceleration), and simulation time compared to the algorithms previously mentioned. A deeper analysis reveals that a strong potential feld inside a well with weak asymptotic behavior leads to better exploitation and exploration attributes for unimodal, multimodal, and fxed‑multimodal functions. Gradient-based and Hessian-based algorithms are widely use in the literature to solve optimization problems in engineering. Tis is due to their computational efciency, which typically require little problem-specifc parameter tuning1. Te Gradient-based and Hessian-based algorithms employ iterative process that involves multivariate scalar function that packages all the information of the partial derivatives of the objective function (i.e., Gradient function or Hessian matrix) to reach the solution.
    [Show full text]
  • Applying Firefly Algorithm to Solve the Problem of Balancing Curricula
    (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 10, No. 1, 2019 Applying FireFly Algorithm to Solve the Problem of Balancing Curricula 1* 2* 3 4 5 6 Jose´ Miguel Rubio , Cristian L. Vidal-Silva , Ricardo Soto , Erika Madariaga , Franklin Johnson , Luis Carter 1 ´Area Acad´emica de Inform´atica y Telecomunicaciones, Universidad Tecnol´ogica de Chile INACAP, Santiago, Chile 2Ingenier´ıa Civil Inform´atica, Escuela de Ingenier´ıa, Universidad Vi˜na del Mar, Vi˜na del Mar, Chile 3Escuela de Ingenier´ıa Inform´atica, Facultad de Ingenier´ıa, Pontificia Universidad Cat´olica de Valpara´ıso, Valpara´ıso, Chile 4Ingenier´ıa Inform´atica, Facultad de Ingenier´ıa, Ciencia y Tecnolog´ıa, Universidad Bernardo O’Higgins, Santiago, Chile 5Depto. Disciplinario de Computaci´on e Inform´atica, Facultad de Ingenier´ıa, Universidad de Playa Ancha, Valpara´so, Chile 6Ingenier´ıa Civil Industrial, Facultad de Ingenier´ıa, Universidad Aut´onoma de Chile, Talca, Chile Abstract—The problem of assigning a balanced academic the paradigm of programming with restrictions and hybrid curriculum to academic periods of a curriculum, that is, the algorithms using genetic algorithms, collaboration schemes, balancing curricula, represents a traditional challenge for every and local searches, among other techniques. educational institution which look for a match among students and professors. This article proposes a solution for the balancing The present work focuses on solving the test instances curricula problem using an optimization technique based on the recognized by the CSPLib [1], and a few real situations of attraction of fireflies (FA) meta-heuristic. We perform a set of test the problem in the study programs of the computer area of and real instances to measure the performance of our solution two Chilean universities.
    [Show full text]
  • Stepping Ahead Based Hybridization of Meta-Heuristic Model for Solving Global Optimization Problems
    Stepping ahead based hybridization of meta-heuristic model for solving Global Optimization Problems Ravneil Nand ∗ z, Kaylash Chaudhary ∗ x, Bibhya Sharma ∗ { ∗ School of Computing, Information and Mathematical Sciences The University of the South Pacific, Suva, Fiji. http://scims.fste.usp.ac.fj/ z [email protected], x [email protected], { [email protected] Abstract—Intelligent optimization algorithms based on swarm rithms in literature which either minimizes or maximizes the principles have been widely researched in recent times. The objective function [13], [14]. This research firstly modifies Firefly Algorithm (FA) is an intelligent swarm algorithm for Firefly Algorithm (FA) and later does the hybridization of global optimization problems. In literature, FA has been seen as one of the efficient and robust optimization algorithm. However, modified FA with Covariance Matrix Adaptation Evolution the solution search space used in FA is insufficient, and the Strategy (CMAES) algorithm. The reason for hybridization is strategy for generating candidate solutions results in good explo- that the two algorithms separately sometimes do not perform ration ability but poor exploitation performance. Although, there well in terms of finding the optimality of a particular function are a lot of modifications and hybridizations of FA with other and also it may take longer time to find best solutions [15]– optimizing algorithms, there is still a room for improvement. Therefore, in this paper, we first propose modification of FA [17]. In 20 dimension problem, the median algorithm solves by introducing a stepping ahead parameter. Second, we design about 30% of the functions while the best algorithm can solve a hybrid of modified FA with Covariance Matrix Adaptation about 75% [18].
    [Show full text]
  • A Study of Search Neighbourhood in the Bees Algorithm a Thesis
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by OpenGrey Repository A Study of Search Neighbourhood in the Bees Algorithm A thesis submitted to Cardiff University in the candidature for the degree of Doctor of Philosophy By Siti Azfanizam Ahmad, Bc. Science. Manufacturing Engineering Centre School of Engineering Cardiff University United Kingdom January 2012 ABSTRACT The Bees Algorithm, a heuristic optimisation procedure that mimics bees foraging behaviour, is becoming more popular among swarm intelligence researchers. The algorithm involves neighbourhood and global search and is able to find promising solutions to complex multimodal optimisation problems. The purpose of neighbourhood search is to intensify the search effort around promising solutions, while global search is to enable avoidance of local optima. Despite numerous studies aimed at enhancing the Bees Algorithm, there have not been many attempts at studying neighbourhood search. This research investigated different kinds of neighbourhoods and their effects on neighbourhood search. First, the adaptive enlargement of the search neighbourhood was proposed. This idea was implemented in the Bees Algorithm and tested on a set of mathematical benchmarks. The modified algorithm was also tested on single objective engineering design problems. The experimental results obtained confirmed that the adaptive enlargement of the search neighbourhood improved the performance of the proposed algorithm. Normally, a symmetrical search neighbourhood is employed in the Bees Algorithm. As opposed to this practice, an asymmetrical search neighbourhood was tried in this work to determine the significance of neighbourhood symmetry. In addition to the mathematical benchmarks, the algorithm with an asymmetrical search neighbourhood was also tested on an engineering design problem.
    [Show full text]
  • Effect of Fuzzy and Crisp Clustering Algorithms to Design Code Book for Vector Quantization in Applications
    Effect of Fuzzy and Crisp Clustering Algorithms to Design Code Book for Vector Quantization in Applications Yukinori Suzuki, Hiromu Sakakita and Junji Maeda Department of Information and Electronic Engineering, Muroran Institute of Technology, 27-1 Mizumoto-cho, Muroran, Hokkaido 050-8585, Japan Keywords: Fuzzy and Crisp Clustering Algorithms, Vector Quantization, Code Book Design. Abstract: Image coding technologies are widely studies not only to economize storage device but also to use commu- nication channel effectively. In various image coding technologies, we have been studied vector quantiza- tion. Vector quantization technology does not cause deterioration image quality in a high compression region and also has a negligible computational cost for image decoding. It is therefore useful technology for com- munication terminals with small payloads and small computational costs. Furthermore, it is also useful for biomedical signal processing: medical imaging and medical ultrasound image compression. Encoded and/or decoded image quality depends on a code book that is constructed in advance. In vector quantization, a code book determines the performance. Various clustering algorithms were proposed to design a code book. In this paper, we examined effect of typical clustering (crisp clustering and fuzzy clustering) algorithms in terms of applications of vector quantization. Two sets of experiments were carried out for examination. In the first set of experiments, the learning image to construct a code book was the same as the test image. In practical vector quantization, learning images are different from test images. Therefore, learning images that were different from test images were used in the second set of experiments. The first set of experiments showed that selection of a clustering algorithm is important for vector quantization.
    [Show full text]
  • 295539263.Pdf
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by TELKOMNIKA (Telecommunication Computing Electronics and Control) TELKOMNIKA, Vol.15, No.1, March 2017, pp. 93~100 ISSN: 1693-6930, accredited A by DIKTI, Decree No: 58/DIKTI/Kep/2013 DOI: 10.12928/TELKOMNIKA.v15i1.3862 93 Research on Chaotic Firefly Algorithm and the Application in Optimal Reactive Power Dispatch Genfu Xiao1, Huan Liu*2, Yanhui Zhou3, Yuming Guo4 1,3,4Institute of Mechanical and Electrical Technology, Jinggangshan University, Ji’an, China 1,2Laboratory of watershed ecology and geographical environment monitoring, NASG, Ji’an, China 2Institute of Electronic and Information Engineering, Jinggangshan University, Ji’an, China *Corresponding author, e-mail: [email protected] Abstract Firefly algorithm (FA) is a newly proposed swarm intelligence optimization algorithm. Like many other general swarm intelligence optimization algorithms, the original version of FA is easy to trap into local optima. In order to overcome this drawback, the chaotic firefly algorithm (CFA) is proposed. The methods of chaos initialization, chaos population regeneration and linear decreasing inertia weight have been introduced into the original version of FA so as to increase its global search mobility for robust global optimization. The CFA is calculated in Matlab and is examined on six benchmark functions. In order to evaluate the engineering application of the algorithm, the reactive power optimization problem in IEEE 30 bus system is solved by CFA. The outcomes show that the CFA has better performance compared to the original version of FA and PSO. Keywords: chaos, FA, optimization, reactive power Copyright © 2017 Universitas Ahmad Dahlan.
    [Show full text]