CN107341633A - Regulate and control the method and apparatus of logistics route - Google Patents
Regulate and control the method and apparatus of logistics route Download PDFInfo
- Publication number
- CN107341633A CN107341633A CN201710497285.8A CN201710497285A CN107341633A CN 107341633 A CN107341633 A CN 107341633A CN 201710497285 A CN201710497285 A CN 201710497285A CN 107341633 A CN107341633 A CN 107341633A
- Authority
- CN
- China
- Prior art keywords
- relay station
- distance
- adjacency matrix
- logistics
- target
- 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.)
- Pending
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
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of method and apparatus of regulation and control logistics route.Wherein, this method includes：Obtain the starting relay station and target relay station of logistics route, the at least one relay station for meeting preparatory condition is determined according to the target relay station of logistics route, each relay station is obtained to the distance of target relay station, adjacency matrix is updated according to distance, the optimal path of logistics route is determined based on the adjacency matrix after renewal.The present invention solves the technical problem that logistics operation efficiency is low caused by prior art can not be dynamically determined optimal logistics route.
Description
Technical field
The present invention relates to field of intelligent control, in particular to a kind of method and apparatus of regulation and control logistics route.
Background technology
With the fast development of Internet technology, net purchase has turned into the main trend of people's shopping.Net purchase has convenient and swift
The advantages of, the home-confined cheap commodity that can be bought of buyer.Therefore, net purchase receives the favor of people.However, mesh
Before, after buyer bought commodity on network, logistics company is generally required by the parameter of people to complete the process of transported goods.Example
Such as, after buyer is by good order under network, logistics company is needed the provinces and cities where the Commodity Transportation to buyer, then again by
The region that courier is transported goods to where buyer, and then be sent in buyer's hand.Whole logistics progress is both needed to the ginseng of very important person
With wasting time and energy.Further, since the quantity of transported goods is relatively more, in whole logistics progress, logistics can not be dynamically determined
Optimal path, logistics operation efficiency comparison are low.
It is low for the above-mentioned logistics operation efficiency caused by prior art can not be dynamically determined optimal logistics route
The problem of, effective solution is not yet proposed at present.
The content of the invention
The embodiments of the invention provide a kind of method and apparatus of regulation and control logistics route, at least to solve due to prior art
The low technical problem of logistics operation efficiency caused by optimal logistics route can not be dynamically determined.
One side according to embodiments of the present invention, there is provided a kind of method of regulation and control logistics route, including：Obtain logistics
The starting relay station and target relay station in path；Determined to meet at least the one of preparatory condition according to the target relay station of logistics route
Individual relay station；Each relay station is obtained to the distance of target relay station；Adjacency matrix is updated according to distance, wherein, adjacency matrix
For characterizing the relation between at least one relay station and distance；The optimal of logistics route is determined based on the adjacency matrix after renewal
Path.
Another aspect according to embodiments of the present invention, a kind of device of regulation and control logistics route is additionally provided, including：Obtain mould
Block, for obtaining the starting relay station and target relay station of logistics route；First determining module, for the mesh according to logistics route
Mark relay station；Each relay station is obtained to the distance of target relay station；Update module, for updating adjacency matrix according to distance,
Wherein, adjacency matrix is used to characterize the relation between at least one relay station and distance；Second determining module, for based on renewal
Adjacency matrix afterwards determines the optimal path of logistics route.
Another aspect according to embodiments of the present invention, a kind of storage medium is additionally provided, the storage medium includes storage
Program, wherein, the method that program performs regulation and control logistics route.
Another aspect according to embodiments of the present invention, a kind of processor being additionally provided, the processor is used for operation program, its
In, the method for execution regulation and control logistics route when program is run.
In embodiments of the present invention, by the way of dynamic updates adjacency matrix, in the starting by obtaining logistics route
After station and target relay station, at least one relay station for meeting preparatory condition is determined according to the target relay station of logistics route, is obtained
Each relay station is taken to update adjacency matrix to the distance of target relay station according to distance, determined based on the adjacency matrix after renewal
The optimal path of logistics route, wherein, adjacency matrix is used to characterize the relation between at least one relay station and distance, reaches
The purpose of auto-control logistics transportation route, it is achieved thereby that reducing the energy consumption during logistics transportation, improve logistics operation
The technique effect of efficiency, and then solve the logistics caused by prior art can not be dynamically determined optimal logistics route and make
The low technical problem of industry efficiency.
Brief description of the drawings
Accompanying drawing described herein is used for providing a further understanding of the present invention, forms the part of the application, this hair
Bright schematic description and description is used to explain the present invention, does not form inappropriate limitation of the present invention.In the accompanying drawings：
Fig. 1 is a kind of method flow diagram of regulation and control logistics route according to embodiments of the present invention；
Fig. 2 is a kind of schematic diagram of optional relay station network according to embodiments of the present invention；
Fig. 3 is a kind of network distribution schematic diagram of optional relay station according to embodiments of the present invention；
Fig. 4 is a kind of method flow diagram of optional regulation and control logistics route according to embodiments of the present invention；
Fig. 5 is a kind of method flow diagram of optional regulation and control logistics route according to embodiments of the present invention；
Fig. 6 is a kind of method flow diagram of optional regulation and control logistics route according to embodiments of the present invention；
Fig. 7 is a kind of optional method flow diagram for establishing the second adjacency matrix according to embodiments of the present invention；
Fig. 8 is a kind of method flow diagram of the second adjacency matrix of optional renewal according to embodiments of the present invention；And
Fig. 9 is a kind of apparatus structure schematic diagram of regulation and control logistics route according to embodiments of the present invention.
Embodiment
In order that those skilled in the art more fully understand the present invention program, below in conjunction with the embodiment of the present invention
Accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is only
The embodiment of a part of the invention, rather than whole embodiments.Based on the embodiment in the present invention, ordinary skill people
The every other embodiment that member is obtained under the premise of creative work is not made, it should all belong to the model that the present invention protects
Enclose.
It should be noted that term " first " in description and claims of this specification and above-mentioned accompanying drawing, "
Two " etc. be for distinguishing similar object, without for describing specific order or precedence.It should be appreciated that so use
Data can exchange in the appropriate case, so as to embodiments of the invention described herein can with except illustrating herein or
Order beyond those of description is implemented.In addition, term " comprising " and " having " and their any deformation, it is intended that cover
Cover it is non-exclusive include, be not necessarily limited to for example, containing the process of series of steps or unit, method, system, product or equipment
Those steps or unit clearly listed, but may include not list clearly or for these processes, method, product
Or the intrinsic other steps of equipment or unit.
Embodiment 1
According to embodiments of the present invention, there is provided a kind of embodiment of the method for regulation and control logistics route is, it is necessary to illustrate, attached
The step of flow of figure illustrates can perform in the computer system of such as one group computer executable instructions, though also,
So logical order is shown in flow charts, but in some cases, can be with different from shown by order execution herein
Or the step of description.
Fig. 1 is the method flow diagram of regulation and control logistics route according to embodiments of the present invention, as shown in figure 1, this method includes
Following steps：
Step S102, obtain the starting relay station and target relay station of logistics route.
It should be noted that the application is applicable to unmanned Intelligent logistics during the automatic material flow in city or area
The transportation route regulation and control of carrier.Wherein, carrier is a kind of easily-consumed products, is mainly used in replacing in factory manually to complete some machineries
The instrument of action, in terms of logistics transportation, carrier can include ground carrier and flight carrier, in this application, ground carrier
Can be but be not limited to unmanned vehicle, ship etc., flight carrier can be but be not limited to unpiloted aircraft or
Aircraft.
In addition it is also necessary to explanation, to realize the automatic material flow in certain city or region, it is necessary to establish the city or area
The relay station network in domain, wherein, Fig. 2 is a kind of schematic diagram of optional relay station network.Harbour or airport in Fig. 2 are extremely
The total relay station and B in total relay station, total relay station of total relay station to A cities, total relay station of total relay station to B cities, and A cities
The foundation of the distance between total relay station in city and the adjacency matrix of distance dependent, wherein, the element of adjacency matrix is in each two
After the distance between station, originate relay station and target relay station corresponds respectively to the initiation region and target area of logistics.
The starting relay station and target relay station of logistics route can be determined by above-mentioned steps S102, that is, logistics is determined
The beginning and end in path, and then optimal logistics route is determined according to the beginning and end of logistics.
Step S104, at least one relay station for meeting preparatory condition is determined according to the target relay station of logistics route.
It should be noted that, it is necessary to be initialized to adjacency matrix, in adjacent square before a logistics task starts
All relay stations in the range of distance objective relay station gauged distance are determined in battle array.
In a kind of optional embodiment, Fig. 3 is a kind of network distribution schematic diagram of optional relay station, is built based on Fig. 3
Adjacency matrix under Liru：
Wherein, the distance between two relay stations of the digitized representation in above-mentioned matrix, for example, relay station A and relay station B it
Between distance be 2km, infinitely great ∞ is not connected between representing two relay stations, for example, relay station A and relay station D be in not
Connection status.
In figure 3, target relay station I, starting relay station is A, from the figure 3, it may be seen that the relaying being connected with target relay station I
Stand as relay station E, F, G, H, aforementioned four relay station is arranged in set U, and then get the above-mentioned preparatory condition that meets
Relay station.
In an alternative embodiment, whether the distance for the relay station for judging to be connected with target relay station is at nobody
In the range of the standardised transportation distance of carrier, if the distance of relay station and target relay station is in the scope of standardised transportation distance
It is interior, then by relay station setting and set U.For example, the standardised transportation distance of unmanned vehicle is 3km, then meet in condition
It is F, G, H after standing, and above three relay station is arranged in set U.
It should be noted that above-mentioned standard transportation range be unmanned vehicle in the case of heavy burden, can reach and return
Farthest transportation range.For example, farthest transportation range of the unmanned vehicle in the case of heavy burden is 20km, then unmanned vehicle standard
Transportation range is set as 10km.
In addition it is also necessary to explanation, the relay station for meeting preparatory condition, Jin Ergen can be got by step S104
The relay station node on optimal path is determined according to the relay station got.
Step S106, each relay station is obtained to the distance of target relay station.
Step S104 is being performed, after getting at least one relay station for meeting preparatory condition, and it is default to obtain satisfaction
The distance between the relay station of condition and target relay station, and the distance between each relay station and target relay station are arranged on
In set I, it is with the distance between target relay station determination set I based on Fig. 3 and each relay station：
I={ ∞, ∞, ∞, ∞, 5,2,2,2, ∞ }
Step S108, according to distance update adjacency matrix, wherein, adjacency matrix be used for characterize at least one relay station with away from
Relation between.
After distance of each relay station to target relay station is got, it is determined that each relay station and target relay station it
Between distance set of relationship I, and by set I renewal into adjacency matrix, that is, update after adjacency matrix be：
It should be noted that above-mentioned adjacency matrix can carry out real-time update according to different target relay stations, so as to reach
The effect for the optimal path for determining logistics is dynamically, in realtime arrived.
Step S110, the optimal path of logistics route is determined based on the adjacency matrix after renewal.
It should be noted that after the adjacency matrix after getting renewal, based on the adjacency matrix after renewal using most
Short distance algorithm determines that the shortest path is the optimal of logistics route from starting relay station to the shortest path of target relay station
Path.Wherein, above-mentioned beeline algorithm can be Dijkstra's algorithm (i.e. dijkstra's algorithm).
In addition it is also necessary to explanation, after the optimal path of logistics route is got, the starting based on logistics route
Relay station and target relay station, the optimal path is stored.Afterwards, if starting relay station and target relay station and this
The starting relay station of logistics task is identical with target relay station, then the optimal path is directly used, without carrying out again most
The determination process of shortest path, so as to further increase the efficiency of logistics operation.
The scheme limited based on above-mentioned steps S102 to step S110, it can know, by obtaining rising for logistics route
Beginning relay station and target relay station, at least one relaying for meeting preparatory condition is determined according to the target relay station of logistics route
Stand, obtain each relay station to the distance of target relay station, adjacency matrix is updated according to distance, based on the adjacency matrix after renewal
The optimal path of logistics route is determined, wherein, adjacency matrix is used to characterize the relation between at least one relay station and distance.
Be easily noted that, the application obtain be meet between the relay station of preparatory condition and target relay station away from
From, and adjacency matrix is updated according to distance, due in different logistics tasks, target relay station and the position of starting relay station
It is probably what is differed to put, and therefore, needs dynamic renewal adjacency matrix for different target relay stations and starting relay station, enters
And logistics route is regulated and controled according to the adjacency matrix after renewal.
By above-described embodiment of the application, the purpose of auto-control logistics transportation route can be reached, it is achieved thereby that
The energy consumption during logistics transportation is reduced, improves the technique effect of the efficiency of logistics operation, and then solve due to prior art
The low technical problem of logistics operation efficiency caused by optimal logistics route can not be dynamically determined.
In a kind of optional embodiment, a kind of method flow diagram of optional regulation and control logistics route as shown in Figure 4,
Before performing step S102, i.e., before the starting relay station of logistics route and target relay station is obtained, regulate and control logistics route side
Method specifically comprises the following steps：
Step S402, establish logistics demand model；
Step S404, relay station network profile is established according to logistics demand model；
Step S406, adjacency matrix is established according to relay station network profile, wherein, adjacency matrix comprises at least：First
Adjacency matrix and the second adjacency matrix.
It should be noted that above-mentioned logistics demand model is distributed according to the logistics demand in a certain city or region, according to
The logistics demand model can determine the distribution situation in the city or in-region relay station, and then according to the distribution feelings of relay station
Condition establishes adjacency matrix.Wherein, above-mentioned first adjacency matrix characterizes the distance between each two relay station relation, the second adjoining square
Battle array is characterized in the quantity of unmanned vehicle idle in each relay station (i.e. workable unmanned vehicle).
In addition it is also necessary to explanation, above-mentioned relay station network profile can be the network of relay station as shown in Figure 3
Distribution map, the network profile according to Fig. 3 can get the physical distance between each two relay station, and it is each in
After the physical distance between station and target relay station, the physical distance is the element in adjacency matrix.Wherein, when two physics
Distance beyond unmanned vehicle standardised transportation apart from when, physical distance between the two relay stations is set for infinity.
Specifically, as shown in figure 5, establishing the first adjacency matrix according to relay station network profile specifically includes following step
Suddenly：
Step S502, obtain the distance between each two relay station in relay station network profile；
Step S504, the element of the first adjacency matrix is determined according to the distance between each two relay station；
Step S506, the first adjacency matrix is established according to the element of the first adjacency matrix；Wherein, each two relay station it
Between distance be more than pre-determined distance in the case of, determine the element of the first adjacency matrix for infinity.
In a kind of optional embodiment, according between each two relay station in relay station network profile as indicated at 3
Distance establish following adjacency matrix：
Wherein, the digitized representation distance in above-mentioned adjacency matrix, for example, the tertial digitized representation relay station B of the second row
The distance between relay station C is 6.If it is not attached between two relay stations, or the distance between two intermediate stations are more than
Standardised transportation distance, then the distance between the two relay stations represented with infinity.
It should be noted that above-mentioned pre-determined distance can be standardised transportation distance, or less than standardised transportation distance
Other numerical value.
In addition it is also necessary to explanation, after the starting relay station of logistics route and target relay station is determined, it is necessary to
First adjacency matrix is updated according to the distance of each relay station and target relay station, wherein, one kind as shown in Figure 6 is optional
Regulate and control the method flow diagram of logistics route, adjacency matrix is updated according to distance, specifically comprised the following steps：
Step S602, obtain at least one relay station in the range of pre-determined distance；
Step S604, obtain the first distance of at least one relay station distance objective relay station；
Step S606, the target column element corresponding with target relay station is determined according to the first distance；
Step S608, the first adjacency matrix is updated according to target column element.
Specifically, when a logistics task starts, it is necessary first to carry out initialization process to adjacency matrix, find and mesh
The distance for marking relay station is less than all relay stations of standardised transportation distance (i.e. pre-determined distance), as shown in figure 3, and target relay station
Distance be less than standardised transportation distance relay station be E, F, G, H.After qualified relay station is obtained, relaying is got
Stand the distance between E, F, G, H distance objective relay station I, and the distance is put into set U, i.e. U={ 5,2,2,2 }.Wherein,
The distance of relay station and target relay station not in the range of pre-determined distance is infinity.According to qualified relay station and mesh
Mark the distance between relay station and the distance between the relay station in the range of pre-determined distance and target relay station does not determine mesh
Column element is marked, is I={ ∞, ∞, ∞, ∞, 5,2,2,2, ∞ } so as to obtain the column element corresponding to target relay station, and should
Row are added in the first adjacency matrix, so as to complete the process of the first adjacency matrix of renewal.The first adjacency matrix after renewal
For：
In an alternative embodiment, a kind of optional method stream for establishing the second adjacency matrix as shown in Figure 7
Cheng Tu, the second adjacency matrix is established according to relay station network profile, specifically comprised the following steps：
Step S702, the carrier quantity of each relay station in relay station network profile is obtained, wherein, carrier quantity is at least
Including：Idle carrier quantity possessed by each relay station and the carrier quantity of each relay station storage；
Step S704, the element of the second adjacency matrix is determined according to the carrier quantity of each relay station；
Step S706, the second adjacency matrix is established according to the element of the second adjacency matrix.
It should be noted that be 0 in idle carrier quantity, and/or the carrier quantity of each relay station storage reaches maximum
In the case of carrier quantity, the element for determining the second adjacency matrix is infinity.I.e. when the unmanned vehicle of some relay station turns out for work
Or the quantity of unmanned vehicle that can accommodate of the relay station has reached saturation (i.e. the quantity of unmanned vehicle has reached the relay station
The maximum carrier quantity that may store), it is infinity, example to set the element corresponding to the row and column of the second dynamic adjacency matrix
Such as, the second adjacency matrix is：
Wherein, the quantity for the idle carrier that can be transported between relay station B and relay station A is 2, and relay station F is deposited
The quantity of the relay station of storage has reached saturation or the unmanned vehicle without idle condition, and therefore, what is be connected with relay station F is all
The quantity of unmanned vehicle between relay station and F is arranged to infinitely great.
Creating the first adjacency matrix and the second adjacency matrix, and after being updated to the first adjacency matrix, according to renewal
The first adjacency matrix afterwards determines the optimal path of logistics route using shortest path first, concretely comprises the following steps：
Step A, determine the first relay station to the first distance of target relay station based on adjacency matrix；
Step B, it is determined that second relay station most short with the distance of the first relay station, and determine in the first relay station and second
After the second distance at station；
Step C, determine the second relay station to the 3rd distance of target relay station based on adjacency matrix；
Step D, beeline is determined according to the 4th distance and the first distance, and preserve the repeater corresponding to beeline
Node, wherein, the 4th distance for second distance and the 3rd distance and, beeline is that the first distance and the 4th count in
It is worth smaller distance；
Step E, repeat step A are to step D, until the 3rd distance is 0, and are linked in sequence to obtain logistics to preserving node
The optimal path in path.
In a kind of optional embodiment, illustrated by taking the network profile of the relay station shown in Fig. 3 as an example.Row are set
Table V records the node of all relay stations in network profile, wherein, V [0] represents starting relay station, dis [i] list note
Relay station V [0] is recorded to relay station V [i] distance W [0] [i], i.e. W is above-mentioned first adjacency matrix.Then to relay station V [0]
It is marked, that is, vis [0]=1 is set, wherein, vis [i] represents the relay station accessed, when not accessing the relay station, vis
[0]=0.And then determination and closest approach V [k] adjacent V [0], and node V [k] is recorded, and record V [0] and V
The distance between [k] is min, while relay station V [k] is marked, i.e. vis [k]=1.Get V [0] and V [k] it
Between distance after, compare the size of the numerical value between dis [i] and min+W [k] [i], i.e. dis [i]=MIN (dis [i], min
+ W [k] [i]), after the comparison, the node that current shortest path passed through is recorded with pass [i].The above method is repeated, directly
To find out all relay stations institute to corresponding node location.Now, the nodal value corresponding to the target point in dis lists is
To originate the beeline of relay station and target relay station, wherein, process required for logistics route is have recorded in pass lists
The node of relay station.
Specifically, starting relay station is relay station A, target relay station I.With relay station A closest relay station
For B (distance is 2), i.e. min=2, now, starting relay station A to target relay station I distance is infinity, and relay station A is extremely
It is 2+ ∞ that relay station B, relay station B arrive the distance between relay station I again, now, passes through relay station B under pass list records.With
Relay station closest relay station B is E, i.e., min=3 now, now, from relay station A, B, E, then from relay station E in
After station I distance be 2+3+ ∞, i.e. 5+ ∞, relay station E under pass list records.Closest relay station is with relay station B
F, i.e., min=2 now, it is 5+2+2, pass from relay station A, B, E, F, then from relay station F to relay station I distance now
Relay station F under list records.That is, optimal path is：A→B→E→F→I.
After the adjacency matrix after according to renewal determines the optimal path of logistics route, it is also necessary to the second adjacency matrix
It is updated, a kind of method flow diagram of specific the second adjacency matrix of optional renewal as shown in Figure 8, the adjoining square of renewal second
The method of battle array specifically comprises the following steps：
Step S802, it is determined that after the optimal path of logistics route, obtain the relay station on optimal path；
Step S804, the carrier quantity for the relay station being pointed on optimal path carry out subtracting one processing, obtain result；
Step S806, the second adjacency matrix is updated according to result；Wherein, the idle carrier of relay station after treatment
In the case that quantity is 0, it is determined that element corresponding in the second adjacency matrix is infinity.
Specifically, by the quantity of the idle unmanned vehicle of all relay stations in optimal path obtained above and the relaying
The quantity of stored unmanned vehicle of standing all subtracts one.If after subtracting one, the quantity of idle unmanned vehicle has been 0, now
The second adjacency matrix is updated, and the quantity of the idle unmanned vehicle corresponding to the relay station is arranged to infinitely great, be i.e. the relaying
The row and column stood in the second adjacency matrix is all set to infinity.
Understood based on above-mentioned embodiments herein disclosure of that, the application can be used for whole-process automatic compound in city
Path regulation and control of the unmanned vehicle from starting point to target point during stream.The application macro adjustments and controls and can distribute the thing of unmanned vehicle
Transit route is flowed, so that unmanned vehicle during logistics transportation, overall low energy consumption, quickly finishes logistics task, entered
And the efficiency of automatic material flow is greatly improved in the application.
Embodiment 2
According to embodiments of the present invention, a kind of device embodiment of regulation and control logistics route is additionally provided.
Fig. 9 is the apparatus structure schematic diagram of regulation and control logistics route according to embodiments of the present invention, as shown in figure 9, the device
Including：First acquisition module 901, the first determining module 903, the second acquisition module 905, update module 907 and second determine
Module 909.
Wherein, the first acquisition module 901, for obtaining the starting relay station and target relay station of logistics route；First is true
Cover half block 903, for the target relay station according to logistics route；Second acquisition module 905, for obtaining each relay station to mesh
Mark the distance of relay station；Update module 907, for updating adjacency matrix according to distance, wherein, adjacency matrix is used to characterize at least
Relation between one relay station and distance；Second determining module 909, for determining logistics road based on the adjacency matrix after renewal
The optimal path in footpath.
It should be noted that above-mentioned first acquisition module 901, the first determining module 903, the second acquisition module 905, renewal
The determining module 909 of module 907 and second correspond to embodiment 1 in step S102 to step S110, five modules with it is corresponding
The step of the example realized it is identical with application scenarios, but be not limited to the disclosure of that of above-described embodiment 1.
From the foregoing, it will be observed that starting relay station and target relay station by obtaining logistics route, according to the target of logistics route
Relay station determines to meet at least one relay station of preparatory condition, obtains each relay station to the distance of target relay station, according to
Distance renewal adjacency matrix, the optimal path of logistics route is determined based on the adjacency matrix after renewal, wherein, adjacency matrix is used for
Characterize the relation between at least one relay station and distance.
Be easily noted that, the application obtain be meet between the relay station of preparatory condition and target relay station away from
From, and adjacency matrix is updated according to distance, due in different logistics tasks, target relay station and the position of starting relay station
It is probably what is differed to put, and therefore, needs dynamic renewal adjacency matrix for different target relay stations and starting relay station, enters
And logistics route is regulated and controled according to the adjacency matrix after renewal.
By above-described embodiment of the application, the purpose of auto-control logistics transportation route can be reached, it is achieved thereby that
The energy consumption during logistics transportation is reduced, improves the technique effect of the efficiency of logistics operation, and then solve due to prior art
The low technical problem of logistics operation efficiency caused by optimal logistics route can not be dynamically determined.
In a kind of optional embodiment, regulating and controlling the device of logistics route also includes：First establishes module, second establishes mould
Block and the 3rd establish module.Wherein, first module is established, for establishing logistics demand model；Second establishes module, for root
Relay station network profile is established according to logistics demand model；3rd establishes module, for being established according to relay station network profile
Adjacency matrix, wherein, adjacency matrix comprises at least：First adjacency matrix and the second adjacency matrix.
It should be noted that above-mentioned first establish module, second establish module and the 3rd establish module correspond to implement
Step S402 to step S406 in example 1, three modules are identical with example and application scenarios that corresponding step is realized, but not
It is limited to the disclosure of that of above-described embodiment 1.
In a kind of optional embodiment, the 3rd, which establishes module, includes：3rd acquisition module, the 3rd determining module and
Four establish module.Wherein, the 3rd acquisition module, for obtain between each two relay station in relay station network profile away from
From；3rd determining module, for determining the element of the first adjacency matrix according to the distance between each two relay station；4th establishes
Module, for establishing the first adjacency matrix according to the element of the first adjacency matrix；Wherein, the distance between each two relay station
In the case of more than pre-determined distance, the element for determining the first adjacency matrix is infinity.
It should be noted that above-mentioned 3rd acquisition module, the 3rd determining module and the 4th, which establish module, corresponds to implementation
Step S502 to step S506 in example 1, three modules are identical with example and application scenarios that corresponding step is realized, but not
It is limited to the disclosure of that of above-described embodiment 1.
In a kind of optional embodiment, update module includes：4th acquisition module, the 5th acquisition module, the 4th determine
Module and the first update module.Wherein, the 4th acquisition module, for obtaining at least one relaying in the range of pre-determined distance
Stand；5th acquisition module, for obtaining the first distance of at least one relay station distance objective relay station；4th determining module,
For determining the target column element corresponding with target relay station according to the first distance；First update module, for according to target
Column element updates the first adjacency matrix.
It should be noted that above-mentioned 4th acquisition module, the 5th acquisition module, the 4th determining module and the first renewal mould
The step S602 to step S608 that block corresponds in embodiment 1, the example and application that four modules are realized with corresponding step
Scene is identical, but is not limited to the disclosure of that of above-described embodiment 1.
In a kind of optional embodiment, the 3rd, which establishes module, includes：6th acquisition module, the 5th determining module and
Five establish module.Wherein, the 6th acquisition module, for obtaining the carrier quantity of each relay station in relay station network profile,
Wherein, carrier quantity comprises at least：Idle carrier quantity possessed by each relay station and the carrier number of each relay station storage
Amount；5th determining module, for determining the element of the second adjacency matrix according to the carrier quantity of each relay station；5th establishes mould
Block, for establishing the second adjacency matrix according to the element of the second adjacency matrix；Wherein, it is 0 in idle carrier quantity, and/or often
In the case that the carrier quantity of individual relay station storage reaches maximum carrier quantity, the element for determining the second adjacency matrix is infinite
Greatly.
It should be noted that above-mentioned 6th acquisition module, the 5th determining module and the 5th, which establish module, corresponds to implementation
Step S702 to step S706 in example 1, three modules are identical with example and application scenarios that corresponding step is realized, but not
It is limited to the disclosure of that of above-described embodiment 1.
In a kind of optional embodiment, regulating and controlling the device of logistics route also includes：7th acquisition module, processing module with
And second update module.Wherein, the 7th acquisition module, for it is determined that after the optimal path of logistics route, obtaining positioned at most
Relay station on shortest path；Processing module, the carrier quantity of the relay station for being pointed on optimal path carry out subtracting one processing,
Obtain result；Second update module, for updating the second adjacency matrix according to result；Wherein, in after treatment
In the case that the idle carrier quantity at station is 0, it is determined that element corresponding in the second adjacency matrix is infinity.
It should be noted that above-mentioned 7th acquisition module, processing module and the second update module correspond in embodiment 1
Step S802 to step S806, three modules are identical with example and application scenarios that corresponding step is realized, but are not limited to
The disclosure of that of above-described embodiment 1.
In a kind of optional embodiment, the second determining module is additionally operable to perform following steps：
Step A, determine the first relay station to the first distance of target relay station based on adjacency matrix；
Step B, it is determined that second relay station most short with the distance of the first relay station, and determine in the first relay station and second
After the second distance at station；
Step C, determine the second relay station to the 3rd distance of target relay station based on adjacency matrix；
Step D, beeline is determined according to the 4th distance and the first distance, and preserve the repeater corresponding to beeline
Node, wherein, the 4th distance for second distance and the 3rd distance and, beeline is that the first distance and the 4th count in
It is worth smaller distance；
Step E, repeat step A are to step D, until the 3rd distance is 0, and are linked in sequence to obtain logistics to preserving node
The optimal path in path.
In addition, another aspect according to embodiments of the present invention, additionally provides a kind of storage medium, the storage medium includes depositing
The program of storage, wherein, the method that program performs the regulation and control logistics route in embodiment 1.
Another aspect according to embodiments of the present invention, a kind of processor being additionally provided, the processor is used for operation program, its
In, the method for regulating and controlling logistics route in embodiment 1 is performed when program is run.
The embodiments of the present invention are for illustration only, do not represent the quality of embodiment.
In the above embodiment of the present invention, the description to each embodiment all emphasizes particularly on different fields, and does not have in some embodiment
The part of detailed description, it may refer to the associated description of other embodiment.
In several embodiments provided herein, it should be understood that disclosed technology contents, others can be passed through
Mode is realized.Wherein, device embodiment described above is only schematical, such as the division of the unit, Ke Yiwei
A kind of division of logic function, can there is an other dividing mode when actually realizing, for example, multiple units or component can combine or
Person is desirably integrated into another system, or some features can be ignored, or does not perform.Another, shown or discussed is mutual
Between coupling or direct-coupling or communication connection can be INDIRECT COUPLING or communication link by some interfaces, unit or module
Connect, can be electrical or other forms.
The unit illustrated as separating component can be or may not be physically separate, show as unit
The part shown can be or may not be physical location, you can with positioned at a place, or can also be distributed to multiple
On unit.Some or all of unit therein can be selected to realize the purpose of this embodiment scheme according to the actual needs.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, can also
That unit is individually physically present, can also two or more units it is integrated in a unit.Above-mentioned integrated list
Member can both be realized in the form of hardware, can also be realized in the form of SFU software functional unit.
If the integrated unit is realized in the form of SFU software functional unit and is used as independent production marketing or use
When, it can be stored in a computer read/write memory medium.Based on such understanding, technical scheme is substantially
The part to be contributed in other words to prior art or all or part of the technical scheme can be in the form of software products
Embody, the computer software product is stored in a storage medium, including some instructions are causing a computer
Equipment (can be personal computer, server or network equipment etc.) perform each embodiment methods described of the present invention whole or
Part steps.And foregoing storage medium includes：USB flash disk, read-only storage (ROM, Read-Only Memory), arbitrary access are deposited
Reservoir (RAM, Random Access Memory), mobile hard disk, magnetic disc or CD etc. are various can be with store program codes
Medium.
Described above is only the preferred embodiment of the present invention, it is noted that for the ordinary skill people of the art
For member, under the premise without departing from the principles of the invention, some improvements and modifications can also be made, these improvements and modifications also should
It is considered as protection scope of the present invention.
Claims (10)
- A kind of 1. method of regulation and control logistics route, it is characterised in that including：Obtain the starting relay station and target relay station of logistics route；At least one relay station for meeting preparatory condition is determined according to the target relay station of the logistics route；Each relay station is obtained to the distance of the target relay station；Adjacency matrix is updated according to the distance, wherein, the adjacency matrix is used to characterize at least one relay station and institute State the relation between distance；The optimal path of the logistics route is determined based on the adjacency matrix after renewal.
- 2. according to the method for claim 1, it is characterised in that obtaining the starting relay station and object relay of logistics route Before standing, methods described also includes：Establish logistics demand model；Relay station network profile is established according to the logistics demand model；The adjacency matrix is established according to the relay station network profile, wherein, the adjacency matrix comprises at least：First is adjacent Connect matrix and the second adjacency matrix.
- 3. according to the method for claim 2, it is characterised in that establish described first according to the relay station network profile Adjacency matrix, including：Obtain the distance between each two relay station in the relay station network profile；The element of first adjacency matrix is determined according to the distance between described each two relay station；First adjacency matrix is established according to the element of first adjacency matrix；Wherein, in the case that the distance between each two relay station is more than pre-determined distance, the first adjoining square is determined The element of battle array is infinity.
- 4. according to the method for claim 3, it is characterised in that adjacency matrix is updated according to the distance, including：Obtain at least one relay station in the range of the pre-determined distance；Obtain first distance of at least one relay station apart from the target relay station；The target column element corresponding with the target relay station is determined according to the described first distance；First adjacency matrix is updated according to the target column element.
- 5. according to the method for claim 2, it is characterised in that establish described second according to the relay station network profile Adjacency matrix, including：The carrier quantity of each relay station in the relay station network profile is obtained, wherein, the carrier quantity is at least wrapped Include：Idle carrier quantity possessed by each relay station and the carrier quantity of each relay station storage；The element of second adjacency matrix is determined according to the carrier quantity of each relay station；Second adjacency matrix is established according to the element of second adjacency matrix；Wherein, it is 0 in the idle carrier quantity, and/or the carrier quantity of each relay station storage reaches maximum carrier In the case of quantity, the element for determining second adjacency matrix is infinity.
- 6. according to the method for claim 5, it is characterised in that the adjacency matrix after based on renewal determines the thing After the optimal path of flow path, methods described also includes：It is determined that after the optimal path of the logistics route, the relay station on the optimal path is obtained；The carrier quantity for the relay station being pointed on the optimal path carries out subtracting one processing, obtains result；Second adjacency matrix is updated according to the result；Wherein, in the case that the idle carrier quantity of relay station after treatment is 0, it is determined that the institute in second adjacency matrix Corresponding element is infinity.
- 7. according to the method for claim 1, it is characterised in that the logistics is determined based on the adjacency matrix after renewal The optimal path in path, including：Step A, determine the first relay station to the first distance of the target relay station based on the adjacency matrix；Step B, it is determined that second relay station most short with the distance of first relay station, and determine first relay station and institute State the second distance of the second relay station；Step C, determine second relay station to the 3rd distance of the target relay station based on the adjacency matrix；Step D, beeline is determined according to the 4th distance and the described first distance, and preserved corresponding to the beeline After the node of device, wherein, the 4th distance for the second distance and the 3rd distance and, the beeline is institute State the less distance of numeric ratio in the first distance and the 4th distance；Step E, repeat step A are to step D, until the described 3rd distance is 0, and are linked in sequence to obtain to preserving the node The optimal path of the logistics route.
- A kind of 8. device of regulation and control logistics route, it is characterised in that including：First acquisition module, for obtaining the starting relay station and target relay station of logistics route；First determining module, for the target relay station according to the logistics route；Second acquisition module, for obtaining each relay station to the distance of the target relay station；Update module, for according to it is described distance update adjacency matrix, wherein, the adjacency matrix be used for characterize it is at least one in Relation between station and the distance；Second determining module, for determining the optimal path of the logistics route based on the adjacency matrix after renewal.
- A kind of 9. storage medium, it is characterised in that the storage medium includes the program of storage, wherein, described program right of execution The method that profit requires the regulation and control logistics route described in any one in 1 to 7.
- A kind of 10. processor, it is characterised in that the processor is used for operation program, wherein, right of execution when described program is run The method that profit requires the regulation and control logistics route described in any one in 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710497285.8A CN107341633A (en) | 2017-06-26 | 2017-06-26 | Regulate and control the method and apparatus of logistics route |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710497285.8A CN107341633A (en) | 2017-06-26 | 2017-06-26 | Regulate and control the method and apparatus of logistics route |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107341633A true CN107341633A (en) | 2017-11-10 |
Family
ID=60221003
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710497285.8A Pending CN107341633A (en) | 2017-06-26 | 2017-06-26 | Regulate and control the method and apparatus of logistics route |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107341633A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111667085A (en) * | 2019-03-08 | 2020-09-15 | 北京京东尚科信息技术有限公司 | Method, device, medium and electronic equipment for determining logistics routing network |
| CN112330241A (en) * | 2020-10-13 | 2021-02-05 | 深圳市中农易讯信息技术有限公司 | Logistics visualization method, device, equipment and medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102364506A (en) * | 2011-06-30 | 2012-02-29 | 福建慧翰信息技术有限公司 | Path reservation planning system and method |
| CN104268637A (en) * | 2014-09-11 | 2015-01-07 | 武汉钢铁(集团)公司 | Goods transmission path generating method and system |
| CN105404941A (en) * | 2015-12-07 | 2016-03-16 | 惠龙易通国际物流股份有限公司 | Intelligent optimization method and system for logistics transportation mode and path |
| CN105512169A (en) * | 2016-03-10 | 2016-04-20 | 珠海市规划设计研究院 | Shortest route searching method based on route and weight |
| CN105825296A (en) * | 2016-03-11 | 2016-08-03 | 惠龙易通国际物流股份有限公司 | Dijkstra-algorithm-based freight information processing method and system |
-
2017
- 2017-06-26 CN CN201710497285.8A patent/CN107341633A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102364506A (en) * | 2011-06-30 | 2012-02-29 | 福建慧翰信息技术有限公司 | Path reservation planning system and method |
| CN104268637A (en) * | 2014-09-11 | 2015-01-07 | 武汉钢铁(集团)公司 | Goods transmission path generating method and system |
| CN105404941A (en) * | 2015-12-07 | 2016-03-16 | 惠龙易通国际物流股份有限公司 | Intelligent optimization method and system for logistics transportation mode and path |
| CN105512169A (en) * | 2016-03-10 | 2016-04-20 | 珠海市规划设计研究院 | Shortest route searching method based on route and weight |
| CN105825296A (en) * | 2016-03-11 | 2016-08-03 | 惠龙易通国际物流股份有限公司 | Dijkstra-algorithm-based freight information processing method and system |
Non-Patent Citations (1)
| Title |
|---|
| 曹振华 等: "基于Dijkstra算法的区域物流网络配送路径优化", 《物流技术》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111667085A (en) * | 2019-03-08 | 2020-09-15 | 北京京东尚科信息技术有限公司 | Method, device, medium and electronic equipment for determining logistics routing network |
| CN111667085B (en) * | 2019-03-08 | 2024-04-09 | 北京京东振世信息技术有限公司 | Logistics routing network determining method, device, medium and electronic equipment |
| CN112330241A (en) * | 2020-10-13 | 2021-02-05 | 深圳市中农易讯信息技术有限公司 | Logistics visualization method, device, equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kim et al. | Sequencing delivery and receiving operations for yard cranes in port container terminals | |
| CN105729491B (en) | The execution method, apparatus and system of robot task | |
| CN108664038B (en) | Multi-unmanned aerial vehicle distributed contract auction online task planning method | |
| CN106528740B (en) | Road axis extracting method based on Delaunay triangulation network | |
| CN105488892B (en) | A kind of method and server for robot queuing management | |
| CN108090093A (en) | The method and apparatus for generating recommendation results | |
| CN109447317A (en) | A kind of warehouse shortest path first method based on more people picking simultaneously | |
| CN107194656A (en) | A kind of method and device for planning of the Distribution path based on standard container order | |
| CN103353872B (en) | A kind of teaching resource personalized recommendation method based on neutral net | |
| CN107511337A (en) | Goods sorting system data processing method, device and electronic equipment | |
| CN107220796A (en) | A kind of kinds of goods transportation resources of distributors and device | |
| CN107067218A (en) | Goods delivery method, system and the terminal of a kind of distributors | |
| CN105373909A (en) | Logistics dispensing center addressing method based on simulation software | |
| CN107808150A (en) | The recognition methods of human body video actions, device, storage medium and processor | |
| CN107798423A (en) | Vehicle path planning Simulation Experimental Platform based on multi-intelligence algorithm | |
| CN103546583B (en) | Group intellectual perception system and group intellectual perception method | |
| CN107609035A (en) | The recommendation method and apparatus of information | |
| CN107341633A (en) | Regulate and control the method and apparatus of logistics route | |
| CN103399868A (en) | Method for optimizing foreign trade logistics path | |
| CN108287856A (en) | Service range determines method, apparatus and electronic equipment | |
| CN108229536A (en) | Optimization method, device and the terminal device of classification prediction model | |
| CN107274084A (en) | A kind of order intelligent dispatching method, system and terminal based on standard container | |
| CN109218118A (en) | Logistics network cascading failure time-varying load re-distribution method based on load capacity nonlinear model | |
| CN107133339A (en) | Circuit query method and apparatus and storage medium, processor | |
| CN110490381A (en) | Bus trunk line planing method based on mixed integer programming |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20171110 |