Multi-objective feasibility enhanced particle swarm optimization. (English) Zbl 1523.90297
Summary: This article introduces a new method entitled multi-objective feasibility enhanced partical swarm optimization (MOFEPSO), to handle highly-constrained multi-objective optimization problems. MOFEPSO, which is based on the particle swarm optimization technique, employs repositories of non-dominated and feasible positions (or solutions) to guide feasible particle flight. Unlike its counterparts, MOFEPSO does not require any feasible solutions in the initialized swarm. Additionally, objective functions are not assessed for infeasible particles. Such particles can only fly along sensitive directions, and particles are not allowed to move to a position where any previously satisfied constraints become violated. These unique features help MOFEPSO gradually increase the overall feasibility of the swarm and to finally attain the optimal solution. In this study, multi-objective versions of a classical gear-train optimization problem are also described. For the given problems, the article comparatively evaluates the performance of MOFEPSO against several popular optimization algorithms found in the literature.
MSC:
| 90C29 | Multi-objective and goal programming |
| 90C59 | Approximation methods and heuristics in mathematical programming |
Keywords:
constraint handling; mechanical design; constrained problems; multi-objective optimization; particle swarm optimizationReferences:
| [1] | Azadani, E. N.; Hosseinian, S. H.; Moradzadeh, B., Generation and Reserve Dispatch in a Competitive Market Using Constrained Particle Swarm Optimization, International Journal of Electrical Power & Energy Systems, 32, 1, 79-86 (2010) · doi:10.1016/j.ijepes.2009.06.009 |
| [2] | Banks, Alec; Vincent, Jonathan; Anyakoha, Chukwudi, A Review of Particle Swarm Optimization. Part I: Background and Development, Natural Computing, 6, 4, 467-484 (2007) · Zbl 1125.90065 · doi:10.1007/s11047-007-9049-5 |
| [3] | Banks, Alec; Vincent, Jonathan; Anyakoha, Chukwudi, A Review of Particle Swarm Optimization. Part II: Hybridisation, Combinatorial, Multicriteria and Constrained Optimization, and Indicative Applications, Natural Computing, 7, 1, 109-124 (2008) · Zbl 1148.68375 · doi:10.1007/s11047-007-9050-z |
| [4] | Bratton, D., and Kennedy, J.. 2007. “Defining a Standard for Particle Swarm Optimization.” In Proceedings of the 2007 IEEE Swarm Intelligence Symposium, 120-127. Washington, DC: IEEE Computer Society. |
| [5] | Clerc, Maurice.2004. “Discrete Particle Swarm Optimization, Illustrated by the Traveling Salesman Problem.” In New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, Vol. 141, 219-239. Berlin: Springer. · Zbl 1139.90415 |
| [6] | Coelhos, Leandrodos Santo., An Efficient Particle Swarm Approach for Mixed-Integer Programming in Reliability-redundancy Optimization Applications, Reliability Engineering & System Safety, 94, 4, 830-837 (2009) · doi:10.1016/j.ress.2008.09.001 |
| [7] | Coello, C. A. C.; Pulido, G. T.; Lechuga, M. S., Handling Multiple Objectives with Particle Swarm Optimization, IEEE Transactions on Evolutionary Computation, 8, 3, 256-279 (2004) · doi:10.1109/TEVC.2004.826067 |
| [8] | Coello Coello, Carlos A., Theoretical and Numerical Constraint-Handling Techniques Used with Evolutionary Algorithms: A Survey of the State of the Art, Computer Methods in Applied Mechanics and Engineering, 191, 1112, 1245-1287 (2002) · Zbl 1026.74056 · doi:10.1016/S0045-7825(01)00323-1 |
| [9] | Coello Coello, Carlos A., and Salazar Lechuga, Maximino. 2002. “MOPSO: A Proposal for Multiple Objective Particle Swarm Optimization.” In Proceedings of the Evolutionary Computation on 2002 (CEC ’02) - Volume 02, 1051-1056. Washington, DC: IEEE Computer Society. |
| [10] | Deb, Kalyanmoy., An Efficient Constraint Handling Method for Genetic Algorithms, Computer Methods in Applied Mechanics and Engineering, 186, 24, 311-338 (2000) · Zbl 1028.90533 · doi:10.1016/S0045-7825(99)00389-8 |
| [11] | Deb, Kalyanmoy, Agrawal, Samir, Pratap, Amrit, and Meyarivan, Tanaka. 2000. “A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II.” In Parallel Problem Solving from Nature PPSN VI, edited by M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo and H.-P. Schwefel, 849-858. Berlin: Springer. |
| [12] | Dolen, M.; Kaplan, H.; Seireg, A., Discrete Parameter-Nonlinear Constrained Optimisation of a Gear Train Using Genetic Algorithms, International Journal of Computer Applications in Technology, 24, 2, 110-121 (2005) · doi:10.1504/IJCAT.2005.007213 |
| [13] | Eberhart, Russ C., and Kennedy, James. 1995. “A New Optimizer Using Particle Swarm Theory.” In Proceedings of the Sixth International Symposium on Micro Machine and Human Science, 39-43. New York, NY: IEEE. |
| [14] | Goldbarg, Elizabeth F. Gouvêa, deSouza, Givanaldo R., and Goldbarg, Marco César.. 2006. “Particle Swarm for the Traveling Salesman Problem.” In Evolutionary Computation in Combinatorial Optimization, edited by Jens Gottlieb and Günther R. Raidl, 99-110. Berlin: Springer. · Zbl 1255.90073 |
| [15] | Goldbarg, Elizabeth F. G., Goldbarg, Marco C., and deSouza, Givanaldo R.. 2008. “Particle Swarm Optimization Algorithm for the Traveling Salesman Problem.” In Traveling Salesman Problem, edited by Federico Greco, 75-96. InTech. https://www.intechopen.com/books/traveling_salesman_problem/particle_swarm_optimization_algorithm_for_the_traveling_salesman_problem |
| [16] | Hasanoglu, Mehmet Sinan, and Dolen, Melik. 2016. “Feasibility Enhanced Particle Swarm Optimization for Constrained Mechanical Design Problems.” Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science232 (2): 381-400. · Zbl 1523.90297 |
| [17] | Jian, L., Peng, C., and Zhiming, L.. 2008. “Solving Constrained Optimization via Dual Particle Swarm Optimization with Stochastic Ranking.” In 2008 International Conference on Computer Science and Software Engineering, 1215-1218. IEEE. |
| [18] | Jordehi A, Rezaee.2015. “A Review on Constraint Handling Strategies in Particle Swarm Optimisation.” Neural Computing and Applications 26 (6): 1265-1275. |
| [19] | Kashan, Ali Husseinzadeh.; Karimi, Behrooz, A Discrete Particle Swarm Optimization Algorithm for Scheduling Parallel Machines, Computers & Industrial Engineering, 56, 1, 216-223 (2009) · doi:10.1016/j.cie.2008.05.007 |
| [20] | Kennedy, J., and Eberhart, R.. 1995. “Particle Swarm Optimization.” In IEEE International Conference on Neural Networks, 1995. Proceedings, Vol. 4, 1942-1948. IEEE. |
| [21] | Kennedy, J., and Eberhart, R. C.. 1997. “A Discrete Binary Version of the Particle Swarm Algorithm.” In 1997 IEEE International Conference on Systems, Man, and Cybernetics, Vol. 5, 4104-4108. IEEE. |
| [22] | KhorshidE, E.; Seireg, A., Discrete Nonlinear Optimisation by Constraint Decomposition and Designer Interaction, International Journal of Computer Applications in Technology, 12, 2, 233-244 (1999) · doi:10.1504/IJCAT.1999.000208 |
| [23] | Kotinis, Miltiadis., A Particle Swarm Optimizer for Constrained Multi-Objective Engineering Design Problems, Engineering Optimization, 42, 10, 907-926 (2010) · doi:10.1080/03052150903505877 |
| [24] | Lalwani, Soniya.; Singhal, Sorabh; Kumar, Rajesh; Gupta, Nilama, A Comprehensive Survey: Applications of Multi-Objective Particle Swarm Optimization (MOPSO) Algorithm, Transactions on Combinatorics, 2, 1, 39-101 (2013) · Zbl 1329.90130 |
| [25] | Laskari, Elena C., Parsopoulos, Konstantinos E., and Vrahatis, Michael N.. 2002. “Particle Swarm Optimization for Integer Programming.” In Proceedings of the World on Congress on Computational Intelligence, Vol. 2, 1582-1587. IEEE. |
| [26] | Loh, WeiLiem., On Latin Hypercube Sampling, The Annals of Statistics, 24, 5, 2058-2080 (1996) · Zbl 0867.62005 · doi:10.1214/aos/1069362310 |
| [27] | Lu, Haiyan; Chen, Weiqi, Dynamic-Objective Particle Swarm Optimization for Constrained Optimization Problems, Journal of Combinatorial Optimization, 12, 4, 409-419 (2006) · Zbl 1126.90080 · doi:10.1007/s10878-006-9004-x |
| [28] | Mallipeddi, Rammohan, and Suganthan, Ponnuthurai Nagaratnam.. 2010. “Problem Definitions and Evaluation Criteria for the CEC 2010 Competition on Constrained Real-Parameter Optimization.” Technical Report. Nanyang Technological University, Singapore. · Zbl 1484.90103 |
| [29] | Mezura-Montes, Efrén.; Coello Coello, Carlos A., Constraint-Handling in Nature-Inspired Numerical Optimization: Past, Present and Future, Swarm and Evolutionary Computation, 1, 4, 173-194 (2011) · Zbl 1218.90004 · doi:10.1016/j.swevo.2011.10.001 |
| [30] | Nourbakhsh, Ahmad; Safikhani, Hamed; Derakhshan, Shahram, The Comparison of Multi-Objective Particle Swarm Optimization and NSGA II Algorithm: Applications in Centrifugal Pumps, Engineering Optimization, 43, 10, 1095-1113 (2011) · doi:10.1080/0305215X.2010.542811 |
| [31] | Pan, Quan-Ke.; Fatih Tasgetiren, M.; Liang, Yun-Chia., A Discrete Particle Swarm Optimization Algorithm for the No-Wait Flowshop Scheduling Problem, Computers & Operations Research, 35, 9, 2807-2839 (2008) · Zbl 1144.90393 · doi:10.1016/j.cor.2006.12.030 |
| [32] | Pang, Wei., Wang, Kangping, Zhou, Chunguang, and Dong, Longjiang. 2004. “Fuzzy Discrete Particle Swarm Optimization for Solving Traveling Salesman Problem.” In The Fourth International Conference on Computer and Information Technology, 2004. CIT ’04, 796-800. September. |
| [33] | Parsopoulos, K. E., and Vrahatis, M. N.. 2005. “Unified Particle Swarm Optimization for Solving Constrained Engineering Optimization Problems.” In Advances in Natural Computation, edited by Lipo Wang, Ke Chen, and Yew Soon Ong, 582-591. Berlin: Springer. |
| [34] | Poles, Silvia.2003. “MOGA-II an Improved Multi-Objective Genetic Algorithm.” ESTECO Technical Report 6. |
| [35] | Pomrehn, LP; Papalambros, PY, Infeasibility and Non-Optimality Tests for Solution Space Reduction in Discrete Optimal Design, Journal of Mechanical Design, 117, 3, 425-432 (1995) · doi:10.1115/1.2826696 |
| [36] | Pomrehn, L. P.; Papalambros, P. Y., Discrete Optimal Design Formulations with Application to Gear Train Design, Journal of Mechanical Design, 117, 3, 419-424 (1995) · doi:10.1115/1.2826695 |
| [37] | Rao R, Venkata; Savsani, Vimal J., Mechanical Design Optimization Using Advanced Optimization Techniques (2012), London: Springer, London |
| [38] | Ray, Tapabrata; Tai, Kang; Seow, Kin Chye, Multiobjective Design Optimization by an Evolutionary Algorithm, Engineering Optimization, 33, 4, 399-424 (2001) · doi:10.1080/03052150108940926 |
| [39] | Reddy M, Janga; Kumar, Nagesh, An Efficient Multi-Objective Optimization Algorithm Based on Swarm Intelligence for Engineering Design, Engineering Optimization, 39, 1, 49-68 (2007) · doi:10.1080/03052150600930493 |
| [40] | Savsani, Poonam; Savsani, Vimal, Passing Vehicle Search (PVS): A Novel Metaheuristic Algorithm, Applied Mathematical Modelling, 40, 5-6, 3951-3978 (2016) · doi:10.1016/j.apm.2015.10.040 |
| [41] | Savsani, Vimal., HBBABC: A Hybrid Optimization Algorithm Combining Biogeography Based Optimization (BBO) and Artificial Bee Colony (ABC) Optimization For Obtaining Global Solution Of Discrete Design Problems, International Journal Of Computational Engineering Research, 2, 7, 85-97 (2012) |
| [42] | Savsani, VJ; Rao, RV; Vakharia, DP, Discrete Optimisation of a Gear Train Using Biogeography Based Optimisation Technique, International Journal of Design Engineering, 2, 2, 205-223 (2009) · doi:10.1504/IJDE.2009.028652 |
| [43] | Takahama, Tetsuyuki, and Sakai, Setsuko. 2004. “Constrained Optimization by Combining the α Constrained Method with Particle Swarm Optimization.” In Proceedings of the Joint 2nd International Conference on Soft Computing and Intelligent Systems and 5th International Symposium on Advanced Intelligent Systems. · Zbl 1173.90549 |
| [44] | Takahama, T., and Sakai, S.. 2006. “Solving Constrained Optimization Problems by the ε Constrained Particle Swarm Optimizer with Adaptive Velocity Limit Control.” In 2006 IEEE Conference on Cybernetics and Intelligent Systems, 1-7. IEEE. |
| [45] | Wang, Jinhua; Yin, Zeyong, A Ranking Selection-Based Particle Swarm Optimizer for Engineering Design Optimization Problems, Structural and multidisciplinary optimization, 37, 2, 131-147 (2008) · doi:10.1007/s00158-007-0222-3 |
| [46] | Wilcoxon, Frank., Individual Comparisons by Ranking Methods, Biometrics Bulletin, 1, 6, 80-83 (1945) · doi:10.2307/3001968 |
| [47] | Zheng, J., Wu, Q., and Song, W.. 2007. “An Improved Particle Swarm Algorithm for Solving Nonlinear Constrained Optimization Problems.” In Third International Conference on Natural Computation (ICNC 2007), Vol. 4, 112-117. IEEE. |
| [48] | Zhou, Aimin; Qu, BoYang; Li, Hui; Zhao, Shi-Zheng; Suganthan, Ponnuthurai Nagaratnam.; Zhang, Qing fu, Multiobjective Evolutionary Algorithms: A Survey of the State of the Art, Swarm and Evolutionary Computation, 1, 1, 32-49 (2011) · doi:10.1016/j.swevo.2011.03.001 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
