51 resultados para HEURÍSTICA
Resumo:
Pós-graduação em Engenharia Mecânica - FEG
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Ciências Biológicas (Zoologia) - IBRC
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
The usability and accessibility, when applied to digital information environments, provide ease of use and access to information, respectively. Thus, we aim to discuss these concepts and apply them in specific digital environments to the elderly through the documentary and bibliographic study of specific recommendations on projects for elderly users. This study was conducted in conjunction with students at the Universidade Aberta à Terceira Idade (UNATI) - UNESP - Marilia, who assisted in the classification of recommendations for usability and accessibility are essential (Priority 1), important (Priority 2) and optional (Priority 3). The results indicate the importance of this type of study for the digital and social inclusion of older people by facilitating elements of access and use of information, providing the building more inclusive informational architectures. The resulting recommendations can be used as a starting point for the design of digital environments for the elderly in a specific heuristic evaluation, for example. However, it remains important to the application of usability testing with users, including the application to validate these recommendations, since different contexts may arise from the implementation of different elements, resources and information services.
Resumo:
Pós-graduação em Engenharia Mecânica - FEG
Resumo:
One of the reasons that influences the efficience of a port terminal that is especialized in movement of containers is in the process of their loading and unloading. The fundamental idea is to determine a plan, to each port in order to decrease the number of total movement of loading and unloading that are necessary during the ship route to every port so that they save time and consequently reduce costs. The goal of this research was to present improvement in the program, written in language C, used to solve to problem of loading and unloading of ships, a NP-complete problem, through the meta-heuristics Simulated Annealing. With the improvement made, an average of 50% reduction of necessary time was gotten to solve the problem in 45 analised instances and in a specific group of these instances the average reduction reached 77 and in 10 instances there was even an improvement in the solution
Resumo:
One problem that has been happening frequently in port terminals is the poor planning of the loading and unloading of containers. The reason of this problem is the lack of an efficient method that provides the best means of these operations. The main goal of this work is, to implement a method that provides the best ways to perform the loading and unloading of containers, at each port and thus bring a great saving for these terminals, since the number of moves is directly proportional to cost. To carry out this program was used the idea that the containers are placed in vertical stacks, where the access can be done only by the top of the stack, so the ship was treated as an matrix and to fill it, two rules were created for loading and two for unloading. To obtain the best sequence of rules was used Beam Search method, which is an enumeration type implicit method that analyzes only the best solution of the tree generated. Thus, the program developed in the Java language, provides the best way to perform the loading and unloading ports and the way as the ship leaves each port using a graphical interface
Resumo:
The Set Covering Problem (SCP) plays an important role in Operational Research since it can be found as part of several real-world problems. In this work we report the use of a genetic algorithm to solve SCP. The algorithm starts with a population chosen by a randomized greedy algorithm. A new crossover operator and a new adaptive mutation operator were incorporated into the algorithm to intensify the search. Our algorithm was tested for a class of non-unicost SCP obtained from OR-Library without applying reduction techniques. The algorithms found good solutions in terms of quality and computational time. The results reveal that the proposed algorithm is able to find a high quality solution and is faster than recently published approaches algorithm is able to find a high quality solution and is faster than recently published approaches using the OR-Library.
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
Pós-graduação em Design - FAAC
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS