Shuffled frog leaping solving method for multi-target backpack problem

A knapsack problem and multi-objective technology, applied in the field of multi-objective knapsack problem solving, can solve problems such as poor diversity of solution sets, poor convergence accuracy, and slow convergence speed, and achieve the effects of improving utilization, convergence, and solution accuracy

Pending Publication Date: 2022-01-04
NANJING UNIV OF INFORMATION SCI & TECH
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, using the traditional multi-objective hybrid leapfrog algorithm to solve the multi-objective knapsack problem still has the following disadvantages: slow convergence speed, poor convergence accuracy, easy premature convergence, poor solution set diversity, and poor distribution.

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
  • Shuffled frog leaping solving method for multi-target backpack problem
  • Shuffled frog leaping solving method for multi-target backpack problem
  • Shuffled frog leaping solving method for multi-target backpack problem

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0075] The present invention is described in further detail now in conjunction with accompanying drawing.

[0076] It should be noted that terms such as "upper", "lower", "left", "right", "front", and "rear" quoted in the invention are only for clarity of description, not for Limiting the practicable scope of the present invention, and the change or adjustment of the relative relationship shall also be regarded as the practicable scope of the present invention without substantive changes in the technical content.

[0077] In one embodiment of the present invention, sample 250 is selected, and there are two backpacks, each backpack has 50 optional items, and each item has profit and weight attributes, as shown in Table 1.

[0078] Table 1

[0079]

[0080]

[0081] Use the mixed leapfrog solving method of a kind of multi-objective knapsack problem proposed by the present invention to solve this example, the main process is as follows figure 1 As shown, the specific step...

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 shuffled frog leaping solving method for a multi-target backpack problem. The method comprises the steps: (1) reading problem information, which comprises the value and weight information of each goods of each backpack and the weight limitation information of each backpack; (2) initializing algorithm parameters; (3) calculating target values of all individuals in the population, determining a non-dominated solution set and putting the non-dominated solution set into an external memory; (4) entering a quick convergence stage, dividing the population into subgroups by using an S-type grouping mode according to a quick non-dominated sorting result, performing local search based on a discrete jump rule and greedy generation on each subgroup, shuffling each subgroup, updating an external memory, judging whether the target evaluation frequency meets a quick convergence stage termination condition; and if not, continuing iteration; and if yes, entering the next stage; (5) entering an exploration expansion stage; and (6) entering an extreme value mining stage. The method has the advantages of high search speed, high search capability and high profit of the planned backpack.

Description

technical field [0001] The present invention relates to the technical field of multi-objective knapsack problem solving, in particular to a hybrid leapfrog solution method for multi-objective knapsack problem. Background technique [0002] Multi-objective combinatorial optimization problems generally exist in various fields of production and life such as industrial design, information processing, and transportation. The knapsack problem is given a set of items and a knapsack with a weight limit, put the items into the knapsack in different combinations so that the total weight of the items does not exceed the knapsack weight limit, and at the same time, maximize the total profit of the items in the knapsack. The multi-objective knapsack problem (MOKP) is a typical multi-objective combinatorial optimization problem. Given m knapsacks and m groups of items, each knapsack corresponds to a group of items, and the number of items in each group is n , each item in each group has ...

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): G06F30/27G06N3/08G06F111/04G06F111/06
CPCG06F30/27G06N3/086G06F2111/06G06F2111/04
Inventor 申晓宁陈庆洲潘红丽徐继勇姚铖滨许笛葛忠佩
Owner NANJING UNIV OF INFORMATION SCI & TECH
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