Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Introduction to Optimization Kapitel lesen Erstes Kapitel lesen

2015 | OriginalPaper | Buchkapitel

5. Constrained Probability Collectives with Feasibility Based Rule I

verfasst von : Anand Jayant Kulkarni, Kang Tai, Ajith Abraham

Erschienen in: Probability Collectives

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This chapter demonstrates further efforts to develop a generic constraint handling technique for PC in order to make it a more versatile optimization algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Constrained Probability Collectives with a Penalty Function Approach
Nächstes Kapitel Probability Collectives for Discrete and Mixed Variable Problems
Literatur
1.
Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186, pp. 311–338 (2000)
2.
He, Q., Wang, L.: A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl. Math. Comput. 186, 1407–1422 (2007)CrossRefMATHMathSciNet
3.
Sakthivel, V.P., Bhuvaneswari, R., Subramanian, S.: Design optimization of three-phase energy efficient induction motor using adaptive bacterial foraging algorithm. Comput. Math. Electr. Electron. Eng. 29(3), 699–726 (2010)CrossRefMATH
4.
Kaveh, A., Talatahari, S.: An improved ant colony optimization for constrained engineering design problems. Comput. Aided Eng. Software 27(1), 155–182 (2010)CrossRefMATH
5.
Bansal, S., Mani, A., Patvardhan, C.: Is stochastic ranking really better than feasibility rules for constraint handling in evolutionary algorithms? In: Proceedings of World Congress on Nature and Biologically Inspired Computing, pp. 1564–1567 (2009)
6.
Gao, J., Li, H., Jiao, Y.C.: Modified differential evolution for the integer programming problems. In: Proceedings of International Conference on Artificial Intelligence, pp. 213–219 (2009)
7.
Ping, W., Xuemin, T.: A Hybrid DE-SQP algorithm with switching procedure for dynamic optimization. In: Proceedings of Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference, pp. 2254–2259 (2009)
8.
Ray, T., Tai, K., Seow, K.C.: An evolutionary algorithm for constrained optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 771–777 (2000)
9.
Ray, T., Tai, K., Seow, K.C.: Multiobjective design optimization by an evolutionary algorithm. Eng. Optim. 33(4), 399–424 (2001)CrossRef
10.
Tai, K., Prasad, J.: Target-matching test problem for multiobjective topology optimization using genetic algorithms. Struct. Multi. Optim. 34(4), 333–345 (2007)CrossRef
11.
Kulkarni, A.J., Tai, K.: A probability collectives approach with a feasibility-based rule for constrained optimization. Appl. Comput. Intell. Soft Comput. 2011, Article ID 980216
12.
Metkar, S.J., Kulkarni, A.J.: Boundary searching genetic algorithm: a multi-objective approach for constrained problems. In: Satapathy, S.C., Biswal, B.N., Udgata, S.K. (eds) Advances in Intelligent and Soft Computing, Springer, pp. 269–276 (2014)
13.
Zhang, D., Deng, A.: An effective hybrid algorithm for the problem of packing circles into a larger containing circle. Comput. Oper. Res. 32, 1941–1951 (2005)CrossRefMATH
14.
Theodoracatos, V.E., Grimsley, J.L.: The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules. Comput. Methods Appl. Mech. Eng. 125, 53–70 (1995)CrossRefMATHMathSciNet
15.
Liu, J., Xue, S., Liu, Z., Xu, D.: An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle. Comput. Ind. Eng. 57(3), 1144–1149 (2009)CrossRef
16.
Castillo, I., Kampas, F.J., Pinter, J.D.: Solving circle packing problems by global optimization: numerical results and industrial applications. Eur. J. Oper. Res. 191(3), 786–802 (2008)CrossRefMATHMathSciNet
17.
Garey, M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman & Co. (1979)
18.
Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. Assoc. Comput. Mach. 1(32), 130–136 (1985)CrossRefMathSciNet
19.
Wang, H., Huang, W., Zhang, Q., Xu, D.: An improved algorithm for the packing of unequal circles within a larger containing circle. Eur. J. Oper. Res. 141, 440–453 (2002)CrossRefMATHMathSciNet
20.
Szabo, P.G., Markot, M.C., Csendes, T.: Global optimization in geometry—circle packing into the square. Essays and Surveys. In: Audet, P., Hansen, P., Savard, G. (eds.) Global Optimization, Kluwer , pp. 233–265 (2005)
21.
22.
Nurmela, K.J., Ostergard, P.R.J.: More optimal packing of equal circles in a square. Discrete Comput. Geom. 22, 439–457 (1999)CrossRefMATHMathSciNet
23.
Graham, R.L., Lubachevsky, B.D.: Repeated patterns of dense packings of equal disks in a square. Electr. J. Combinatorics 3, 1–16 (1996)
24.
Szabo, P.G., Csendes, T., Casado, L.G., Garcia, I.: Equal circles packing in a square i—problem setting and bounds for optimal solutions. In: Giannessi, F., Pardalos, P., Rapcsak, T. (eds.) Optimization Theory: Recent Developments from Matrahaza, Kluwer, pp. 191–206 (2001)
25.
de Groot, C., Peikert, R., Wurtz, D.: The Optimal Packing of Ten Equal Circles in a Square, IPS Research Report 90-12. ETH, Zurich (1990)
26.
Goldberg, M.: The packing of equal circles in a square, Mathematics Magazine, 43 pp. 24–30 (1970)
27.
28.
29.
30.
31.
Boll, D.W., Donovan, J., Graham, R.L., Lubachevsky, B.D.: Improving dense packings of equal disks in a square. Electr. J. Combinatorics 7, R46 (2000)MathSciNet
32.
Lubachevsky, D., Graham, R.L.: Curved hexagonal packing of equal circles in a circle. Discrete Comput. Geom. 18, 179–194 (1997)CrossRefMATHMathSciNet
33.
Szabo, P. G. Specht, E.: Packing up to 200 equal circles in a square. In: Torn, A., Zilinskas, J. (eds.) Models And Algorithms For Global Optimization, pp. 141–156 (2007)
34.
Mladenovic, N., Plastria, F., Urosevi, D.: Formulation space search for circle packing problems. LNCS, pp. 212–216 (2007)
35.
Mldenovic, N., Plastria, F., Urosevi, D.: Reformulation descent applied to circle packing problems. Comput. Oper. Res. 32, 2419–2434 (2005)CrossRef
36.
Huang, W., Chen, M.: Note on: an improved algorithm for the packing of unequal circles within a larger containing circle. Comput. Ind. Eng. 50(2), 338–344 (2006)CrossRef
37.
Liu, J., Xu, D., Yao, Y., Zheng, Y.: Energy landscape paving algorithm for solving circles packing problem. In: International Conference on Computational Intelligence and Natural Computing, pp. 107–110 (2009)
38.
Liu, J., Yao,Y., Zheng, Y., Geng, H., Zhou, G.: An effective hybrid algorithm for the circles and spheres packing problems. LNCS-5573, pp. 135–144 (2009)
39.
Stoyan, Y.G., Yaskov, G.N.: Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. Int. Trans. Oper. Res. 5, 45–57 (1998)CrossRefMATH
40.
Stoyan, Y.G., Yaskov, G.N.: A mathematical model and a solution method for the problem of placing various-sized circles into a strip. Eur. J. Oper. Res. 156, 590–600 (2004)CrossRefMATHMathSciNet
41.
George, J.A.: Multiple container packing: a case study of pipe packing. J. Oper. Res. Soc. 47, 1098–1109 (1996)CrossRefMATH
42.
George, J.A., George, J.M., Lamar, B.W.: Packing different-sized circles into a rectangular container. Eur. J. Oper. Res. 84, 693–712 (1995)CrossRefMATH
43.
Hifi, M., M’Hallah, R.: Approximate algorithms for constrained circular cutting problems. Comput. Oper. Res. 31, 675–694 (2004)CrossRefMATH
44.
Bieniawski, S.R.: Distributed optimization and flight control using collectives. Ph.D. Dissertation, Stanford University, CA, USA (2005)
45.
Chandler, P., Rasumussen, S., Pachter, M.: UAV cooperative path-planning. In: Proceedings of AIAA Guidance, Navigation, and Control Conference. Paper. No. 4370 (2000)
46.
Sislak, D., Volf, P., Komenda, A., Samek, J., Pechoucek, M.: Agent-based multi-layer collision avoidance to unmanned aerial vehicles. In: Proceedings of International Conference on Integration of Knowledge Intensive Multi-Agent Systems, Art. No. 4227576, pp. 365–370 (2007)
47.
Krozel, J., Peters, M., Bilimoria, K.: A decentralized control strategy for distributed air/ground traffic separation. In: Proceedings of AIAA Guidance, Navigation and Control Conference and Exhibit, Paper, No. 4062 (2000)
48.
Zengin, U., Dogan, A.: Probabilistic trajectory planning for UAVs in dynamic environments. In: Proceedings of AIAA 3rd “Unmanned-Unlimited” Technical Conference, Workshop, and Exhibit 2, Paper, No. 6528 (2004)
49.
Anderson, M.R., Robbins, A.C.: Formation flight as a cooperative game. In: Proceedings of AIAA Guidance, Navigation, and Control Conference, pp. 244–251 (1998)
50.
Chang, D.E., Shadden, Marsden J. E., Olfati-Saber, R.: Collision avoidance for multiple agent systems. In: Proceedings of 42nd IEEE Conference on Decision and Control, pp. 539–543 (2003)
51.
Sigurd, K., How, J.: UAV trajectory design using total field collision avoidance. In: Proceedings of AIAA Guidance, Navigation, and Control Conference, Paper No. 5728 (2003)
52.
Metadaten
Titel
Constrained Probability Collectives with Feasibility Based Rule I
verfasst von
Anand Jayant Kulkarni
Kang Tai
Ajith Abraham
Copyright-Jahr
2015
Buch
Probability Collectives

Print ISBN: 978-3-319-15999-7

Electronic ISBN: 978-3-319-16000-9

Copyright-Jahr: 2015

DOI
https://doi.org/10.1007/978-3-319-16000-9_5