CN113379342B - Service management system for optimizing Internet of things based on shortest path algorithm - Google Patents
Service management system for optimizing Internet of things based on shortest path algorithm Download PDFInfo
- Publication number
- CN113379342B CN113379342B CN202110468888.1A CN202110468888A CN113379342B CN 113379342 B CN113379342 B CN 113379342B CN 202110468888 A CN202110468888 A CN 202110468888A CN 113379342 B CN113379342 B CN 113379342B
- Authority
- CN
- China
- Prior art keywords
- path
- value
- unit
- group
- delivery
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Abstract
The invention discloses a service management system for optimizing the Internet of things based on a shortest path algorithm, which comprises a target input unit, a path initial planning unit, a model library, a verification unit, a feedback adjustment unit, a cost conversion unit, a processor, a display unit, a management unit and a record library; the target input unit is used for uploading transportation information by a user, wherein the transportation information comprises article information, a starting point and a destination point, and the article information comprises article details and weight; the target input unit is used for transmitting the transportation information to the path primary planning unit; the invention is used for uploading the transportation information by the user through the target input unit, and then transmitting the transportation information to the path primary planning unit; the initial path planning unit is used for carrying out preliminary processing on the transportation information by combining with the model library to obtain a distribution path group formed by all distribution paths; and the verification unit is used for transmitting the distribution path group and the article information to the cost accounting unit and the feedback adjustment unit.
Description
Technical Field
The invention belongs to the field of service management, relates to a shortest path technology, and particularly relates to an Internet of things service management system optimized based on a shortest path algorithm.
Background
Patent publication No. CN106600180A discloses a transportation path optimizing method and system for a logistics management system. The transportation path optimization method of the logistics management system comprises the following steps: reading the path between the starting node and the destination node from a logistics transportation network of a logistics management system, wherein the cost value corresponds to each path; generating a cost matrix according to the path and the cost value; selecting a transport vehicle group corresponding to the path from a vehicle matching table of the logistics management system; constructing a load function corresponding to the path according to the transport vehicle group, and synthesizing a weight matrix between an initial node and a destination node according to the load function and a cost matrix; and calculating a path with the lowest weight cost value according to the weight matrix to obtain an optimized path between the starting node and the destination node. The transportation path optimization method and the transportation path optimization system of the logistics management system effectively improve the path optimization effect in the logistics management system.
However, there is no effective optimization method for selecting nodes of combining paths corresponding to the logistics, and no reasonable combination cost and path planning for each article of the user in the same direction; based on this, a solution is now provided.
Disclosure of Invention
The invention aims to provide an Internet of things service management system optimized based on a shortest path algorithm.
The aim of the invention can be achieved by the following technical scheme:
the service management system of the Internet of things is optimized based on a shortest path algorithm and comprises a target input unit, a path initial planning unit, a model library, a verification unit, a feedback adjustment unit, a cost conversion unit, a processor, a display unit, a management unit and a record library;
the target input unit is used for uploading transportation information by a user, wherein the transportation information comprises article information, a starting point and a destination point, and the article information comprises article details and weight; the target input unit is used for transmitting the transportation information to the path primary planning unit;
the model library stores transportation nodes of all the logistics networks nationwide, and the transportation nodes are corresponding route nodes of logistics such as transportation stations or transfer stations; the path initial planning unit is used for carrying out preliminary processing on the transportation information by combining the model library to obtain a distribution path group formed by all distribution paths;
the path primary planning unit is used for transmitting the distribution path group and the article information to the verification unit, and the verification unit receives the distribution path group and the article information transmitted by the path primary planning unit; the verification unit is used for transmitting the distribution path group and the article information to the cost accounting unit and the feedback adjusting unit;
the cost accounting unit receives the distribution path group and the article information transmitted by the verification unit, and carries out cost accounting on the distribution path group and the article information to obtain a quota value group and a supporting value group corresponding to the distribution path group;
the cost accounting unit is used for returning the quota value group and the abutment value group corresponding to the distribution path group to the verification unit;
the feedback adjusting unit receives the distribution path group and the article information transmitted by the verification unit and performs feedback analysis on the distribution path group and the article information to obtain a composite value group corresponding to the distribution path group;
the feedback regulation unit returns the composite value group to the verification unit; the verification unit receives the composite value group transmitted by the feedback regulation unit;
the verification unit is used for carrying out selected analysis on the distribution path group and the corresponding composite value group, quota value group and abutment value group to obtain a verification path;
the management unit is in communication with the processor.
Further, the preliminary treatment comprises the following specific steps:
step one: acquiring a starting point and an ending point in a transport node;
step two: comparing the starting point with all the transportation nodes, and marking the corresponding transportation node as a delivery starting point if the transportation node consistent with the starting point exists;
if the transport node is not present, automatically acquiring the transport node closest to the transport node, and automatically marking the transport node as a delivery starting point when the transport node closest to the transport node is only one;
otherwise, automatically acquiring all the nearest transportation nodes and marking the nearest transportation nodes as alternative nodes; selecting and analyzing the alternative nodes to obtain a distribution starting point;
step three: obtaining a delivery starting point, obtaining a terminal, and processing the terminal by adopting the same principle as that of obtaining the delivery starting point, wherein the obtained transportation node is marked as the delivery terminal;
step four: automatically comparing the delivery starting point and the delivery ending point in a model library to obtain all transport node combinations from the delivery starting point to the delivery ending point, and marking the transport node combinations as delivery paths, wherein the delivery paths meet the minimum path difference requirement;
step five: and obtaining a distribution path group formed by all the distribution paths.
Further, the selected analysis in the second step is specifically:
s1: optionally an alternative node;
s2: acquiring the single-day traffic of the next week of the alternative node, and sequencing from big to small;
s3: removing the single daily traffic of the first ten percent and the last ten percent;
s4: carrying out average value calculation on the rest single-day traffic, and marking the obtained average value as the determined traffic;
s5: optionally selecting the next alternative node, repeating the steps S2-S5 to obtain the recognized traffic of all the alternative nodes, and marking the alternative node with the highest recognized traffic as a distribution starting point; if more than one alternative node with the highest recognized traffic exists, one of the nodes is randomly selected as the corresponding distribution starting point.
Further, the minimum diameter difference requirement in the fourth step is specifically:
directly connecting two nodes of a delivery starting point and a delivery ending point, and marking the obtained straight line path as an ideal path;
obtaining the shortest linear distance from the ideal path in all the transportation nodes in the formed distribution path, and marking the linear distance as a path difference value; the diameter difference value must be smaller than X1, X1 is a preset value;
simultaneously, the folding value is lower than X2, and X2 is a preset value; the fold value is specifically defined as:
any transport node in any distribution path is obtained, and if the distance between the transport node and a transport destination is greater than the distance between the last transport node and the transport destination, the difference value exceeds X3, and X3 is a preset value; then a fold value is defined plus one.
Further, the cost accounting comprises the following specific steps:
s01: acquiring a distribution path group;
s02: optionally a delivery path within a delivery path group;
s03: then, according to the article information, acquiring funds required under the condition of corresponding to the distribution path, and marking the numerical value after removing the dimension of the amount as a quota value;
s04: meanwhile, the distribution time required by the distribution path under the strength is obtained, and the corresponding numerical value after the dimension of the time is removed is marked as a pushing value;
s05: obtaining a next distribution path, and repeating the steps S03-S05 to obtain corresponding quota values and abutment values in all distribution path groups; marked as quota value group and withholding value group respectively.
Further, the feedback analysis specifically comprises the following steps:
SS1: acquiring a distribution path group;
SS2: optionally, a delivery path is selected, and a composite value of the delivery path in the current time is obtained, wherein the composite value is obtained by the following steps:
SS21: acquiring an approval distribution path of all other articles starting at a distribution starting point in the current time;
SS22: the number of duplicate shipping nodes in the approved delivery path and the selected delivery path are automatically matched. When the repeated number of the transportation nodes exceeds eighty percent of the total number, the composite value is automatically increased by one;
SS23: matching all the approved delivery paths with the selected delivery paths to obtain a composite value;
SS3: and optionally selecting the next delivery path, and repeating the steps SS2-SS3 until all the delivery paths are processed, so as to obtain a composite value group corresponding to the delivery path group.
Further, the specific steps of the selected analysis are as follows:
s001: acquiring a distribution path group and a corresponding composite value group, quota value group and a supporting value group thereof;
s002: calculating a selected value of the set of delivery paths using the formula:
selected value = 0.328 x complex value +0.256 x quota value +0.416 x offset value;
s003: and marking the corresponding distribution path with the highest selected value as a verification path.
Further, the verification unit is used for transmitting the verification path to the processor, the processor is used for transmitting the verification path to the display unit for real-time display, and the processor is used for transmitting the verification path to the record library for real-time storage.
Further, the management unit is used for inputting a preset value.
The invention has the beneficial effects that:
the invention is used for uploading the transportation information by the user through the target input unit, and then transmitting the transportation information to the path primary planning unit; the initial path planning unit is used for carrying out preliminary processing on the transportation information by combining with the model library to obtain a distribution path group formed by all distribution paths; the verification unit is used for transmitting the distribution path group and the article information to the cost accounting unit and the feedback adjusting unit;
the cost accounting unit is used for receiving the distribution path group and the article information transmitted by the verification unit, and carrying out cost accounting on the distribution path group and the article information to obtain a quota value group and a supporting value group corresponding to the distribution path group; then, feedback analysis is carried out on the distribution path group and the article information by using a feedback adjusting unit, and a composite value group corresponding to the distribution path group is obtained;
finally, the verification unit is used for carrying out selected analysis on the distribution path group and the corresponding composite value group, quota value group and abutment value group to obtain a verification path; thus, the path selection is completed, and the method is simple and effective, and is easy and practical.
Drawings
The present invention is further described below with reference to the accompanying drawings for the convenience of understanding by those skilled in the art.
Fig. 1 is a system block diagram of the present invention.
Detailed Description
As shown in fig. 1, the service management system of the internet of things is optimized based on a shortest path algorithm, and comprises a target input unit, a path initial planning unit, a model library, a verification unit, a feedback adjustment unit, a cost conversion unit, a processor, a display unit, a management unit and a record library;
the target input unit is used for uploading transportation information by a user, wherein the transportation information comprises article information, a starting point and a destination point, and the article information comprises basic information such as article details, weight and the like; the target input unit is used for transmitting the transportation information to the path primary planning unit;
the model library stores transportation nodes of all the logistics networks nationwide, and the transportation nodes are corresponding route nodes of logistics such as transportation stations or transfer stations; the path initial planning unit is used for carrying out preliminary treatment on transportation information by combining a model library, and the specific steps of the preliminary treatment are as follows:
step one: acquiring a starting point and an ending point in a transport node;
step two: comparing the starting point with all the transportation nodes, and marking the corresponding transportation node as a delivery starting point if the transportation node consistent with the starting point exists;
if the transport node is not present, automatically acquiring the transport node closest to the transport node, and automatically marking the transport node as a delivery starting point when the transport node closest to the transport node is only one;
otherwise, automatically acquiring all the nearest transportation nodes and marking the nearest transportation nodes as alternative nodes; and carrying out selected analysis on the alternative nodes, wherein the selected analysis specifically comprises the following steps:
s1: optionally an alternative node;
s2: acquiring the single-day traffic of the next week of the alternative node, and sequencing from big to small;
s3: removing the single daily traffic of the first ten percent and the last ten percent;
s4: carrying out average value calculation on the rest single-day traffic, and marking the obtained average value as the determined traffic;
s5: optionally selecting the next alternative node, repeating the steps S2-S5 to obtain the recognized traffic of all the alternative nodes, and marking the alternative node with the highest recognized traffic as a distribution starting point; if more than one alternative node with highest recognized traffic exists, randomly selecting one of the nodes as a corresponding distribution starting point;
step three: obtaining a delivery starting point, obtaining a terminal, and processing the terminal by adopting the same principle as that of obtaining the delivery starting point, wherein the obtained transportation node is marked as the delivery terminal;
step four: automatically comparing the delivery starting point and the delivery ending point in a model library to obtain all transport node combinations from the delivery starting point to the delivery ending point, and marking the transport node combinations as delivery paths, wherein the delivery paths meet the minimum path difference requirements, and the minimum path difference requirements are specifically as follows:
directly connecting two nodes of a delivery starting point and a delivery ending point, and marking the obtained straight line path as an ideal path;
obtaining the shortest linear distance from the ideal path in all the transportation nodes in the formed distribution path, and marking the linear distance as a path difference value; the diameter difference must be smaller than X1, X1 is a preset value, and can be specifically 100Km;
simultaneously, the folding value is lower than X2, and X2 is a preset value; the fold value is specifically defined as:
any transport node in any distribution path is obtained, and if the distance between the transport node and a transport destination is greater than the distance between the last transport node and the transport destination, the difference value exceeds X3, and X3 is a preset value; then define a fold value plus one;
step five: obtaining a distribution path group formed by all distribution paths;
the path primary planning unit is used for transmitting the distribution path group and the article information to the verification unit, and the verification unit receives the distribution path group and the article information transmitted by the path primary planning unit; the verification unit is used for transmitting the distribution path group and the article information to the cost accounting unit and the feedback adjusting unit;
the cost accounting unit receives the distribution path group and the article information transmitted by the verification unit and carries out cost accounting on the distribution path group and the article information, and the cost accounting comprises the following specific steps:
s01: acquiring a distribution path group;
s02: optionally a delivery path within a delivery path group;
s03: then, according to the article information, acquiring funds required under the condition of corresponding to the distribution path, and marking the numerical value after removing the dimension of the amount as a quota value;
s04: meanwhile, the distribution time required by the distribution path under the strength is obtained, and the corresponding numerical value after the dimension of the time is removed is marked as a pushing value;
s05: obtaining a next distribution path, and repeating the steps S03-S05 to obtain corresponding quota values and abutment values in all distribution path groups; marked as a quota value group and a withholding value group respectively;
the cost accounting unit is used for returning the quota value group and the abutment value group corresponding to the distribution path group to the verification unit;
the feedback adjusting unit receives the distribution path group and the article information transmitted by the verification unit and performs feedback analysis on the distribution path group and the article information, and the feedback analysis specifically comprises the following steps:
SS1: acquiring a distribution path group;
SS2: optionally, a delivery path is selected, and a composite value of the delivery path in the current time is obtained, wherein the composite value is obtained by the following steps:
SS21: acquiring the approval delivery paths of all other articles starting from the delivery starting point in the current time, wherein the approval delivery paths are the delivery paths corresponding to other articles finally;
SS22: the number of duplicate shipping nodes in the approved delivery path and the selected delivery path are automatically matched. When the repeated number of the transportation nodes exceeds eighty percent of the total number, the composite value is automatically increased by one;
SS23: matching all the approved delivery paths with the selected delivery paths to obtain a composite value;
SS3: optionally selecting a next delivery path, and repeating the steps SS2-SS3 until all the delivery paths are processed, so as to obtain a composite value group corresponding to the delivery path group;
the feedback regulation unit returns the composite value group to the verification unit; the verification unit receives the composite value group transmitted by the feedback regulation unit;
the verification unit is used for carrying out selected analysis on the distribution path group and the corresponding composite value group, quota value group and abutment value group, and the specific steps of the selected analysis are as follows:
s001: acquiring a distribution path group and a corresponding composite value group, quota value group and a supporting value group thereof;
s002: calculating a selected value of the set of delivery paths using the formula:
selected value = 0.328 x complex value +0.256 x quota value +0.416 x offset value;
s003: marking the corresponding distribution path with the highest selected value as a verification path;
the verification unit is used for transmitting the verification path to the processor, the processor is used for transmitting the verification path to the display unit for real-time display, and the processor is used for transmitting the verification path to the record library for real-time storage;
the management unit is in communication connection with the processor and is used for inputting a preset value.
Optimizing the service management system of the Internet of things based on the shortest path algorithm, uploading transportation information to a user through a target input unit during operation, and then transmitting the transportation information to a path primary planning unit; the initial path planning unit is used for carrying out preliminary processing on the transportation information by combining with the model library to obtain a distribution path group formed by all distribution paths; the verification unit is used for transmitting the distribution path group and the article information to the cost accounting unit and the feedback adjusting unit;
the cost accounting unit is used for receiving the distribution path group and the article information transmitted by the verification unit, and carrying out cost accounting on the distribution path group and the article information to obtain a quota value group and a supporting value group corresponding to the distribution path group; then, feedback analysis is carried out on the distribution path group and the article information by using a feedback adjusting unit, and a composite value group corresponding to the distribution path group is obtained;
finally, the verification unit is used for carrying out selected analysis on the distribution path group and the corresponding composite value group, quota value group and abutment value group to obtain a verification path; thus, the path selection is completed, and the method is simple and effective, and is easy and practical.
The foregoing is merely illustrative of the structures of this invention and various modifications, additions and substitutions for those skilled in the art can be made to the described embodiments without departing from the scope of the invention or from the scope of the invention as defined in the accompanying claims.
Claims (3)
1. The service management system of the Internet of things is optimized based on a shortest path algorithm and is characterized by comprising a target input unit, a path initial planning unit, a model library, a verification unit, a feedback adjustment unit, a cost conversion unit, a processor, a display unit, a management unit and a record library;
the target input unit is used for uploading transportation information by a user, wherein the transportation information comprises article information, a starting point and a destination point, and the article information comprises article details and weight; the target input unit is used for transmitting the transportation information to the path primary planning unit;
the model library stores transportation nodes of all the national logistics networks, and the transportation nodes are route nodes of corresponding logistics; the path initial planning unit is used for carrying out preliminary processing on the transportation information by combining the model library to obtain a distribution path group formed by all distribution paths;
the path primary planning unit is used for transmitting the distribution path group and the article information to the verification unit, and the verification unit receives the distribution path group and the article information transmitted by the path primary planning unit; the verification unit is used for transmitting the distribution path group and the article information to the cost accounting unit and the feedback adjusting unit;
the cost accounting unit receives the distribution path group and the article information transmitted by the verification unit, and carries out cost accounting on the distribution path group and the article information to obtain a quota value group and a supporting value group corresponding to the distribution path group;
the cost accounting unit is used for returning the quota value group and the abutment value group corresponding to the distribution path group to the verification unit;
the feedback adjusting unit receives the distribution path group and the article information transmitted by the verification unit and performs feedback analysis on the distribution path group and the article information to obtain a composite value group corresponding to the distribution path group;
the feedback regulation unit returns the composite value group to the verification unit; the verification unit receives the composite value group transmitted by the feedback regulation unit;
the verification unit is used for carrying out selected analysis on the distribution path group and the corresponding composite value group, quota value group and abutment value group to obtain a verification path;
the management unit is in communication connection with the processor;
the preliminary treatment comprises the following specific steps:
step one: acquiring a starting point and an ending point in a transport node;
step two: comparing the starting point with all the transportation nodes, and marking the corresponding transportation node as a delivery starting point if the transportation node consistent with the starting point exists;
if the transport node is not present, automatically acquiring the transport node closest to the transport node, and automatically marking the transport node as a delivery starting point when the transport node closest to the transport node is only one;
otherwise, automatically acquiring all the nearest transportation nodes and marking the nearest transportation nodes as alternative nodes; selecting and analyzing the alternative nodes to obtain a distribution starting point;
step three: obtaining a delivery starting point, obtaining a terminal, and processing the terminal by adopting the same principle as that of obtaining the delivery starting point, wherein the obtained transportation node is marked as the delivery terminal;
step four: automatically comparing the delivery starting point and the delivery ending point in a model library to obtain all transport node combinations from the delivery starting point to the delivery ending point, and marking the transport node combinations as delivery paths, wherein the delivery paths meet the minimum path difference requirement;
step five: obtaining a distribution path group formed by all distribution paths;
the selected analysis in the second step is specifically:
s1: optionally an alternative node;
s2: acquiring the single-day traffic of the next week of the alternative node, and sequencing from big to small;
s3: removing the single daily traffic of the first ten percent and the last ten percent;
s4: carrying out average value calculation on the rest single-day traffic, and marking the obtained average value as the determined traffic;
s5: optionally selecting the next alternative node, repeating the steps S2-S5 to obtain the recognized traffic of all the alternative nodes, and marking the alternative node with the highest recognized traffic as a distribution starting point; if more than one alternative node with highest recognized traffic exists, randomly selecting one of the nodes as a corresponding distribution starting point;
the minimum diameter difference requirement in the fourth step is specifically:
directly connecting two nodes of a delivery starting point and a delivery ending point, and marking the obtained straight line path as an ideal path;
obtaining the shortest linear distance from the ideal path in all the transportation nodes in the formed distribution path, and marking the linear distance as a path difference value; the diameter difference value must be smaller than X1, X1 is a preset value;
simultaneously, the folding value is lower than X2, and X2 is a preset value; the fold value is specifically defined as:
any transport node in any distribution path is obtained, and if the distance between the transport node and a transport destination is greater than the distance between the last transport node and the transport destination, the difference value exceeds X3, and X3 is a preset value; then define a fold value plus one;
the cost accounting comprises the following specific steps:
s01: acquiring a distribution path group;
s02: optionally a delivery path within a delivery path group;
s03: acquiring funds required under the condition of corresponding to the distribution path according to the article information, and marking the value after removing the dimension of the funds as a quota value;
s04: meanwhile, the distribution time required by the distribution path is obtained, and the corresponding numerical value after the dimension of the time is removed is marked as a pushing value;
s05: obtaining a next distribution path, and repeating the steps S03-S05 to obtain corresponding quota values and abutment values in all distribution path groups; marked as a quota value group and a withholding value group respectively;
the feedback analysis comprises the following specific steps:
SS1: acquiring a distribution path group;
SS2: optionally, a delivery path is selected, and a composite value of the delivery path in the current time is obtained, wherein the composite value is obtained by the following steps:
SS21: acquiring an approval distribution path of all other articles starting at a distribution starting point in the current time;
SS22: automatically matching the number of repeated transportation nodes of the approved delivery path with the selected delivery path, and automatically adding one to the composite value when the repeated number of the transportation nodes exceeds eighty percent of the total number;
SS23: matching all the approved delivery paths with the selected delivery paths to obtain a composite value;
SS3: optionally selecting a next delivery path, and repeating the steps SS2-SS3 until all the delivery paths are processed, so as to obtain a composite value group corresponding to the delivery path group;
the specific steps of the selected analysis are as follows:
s001: acquiring a distribution path group and a corresponding composite value group, quota value group and a supporting value group thereof;
s002: calculating a selected value of the set of delivery paths using the formula:
selected value = 0.328 x complex value +0.256 x quota value +0.416 x offset value;
s003: and marking the corresponding distribution path with the highest selected value as a verification path.
2. The internet of things service management system according to claim 1, wherein the verification unit is configured to transmit the verification path to a processor, the processor is configured to transmit the verification path to a display unit for real-time display, and the processor is configured to transmit the verification path to a record repository for real-time storage.
3. The internet of things service management system based on the shortest path algorithm according to claim 1, wherein the management unit is configured to enter a preset value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110468888.1A CN113379342B (en) | 2021-04-28 | 2021-04-28 | Service management system for optimizing Internet of things based on shortest path algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110468888.1A CN113379342B (en) | 2021-04-28 | 2021-04-28 | Service management system for optimizing Internet of things based on shortest path algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113379342A CN113379342A (en) | 2021-09-10 |
| CN113379342B true CN113379342B (en) | 2023-07-25 |
Family
ID=77570240
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110468888.1A Active CN113379342B (en) | 2021-04-28 | 2021-04-28 | Service management system for optimizing Internet of things based on shortest path algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113379342B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106779173A (en) * | 2016-11-25 | 2017-05-31 | 浙江工业大学 | A kind of route optimizing method for logistic distribution vehicle |
| CN106803136A (en) * | 2017-01-24 | 2017-06-06 | 苏州工业职业技术学院 | A kind of fresh dispatching real-time optimization method based on genetic algorithm |
| CN107624190A (en) * | 2015-05-19 | 2018-01-23 | 弗利特马蒂奇爱尔兰有限公司 | System and method for accelerating route search |
| CN111815076A (en) * | 2020-08-31 | 2020-10-23 | 物联云仓(成都)科技有限公司 | Optimization method of logistics distribution path, storage medium and computer equipment |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010176347A (en) * | 2009-01-29 | 2010-08-12 | Fujitsu Ltd | Shortest path retrieval method and device |
| CN101788999A (en) * | 2009-12-30 | 2010-07-28 | 安徽大学 | Binary chop tracking method of shortest paths in network map |
| CN105354633A (en) * | 2015-10-26 | 2016-02-24 | 努比亚技术有限公司 | Transportation route calculation system and method |
| CN106600180B (en) * | 2016-11-04 | 2018-01-02 | 中联物流（中国）有限公司 | The transportation route optimization method and system of logistic management system |
| CN109976148B (en) * | 2017-12-28 | 2022-02-22 | 深圳市优必选科技有限公司 | Robot motion path planning method and device, storage medium and terminal equipment |
| CN110119831A (en) * | 2018-02-07 | 2019-08-13 | 青岛农业大学 | A kind of the transportation route optimization system and method for logistic management system |
| CN108827335B (en) * | 2018-08-22 | 2021-05-14 | 北京理工大学 | Shortest path planning method based on one-way search model |
| CN110232542A (en) * | 2019-05-21 | 2019-09-13 | 重庆邮电大学 | A kind of express mail Distribution path planing method of real-time response system variation instruction |
| CN111932182A (en) * | 2020-08-27 | 2020-11-13 | 广东优特云科技有限公司 | Distribution path planning method and related device |
-
2021
- 2021-04-28 CN CN202110468888.1A patent/CN113379342B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107624190A (en) * | 2015-05-19 | 2018-01-23 | 弗利特马蒂奇爱尔兰有限公司 | System and method for accelerating route search |
| CN106779173A (en) * | 2016-11-25 | 2017-05-31 | 浙江工业大学 | A kind of route optimizing method for logistic distribution vehicle |
| CN106803136A (en) * | 2017-01-24 | 2017-06-06 | 苏州工业职业技术学院 | A kind of fresh dispatching real-time optimization method based on genetic algorithm |
| CN111815076A (en) * | 2020-08-31 | 2020-10-23 | 物联云仓(成都)科技有限公司 | Optimization method of logistics distribution path, storage medium and computer equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113379342A (en) | 2021-09-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20240054444A1 (en) | Logistics scheduling method and system for industrial park based on game theory | |
| CN107145971A (en) | A kind of express delivery dispatching optimization method of dynamic adjustment | |
| CN105096006A (en) | Method for optimizing a routing of an intelligent ammeter distributing vehicle | |
| CN109919532B (en) | Logistics node determining method and device | |
| CN111445186B (en) | Petri network theory-based vehicle path optimization method with time window | |
| CN101013955B (en) | Fast simulated annealing for traffic matrix estimation | |
| CN110689307B (en) | Method and system for optimizing article delivery time | |
| CN108108933A (en) | Position distribution method of storing in a warehouse and device | |
| CN111507686A (en) | Automatic budget system and method for engineering design change | |
| CN113379342B (en) | Service management system for optimizing Internet of things based on shortest path algorithm | |
| CN106534045A (en) | Configurable financial message conversion device and conversion method thereof | |
| CN100456680C (en) | Cooling method and coder | |
| WO2023071374A1 (en) | Method and apparatus for processing data of goods | |
| Shi et al. | Vehicle routing problem of an innovative B2C and O2O joint distribution service | |
| CN114757662A (en) | Internet-based cross-border service trading platform management system and method | |
| CN108550004A (en) | A kind of warehouse management system of high degree of automation | |
| CN113393258A (en) | Market shopping guide system based on artificial intelligence and data analysis | |
| de la Crnz García et al. | Hybrid heuristic and mathematical programming in oil pipelines networks | |
| Westphal et al. | Pruning in column generation for service vehicle dispatching | |
| Shi et al. | An integer l-shaped method for dynamic order dispatching in autonomous last-mile delivery with demand uncertainty | |
| Sood et al. | Pricing in two-sided markets in the presence of free upgrades | |
| CN113628025B (en) | Bill generation method and device, computer equipment and storage medium | |
| CN107609920A (en) | A kind of orbit generation method and system | |
| CN111401606B (en) | Distribution method and distribution system for combining business-living complex building with intelligent distribution | |
| Kammarti et al. | Improved tabu search in an hybrid evolutionary approach for the pickup and delivery problem with time windows |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |