Judges a score, signature
and notes
Team No：
10476
Three judges score,
signature and notes
Two judges scoring,
signature and notes
Topics：
C
Four judges score,
signature and notes
Topic：
The article is about how to choose the best tourist track,which belong to travelling
salesman problem. For seeking shortest and most low-cost track,we simulated three
models containing economical model,time-saving model and easy model.In order to
solve different problems,we used ant colony optimization, modified circle algorithm
and multi-objective programming.Then, we combined the fact to the three models and
analysed residual.What ‘s more,we analysed the complexity of above algorithm.
For the first problem,referring to Global mapper,making sure 10 scenic spots’
longitude and latitude, calculating a shortest track.In another word,starting with the
hotel,visiting every spots only once and ending up in the hotel.According to the
longitude and latitude,we ‘ll make full use of geometry to calculate the distance from
two cities.we can describle the problem as setting up 10 dots representing 10 cities.The
line between each two dots means the tourist track.The route attributes such as the
length of the said for the edge weights, you can travel the city network abstraction as a
weighted directed graph. Set a weighted directed graph G for binary group G = (V,
{E}), which contains V is the set of n nodes, E is a collection of h side , (I, j) is from
edge nodes I and j E, edge (I, j) is nonnegative weights. Set S, T V respectively in the
starting node and destination node, then the optimal path problem is refers to in the
weighted directed graph G, then the optimal path problem is refers to in the weighted
directed graph G, find from the specified initial node to the destination node of a path
with the minimum weight sum The shortest tour line length is 92.2 kilometers.
In view of the problem, the purpose of this problem is to design the most economical
travel plan, namely the minimum distance cost we use improved algorithm to solve
traveling salesman problem, in any distance between two points of minimum cost
matrices as the weights, using undirected graph adjacency matrix structure, according
to the question I do not know the starting location, so using the Matlab software
repeated 10 times improved circle algorithm in each city as a starting point, namely
from 10 Hamilton got the optimal times, namely.
Between any two points on question three, give priority to in order to enjoy here, in a
model based on the results of the model, we set principles: priority is convenient,
when both the cost than taking a taxi on a luxury bus of the high cost of used within a
certain range, is taking a taxi Here by dynamic programming to implement the plan,
on the basis of the economy of the shortest route, through a change in a way, to make
the final cost deviates from the value of the minimum cost of in our allowed range,
thus to save money The purpose of saving time and convenient Ultimately satisfied
tourists themselves need to travel plan, the total cost 1643 yuan (do not include
更多数模资讯和学习资料，请关注b站/公众号：数学建模BOOM
精品课程：https://k.weidian.com/z=camKMb
剩余24页未读，继续阅读
资源评论
