在线TSP问题求解与其在车辆路径上的应用分析.pdfVIP

Abstract Abstract Traveling Salesman Problem (TSP) which is proved that is a NP-Complete Problem is proposed by the Irish mathematician Sir William Rowan Hamilton and British mathematician Thomas Penyngton Kirkman in the 19th century. It involves making a tour of every vertex in a given set, returning to the starting point, making the length of the tour length minimize. And the vehicle routing problem, which have a group of car, make every car on the part of all the city only visit, and a city can only be visited by a car, whose aim is to make the sum of all vehicles travel time minimize. As the applications of them are more extensive, there are many algorithms is used to solve this problem. In some practical applications, it doesn’t exist as to all information is fully aware. For such uncertainty problems, there are many algorithms can solve such optimization problems. For example, probability distribution or integer programming method can be used to deal with dynamic problem, which would need an exact probability distribution model. While we don’t have sufficient data to accurately estimate its distribution model, the online optimization method can be used to solve the problem. The difference is that the online method is used to solve the constantly and continuously making decisions. This thesis which mainly proposed two response strategies Waiting-If-Necessary(WIN) and kWIN for the online traveling salesman problem and emergency vehicle routing problem respectively is detailed in five sections as follow. Section I presents the applicable field, development history and relationship with the traveling salesman p