Skip to main content

Amended Fruit fly Optimization



Amended Fruit fly Optimization

According to food finding characteristics of fruit fly swarm, the whole procedure of the original FOAcan be divided into several step as follows:-

ALGORITHM FOR aFOA

Step 1 Start:
            Start the algorithm.
Step 2 Parameter Initialization:        
            The main parameters of aFOA are maximum iteration number, the population size.
Step 3 Population Initialization:
            Randomly initialize the population size is NP. Randomly produce solution, half blending and un-blending.
Step 4 Neighborhood Generations and Find Best
           Neighborhood:
            NN neighborhoods are randomly generated. NN neighborhoods are produced by three kinds of neighborhood search. Find out the best neighbor.
Step 5 Replacements of Neighbor:
            If the best neighbor is better than the fly then replace the fly with the best neighbor and go to next step, else go to next step without replacing.
Step 6 Local Neighborhood Loop Search:
            If the loop termination is reached then sort the population else go back to step 4.
Step 7 Crossovers:
            In global cooperation search each flies in the poor half crossover it with the corresponding one. If new fly is better than poor fly then replace the poor fly with new one and go to next step, else go to next step without replacing.
Step 8 Termination Criterion:
             If termination standard is reached then provide result, else go back to step 3.
Step 9 End:
            End the algorithm.
 

Anurag Rana

Comments

Popular posts from this blog

Standard and Formatted Input / Output in C++

The C++ standard libraries provide an extensive set of input/output capabilities which we will see in subsequent chapters. This chapter will discuss very basic and most common I/O operations required for C++ programming. C++ I/O occurs in streams, which are sequences of bytes. If bytes flow from a device like a keyboard, a disk drive, or a network connection etc. to main memory, this is called   input operation   and if bytes flow from main memory to a device like a display screen, a printer, a disk drive, or a network connection, etc., this is called   output operation . Standard Input and Output in C++ is done through the use of  streams . Streams are generic places to send or receive data. In C++, I/O is done through classes and objects defined in the header file  <iostream> .  iostream  stands for standard input-output stream. This header file contains definitions to objects like  cin ,  cout , etc. /O Library Header Files There are...

Data Warehousing - An Overview

Anurag Information Technology (IT) has historically influenced organizational performance and competitive standing. The increasing processing power and sophistication of analytical tools and techniques have put the strong foundation for the product called data warehouse. There are a number of reasons that any organization should consider a data warehouse, which can be the critical tool for maximizing the organization’s investment in the information it has collected and stored throughout the enterprise. IT managers need to understand the rationale and benefits of data warehouses because they may need to design and implement, or procure this kingpin of business intelligence. The data warehouses are supposed to provide storage, functionality and responsiveness to queries beyond the capabilities of today's transaction-oriented databases. Also data warehouses are set to improve the data access performance of databases. Traditional databases balance the requirement of data access w...

Genotype Representation

Binary Representation This is one of the simplest and most widely used representation in GAs. In this type of representation the genotype consists of bit strings. For some problems when the solution space consists of Boolean decision variables – yes or no, the binary representation is natural. Take for example the 0/1 Knapsack Problem. If there are n items, we can represent a solution by a binary string of n elements, where the x th  element tells whether the item x is picked (1) or not (0). For other problems, specifically those dealing with numbers, we can represent the numbers with their binary representation. The problem with this kind of encoding is that different bits have different significance and therefore mutation and crossover operators can have undesired consequences. This can be resolved to some extent by using  Gray Coding,  as a change in one bit does not have a massive effect on the solution. Real Valued Representation For problems where we want to define ...