Traffic network vulnerability problem bionic optimization method based on myxomycete foraging behaviors
Patent Information
- Authority / Receiving Office
- CN Β· China
- Current Assignee / Owner
- CHINA THREE GORGES UNIV
- Publication Date
- 2019-09-27
Smart Images

Figure 1 
Figure 2 
Figure 3
Abstract
Description
technical field
[0001] The invention belongs to the field of computer bionics, in particular to a bionic optimization method for traffic network vulnerability problems based on slime mold foraging behavior. Background technique
[0002] The transportation network planning and design problem can be naturalized as the classic traveling salesman problem (Traveling Salesman Problem, TSP), which is also translated as the salesman problem and the salesman problem. Merrill M. Flood was the first to use a mathematical model to study the TSP problem. In the 1930s, he solved a school bus route planning problem mathematically for the first time. The problem can be described as, assuming that a traveling salesman wants to visit n cities, the traveling route must traverse each city once, and finally return to the original departure city, the traveling salesman can choose the optimal route of the total route. The traveling salesman problem has been proposed for a hundred years. Scientist...