Preview

Recent Developments in Metaheuristic Algorithms a Review Saka 2012

Powerful Essays
Open Document
Open Document
15059 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Recent Developments in Metaheuristic Algorithms a Review Saka 2012
RECENT DEVELOPMENTS IN METAHEURISTIC ALGORITHMS: A Review M. P. Saka*
*

E. Doğan‡

Corresponding author, Prof. Dr., University of Bahrain, Department of Civil Engineering, Isa Town, Bahrain


Assistant Professor, Celal Bayar University, Civil Engineering Department, Manisa, Turkey

Stream: ECT2012RL Reference: ECT2012RL/2011/00005

1

Abstract
Recent developments in optimization techniques that deals in finding the solution of combinatorial optimization problems has provided engineering designers new capabilities. These new optimization algorithms are called metaheuristic techniques and they use nature as a source of inspiration to develop new numerical optimization procedures. It is shown in the literature that these techniques are robust and efficient and their performance is not affected by the complexity of optimization problems. In last two decades several metaheuristic algorithms are developed that mimic natural phenomena. Among these evolutionary algorithms imitate evolutionary biology and make use of the principle of the survival of the fittest to establish a numerical search algorithm. Swarm intelligence is based on the collective behaviour of insect swarm, bird flocking or fish schooling. Particle swarm optimizer turns this collective behaviour of particles into a numerical optimization algorithm. Differential evolution is a method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Harmony search method mimics the musical performance process that takes place when a musician searches for a better state of harmony. Big Bang-Big Crunch method simulates the theory of evolution of the universe. Artificial bee colony algorithm is based on the intelligent behaviour of honey bee swarm. Fireflies communicate, search for pray and find mates using bioluminescence with varied flashing patterns. Firefly algorithm mimics the social behaviour of fireflies. Cuckoo search algorithm



References: 42 [10] X-S, Yang, “Engineering Optimization: An Introduction with Metaheuristic Applications”, John Wiley, 2010 47 Algorithms”, Artificial Intelligence Review, Doi: 10.1007/s10462-011-9276-0, 1-32, 2011

