Ant colony optimization processing method of large-scale multi-target intelligent moving route selection

A mobile path, multi-target technology, applied in the field of smart mobile devices, can solve problems such as performance degradation

CN102278996BInactive Publication Date: 2012-11-07SOUTHWEST JIAOTONG UNIV
3 Cites 3 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Publication Date
2012-11-07
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention discloses an ant colony optimization processing method of large-scale multi-target intelligent moving route selection; after data of NTSP target logistics delivery addresses, distances between every two addresses, and M price of cost for passing through each route are obtained, a route planning unit is solved by ant colony optimization technology so as to obtain a specific walking route for intelligent mobile-agent delivery, and the route is outputted to an executive mechanism for realization. When the method is used to solve the problem of large-scale multi-target intelligent moving route selection, the invention has good optimization performance, and has the advantages of parallelism, self-organization, strong robustness, and the like, and the obtained solutions are large in quantity, high in quality, and have strong approximation capability to the real Pareto solution set; the obtained solution set has uniform distribution; the calculation speed is high. The inventioncan be used in intelligent processing units of route planning systems in fields of logistics distribution, intelligent traffic, internet, robots, etc.
Need to check novelty before this filing date? Find Prior Art

Description

Technical field

[0001] The invention relates to an intelligent mobile device, in particular to the technical field of optimizing and selecting a reasonable path for an intelligent mobile subject. Background technique

[0002] Path planning is a key issue in the field of logistics distribution, especially in intelligent logistics supported by Internet of Things technology. The intelligent mobile agent who executes logistics distribution wants to complete the delivery of n customers' orders, and minimize M contradictory costs such as cost consumption and route distance as much as possible at the same time. From the perspective of mathematical processing methods, the above problem can be abstracted into a typical mathematical problem, the so-called multi-objective traveling salesman problem (Multi-objective Traveling Salesman Problem, MTSP), the general description of MTSP is: Given n cities and There are M costs between them, and each cost is contradictory. A traveler wants t...

Examples

Embodiment

[0062] The invention is adopted to solve the double-objective traveling salesman problem composed of 200 cities, which is constructed from two single-objective traveling salesman problems KroA200 and KroB200 in the standard database TSPLIB. The experiment uses Matlab as the implementation tool, and solves the problem on a computer with a CPU of AMD Sempron 1.6GHz, a memory of 1GB, and an operating system of Windows XP.

[0063] The specific implementation steps of a kind of ant colony optimization method for solving large-scale multi-objective traveling salesman problem provided by the present invention are as follows:

[0064] Step 1: Parameter initialization: set the parameters of the algorithm α=1, β=2, ρ=0.1, q 0 =0.9, ξ=0.1, K=5, N=20, T=100, Φ= , the weight vector is randomly generated, and the weight vector in this embodiment is λ 1 =[0.0170 0.9830],λ 2 =[0.0541 0.9459],λ 3 =[0.2177 0.7823],λ 4 =[0.2444 0.7556],λ 5 =[0.2551 0.7449],λ 6 =[0.2579 0.7421],λ 7 =[0....