Combined optimization problem processing method and device

A technique for combining optimization and processing methods

Pending Publication Date: 2019-10-29
CAINIAO SMART LOGISTICS HLDG LTD
View PDF0 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The disadvantages of this algorithm include: the original problem needs to be reasonably and carefully decomposed, only a single algorithm is used, and repeated searches are required to obtain the optimal solution, etc., resulting in waste of computing resources, lengthy search process, and insufficient search results.

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
  • Combined optimization problem processing method and device
  • Combined optimization problem processing method and device
  • Combined optimization problem processing method and device

Examples

Experimental program
Comparison scheme
Effect test

no. 1 example

[0046] The first embodiment of the present invention proposes a method for processing combinatorial optimization problems. figure 2 The flow chart of steps of the method for processing a combinatorial optimization problem according to the first embodiment of the present invention is shown. like figure 2 Shown, the processing method of the combinatorial optimization problem that the present invention proposes comprises the following steps:

[0047] S101. When the calculation termination condition is not met, provide initial solutions corresponding to the calculation tasks to multiple calculation units respectively;

[0048] In a data processing system, electronic devices with computing and processing functions, such as servers and terminal computers, can be divided into a central management unit and a computing unit. like image 3 Shown is a schematic diagram of a central management unit and 5 computing units. The central management unit and computing unit are divided acc...

no. 2 example

[0081] The second embodiment of the present invention proposes a method for processing combinatorial optimization problems. Figure 4Shown is a flow chart of the steps of the method for processing a combinatorial optimization problem according to the second embodiment of the present invention. like Figure 4 As shown, the processing method of the combinatorial optimization problem in the embodiment of the present invention has the following steps:

[0082] S201. When the calculation termination condition is not met, provide initial solutions corresponding to the calculation tasks to multiple calculation units respectively;

[0083] S202. Receive a solution obtained by performing the computing task according to the initial solution by a plurality of computing units;

[0084] S208, perform clustering on the solutions, and acquire clustered solutions;

[0085] S210, after determining that the calculation termination condition is satisfied, determine a final solution from the c...

no. 3 example

[0144] The third embodiment of the present invention proposes a processing device for combinatorial optimization problems, such as Image 6 As shown, the device includes:

[0145] A generating module 601, configured to provide initial solutions corresponding to computing tasks to multiple computing units when the computing termination conditions are not met;

[0146] A receiving module 602, configured to receive a solution obtained by a plurality of calculation units performing the calculation task according to the initial solution;

[0147] A processing module 603, configured to perform clustering on the solutions, and obtain clustered solutions;

[0148] A determining module 604, configured to determine a final solution from the clustered solution clusters after determining that the calculation termination condition is met.

[0149] The processing device for the combinatorial optimization problem proposed in this embodiment has at least the following advantages:

[0150] ...

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 combined optimization problem processing method and a combined optimization problem processing device. The method for processing the combinatorial optimization problem comprises the following steps of: when a calculation termination condition is not met, respectively providing initial solutions corresponding to calculation tasks for a plurality of calculation units; receiving solutions obtained by executing the calculation task by a plurality of calculation units according to the initial solutions; clustering on the solutions, and obtaining a clustered solution cluster; and determining a final solution from the clustered solution cluster after determining that a calculation termination condition is satisfied. According to the combined optimization problem processing method provided by the embodiment of the invention, the same combined optimization problem can be searched in parallel by utilizing a plurality of search strategies, and the solving advantages of different search strategies for a certain type of problem are fully exerted, so that a better solution can be quickly obtained.

Description

technical field [0001] The present application relates to the field of computer information processing, in particular to a method for processing combinatorial optimization problems and a processing device for combinatorial optimization problems. Background technique [0002] In the current field of information processing, the combinatorial optimization problem is a typical problem in the field of optimization, that is, to find the optimal solution from the feasible solution set of the combinatorial problem (an integer, a set, an arrangement, or a graph) . can be defined as: [0003] Θ is a finite set, and f is the mapping from Θ to the real number set R, that is, f: Θ→R. Find theta * ∈Θ, such that for any θ′∈Θ, f(θ * )≤f(θ′), that is, to solve [0004] Classical combinatorial optimization problems include vehicle routing optimization problems, bin packing problems, facility location problems, planning and scheduling problems, etc. For example, in the vehicle routing ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/04G06Q10/08
CPCG06Q10/04G06Q10/047G06Q10/08355
Inventor 胡浩源陈昱洁韩坤鹏王龙飞
Owner CAINIAO SMART LOGISTICS HLDG LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap