Chinese Postman Problem Essay

How does a Chinese Postman deliver letters to every house in the neighborhood in the shortest time possible?

Introduction:
This is a problem that was developed in 1960 by a Chinese mathematician Kuan Mei-Ko, to question how a postman should deliver mail in shortest possible distance with the minimum time to a certain number of streets. There has been many mathematicians worldwide who pay close attention to this question, such as in 1973 the Hungarian mathematicians Edmonds and Johnson gave an effective calculation to the problem, which we will mention later in the investigation.

Here is the problem that Kuan Mei-Ko was trying to solve:
*The postman will need to visit every letter on the graph in the shortest possible time.

Statement of Task:
The main intention of this investigation was to find out how the postman can visit very letter (symbolizes the houses) in the minimum time. The information in which I need to support my investigation is able to be found on the internet, during this process what I need to do is carefully sort out the credible websites.

Plan of Investigation:
I will first research on the history of the Postman Problem, such as how the solution to problem gradually evolve over time. Then I will look on the internet for the methods which can be applied to a problem like this, also the formulas that

However, as the problem has so many solutions and that each method are very different, it is still not exactly accessible to analyze each and every one of the methods which can be used. The process of explaining how to solve the question is therefore not exactly clear, as we not went it over as a step by step explanation. Also, we used most of the investigation for researching and analyzing the methods for solving this problem, leaving the actual solution very short and was not explained in