Optimization method for solving omni-channel logistics distribution problem

A technology for logistics distribution and optimization methods, which is applied in the field of computer science and can solve problems such as the difficulty of algorithms to meet actual needs.

Active Publication Date: 2017-09-22
CENT SOUTH UNIV
View PDF5 Cites 49 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Since the current algorithm used in logistics distribution is difficult to meet the actual needs, the present invention provides an adaptive large-scale neighborhood search algorithm based on Lagrangian relaxation to solve the problem of omni-channel logistics distribution. Provide effective delivery solutions for enterprises within a short time

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
  • Optimization method for solving omni-channel logistics distribution problem
  • Optimization method for solving omni-channel logistics distribution problem
  • Optimization method for solving omni-channel logistics distribution problem

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0064] Aiming at the problem of omni-channel logistics distribution, the present invention proposes a three-stage solution algorithm. First, use Lagrangian relaxation techniques to solve the problem of store location and customer assignment. Then, the adaptive large-scale neighborhood search algorithm is used to solve the path planning problem from the logistics warehouse to each store. Finally, the greedy insertion method is used to solve the path planning problem between the store and its service customers.

[0065] The present invention solves the site selection-path problem in three stages: in the first stage, according to the customer's location and the location of the alternative stores, designate a service store for each customer, and determine the location of the store, which is a facility site selection problem. Grange relaxation technique to solve. In the second stage, a group of vehicles is dispatched from the main logistics warehouse to deliver goods to each store...

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 an optimization method for solving an omni-channel logistics distribution problem. In a first stage, a Lagrange relaxation technology is used to solve a LAP (Location-allocation Problem) problem. In a second stage, adaptive large-scale neighborhood search is used for solving a multi-vehicle-type vehicle path problem, a feasible solution can be searched in a large range in a solution space through one group of simple destruction and reconstruction algorithms, and a situation of falling into local optimum can be effectively avoided. Meanwhile, a simulated annealing acceptance criteria realized in the adaptive large-scale neighborhood search can guarantee the quality of a solution and the convergence of the algorithm, a result is output after the algorithm is executed for an appointed iteration number, a time constraint requirement can be met, and a good vehicle distribution scheme is solved for enterprises in limiting time. The simpleness of the Lagrange relaxation technology is combined with the efficiency of the adaptive large-scale neighborhood search, so that the integral solving efficiency of a mixed algorithm is high, and the problem of omni-channel logistics distribution can be effectively solved.

Description

technical field [0001] The invention relates to the site selection-route problem in the field of computer science, in particular to an optimization method for solving the problem of omni-channel logistics distribution. Background technique [0002] With the popularity of the Internet, people's basic necessities of life are increasingly inseparable from the Internet. In the context of the "Internet +" era, many traditional enterprises are seeking transformation in order to achieve industrial upgrading and better development of enterprises. Using the Internet platform, companies can conduct online and offline sales, broaden sales channels, and increase customer sources. However, in the process of integrating online and offline resources, enterprises are facing new challenges. Taking the retail industry as an example, at present, enterprises meet the ordering needs of offline stores through self-operated distribution models, and use third-party logistics companies to deliver ...

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/047G06Q10/08355
Inventor 阳旺何国超
Owner CENT SOUTH UNIV
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