首页 | 本学科首页   官方微博 | 高级检索  
     


Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
Authors:M. Andretta  E.G. Birgin
Affiliation:1. Department of Applied Mathematics and Statistics, Institute of Mathematical and Computer Sciences, University of São Paulo, Avenida Trabalhador São-carlense, 400, Centro, 13566-590 São Carlos, SP, Brazil;2. Department of Computer Science, Institute of Mathematics and Statistics, University of São Paulo, Rua do Matão, 1010, Cidade Universitária, 05508-090 São Paulo, SP, Brazil
Abstract:
Problems of planar covering with ellipses are tackled in this work. Ellipses can have a fixed angle or each of them can be freely rotated. Deterministic global optimization methods are developed for both cases, while a stochastic version of the method is also proposed for large instances of the latter case. Numerical results show the effectiveness and efficiency of the proposed methods.
Keywords:Global optimization   Non-linear programming   Planar covering with ellipses   Algorithms
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号