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

Method for finding the shortest path of urban logistics distribution based on time reliability

A technology of logistics distribution and the shortest path, applied in the direction of logistics, genetic rules, gene models, etc., can solve problems such as no time reliability selection research

Active Publication Date: 2018-12-18
CHONGQING UNIV
View PDF4 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In the current research, the research on urban logistics distribution is mainly focused on the VRP problem of vehicle route selection, such as the shortest route or the lowest cost, without in-depth research on the time reliability of route selection.

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
  • Method for finding the shortest path of urban logistics distribution based on time reliability
  • Method for finding the shortest path of urban logistics distribution based on time reliability
  • Method for finding the shortest path of urban logistics distribution based on time reliability

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] Embodiments of the present invention are described below through specific examples, and those skilled in the art can easily understand other advantages and effects of the present invention from the content disclosed in this specification. The present invention can also be implemented or applied through other different specific implementation modes, and various modifications or changes can be made to the details in this specification based on different viewpoints and applications without departing from the spirit of the present invention.

[0037] It should be noted that the diagrams provided in this embodiment are only schematically illustrating the basic idea of ​​the present invention, and only the components related to the present invention are shown in the diagrams rather than the number, shape and shape of the components in actual implementation. Dimensional drawing, the type, quantity and proportion of each component can be changed arbitrarily during actual impleme...

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 method for searching the shortest path of urban logistics distribution based on time reliability, which comprises the following steps: acquiring the historical path time datain the designated distribution network within a certain time range; obtaining the degree of customer desire for distribution services; Obtain the data of distribution network, establishing the objective function model with the budgeted travel time as the reliability measurement index, and establishing the constraint conditions according to the objective function model. A genetic algorithm is usedto solve the objective function model and the constraint conditions. The invention firstly considers the fluctuation of the traffic road network and solves the logistics distribution problem by solving the traffic network problem. Then, on the existing vehicle routing problem with time windows, a new concept of time windows is proposed, that is, based on the customer's desire for service as the benchmark, the route optimization model is constructed with the travel time and service time as the objective function, which is more in line with the actual needs and road network conditions.

Description

technical field [0001] The invention relates to the field of route optimization of logistics distribution vehicles, in particular to a method for finding the shortest route of urban logistics distribution based on time reliability. Background technique [0002] The rapid development of e-commerce has also led to the prosperity of e-commerce logistics, and the quality of logistics distribution services has also received more and more attention. Whether it is Tmall’s one-hour delivery, JD 211 delivery or the 30-minute delivery service proposed by Hema Xiansheng, which is currently in the fresh food cold chain logistics, all reflect the importance of delivery time. In the current research, the research on urban logistics distribution mainly focuses on the VRP issues such as the shortest route or the lowest cost of vehicle route selection, without in-depth research on the time reliability of route selection. [0003] VRP originated from transportation. It was first published by...

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): G06Q10/04G06Q10/08G06N3/12
CPCG06N3/126G06Q10/047G06Q10/08355Y02T10/40
Inventor 李华民熊维新
Owner CHONGQING UNIV
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