You May Also Find These Documents Helpful

  • Satisfactory Essays

    DAC1 Study

    • 782 Words
    • 3 Pages

    Optimization analysis, an extension of goal-seeking analysis, finds the optimum value for a target variable by repeatedly changing other variables, subject to specified constraints.…

    • 782 Words
    • 3 Pages
    Satisfactory Essays
  • Best Essays

    [4] David, B. Fogel. "Applying evolutionary programming to selected traveling salesman problems." Cybernetics and systems 24(1) (1993): 27-36.…

    • 4745 Words
    • 19 Pages
    Best Essays
  • Powerful Essays

    References: Aarts, E.H.L., Korst, J.H.M. and Laarhoven, P.J.M. van. (1997). Simulated annealing. Pages 91– 120 in: Local Search in Combinatorial Optimization (E.H.L. Aarts, and J.K.L. Lenstra, Eds.) John Wiley & Sons, New York. Anderson, C. and McShea, D.W. Individual versus social complexity, with particular reference to ant colonies. Biol. Rev. (Camb), in press. Appleby, S. and Steward, S. (1994). Mobile software agents for control in telecommunications networks. BT Technol. J. 12: 104–113. Bartholdi, J. J., III. (1993) Interactive program to balance assembly lines. Int. J. Prod. Res. 31: 2447–2461. Bartholdi, J.J., III and Eisenstein, D.D. (1996). A production line that balances itself. Oper. Res. 44: 21–34. Bartholdi, J. J., III, Bunimovich, L.A. and Eisenstein, D.D. (1999). Dynamics of two- and threeworker "bucket brigade" production lines. Oper. Res. 47: 488–491. Bartholdi, J. J., III, Eisenstein, D.D. and Foley, R. A. Performance of bucket brigades when work is stochastic. Oper. Res., in press. Beebe, W. (1921). Edge of the Jungle. Henry Holt and Company, New York. Bonabeau, E. (1998). Social insect colonies as complex adaptive systems. Ecosystems 1: 437– 443. Bonabeau, E., and Théraulaz, G. (2000). Swarm smarts. Sci. Am. 282: 72–79. Bonabeau, E., Dorigo, M. and Théraulaz, G., 1999. Swarm Intelligence: From Natural to Artificial Systems. Santa Fe Institute on the Sciences of Complexity. Oxford University Press, New York. Bonabeau, E., Dorigo, M. and Théraulaz, G. (2000). Inspiration for optimization from social insect behaviour. Nature 406: 39–42.…

    • 8717 Words
    • 35 Pages
    Powerful Essays
  • Powerful Essays

    Therefore, this paper is proposed for discovering the suitable SWS in addition to its existing approaches.…

    • 3145 Words
    • 13 Pages
    Powerful Essays
  • Satisfactory Essays

    Biology Test

    • 837 Words
    • 4 Pages

    4) The transportation algorithm can be used to solve both minimization problems and maximization problems.…

    • 837 Words
    • 4 Pages
    Satisfactory Essays
  • Powerful Essays

    particular application, the proposed heuristic based on majority rules combined with concessions to significant mi-…

    • 8558 Words
    • 68 Pages
    Powerful Essays
  • Good Essays

    Qwertyui

    • 17468 Words
    • 70 Pages

    References: [18] N. I. M. Gould. On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem. Math. Program., 32:90–99, 1985. [19] H. M. Huynh. A Large-Scale Quadratic Programming Solver Based on Block-LU Updates of the KKT System. PhD thesis, Program in Scientific Computing and Computational Mathematics, Stanford University, Stanford, CA, 2008. [20] A. Majthay. Optimality conditions for quadratic programming. Math. Programming, 1:359–365, 1971. [21] J. Nocedal and S. J. Wright. Numerical Optimization. Springer-Verlag, New York, 1999. [22] P. M. Pardalos and G. Schnitger. Checking local optimality in constrained quadratic programming is NP-hard. Oper. Res. Lett., 7(1):33–35, 1988. [23] P. M. Pardalos and S. A. Vavasis. Quadratic programming with one negative eigenvalue is NP-hard. J. Global Optim., 1(1):15–22, 1991. [24] M. J. D. Powell. On the quadratic programming algorithm of Goldfarb and Idnani. Math. Programming Stud., (25):46–61, 1985. [25] J. A. Tomlin. On pricing and backward transformation in linear programming. Math. Programming, 6:42–47, 1974.…

    • 17468 Words
    • 70 Pages
    Good Essays
  • Good Essays

    The Grey wolf optimizer (GWO) algorithm mimics the leadership hierarchy and hunting mechanism of gray wolves in nature proposed by Mirjalili et al. in 2014. Four types of grey wolves such as alpha, beta, delta, and omega are employed for simulating the leadership…

    • 936 Words
    • 4 Pages
    Good Essays
  • Good Essays

    264 largest coefficient rule, 89 largest improvement rule, 89 law of diminishing marginal returns, 205 Leaf, 156 level set, 240 lexicographic rule, 114 linear constraint, 12 linear program, 12 feasible, 55 infeasible, 55 LP, 12 unbounded, 55 Markowitz model, 54 Matching Maximum, 155 matching, 38 neighbours, 146 non linear program, 48 non linear program:NLP, 48 optimal value, 55 path, 37 perfect matching, 38 pivot rules, 114 polyhedron, polyhedra, 104 portfolio optimization, 54 potential function, 258 pruning, 230 reducible, 91 robust optimization, 54 shadow prices, 203, 205 Simplex algorithm, 85 Slater point, 248 smallest subscript rule, 85, 97 solution feasible, 55 optimal, 55 standard equality form (SEF), 63 steepest edge rule, 89 Strong Duality Theorem, 175 subgradient, 242 supporting halfspace, 243 tight constraint, 106 Tree, 156 value, objective function value, 55 variable basic, 70 free, 64 non-basic, 70 slack, 66 vertex, 35 vertex cover, 46, 127…

    • 75357 Words
    • 302 Pages
    Good Essays
  • Powerful Essays

    This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique has been used widely to the reduce completion time of a production system. With respect to the complexity of the problem, optimization techniques such as branch and bound methods are no so efficient at medium and large dimensions; thus, to solve the problem, metaheuristic techniques are good option. In this study, first of all, the problems are solved in both permitted and not permitted of lot streaming by means of memetic algorithm and then by using the critical path method heuristic, we obtain better results. The numerical…

    • 1862 Words
    • 8 Pages
    Powerful Essays
  • Powerful Essays

    Ant Colony Optimization

    • 7210 Words
    • 29 Pages

    beings. Probably one of the most noticeable behaviors visible to us is the formation of socalled ant streets. When we were young, several of us may have stepped on such an ant…

    • 7210 Words
    • 29 Pages
    Powerful Essays
  • Satisfactory Essays

    Genetic Algorithm (GA) is wide applied in almost any field, including solving FLP. Tam 1992 introduced the coding of layouts as a string of characters of finite length and used a fixed slicing tree structure defined by a clustering algorithm to represent a layout as a chromosome of string of characters. Its improvement is presented in Tam 1998 with a parallel GA approach in terms of schema coding and solution method. It relaxes the assumption of a fixed slicing tree structure by coding the structure, internal and external nodes of a tree as substrings in the schema. Based on the application limitation of the classical crossover and mutation operators of Tam 1998, L. Al-Hakim2000 introduced a preserving operation, referred to as transplanting, to produce feasible offspring. It also discusses the improvement of each of the GA development procedures with comparison with Tam1998.…

    • 564 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    experiment are given in Waidmann et al. [7-9]. For reducing the computational cost and design…

    • 984 Words
    • 4 Pages
    Good Essays
  • Good Essays

    [HR86] K. Hogan and C. S. ReVelle, Concept and applications of backup coverage, Management Science 32 (1986), no. 11, 1434–1444. [Jia08] Y. Jia, Improvement program of urban taxi stops based on simulated annealing algorithm in the context of china, Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (Washington, DC, USA), IEEE Computer Society, 2008, pp. 356–359. [LE96] P. Lopez and P. Esquirol, Consistency enforcing in scheduling: A general formulation based on energetic reasoning, 5th International Workshop on Projet Management and Scheduling (PMS’96) (Poznan (Poland)), 1996, pp. 155–158. [LSP08] J. H. Lee, I. H. Shin, and G. L. Park, Pick-up pattern for taxi location recommendation, 4th International Conference on Networked Computing and Advanced Information Management, 2008. [LWCT04] D.-H. Lee, H. Wang, R. L. Cheu, and S. H. Teo, Taxi dispatch system based on current demands and real-time traffic conditions, Transportation Research Record (2004), no. 1882, 193–200. [MMYH10] Q. Meng, S. Mabu, L. Yu, and K. Hirasawa, A novel taxi dispatch system integrating a multicustomer strategy and genetic network programming, Journal of Advanced Computational Intelligence and Intelligent Informatics 14 (2010), no. 5. [NSZ02] K. Neumann, C. Schwindt, and J. Zimmermann, Project Scheduling with Time Windows and Scarce Resources, Springer, 2002. [OD98] S. H. Owen and M. S. Daskin, Strategic facility location: A review, European Journal of Operational Research 111 (1998), no. 3, 423–447. [Sav92] M. W. P. Savelsbergh, The vehicle routing problem with time windows: Minimizing route duration, INFORMS Journal on Computing 4 (1992), no. 2, 146–154. [SCMK97] M. Shrivastava, P. K. Chande, A. S. Monga, and H. Kashiwagi, Taxi dispatch: A fuzzy approach, IEEE Conference on Intelligent Transportation System, 1997.…

    • 9144 Words
    • 37 Pages
    Good Essays
  • Better Essays

    GSHP Analysis

    • 881 Words
    • 4 Pages

    Zhou et al [21] optimized the performance of GSHP system through TRNSYS simulation. Sivasakthivel et al. [22] proposed optimum parameters of a GSHP system for both cooling and heating operations. Zeng et al. [23] used the multi-population genetic algorithm (MPGA) to optimize the operation and capacity strategy for CCHP–GSHP coupling system, resulting in excellent energy-saving and cost-saving effect in a case study. Esen et al. [24] utilized Taguchi method to optimize the GSHP system and concluded that the depth of borehole is the most significant parameter.…

    • 881 Words
    • 4 Pages
    Better Essays