Solving the illumination problem with heuristics

Authors:
Manuel Abellanas;Enrique Alba;Santiago Canales;Gregorio Hernández
Affiliations:
Universidad Politécnica de Madrid, Facultad de Informática, Departamento de Matemática Aplicada, Spain;Universidad de Málaga, Departamento de Lenguajes y CC, Spain;Universidad Pontificia Comillas de Madrid, Departamento de Matemática Aplicada y Computación, Spain;Universidad Politécnica de Madrid, Facultad de Informática, Departamento de Matemática Aplicada, Spain
Venue:
NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
Year:
2006

Citing 4
Cited 0

Simulated annealing

Modern heuristic techniques for combinatorial problems
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Heuristics for the Generation of Random Polygons

Proceedings of the 8th Canadian Conference on Computational Geometry
Evolutionary Computation

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.