4 resultados para Compact Upwind Scheme
em Dalarna University College Electronic Archive
Resumo:
The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.
Resumo:
Within the frame of the project REBUS, "Competitive solar heating systems for residential buildings", which is financed by Nordic Energy Research, a new type of compact solar combisystem with high degree of prefabrication was developed. A hydraulic and control concept was designed with the goal to get highest system efficiency for use with either a condensing natural gas boiler or a pellet boiler. Especially when using the potential of high peak power of modern condensing natural gas boilers, a new operation strategy of a natural gas boiler/solar combisystem can increase the energy savings of a small solar combisystem by about 80% compared to conventional operation strategies.
Resumo:
FP7- MacSheep
