Two Meta-Heuristics for Solving Unconstrained Optimization Problems and Machinery Problems

Article Preview

Abstract:

Machining optimization problem aims to optimize machinery conditions which are important for economic settings. The effective methods for solving these problems using a finite sequence of instructions can be categorized into two groups; exact optimization algorithm and meta-heuristic algorithms. A well-known meta-heuristic approach called Harmony Search Algorithm was used to compare with Particle Swarm Optimization. We implemented and analysed algorithms using unconstrained problems under different conditions included single, multi-peak, curved ridge optimization, and machinery optimization problem. The computational outputs demonstrated the proposed Particle Swarm Optimization resulted in the better outcomes in term of mean and variance of process yields.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 1044-1045)

Pages:

1418-1423

Citation:

Online since:

October 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Granville, V. Krivanek, M. Rasson, J P, Simulated annealing: a Proof of Convergence", Pattern Analysis and Machine Intelligence., IEEE Tran. 16( 1994) 652 – 656.

DOI: 10.1109/34.295910

Google Scholar

[2] M. Dorigo, V. Maniezzo and A. Colorni "Ant System: Optimisation by a Colony of Cooperating Agents IEEE Tran. Part B. 26(1996)29-41.

DOI: 10.1109/3477.484436

Google Scholar

[3] M. Clerc, and J. Kennedy The Particle Swarm-Explosion, Stability, and Convergence in a Multidimensional Complex Space, IEEE Tran. on Evo. Com. 6( 2002)58-73.

DOI: 10.1109/4235.985692

Google Scholar

[4] X.S. Yang, A Discrete Firefly Meta-heuristic with Local Search for Make span Min. in permutation Flow Shop Scheduling Prob. Int. j. of Ind. Eng. Computations, 1( 2010) 1–10.

DOI: 10.5267/j.ijiec.2010.01.001

Google Scholar

[5] X.S. Yang, A New Meta heuristic Bat-Inspired Algorithm, in: Nature Inspired Cooperative Strategies for Optimization (NISCO 2010), Studies in Computational Intelligence, Springer Berlin, 284(2010) 65–74.

DOI: 10.1007/978-3-642-12538-6_6

Google Scholar

[6] E. Elbeltagi, T. Hegazy and D. Grierson., Comparison among five evolutionary based optimization algorithms, Advanced Engineering Informatics, 19(2005) 43–53.

DOI: 10.1016/j.aei.2005.01.004

Google Scholar

[7] P. Aungkulanon and P. Luangpaiboon., Stochastic search mechanisms on the bee algorithm for optimising noisy multi-response surfaces Lec. Notes in Man. Sci., 4 (2012) 154–164.

Google Scholar

[8] K.S. Lee and Z.W. Geem, A New Meta-heuristic Algorithm for Con. Eng. Optimisation: Harmony Search Theory: Meth. Appl. Mech. Eng., 194( 2004)3902–3933.

Google Scholar

[9] Storn, R. and Price, K. System Design by Constraint Adaptation and Deferential Evolution Journal of Global Optimization 11 (1997)341–359.

Google Scholar

[10] F. Cus, J. Balic, Optimisation of Cutting Process by GA Approach, Robot. and Com. Integ. Manu., 19 (2003)113–121.

Google Scholar

[11] Lokketangen , A. K. Jornsten and S. Storoy, Tabu Search within a Pivot and Complement Framework Tran. in OR. 1(1994)305-316.

DOI: 10.1111/1475-3995.d01-42

Google Scholar

[12] Z. Khan, L.B. Prasad and T. Singhl , Machine Condition Optimisation by Genetic Algorithms and Simulated" Computers Ops Res. 24( 1997)647-657.

Google Scholar

[13] Mladenovic,N., Hansen, P., Variable Neighborhood Search, Com. and OR. 24(1997), 1097–1100.

Google Scholar

[14] M. Mah., M. Fesang. and E. Daman., An improved harmony search algorithm for solving optimization problems App. Math. and Comp., 188(2007) 1567–1579.

Google Scholar

[15] R. Inkaew and P. Luangpaiboon., Multi-Response Surface Optimisation with Different Priorities for Ramp Process Parameter Design Adv. Mat. Res., 548 (2012)744-748.

DOI: 10.4028/www.scientific.net/amr.548.744

Google Scholar