Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

GTSP solving algorithm based on adaptive large-field search

A self-adaptive, large-scale technology, applied in the direction of calculation, calculation model, complex mathematical operation, etc., to achieve the effect of excellent convergence

Pending Publication Date: 2021-05-14
XIAN TECHNOLOGICAL UNIV
View PDF0 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] Purpose of the invention: In order to overcome the deficiencies in the prior art, the present invention provides a GTSP solution algorithm based on adaptive large-scale search, which can effectively improve the solution efficiency of larger-scale problems

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • GTSP solving algorithm based on adaptive large-field search
  • GTSP solving algorithm based on adaptive large-field search
  • GTSP solving algorithm based on adaptive large-field search

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] The present invention will be further described below in conjunction with the accompanying drawings.

[0050] as attached Figure 1-15 : GTSP solution algorithm based on adaptive large-scale search, including ALFG algorithm; ALFG algorithm integrates the intra-group point update strategy in the ant colony algorithm solution into the adaptive large-neighborhood search, so that the structure of the solution can be adapted to the heuristic algorithm solution requirements; on the basis of E-GTSP, new heuristics such as update-worst removal, update-best insertion, and dynamic multi-point removal are proposed. a new adaptive strategy.

[0051] The traveling salesman problem is a combinatorial optimization problem, and the local search technique (Local Search, LS) can effectively solve this kind of problem. The current common local search algorithms include variable neighborhood search (Variable Neighborhood Search, VNS), large neighborhood search (Large Neighborhood Search,...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a GTSP solving algorithm based on adaptive large field search. The GTSP solving algorithm comprises an ALFG algorithm, wherein the ALFG algorithm fuses an intra-group point updating strategy in the solution of the ant colony algorithm into the adaptive large neighborhood search, so that the structure of the solution adapts to the requirements of the solution of the heuristic algorithm; on the basis of E-GTSP, new heuristics of update-worst removal, update-optimal insertion and dynamic multi-point removal are provided, and a new adaptive strategy is provided for the problem of scale change of weight in the algorithm iteration process. The invention provides a GTSP solving algorithm based on adaptive large-field search, which can effectively improve the solving efficiency of a larger-scale problem.

Description

technical field [0001] The present invention relates to the field of generalized traveling salesman problem. Background technique [0002] When solving the MDCSP problem, it is constructed as an E-GTSP model through the graph conversion algorithm to solve it. This method is not efficient on larger-scale problems, because with the increase of charging points and UGV operating points, after conversion The number of vertices in the graph will increase with the existence of virtual vertices. Therefore, this paper will propose a generalized traveling salesman problem (non-equivalent) direct solution algorithm based on Adaptive Large Neighborhood Search (ALNS): ALFG (ALNS for GTSP). The algorithm uses the weight update of intra-group points to adapt to the structural representation requirements of the solution in ALNS, and improves the convergence performance of the algorithm by developing a new greedy strategy-based heuristic and dynamic multi-point removal heuristic. Contents...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F17/11G06N3/00
CPCG06F17/11G06N3/006
Inventor 王沁乔路田军委苏宇徐浩铭王一卓王晨
Owner XIAN TECHNOLOGICAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com