A Genetic Algorithm for a Sensor Device Location Problem

Chapter
First Online:
Part of the Computational Methods in Applied Sciences book series (COMPUTMETHODS, volume 36)

Abstract

In this paper we present a noncooperative game theoretical model for the well known problem of experimental design. A virtual player decides the design variables of an experiment and all the players solve a Nash equilibrium problem by optimizing suitable payoff functions. We consider the case where the design variables are the coordinates of \(n\) points in a region of the plane and we look for the optimal configuration of the points under some constraints. Arising from a concrete situation, concerning the ARGO-YBJ experiments, the goal is to find the optimal configuration of the detector, consisting of a single layer of resistive plate counters. Theoretical and computational results are presented for this location problem.

Keywords

Facility location Nash equilibrium Constrained optimization 
This is a preview of subscription content, log in to check access.

Notes

Acknowledgments

This work has been partially supported by F.A.R.O. 2012 “Metodi Matematici per la modellizzazione di fenomeni naturali”, University of Naples Federico II, Italy.

References

  1. 1.
    Bacci C, Bao KZ, Barone F, Bartoli B, Bernardini P, Buonomo R, Bussino S, Calloni E, Cao BY, Cardarelli R et al (2002) High altitude test of RPCs for the Argo YBJ experiment. In: Nuclear instruments and methods in physics research section a: accelerators, spectrometers, detectors and associated equipment, vol 443(2), Elsevier, Amsterdam, pp 342–350Google Scholar
  2. 2.
    Başar T, Olsder GJ (1999) Dynamic noncooperative game theory, Reprint of the second (1995) edition, Classics in applied mathematics, Society for industrial and applied mathematics (SIAM), PhiladelphiaGoogle Scholar
  3. 3.
    Benabbou A, Borouchaki H, Laug P, Lu J (2008) Sphere packing and applications to granular structure modeling. In: Garimella RV (ed) Proceedings of the 17th international meshing roundtable, Springer, 12–15 October 2008Google Scholar
  4. 4.
    Clarich A, Periaux J, Poloni C (2003) Combining game strategies and evolutionary algorithms for CAD parametrization and multi-point optimization of complex aeronautic systems. In: EUROGEN 2003, BarcelonaGoogle Scholar
  5. 5.
    Conway JH, Sloane NJA (1998) Sphere packings, lattices and groups. Springer, New YorkGoogle Scholar
  6. 6.
    D’Amato E, Daniele E, Mallozzi L, Petrone G (2012) Equilibrium strategies via GA to stackelberg games under multiple follower best reply. Int J Intell Syst 27:74–85CrossRefGoogle Scholar
  7. 7.
    D’Amato E, Daniele E, Mallozzi L, Petrone G, Tancredi S (2012) A hierarchical multi-modal hybrid Stackelberg-Nash GA for a leader with multiple followers game. In: Sorokin A, Murphey R, Thai MT, Pardalos PM (ed) Dynamics of information systems: foundations mathematical, Springer proceedings in mathematics & statistics. Springer, New York, pp 267–280Google Scholar
  8. 8.
    D’Amato E, Daniele E, Mallozzi L, Petrone G (2012) Waiting time costs in a bilevel location-allocation problem. Contrib Game Theor Manage 5:178–186Google Scholar
  9. 9.
    Dean AM, Voss D (2000) Design and analysis of experiments series, Springer texts in statistics. Springer, New YorkGoogle Scholar
  10. 10.
    Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, ChichesterMATHGoogle Scholar
  11. 11.
    Donev A, Torquato S, Stillinger FH, Connelly R (2004) A linear programming algorithm to test for jamming in hard-sphere packings. J Comput Phys 197:139–166CrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    Fudenberg D, Tirole J (1993) Game theory. The MIT Press, CambridgeGoogle Scholar
  13. 13.
    Hales TC (1992) The sphere packing problem. J Comput Appl Math 42:41–76CrossRefMathSciNetGoogle Scholar
  14. 14.
    Mallozzi L (2007) Noncooperative facility location games. Oper Res Lett 35:151–154CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    Mallozzi L, D’Amato E, Daniele E, Petrone G (2011) N leader—M follower coalition games with genetic algorithms and applications. In: Poloni C, Quagliarella D, Periaux J, Gauger N, Giannakoglou K (eds) Evolutionary and deterministic methods for design, optimization and control. CIRA, CapuaGoogle Scholar
  16. 16.
    Nurmela KJ (1997) Stochastic optimization methods in sphere packing and covering problems in discrete geometry and coding theory, PhD Thesis, Helsinki University of Technology, printed by Picaset OyGoogle Scholar
  17. 17.
    Periaux J, Chen HQ, Mantel B, Sefrioui M, Sui HT (2001) Combining game theory and genetic algorithms with application to DDM-nozzle optimization problems. Finite Elem Anal Des 37:417–429CrossRefMATHGoogle Scholar
  18. 18.
    Sloane NJA (1998) The sphere packing problem, Shannon lecture. AT & T Shannon Lab, Florham Park, pp 07932–0971Google Scholar
  19. 19.
    Sutou A, Dai Y (2002) Global optimization approach to unequal sphere packing problems in 3D. J Optim Theor Appl 114(3):671–694CrossRefMATHMathSciNetGoogle Scholar
  20. 20.
    Wang JF, Periaux J (2001) Multi-point optimization using GAS and Nash/Stackelberg games for high lift multi-airfoil design in aerodynamics. In: Proceedings of the 2001 congress on evolutionary computation CEC2001, May 2001, pp 552–559Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Dipartimento di Ingegneria Industriale e dell’InformazioneSeconda Università degli Studi di NapoliAversaItaly
  2. 2.Fraunhofer Institut für Windenergie und Energiesystemtechnik - IWESOldenburgGermany
  3. 3.Department of Mathematics and Applications “R.Caccioppoli”University of Naples “Federico II”NaplesItaly

Personalised recommendations