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

Commodity distribution path planning method based on MoCD algorithm

A path planning and commodity technology, applied in the field of commodity distribution path planning algorithm, can solve problems such as high processor requirements, long search time, and great theoretical significance

Active Publication Date: 2016-11-23
吕建正
View PDF5 Cites 29 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the calculation cost of this scheme is very large, the search time is long, and the requirements for the processor are high in practical applications. The theoretical significance is relatively large, and the practicability is not strong.

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
  • Commodity distribution path planning method based on MoCD algorithm
  • Commodity distribution path planning method based on MoCD algorithm
  • Commodity distribution path planning method based on MoCD algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0056] The present invention provides a method for planning commodity delivery routes based on the MoCD algorithm, comprising the following steps:

[0057] Step 101: building an urban road network model;

[0058] Step 102: Determine commodity price information;

[0059] Step 103: According to the delivery destinations of products from different manufacturers, select manufacturers that meet the required destinations;

[0060] Step 104: Determine the commodity supply and demand plan;

[0061] Step 105: use the Dijkstra algorithm to plan the route from the vehicle to the commodity manufacturer;

[0062] Step 106: Search for the divided areas of the urban road network model by means of a step-by-step search;

[0063] Step 107: output the optimal path planning solution, end.

[0064] specific:

[0065] In step 101, the present invention has set up the model of urban road network:

[0066] The criss-crossing and intricate urban road network is mainly composed of many streets i...

Embodiment 2

[0093] The present invention verifies the proposed algorithm based on 66 steel manufacturers in an urban area of ​​Shandong Province, applies the commodity distribution route planning algorithm based on Dijkstra algorithm to an App developed by a certain company, and uses the loading recommendation function in the mobile App to analyze the proposed algorithm. The practicality of the invented algorithm is verified. The following mainly describes the time and planning schemes of different algorithm search paths.

[0094] (1) Calculation time is one of the factors to measure the performance of the algorithm. Considering 66 steel manufacturers, a certain vehicle needs to transport a certain kind of steel to Beijing, we give the optimal route time searched by the mobile app as the calculation time of the algorithm, and run it 10 times to find the average value. The ant colony algorithm is given below and the average computation time of the algorithm of the present invention.

[0...

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 commodity distribution path planning method based on an MoCD algorithm (multi-object constraint algorithm based on Dijkstra algorithm), which includes the following steps of: firstly taking intersections or endpoints of roads as nodes and building a model of an urban road network according to actual urban road conditions; secondly determining commodity price information, and screening manufacturers which accord with commodity sending destinations; then selecting the manufacturers according to the required commodity number and the manufacturer stock quantity, and a supply and demand scheme which has multiple manufacturer combinations so as to satisfy required commodity quantity existing; and finally planning an optimal path by using the Dijkstra algorithm based on manufacture geographic positions and vehicle positions determined in the last step, and using a step by step search method to improve the search efficiency of the invention algorithm. The transport cost is saved, and the vehicle loading rate and the distribution efficiency are improved by planning the optimal path.

Description

technical field [0001] The invention relates to a commodity delivery path planning algorithm in a logistics system, in particular to a commodity delivery path planning method based on MoCD algorithm (multi-objective constraint algorithm based on Dijkstra algorithm). Background technique [0002] In recent years, with the rapid development of the Internet, e-commerce has penetrated into all walks of life, and the consequent modern logistics industry is becoming a new research focus. As a core link in modern logistics management, commodity distribution has attracted extensive research and attention from experts and scholars, and the technical level and overall efficiency of commodity distribution have also been greatly improved. The path planning in commodity distribution is a key link in the logistics system. A better product planning route plan is conducive to speeding up logistics response, improving service quality, reducing logistics costs, improving efficiency and incre...

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/08G06Q50/28
CPCG06Q10/047G06Q10/08355G06Q10/08
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