1 resultado para COVERAGE PROBLEM
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo
Filtro por publicador
- JISC Information Environment Repository (2)
- Abertay Research Collections - Abertay University’s repository (1)
- Aberystwyth University Repository - Reino Unido (6)
- Adam Mickiewicz University Repository (5)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- Aquatic Commons (30)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (9)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (2)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (1)
- Boston University Digital Common (8)
- Brock University, Canada (25)
- CaltechTHESIS (11)
- Cambridge University Engineering Department Publications Database (72)
- CentAUR: Central Archive University of Reading - UK (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (52)
- Cochin University of Science & Technology (CUSAT), India (10)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Cornell: DigitalCommons@ILR (1)
- Deakin Research Online - Australia (8)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (2)
- Diposit Digital de la UB - Universidade de Barcelona (2)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (6)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (6)
- Funes: Repositorio digital de documentos en Educación Matemática - Colombia (1)
- Greenwich Academic Literature Archive - UK (22)
- Helda - Digital Repository of University of Helsinki (24)
- Indian Institute of Science - Bangalore - Índia (145)
- Instituto Politécnico do Porto, Portugal (16)
- Massachusetts Institute of Technology (6)
- Ministerio de Cultura, Spain (20)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (8)
- Portal de Revistas Científicas Complutenses - Espanha (3)
- QSpace: Queen's University - Canada (3)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (148)
- Queensland University of Technology - ePrints Archive (245)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (3)
- Repositório Institucional da Universidade de Aveiro - Portugal (5)
- Repositório Institucional da Universidade Federal do Rio Grande - FURG (1)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- SAPIENTIA - Universidade do Algarve - Portugal (8)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- Universidad de Alicante (1)
- Universidad del Rosario, Colombia (10)
- Universidad Politécnica de Madrid (3)
- Universidad Politécnica Salesiana Ecuador (1)
- Universidade de Lisboa - Repositório Aberto (2)
- Universitat de Girona, Spain (4)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (14)
- Université de Lausanne, Switzerland (2)
- Université de Montréal, Canada (19)
- University of Southampton, United Kingdom (6)
- University of Washington (1)
- WestminsterResearch - UK (1)
Resumo:
This paper aims to provide an improved NSGA-II (Non-Dominated Sorting Genetic Algorithm-version II) which incorporates a parameter-free self-tuning approach by reinforcement learning technique, called Non-Dominated Sorting Genetic Algorithm Based on Reinforcement Learning (NSGA-RL). The proposed method is particularly compared with the classical NSGA-II when applied to a satellite coverage problem. Furthermore, not only the optimization results are compared with results obtained by other multiobjective optimization methods, but also guarantee the advantage of no time-spending and complex parameter tuning.