Solving the Illumination Problem with Heuristics

  • Manuel Abellanas
  • Enrique Alba
  • Santiago Canales
  • Gregorio Hernández
Conference paper

DOI: 10.1007/978-3-540-70942-8_24

Volume 4310 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Abellanas M., Alba E., Canales S., Hernández G. (2007) Solving the Illumination Problem with Heuristics. In: Boyanov T., Dimova S., Georgiev K., Nikolov G. (eds) Numerical Methods and Applications. NMA 2006. Lecture Notes in Computer Science, vol 4310. Springer, Berlin, Heidelberg

Abstract

In this article we propose optimal and quasi optimal solutions to the problem of searching for the maximum lighting point inside a polygon P of n vertices. This problem is solved by using three different techniques: random search, simulated annealing and gradient. Our comparative study shows that simulated annealing is very competitive in this application. To accomplish the study, a new polygon generator has been implemented, which greatly helps in the general validation of our claims on the illumination problem as a new class of optimization task.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Manuel Abellanas
    • 1
  • Enrique Alba
    • 2
  • Santiago Canales
    • 3
  • Gregorio Hernández
    • 1
  1. 1.Universidad Politécnica de Madrid. Facultad de Informática, Departamento de Matemática Aplicada.Spain
  2. 2.Universidad de Málaga, Departamento de Lenguajes y CC. CC.Spain
  3. 3.Universidad Pontificia Comillas de Madrid, Departamento de Matemática Aplicada y Computación.Spain