Check patentability & draft patents in minutes with Patsnap Eureka AI!

Vehicle scheduling method and device

A vehicle scheduling and vehicle technology, applied in the field of logistics, can solve problems such as the inability to solve the problem of multiple warehouses and multiple trips

Pending Publication Date: 2021-12-07
BEIJING JINGDONG ZHENSHI INFORMATION TECH CO LTD
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] In view of this, the embodiment of the present invention provides a vehicle scheduling method and device to solve the technical problem that cannot solve the problem of multiple trips in multiple warehouses

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
  • Vehicle scheduling method and device
  • Vehicle scheduling method and device
  • Vehicle scheduling method and device

Examples

Experimental program
Comparison scheme
Effect test

example

[0191] There are 10 nodes in total, 0 is the central warehouse, 2 non-central warehouses, and 7 customer nodes (3 delivery customer nodes and 4 receiving customer nodes.

[0192] The distance matrix of 10 nodes d=[[0.0,6,10,1,3,5,9,2,5,5,10],[5,0.0,5,3,7,5,7,7, 10,4,4],[10,3,0.0,6,9,9,3,5,2,10,5],[4,2,8,0.0,4,7,3,10,8, 1,10],[10,1,3,2,0.0,6,8,8,3,4,8],[5,8,6,6,10,0.0,10,4,10,3, 7],[3,9,1,8,4,10,0.0,9,5,5,1],[1,8,4,9,1,7,3,0.0,7,2,4] ,[10,10,4,10,6,8,8,1,0.0,1,9],[6,10,2,10,5,9,3,2,4,0.0,3],[ 1,3,7,3,5,6,3,9,9,4,0.0]]

[0193] Among them, d[I,j] is the distance from node i to j.

[0194] The warehouse service is {2:[3],0:[4,5]}, which means that the non-central warehouse 2 serves the distribution customer node 3, and the central warehouse serves customer nodes 4 and 5.

[0195] {3:[1,3,0.5,1],4:[1,3,0.5,7],5:[5,7,0.5,2],6:[1,3,0.5,1],7 :[5,7,0.5,4],8:[1,3,0.5,8],9:[5,7,0.5,2]} indicates the service time window, service duration and wheel load of all customer nodes.

[01...

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 vehicle scheduling method and device and relates to the technical field of logistics. A specific embodiment of the method comprises the following steps of solving a route of a vehicle based on a scanning algorithm to obtain a scanning algorithm solution with the minimum total cost; wherein the scanning algorithm solution comprises a plurality of routes; combining a plurality of routes according to similarity between the routes to obtain a plurality of route sets; solving a plurality of route sets based on a mixed integer linear programming algorithm to obtain an optimal solution; wherein the optimal solution comprises the required vehicle, the number of times of each vehicle and each node passed by each route of each vehicle; and scheduling the vehicle according to the optimal solution. According to the method, a technical problem that the multi-warehouse and multi-pass problem cannot be solved can be solved.

Description

technical field [0001] The invention relates to the technical field of logistics, in particular to a vehicle scheduling method and device. Background technique [0002] The vehicle routing problem is one of the most common problems in logistics scheduling, which is a typical NP (non-deterministic polynomial, non-deterministic polynomial) difficult problem. [0003] In the course of realizing the present invention, the inventor finds that there are at least the following problems in the prior art: [0004] At present, the existing technology solves the problem of single-warehouse distribution and collection, but it cannot solve the problem of multiple warehouses and multiple trips. Contents of the invention [0005] In view of this, the embodiments of the present invention provide a vehicle scheduling method and device to solve the technical problem that cannot solve the problem of multiple trips in multiple warehouses. [0006] In order to achieve the above purpose, acco...

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/06G06Q10/04G06Q10/08
CPCG06Q10/06311G06Q10/047G06Q10/08355
Inventor 白悦辉
Owner BEIJING JINGDONG ZHENSHI INFORMATION TECH CO LTD
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com