Chapter

Numerical Methods and Applications

Volume 4310 of the series Lecture Notes in Computer Science pp 205-213

Solving the Illumination Problem with Heuristics

  • Manuel AbellanasAffiliated withUniversidad Politécnica de Madrid. Facultad de Informática, Departamento de Matemática Aplicada.
  • , Enrique AlbaAffiliated withUniversidad de Málaga, Departamento de Lenguajes y CC. CC.
  • , Santiago CanalesAffiliated withUniversidad Pontificia Comillas de Madrid, Departamento de Matemática Aplicada y Computación.
  • , Gregorio HernándezAffiliated withUniversidad Politécnica de Madrid. Facultad de Informática, Departamento de Matemática Aplicada.

* Final gross prices may vary according to local VAT.

Get Access

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.