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

Logistics distribution vehicle scheduling method based on improved A* algorithm

A technology for logistics distribution and vehicle scheduling, which is applied in the field of Internet of Vehicles and can solve problems such as slow operation.

Active Publication Date: 2018-06-12
上海锦觅网络科技有限公司
View PDF5 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0002] The Vehicle Scheduling Problem (VRP) in the logistics distribution route is a typical combinatorial optimization problem, and it has been proved to be an NP-hard problem. It is difficult to solve the problem in a limited time with an accurate algorithm.
[0003] Commonly used algorithms include Dijkstra algorithm and best-first search (BFS) algorithm, but both algorithms have certain shortcomings. Dijkstra is a typical single-source shortest path algorithm. When encountering U-shaped obstacles in the map, Dijkstra algorithm It will run slower, and the execution efficiency needs to be improved; although BFS is much faster than the Dijkstra algorithm, because it only considers the cost of reaching the target, it will not avoid it when it encounters U-shaped obstacles in the map. choose a long path

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
  • Logistics distribution vehicle scheduling method based on improved A* algorithm
  • Logistics distribution vehicle scheduling method based on improved A* algorithm
  • Logistics distribution vehicle scheduling method based on improved A* algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0056] Grid distribution area:

[0057] Such as figure 1 As shown, on the premise of knowing the precise geographic location of the customer, the map is divided into square grids (Grid) according to a certain ratio, and simplified into a two-dimensional array. Each grid is an element of the array, and the grid is marked as □ Indicates a passable path, marked as Indicates impassable paths (such as walls, ditches, etc.). A path is referred to as a collection of grids from the starting point A to the ending point B, where the passing points are called "nodes", and nodes can be any location of any shape.

[0058] Preferably the appropriate evaluation distance:

[0059] Such as figure 2 As shown, A is the starting point, B is the end point, and the side of the grid is 10. When moving along the XY axis of the grid, add 10 to g(n), and add 14 to g(n) when moving along the diagonal direction of the grid ( Integers are used here for the convenience of calculation), and the value...

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 logistics distribution vehicle scheduling method based on an improved A* algorithm, and proposes a plan for vehicle scheduling, route selection and route planning in logistics distribution including two parts: an improved A* algorithm and a logistics distribution algorithm. The improved A* algorithm is used to quickly search for the optimal path between two points, including: meshing the distribution area, preferably selecting the appropriate evaluation distance, and recursively searching for the shortest distance. The logistics distribution algorithm is used to generate vehicle information sent from the distribution center to each customer node, the vehicle information includes vehicle numbers, passing customer nodes, vehicle routes, load capacities, and total distances of the routes, and the logistics distribution algorithm includes two parts of calculating distances and routes from the customer nodes to the logistics center, and generating the distributionplane with the improved weighted graph algorithm. This scheduling method considers the constraints in the vehicle path, reduces the total transportation distance, enhances the overall control and management of the logistics distribution process, and achieves a more economical distribution line.

Description

technical field [0001] The invention relates to the technical field of the Internet of Vehicles, in particular to an improved A * Algorithmic logistics distribution vehicle scheduling method. Background technique [0002] The Vehicle Scheduling Problem (VRP) in the logistics distribution route is a typical combinatorial optimization problem, and it has been proved to be an NP-hard problem. It is difficult to solve the problem in a limited time with an accurate algorithm. [0003] Commonly used algorithms include Dijkstra algorithm and best-first search (BFS) algorithm, but both algorithms have certain shortcomings. Dijkstra is a typical single-source shortest path algorithm. When encountering U-shaped obstacles in the map, Dijkstra algorithm It will run slower, and the execution efficiency needs to be improved; although BFS is much faster than the Dijkstra algorithm, because it only considers the cost of reaching the target, it will not avoid it when it encounters U-shaped ...

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/06G06Q10/08G06Q50/30H04L29/08
CPCH04L67/12G06Q10/047G06Q10/06312G06Q10/083G06Q50/40
Inventor 易星吴昊陈军杨晓星易阳
Owner 上海锦觅网络科技有限公司
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