This paper focuses on the model and algorithm for optimization of tourist routes. For the optimization problem of "multi-day tourism" it proposes a novel strategy based on heuristic algorithm. It adopts Monte Carlo improved simulated annealing algorithm, to provide optimized design of local tourist route in a certain area, with the object of shortest path and smallest cost. It also establishes the mathematical model of "multi-day" tourism route. By multiple experiments and computation, it is founded that the application of simulated annealing in tourism route design can effectively acquire the optimal solution or approximate optimal solution. Finally the tourist attractions of a certain city is taken as an example to verify the method proposed in this paper.

Tourism Route Design and Optimization Based on Heuristic Algorithm

Identification of Two Duplicated Loci Controlling a Disease‐like Rugose Leaf Phenotype in Soybean

Goal programming is an important branch of operational research. In this paper, the theory of goal programming is detailed introduced including basic concepts, the mathematical mode. The basic ideas to solve goal programming are transforming goal programming into single-objective linear programming. An optimal solution is attained when all the goals are reached as close as possible to their aspiration level, while satisfying a set of constraints. Two solving methods-the simplex algorithm and the method of LINGO software t are discussed in the paper. Finally goal programming model are applied to the actual management decisions, multi-objective programming model are established and used Lingo software to achieve satisfied solution.

http://www.aicit.org/JCIT/ppl/JCIT3320PPL.pdf

Research on Goal Programming Algorithm Based on Lingo

Design traveling route for tourist is a challenging problem. According to the actual scenic spots, the mathematical model of the traveling routes was established. In order to get the best attractions which we want to choose, the complex decisions are analyzed by method of analytic hierarchy process. And four relative important aspects of the objectives are compared including culture and history, beautiful scenery, traffic and flowing rate of visitors. After the decisions of scenic spots, then the graph model of tourist routes are established. Optimized traveling route are proposed by studying traveling salesman problem. And applying dynamic programming algorithm of TSP, the optimized route are obtain. The route can be reach each scenic spot exactly once and returns to the origin after finishing the travel, and this method can be used in other traveling maps easily.

Design and evaluation of tourist routes

In view of serious traffic jam, how to make the rescue vehicle arrive at the scene in the shortest time has been one of key problems to the success of emergency handling. This paper puts forward a kind of improved Dijkstra algorithm applied to optimal vehicle path selection for emergency command, which builds a relationship between node and adjacent edge to improve the searching rate and optimize the search area. The simulation results show the improved algorithm proposed has better effects in query speed, the storage space and the selection of the optimal vehicle path.

Applied Research on Improved Dijkstra Algorithm to the Optimal Vehicle Path Selection in Emergency Command

Optimized Traveling Route Scheme based on Improved Prim Algorithm

Soybean (Glycine max) is one of the most important crop plants for providing protein and oil. It is important to investigate soybean genome for its economic and scientific value. Polyploidy is a widespread and recursive phenomenon during plant evolution, and it could generate massive duplicated genes which is an important resource for genetic innovation. Improved sequence alignment criteria and statistical analysis are used to identify and characterize duplicated genes produced by polyploidization in soybean. Based on the collinearity method, duplicated genes by whole genome duplication account for 70.3% in soybean. From the statistical analysis of the molecular distances between duplicated genes, our study indicates that the whole genome duplication event occurred more than once in the genome evolution of soybean, which is often distributed near the ends of chromosomes.

https://downloads.hindawi.com/journals/ijg/2013/275616.pdf

Comparative Inference of Duplicated Genes Produced by Polyploidization in Soybean Genome

It is important to design the optimal travel route for the traveler. In this paper, based the on Google Earth, the undirected graph of Tangshan tourist sites are established, optimal traveling rout are explored by Prim algorithm and improved Prim algorithm.

Yanmei Yang

Papers

Optimized Traveling Route Scheme based on Improved Prim Algorithm

Comparative Inference of Duplicated Genes Produced by Polyploidization in Soybean Genome

Modeling and Algorithm of Optimal Traveling Route