Thursday, 14:15 - 14:40 h, Room: H 3012

 

Marta Vidal
A new proposal for a lower bound in a generalized quadratic assignment problem applied to the zoning problem

Coauthor: MarĂ­a Cristina Maciel

 

Abstract:
Zoning is a key prescriptive tool for administration and management of protected areas. However, the lack of zoning is common for most protected areas in developing countries and, as a consequence, many protected areas are not effective in achieving the goals for which they were created. In this work we introduce a quantitative method to expeditiously zone protected areas.
Zoning problem was mathematically modeled as a generalized quadratic assignment problem (GQAP), this problem generalizes the well known quadratic assignment problem, one of the most difficult problems in the combinatorial optimization field, it belongs to the NP- hard class. To solve it we applied a simulated annealing heuristic, obtaining satisfactory results in both academic problems of different dimensions as a real large scale problem.
In this work we propose a lower bound for the GQAP based on a new Lagrangean relaxation, which will be applied to the simulated annealing algorithm.

 

Talk 3 of the contributed session Thu.2.H 3012
"Nonlinear combinatorial optimization" [...]
Cluster 2
"Combinatorial optimization" [...]

 

  personal loans. In this section we give only a brief summary recommendation for admission of Levitra. Full information can be found in the instructions for receiving medications with vardenafil.