Related logistics transportation optimized dispatching method with time-varying time window

A technology related to logistics transportation and optimal scheduling, applied in logistics, biological models, instruments, etc., can solve the problem of slow convergence speed of bee colony algorithm, and achieve the effect of accelerating convergence speed, good robustness, and wide applicability

Inactive Publication Date: 2015-05-06
GUANGDONG YIFU NETWORK TECH
View PDF0 Cites 41 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The time-varying time window associated logistics transportation scheduling problem is a new problem, and there are few researches at home and abroad at present
However, the bee colony algorithm has problems such as being easily limited to local optimum and slow convergence speed.

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
  • Related logistics transportation optimized dispatching method with time-varying time window
  • Related logistics transportation optimized dispatching method with time-varying time window
  • Related logistics transportation optimized dispatching method with time-varying time window

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0037] The technical solution of the present invention will be further described below through the accompanying drawings and specific implementation methods, but the protection scope of the present invention is not limited thereto.

[0038] A solution to the logistics and transportation scheduling problem associated with time-varying time windows, comprising the following steps:

[0039] Step 1: In the time-varying scheduling environment, establish the entire scheduling cycle as the time axis, record the time when each new demand is generated as τ, and establish a sub-static model subP(τ) based on time τ.

[0040] First define the following parameters and variables:

[0041] N c0 (τ): the collection of all key points and distribution centers at time τ;

[0042] N u (τ): The set of all unserved customers and dynamic customers at time τ;

[0043] N cu (τ): the collection of key points, unserved customers and dynamic customers at time τ;

[0044] N u0 (τ): the collection o...

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 a related logistics transportation optimized dispatching method with a time-varying time window. The related logistics transportation optimized dispatching method with the time-varying time window comprises the specific following steps of 1 obtaining demand information of a reservation client through a distribution center; 2 performing initial path planning on the known client through a II insertion method; 3 improving a bee algorithm and optimizing an initial path based on a differential evolution algorithm; 4 collecting time varying information through the distribution center, obtaining new time window information of the client and recording application time of the new time window of the client; judging a key point at the time when the new information comes; 6 inserting the time-varying client to the initial path which is to be solved in the step 3 through the improved II insertion method to achieve optimization of the time-varying path; 7 ending. According to the related logistics transportation optimized dispatching method with the time-varying time window, a final dispatching scheme for related logistics transportation dispatching with the time-varying time window is obtained.

Description

technical field [0001] The invention belongs to the field of optimal scheduling of logistics transportation, and relates to an optimal scheduling method of associated logistics transportation with time-varying time windows, which is used for solving the optimal scheduling problem of logistics transportation associated with time-varying time windows. Background technique [0002] Logistics transportation optimization scheduling problem is an important class of combinatorial optimization problems, which is widely used, involving production, circulation, consumption and other fields. It refers to the organization and distribution of goods in the distribution center according to customer requirements, and the pursuit of the lowest total transportation cost or the highest total profit. The core content of logistics transportation optimal scheduling is to allocate vehicles and generate distribution routes for each vehicle according to the customer's cargo demand. Today, with the ...

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/08G06Q50/28G06N3/00
CPCG06Q10/047G06N3/006G06Q10/08G06Q50/28
Inventor 汤雅连
Owner GUANGDONG YIFU NETWORK 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