Skip to main content
SpringerLink
Log in

Constrained Probability Collectives with Feasibility Based Rule I

  • Chapter
  • First Online:
Probability Collectives

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 86))

  • 926 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186, pp. 311–338 (2000)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  4. Kaveh, A., Talatahari, S.: An improved ant colony optimization for constrained engineering design problems. Comput. Aided Eng. Software 27(1), 155–182 (2010)

    Article  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  9. Ray, T., Tai, K., Seow, K.C.: Multiobjective design optimization by an evolutionary algorithm. Eng. Optim. 33(4), 399–424 (2001)

    Article  Google Scholar 

  10. Tai, K., Prasad, J.: Target-matching test problem for multiobjective topology optimization using genetic algorithms. Struct. Multi. Optim. 34(4), 333–345 (2007)

    Article  Google Scholar 

  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

    Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  17. Garey, M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman & Co. (1979)

    Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  21. Nurmela, K.J., Ostergard, P.R.J.: Packing up to 50 equal circles in a square. Discrete Comput. Geom. 18, 111–120 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  22. Nurmela, K.J., Ostergard, P.R.J.: More optimal packing of equal circles in a square. Discrete Comput. Geom. 22, 439–457 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  26. Goldberg, M.: The packing of equal circles in a square, Mathematics Magazine, 43 pp. 24–30 (1970)

    Google Scholar 

  27. Mollard, M., Payan, C.: Some progress in the packing of equal circles in a square. Discrete Math. 84, 303–307 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  28. Schaer, J.: On the packing of ten equal circles in a square. Math. Mag. 44, 139–140 (1971)

    MATH  MathSciNet  Google Scholar 

  29. Schluter, K.: Kreispackung in quadraten. Elem. Math. 34, 12–14 (1979)

    MathSciNet  Google Scholar 

  30. Valette, G.: A better packing of ten circles in a square. Discrete Math. 76, 57–59 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  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  Google Scholar 

  32. Lubachevsky, D., Graham, R.L.: Curved hexagonal packing of equal circles in a circle. Discrete Comput. Geom. 18, 179–194 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  34. Mladenovic, N., Plastria, F., Urosevi, D.: Formulation space search for circle packing problems. LNCS, pp. 212–216 (2007)

    Google Scholar 

  35. Mldenovic, N., Plastria, F., Urosevi, D.: Reformulation descent applied to circle packing problems. Comput. Oper. Res. 32, 2419–2434 (2005)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  41. George, J.A.: Multiple container packing: a case study of pipe packing. J. Oper. Res. Soc. 47, 1098–1109 (1996)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  43. Hifi, M., M’Hallah, R.: Approximate algorithms for constrained circular cutting problems. Comput. Oper. Res. 31, 675–694 (2004)

    Article  MATH  Google Scholar 

  44. Bieniawski, S.R.: Distributed optimization and flight control using collectives. Ph.D. Dissertation, Stanford University, CA, USA (2005)

    Google Scholar 

  45. Chandler, P., Rasumussen, S., Pachter, M.: UAV cooperative path-planning. In: Proceedings of AIAA Guidance, Navigation, and Control Conference. Paper. No. 4370 (2000)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  52. Haddin, G.: The tragedy of commons. Science 162, 1243–1248 (1968)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore, Singapore

    Anand Jayant Kulkarni & Kang Tai

  2. Scientific Network for Innovation and Research Excellence, Machine Intelligence Research Labs (MIR Labs), Auburn, WA, USA

    Ajith Abraham

Authors
  1. Anand Jayant Kulkarni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kang Tai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ajith Abraham
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anand Jayant Kulkarni .

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Kulkarni, A.J., Tai, K., Abraham, A. (2015). Constrained Probability Collectives with Feasibility Based Rule I. In: Probability Collectives. Intelligent Systems Reference Library, vol 86. Springer, Cham. https://doi.org/10.1007/978-3-319-16000-9_5

Download citation

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

  • Published:

  • Publisher Name: Springer, Cham

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

  • Online ISBN: 978-3-319-16000-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation