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

Inventory path joint optimization method based on improved Lagrange relaxation algorithm

A joint optimization and relaxation algorithm technology, applied in constraint-based CAD, multi-objective optimization, design optimization/simulation, etc., can solve problems such as slow convergence of target solutions, unfavorable large-scale problems, and poor quality of approximate solutions

Active Publication Date: 2021-09-07
SHANGHAI UNIV OF ENG SCI
View PDF7 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in the iterative solution process of the traditional subgradient algorithm (Traditional Subgradient Algorithm, TSA), the target solution will converge slowly, which makes it take a long time and the quality of the approximate solution is not good, which is not conducive to the solution of large-scale problems in practice.

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
  • Inventory path joint optimization method based on improved Lagrange relaxation algorithm
  • Inventory path joint optimization method based on improved Lagrange relaxation algorithm
  • Inventory path joint optimization method based on improved Lagrange relaxation algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0062] Such as figure 1 As shown, the present invention discloses a joint optimization method for inventory paths based on the improved Lagrangian relaxation algorithm, comprising the following steps:

[0063] S1: Obtain delivery information, and establish a mathematical model of the inventory routing problem according to the objective function and constraints;

[0064] S2: Select the coupling constraints that affect the solution of the mathematical model of the inventory routing problem from multiple constraints, and converge to the objective function to obtain the Lagrangian relaxation problem function;

[0065] S3: Decompose the Lagrangian relaxation problem function into multiple sub-problems according to different decision variables;

[0066] S4: Use the improved Lagrangian relaxation algorithm to solve the dual function values ​​of each sub-problem;

[0067] S5: According to the solution result, the optimal target value is obtained, and the optimal inventory path plann...

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 relates to an inventory path joint optimization method based on an improved Lagrange relaxation algorithm, and the method comprises the following steps: S1, obtaining distribution information, and building an inventory path problem mathematical model according to an objective function and constraint conditions; s2, selecting a coupling constraint influencing the solution of the inventory path problem mathematical model from a plurality of constraint conditions, and converging the coupling constraint into a target function to obtain a Lagrange relaxation problem function; s3, decomposing the Lagrange relaxation problem function into a plurality of sub-problems according to different decision variables; s4, an improved Lagrangian relaxation algorithm is used to solve the dual function value of each sub-problem; and S5, obtaining an optimal target value according to a solving result, and obtaining an optimal inventory path planning scheme. Compared with the prior art, the method has the advantages of high convergence speed, high approximate solution quality and the like.

Description

technical field [0001] The invention relates to the field of inventory path planning schemes of a secondary distribution network in a supply chain system, in particular to a joint optimization method for inventory paths based on an improved Lagrangian relaxation algorithm. Background technique [0002] In the current big data background, how to reasonably analyze the data generated in the process of business operation and provide efficient decision-making plans for the actual operation of enterprises has always been a problem that researchers have paid attention to. In addition, the competition among enterprise supply chains still becomes a part that cannot be ignored. In a logistics system, a key driver of the overall productivity and profitability of a supply chain is its distribution network, which can be used to achieve a variety of supply chain goals from low cost to high responsiveness, and the inventory routing problem is one of the supply chain Secondary distributio...

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): G06F30/20G06Q10/04G06Q10/08G06F111/04G06F111/06
CPCG06F30/20G06Q10/047G06Q10/083G06F2111/04G06F2111/06Y02T10/40
Inventor 赵媛媛段倩倩
Owner SHANGHAI UNIV OF ENG SCI
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