Framtagning av prototyp för att läsa och dokumentera kundspecifikationer

To increase the quality in their products ABB is working towards a cleared order concept. That means that all customer specified options are to be known before they start with order calculations and construction. As it is today they use paper checklists to achieve this. One order may have several reactors, and for a reactor there can be several different alternatives. For each alternative a new checklist must be filled out.As of today all reading of the customer specification and checklist fill in with is done by hand by different persons, and sometimes the same data is read more than one time. All data is also manually inserted into the calculation tools.To decrease the risk that data is left out or gets distorted they want to have a tool to aid with the reading of the specification and the documentation of that work. Already read data can be copied over to another alternative so that it not must be read one more time. The read data are to be stored in a database so that it easily can be per automation inserted into the different design tools.

Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

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.