819 resultados para layout algorithm
Resumo:
This masters thesis describes the development of signal processing and patternrecognition in monitoring Parkison’s disease. It involves the development of a signalprocess algorithm and passing it into a pattern recogniton algorithm also. Thesealgorithms are used to determine , predict and make a conclusion on the study ofparkison’s disease. We get to understand the nature of how the parkinson’s disease isin humans.
Resumo:
This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.
Resumo:
Genetic algorithm has been widely used in different areas of optimization problems. Ithas been combined with renewable energy domain, photovoltaic system, in this thesis.To participate and win the solar boat race, a control program is needed and C++ hasbeen chosen for programming. To implement the program, the mathematic model hasbeen built. Besides, the approaches to calculate the boundaries related to conditionhave been explained. Afterward, the processing of the prediction and real time controlfunction are offered. The program has been simulated and the results proved thatgenetic algorithm is helpful to get the good results but it does not improve the resultstoo much since the particularity of the solar driven boat project such as the limitationof energy production
Resumo:
The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.
Resumo:
The automated timetabling and scheduling is one of the hardest problem areas. This isbecause of constraints and satisfying those constraints to get the feasible and optimizedschedule, and it is already proved as an NP Complete (1) [1]. The basic idea behind this studyis to investigate the performance of Genetic Algorithm on general scheduling problem underpredefined constraints and check the validity of results, and then having comparative analysiswith other available approaches like Tabu search, simulated annealing, direct and indirectheuristics [2] and expert system. It is observed that Genetic Algorithm is good solutiontechnique for solving such problems and later analysis will prove this argument. The programis written in C++ and analysis is done by using variation in various parameters.
Resumo:
The field of automated timetabling and scheduling meeting all the requirementsthat we call constraints is always difficult task and already proved as NPComplete. The idea behind my research is to implement Genetic Algorithm ongeneral scheduling problem under predefined constraints and check the validityof results, and then I will explain the possible usage of other approaches likeexpert systems, direct heuristics, network flows, simulated annealing and someother approaches. It is observed that Genetic Algorithm is good solutiontechnique for solving such problems. The program written in C++ and analysisis done with using various tools explained in details later.
Resumo:
Currently there is no Swedish boardsport magazine for women. In this degree project a prototype of a new lifestyle magazine for women in boardsports has been created. Through a magazine study and a targetgroup survey we have found a magazine concept and suggestions for the magazine content. A digital 96-page prototype has been created. The feedback from Anders Neuman-Östberg, the experienced editor in chief of the Swedish boardsport magazine Transistion gives the project report the needed credibility.The overall response from all the people involved in the making of this prototype has been positive. We can see a market demand for a magazine like Werv and hope that we can find a way to publish it in the future. In this degree project we haven't looked into the economic sustainability and therefore we can't say if it's feasible. Further investigations are needed before Werv can be published.
Resumo:
In this thesis the solar part of a large grid-connected photovoltaic system design has been done. The main purpose was to size and optimize the system and to present figures helping to evaluate the prospective project rationality, which can potentially be constructed on a contaminated area in Falun. The methodology consisted in PV market study and component selection, site analysis and defining suitable area for solar installation; and system configuration optimization based on PVsyst simulations and Levelized Cost of Energy calculations. The procedure was mainly divided on two parts, preliminary and detailed sizing. In the first part the objective was complex, which included the investigation of the most profitable component combination and system optimization due to tilt and row distance. It was done by simulating systems with different components and orientations, which were sized for the same 100kW inverter in order to make a fair comparison. For each simulated result a simplified LCOE calculation procedure was applied. The main results of this part show that with the price of 0.43 €/Wp thin-film modules were the most cost effective solution for the case with a great advantage over crystalline type in terms of financial attractiveness. From the results of the preliminary study it was possible to select the optimal system configuration, which was used in the detailed sizing as a starting point. In this part the PVsyst simulations were run, which included full scale system design considering near shadings created by factory buildings. Additionally, more complex procedure of LCOE calculation has been used here considered insurances, maintenance, time value of money and possible cost reduction due to the system size. Two system options were proposed in final results; both cover the same area of 66000 m2. The first one represents an ordinary South faced design with 1.1 MW nominal power, which was optimized for the highest performance. According to PVsyst simulations, this system should produce 1108 MWh/year with the initial investment of 835,000 € and 0.056 €/kWh LCOE. The second option has an alternative East-West orientation, which allows to cover 80% of occupied ground and consequently have 6.6 MW PV nominal power. The system produces 5388 MWh/year costs about 4500,000 € and delivers electricity with the same price of 0.056 €/kWh. Even though the EW solution has 20% lower specific energy production, it benefits mainly from lower relative costs for inverters, mounting and annual maintenance expenses. After analyzing the performance results, among the two alternatives none of the systems showed a clear superiority so there was no optimal system proposed. Both, South and East-West solutions have own advantages and disadvantages in terms of energy production profile, configuration, installation and maintenance. Furthermore, the uncertainty due to cost figures assumptions restricted the results veracity.
Resumo:
En deskriptiv visuell innehållsanalys genomfördes med en korpus bestående av vetenskapliga artiklar från 30 topprankade tidskrifter jämnt fördelade på de tre disciplinerna matematik, medicin och utbildningsvetenskap, med syfte att undersöka om det fanns ett samband mellan tidskrifternas disciplintillhörighet och den grafiska formgivningen. Kartläggningen omfattade layout (bl.a. sidformat, spalter, marginalstorlek, användning av grafiska element, placering av tabeller, figurer och pagina) och typografiskt utseende hos titel, rubriker, brödtext och abstrakt (t.ex. teckenstorlek, textjustering, teckengrovlek, typsnitt, färg och radavstånd). Resultaten visar att disciplinerna använde olika men även gemensamma konventioner i sitt grafiska utseende. Matematik uppvisade enkelspaltig layout med liten typografisk variation, genomgående användning av typsnitt från familjen Transitional eller Transitional/Didone för hela dokumentet, avsaknad av kulört färg och sällan användning av grafiska element. Medicin uppvisade större variation med användning av kulört färg, icke-centrerad typografi med både sansseriff- och seriff-typsnitt, grafiska element och ramar som förstärker det ofta använda dubbelspaltiga gridsystemet. Utbildningsvetenskap uppvisade en grafisk design som återfanns i båda disciplinerna, men påminde mest om matematik till utseendet. Kodbok ingår i sin helhet som bilaga. Uppsatsen i sig är delvis formgiven med utgångspunkt i de erhållna resultaten.