CN105091898B - Lorry traffic path generation method, device and system based on time and cost - Google Patents
Lorry traffic path generation method, device and system based on time and cost Download PDFInfo
- Publication number
- CN105091898B CN105091898B CN201510585877.6A CN201510585877A CN105091898B CN 105091898 B CN105091898 B CN 105091898B CN 201510585877 A CN201510585877 A CN 201510585877A CN 105091898 B CN105091898 B CN 105091898B
- Authority
- CN
- China
- Prior art keywords
- node
- route
- lorry
- cost
- time
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 16
- 238000005553 drilling Methods 0.000 claims description 3
- 206010039203 Road traffic accident Diseases 0.000 description 3
- 230000032258 transport Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000033228 biological regulation Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3461—Preferred or disfavoured areas, e.g. dangerous zones, toll or emission zones, intersections, manoeuvre types, segments such as motorways, toll roads, ferries
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3492—Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
Abstract
The present invention relates to a kind of lorry traffic path generation method, device and system based on time and cost, the n ranks for lorry, which can be obtained, can go on a journey network, although the network will can be arrived at from departure place, the intransitable route of lorry excludes, and has specific aim.And then according to the operation information of acquisition and the network of going on a journey previously obtained; the time model and cost model of structure from origin to destination; and according to the time model, cost model and the time restriction of acquisition, cost limitations; determine lorry traffic path; the route has considered time and cost; while ensuring cargo reaching on the time, and reduce transportation cost.
Description
Technical field
The present invention relates to traffic and transport fields, are generated based on the lorry traffic path of time and cost more particularly to a kind of
Methods, devices and systems.
Background technology
With the development of GPS positioning technology, people input departure place and destination in navigation system, you can obtain from going out
Hair ground arrives all paths of destination, and then therefrom chooses suitable route.This gives people, especially to the unfamiliar department of road conditions
Machine brings many facilities.
But navigation system in the prior art only only accounts for whether the route can arrive at from departure place,
All routes arrived at from departure place are all supplied to user, do not consider other factors.However, lorry is as a kind of
The special vehicles, on the one hand, Public Security Department may have many policies to limit in different routes, to lorry, such as limit for height, limit
Width, freight weight limit, the restricted driving of certain period etc., lorry may be directed to the route limited by policy, lead to driver by existing navigation system
It needs to turn around to return or breaks rules and regulations to pass through, or even cause traffic accident, casualties；On the other hand, the new of cargo is loaded for guarantee
Fresh degree, driver wish that cargo is made to reach as early as possible, but this will certainly improve transportation cost, need to seek the time and cost synthesis is examined
The lorry traffic path of worry.So how for load truck to provide targetedly traffic path, consider the time and at
This, is that current traffic and transport field suffers from a problem that.
Invention content
Based on this, it is necessary to the problem of for how to provide targetedly traffic path for load truck, provide one kind
Lorry traffic path generation method based on time and cost, including：
Obtaining lorry n ranks from origin to destination can go on a journey network.
Obtain the operation information of every route in the network that can go on a journey.
According to the operation information of can go on a journey network and every route, time model from origin to destination is built.
According to the operation information of can go on a journey network and every route, cost model from origin to destination is built.
Obtain time restriction and the cost limitation of user.
It is limited according to time model, cost model, time restriction and cost, generates lorry traffic path.
A kind of lorry traffic path generating means based on time and cost, including：
Network acquisition module can go on a journey network for obtaining the n ranks of lorry from origin to destination.
Operation information acquisition module, for obtain can go on a journey network in every route operation information.
Time model builds module, for the operation information according to can go on a journey network and every route, builds follow
Time model of the ground to destination.
Cost model builds module, for the operation information according to can go on a journey network and every route, builds follow
Cost model of the ground to destination.
Restrictive condition acquisition module, the time restriction for obtaining user and cost limitation.
Route Generation module generates lorry and goes out for being limited according to time model, cost model, time restriction and cost
Walking along the street line.
It is a kind of that system, including above-mentioned lorry traffic path generation dress are generated based on the lorry traffic path of time and cost
Set and,
Operation information provides device, the operation information for providing every route for lorry traffic path generating means.
Lorry traffic path generation method, device and system provided by the invention based on time and cost, can obtain needle
It can go on a journey network to the n ranks of lorry, although the network will can be arrived at from departure place, lorry is intransitable
Route excludes, and has specific aim.And then according to the operation information of acquisition and the network of going on a journey previously obtained, build follow
Ground to destination time model and cost model, and according to the time model, cost model and the time restriction of acquisition, cost
Restrictive condition determines lorry traffic path, which has considered time and cost, it is ensured that while cargo reaching on the time,
Transportation cost is reduced again.
Description of the drawings
Fig. 1 is the flow of one embodiment of the lorry traffic path generation method based on time and cost in the present invention
Figure；
Fig. 2 be the present invention in the lorry traffic path generation method based on time and cost acquisition can go on a journey network step
The flow chart of rapid one embodiment；
Fig. 3 is that n ranks can go on a journey the schematic diagram of network in the present invention；
Fig. 4-6, which is the acquisition of the lorry traffic path generation method based on time and cost in the present invention, can go on a journey network
The flow chart of the specific embodiment of step；
Fig. 7 is the generation lorry traffic path step of the lorry traffic path generation method based on time and cost in the present invention
The flow chart of rapid one embodiment；
Fig. 8 is the structure of one embodiment of the lorry traffic path generating means based on time and cost in the present invention
Figure；
Fig. 9 is one of the Route Generation module of the lorry traffic path generating means based on time and cost in the present invention
The structure chart of embodiment；
Figure 10 is the structure of the one embodiment for generating system in the present invention based on the lorry traffic path of time and cost
Figure.
Specific implementation mode
As shown in Figure 1, it is shown that one embodiment of the invention, a kind of lorry traffic path generation side based on time and cost
Method, including：
S100：Obtaining lorry n ranks from origin to destination can go on a journey network.
Preferably, as shown in Fig. 2, step S100 includes：
S110：Departure place is obtained to all routes of destination, according to all routes, the n ranks for generating all routes are undirected
Network.
Specifically, can be according to all routes of existing airmanship acquisition departure place to destination, by this all route
Each corner be set as a node either two intersections that do not go the same way be set as a node or each traffic light
The track for being set as a node or road occurs to be set as a node at increase and decrease, it is of course also possible to which above-mentioned each factor is comprehensive
Conjunction accounts for that node is arranged, and to form the node of undirected graph, and is numbered to node, is denoted as node 1 respectively,
Node 2 ... node n.The each two adjacent node communicated by road forms all routes, forms the side of undirected graph.It is logical
Node and side are crossed, the n rank undirected graphs for characterizing departure place to all routes of destination are formed.As shown in Figure 3.
S120：Obtain the restricted information of all routes.
Specifically, the restricted information of route can be by communicating to connect with the Information Network of Public Security Department, wired or wireless side
Formula obtains the restricted information of all routes from origin to destination, also can directly be carried by third-party server or operator
For the restricted information.In another embodiment, restricted information can also be automatically generated by information network platform or user according to
Information is collected voluntarily to input.In addition, restricted information, policy limitation that is optional but being not limited only to Public Security Department.Restricted information is also
May include the information that other drivers or user provide.Such as, certain driver reaches certain section, it is found that standard the section is not suitable for
Lorry pass through after, which can be fed back to server, operator or public information network platform, which goes on a journey network
Generation method, can be thus to obtain the restricted information of route.
S130：Obtain the essential information of lorry.
Specifically, the essential information of lorry can be provided by user oneself, input, or obtained by the sensor sensing of setting
.The sensor, it is optional but be not limited only to infrared sensor, pressure sensor etc..
S140：According to restricted information, essential information and n rank undirected graphs, generating n ranks can go on a journey network.
Specifically, according to the route restricted information of acquisition and the essential information of lorry, in institute from origin to destination
Have in route, the intransitable route of lorry is excluded, the route of only remaining lorry P Passable is presented on lorry trip network
On figure, for reference, selection.Preferably, include or being sent to use on terminal server by the n ranks network that can go on a journey
The hand-held mobile terminal at family.
More preferably, optional but be not limited only to include one in following four step as shown in figure 4, step S120
Step or multiple steps：
S121：Obtain the maximum height limit of all routes；
S122：Obtain the Max. Clearance _M. of all routes；
S123：Obtain the maximum weight of all routes；
S124：Obtain the limitation time of all routes.
It is corresponding, it is optional but be not limited only to include a step in following four step as shown in figure 5, step S130
Or multiple steps：
S131：Obtain lorry height；
S132：Obtain lorry width；
S133：Obtain lorry weight；
S134：Obtain time of the lorry by certain route.
It is corresponding, it is optional but be not limited only to include one group of step or more in following four groups as shown in fig. 6, step S140
Group step.
First group of step：
S141：The maximum height limit of every route and lorry height are compared one by one, if the maximum height limit of route is more than lorry
Highly, it is determined that route is feasible route；If the maximum height limit of route is less than or equal to lorry height, it is determined that route is can not
Walking along the street line；
S142：According to feasible route, generating n ranks can go on a journey network.
Second group of step：
S143：The Max. Clearance _M. of every route and lorry width are compared one by one, if the Max. Clearance _M. of route is more than lorry
Width, it is determined that route is feasible route.If the Max. Clearance _M. of route is less than or equal to lorry width, it is determined that route is can not
Walking along the street line；
S144：According to feasible route, generating n ranks can go on a journey network.
Third group step：
S145：The maximum weight of every route and lorry weight are compared one by one, if the maximum weight of route is more than lorry
Weight, it is determined that route is feasible route.If the maximum weight of route is less than or equal to lorry weight, it is determined that route is can not
Walking along the street line；
S146：According to feasible route, generating n ranks can go on a journey network.
4th group of step：
S147：The limitation time of every route and lorry are compared one by one by the time of certain route, if lorry passes through
The time of certain route is outside the limitation time of certain route, it is determined that the route is feasible route.If lorry passes through certain road
The time of line is within the limitation time of certain route, it is determined that the route is infeasible route；It should be noted that herein "
Time that lorry passes through certain route " refer in the case where determining the lorry departure time, estimates lorry and passes through certain route
Time；
S148：According to feasible route, generating n ranks can go on a journey network.
It should be understood that above four groups of steps, more than two groups, the priority of step can be according to practical feelings
Condition and change, it is not limited to a certain kind determine sequencing.
S200：Obtain the operation information of every route in the network that can go on a journey.
Specifically, the operation information of every route, including lorry is when this section of route is run, influence running velocity,
The relevant information of the Route travel time and cost.Preferably, which can pass through the information Netcom with Public Security Department
Letter connection, wired or wireless way obtain the operation information of every route in the network that can go on a journey.In another embodiment, it transports
Row information can also be automatically generated by information network platform or user voluntarily inputs according to information is collected.
S300：According to the operation information of can go on a journey network and every route, the time from origin to destination is built
Model.
Specifically, according to the operation information of every route, lorry current required time on every route, then root are obtained
According to the network of going on a journey of lorry, the time needed for the every route of lorry from origin to destination is superimposed, is obtained from going out
Hair ground arrives the time model of destination.Preferably, lorry current required time on every route, it can be used as time weight mark
Note is in each edge that n ranks can go on a journey network.
S400：According to the operation information of can go on a journey network and every route, cost from origin to destination is built
Model.
Specifically, according to the operation information of every route, lorry current required cost on every route, then root are obtained
According to the network of going on a journey of lorry, the cost needed for the every route of lorry from origin to destination is superimposed, is obtained from going out
Hair ground arrives the cost model of destination.Preferably, lorry current required cost on every route, can be used as cost weights mark
Note is in each edge that n ranks can go on a journey network.
S500：Obtain time restriction and the cost limitation of user.
Specifically, user can input the time restriction and cost limitation by input unit such as keyboard, touch screen.This when
Between limitation and cost limitation, it is optional but be not limited only to from the proportionate gain of driver or carrier consider.
S600：It is limited according to time model, cost model, time restriction and cost, generates lorry traffic path.
Specifically, according to time model, cost model, time restriction and cost limit, generate user's stipulated time and at
Corresponding traffic path in this range is presented to the user, selection for reference.Preferably, the lorry traffic path of the generation can
It is sent to server or the handheld device of user, is identified by green line, is checked convenient for user.
In this embodiment, the n ranks obtained first for lorry can go on a journey network, although the network incited somebody to action can be from going out
It arrives to hair, but the intransitable route of lorry excludes, and has specific aim.Operation information according to acquisition and elder generation in turn
The network of going on a journey of preceding acquisition builds time model and cost model from origin to destination, and according to the time mould
Type, cost model and the time restriction of acquisition and cost limitations, determine lorry traffic path, when which has considered
Between and cost, it is ensured that while cargo reaching on the time, but reduce transportation cost.
Preferably, step S200, including the distance of every route of acquisition, traffic lights stand-by period, road conditions coefficient, congestion system
Several and every route average speed.
Specifically, the distance of every route, traffic lights stand-by period can join according to the informatization platform of Public Security Department
Net obtains；Also it can pay and obtain by mechanisms such as server, operators.The road conditions coefficient of every route is the road for reflecting route
The index of face damaged condition, can be empirically determined by the feedback etc. of pavement damage situation, surface evenness, other users.
Preferably, it is 1 to indicate road conditions as normal condition using road conditions coefficient, the higher expression route pavement damage of coefficient value is more serious, road
Condition is poorer, and the lower expression route road surface of coefficient value is more steady, road conditions are better.The congestion coefficient of every route is gathered around for conjunctive path
The composite index of stifled situation and traffic accident probability of happening, can pass through the vehicle flowrate of the route, jam situation and traffic accident probability of happening etc.
Factor is rule of thumb comprehensive to be determined.Preferably, normal condition, the higher expression route of coefficient value are expressed as 1 with congestion coefficient
Congestion possibility is bigger, the congestion time is more long, and the lower expression route congestion possibility of coefficient value is smaller, the congestion time is shorter.
The average speed of every route can be empirically determined according to road conditions coefficient and congestion coefficient, can also be obtained by many experiments.More
To be preferred, traffic lights stand-by period, congestion coefficient may each be the variable depending on the period.Such as, when certain section vehicle is more,
The red light stand-by period may be longer；When the working peak period of certain section, congestion is than more serious.More preferably, step S200 is obtained
The traffic lights stand-by period, congestion information, be estimation lorry when reaching the route, the real time information of the route.
Step S300 is built from origin to destination according to the operation information of can go on a journey network and every route
Time model is：
Tij=tij+lij×rij×bij/vij
Wherein, intersections of the n according to all corners, two different routes in the network that can go on a journey, all traffic lights
Locate, any one or more setting at the generation increase and decrease of the track of all circuits, is denoted as node 1, node 2 ... node n, i=
1 ... n, j=1 ... n, tijFor the traffic lights stand-by period of route shown in node i to node j, lijFor node i to node j institutes
Show the distance of route, rijFor the road conditions coefficient of route shown in node i to node j, bijFor gathering around for route shown in node i to node j
Stifled coefficient, vijFor the average speed that lorry is run on the route shown in node i to node j, TijIt is lorry from node i to node j
Run time needed for shown route,T is lorry from going out
Hair ground to the total time needed for destination.
Specifically, according to the distance of every route, traffic lights stand-by period, road conditions coefficient, congestion coefficient and average speed
Time of the lorry needed for from node i to node j is calculated, each edge for the network that can go on a journey in n ranks with time weight respective markers
On, further according to all routes of departure place to destination, by the time needed for the every route passed through from origin to destination
Superposition obtains every required total time from origin to destination.Wherein, Xij=0, it indicates between node i and node j not
It is directly connected to, i.e., there is no route to communicate between node i and node j, lorry impassabitity, Xij=1, indicate node i and node j it
Between be directly connected to, i.e., there is route to communicate between node i and node j, lorry P Passable.
In this embodiment, operation information includes the distance of every route, traffic lights stand-by period, road conditions coefficient, congestion
The average speed of coefficient and every route thus gives a concrete form of time model.
Preferably, step S200, including obtain distance, road and bridge expense and the road conditions coefficient of every route.
Specifically, the distance of every route, road and bridge expense can be obtained according to networking with the informatization platform of Public Security Department；
It can pay and obtain by mechanisms such as server, operators.The road conditions coefficient of every route is the pavement damage situation for reflecting route
Index, can be empirically determined by the feedback etc. of pavement damage situation, surface evenness, other users.Preferably, with road
Condition coefficient is that 1 expression road conditions are normal condition, and the higher expression route pavement damage of coefficient value is more serious, road conditions are poorer, coefficient
The lower expression route road surface of value is more steady, road conditions are better.
Step S400：According to the operation information of can go on a journey network and every route, build from origin to destination
Cost model is：
Cij=cij+lijrijc
Wherein, intersections of the n according to all corners, two different routes in the network that can go on a journey, Suo Youhong
Any one or more setting at green light, at the generation increase and decrease of the track of all circuits, is denoted as node 1, node 2 ...
Node n, i=1 ... n, j=1 ... n, cijFor the road and bridge expense of route shown in node i to node j, lijExtremely for node i
The distance of route, r shown in node jijFor the road conditions coefficient of route shown in node i to node j, c runs for lorry full load
Freight charges needed for 1km are constant, CijFor the operating cost needed for lorry route shown in from node i to node j,C be lorry from origin to destination needed for assembly
This.
Specifically, the freight charges and road and bridge expense needed for the distance of every route, road conditions coefficient, operation 1km calculate lorry
Cost needed for from node i to node j, with cost weights respective markers in each edge that n ranks can go on a journey network, further according to
Cost needed for the every route passed through from origin to destination is superimposed by departure place to all routes of destination, is obtained
Every required totle drilling cost from origin to destination.
In this embodiment, operation information includes the distance, road and bridge expense and road conditions coefficient of every route, and according to acquisition
Operation information and the lorry run the freight charges needed for 1km, thus give a concrete form of cost model.
Preferably, as shown in fig. 7, step S600, including：
S610：Obtain the first weights of time model.
S620：Second weights of procurement cost model.
S630：Under the premise of meeting time restriction and cost limits, according to time model, cost model, the first weights
With the second weights, lorry traffic path is determined.
Specifically, assuming that the time restriction obtained is Ta, cost be limited to Ca, then can meet time restriction and cost limit
Under the premise of system, according to the actual demand determination of user and matched first weights of time model and with cost model matched the
Two weights thereby determine that lorry traffic path.Preferably, the second weights of the first weights of time model and cost model
It is self-defined according to user demand and current route situation, it is voluntarily inputted by input unit；Also it can be carried by third-party server
For；Or it rule of thumb presets.
In this embodiment, by true with matched first weights of time model and with matched second weights of cost model
Order vehicle traffic path, the route can meet the condition of time restriction and cost limitation, ensure that loading cargo is fresh, send on time
It up to recipient, and can ensure that the income of driver and carrier, achieve the effect that two-win.
As shown in figure 8, in another embodiment, the present invention also provides a kind of lorries based on time and cost to go out walking along the street
Line generating means, including：
Network acquisition module 100 can go on a journey network for obtaining the n ranks of lorry from origin to destination.
Operation information acquisition module 200, for obtain can go on a journey network in every route operation information.
Time model builds module 300, and for according to the operation information of network and every route of can going on a journey, structure is from going out
Hair ground arrives the time model of destination.
Cost model builds module 400, and for according to the operation information of network and every route of can going on a journey, structure is from going out
Hair ground arrives the cost model of destination.
Restrictive condition acquisition module 500, the time restriction for obtaining user and cost limitation.
Route Generation module 600 generates lorry for being limited according to time model, cost model, time restriction and cost
Traffic path.
The lorry traffic path generating means based on time and cost of the embodiment and the lorry based on time and cost
Traffic path generation method corresponds to, and details are not described herein for specific implementation mode and details.The device can be mounted on shipping company
Or on lorry, lorry traffic path is provided in real time.The lorry traffic path can ensure that lorry P Passable for lorry,
In addition also ensure that lorry reaches in stipulated time limitation and cost limitations, it is ensured that while cargo is fresh, it is ensured that department
Machine or the proportionate gain of carrier.
Preferably, operation information acquisition module 200, be specifically used for obtaining the distance of every route, the traffic lights stand-by period,
The average speed of road conditions coefficient, congestion coefficient and every route.
Time model is：
Tij=tij+lij×rij×bij/vij
Wherein, intersections of the n according to all corners, two different routes in the network that can go on a journey, all traffic lights
Locate, any one or more setting at the generation increase and decrease of the track of all circuits, is denoted as node 1, node 2 ... node n, i=
1 ... n, j=1 ... n, tijFor the traffic lights stand-by period of route shown in node i to node j, lijFor node i to node j institutes
Show the distance of route, rijFor the road conditions coefficient of route shown in node i to node j, bijFor gathering around for route shown in node i to node j
Stifled coefficient, vijFor the average speed that lorry is run on the route shown in node i to node j, TijIt is lorry from node i to node j
Run time needed for shown route,T is lorry from going out
Hair ground to the total time needed for destination.
In this embodiment, operation information acquisition module 200 is specifically used for obtaining distance, the traffic lights etc. of every route
Wait for the time, road conditions coefficient, congestion coefficient and every route average speed, thus give one of time model specific implementation
Mode.
Preferably, operation information acquisition module 200 is specifically used for obtaining distance, road and bridge expense and the road conditions system of every route
Number.
Cost model is：
Cij=cij+lijrijc
Wherein, intersections of the n according to all corners, two different routes in the network that can go on a journey, Suo Youhong
Any one or more setting at green light, at the generation increase and decrease of the track of all circuits is denoted as node 1, node 2 ... section
Point n, i=1 ... n, j=1 ... n, cijFor the road and bridge expense of route shown in node i to node j, lijFor node i to section
The distance of route, r shown in point jijFor the road conditions coefficient of route shown in node i to node j, c runs 1km institutes for lorry full load
The freight charges needed are constant, CijFor the operating cost needed for lorry route shown in from node i to node j,C be lorry from origin to destination needed for assembly
This.
In this embodiment, operation information acquisition module 200, be specifically used for obtaining the distance of every route, road and bridge expense and
Road conditions coefficient thus gives a specific implementation mode of cost model.
Preferably, as shown in figure 9, Route Generation module 600, including：
First acquisition unit 610 obtains the first weights of time model.
Second acquisition unit 620, the second weights of procurement cost model.
Determination unit 630, under the premise of meeting time restriction and cost and limiting, according to time model, cost model, the
One weights and the second weights, determine lorry traffic path.
Specifically, assuming that the time restriction obtained is Ta, cost be limited to Ca, then can meet time restriction and cost limit
Under the premise of system, according to the actual demand determination of user and matched first weights of time model and with cost model matched the
Two weights thereby determine that lorry traffic path.Preferably, first acquisition unit 610 and second acquisition unit 620 can be keyboard,
The input units such as touch screen, or the network interface with third-party server communication connection.
In this embodiment, by obtain with time model match the first weights and with cost model it is matched second power
Value determines that lorry traffic path, the route can meet the condition of time restriction and cost limitation, ensures that loading cargo is fresh, accurate
When be sent to recipient, and can ensure that the income of driver and carrier, achieve the effect that two-win.
In another embodiment, as shown in Figure 10, it is gone on a journey based on the lorry of time and cost the present invention also provides a kind of
Route Generation system, including above-mentioned arbitrary lorry traffic path generating means 10 and,
Operation information provides device 20, the operation information for providing every route for lorry traffic path generating means.
Can be server, operator, public information platform etc. specifically, operation information provides device 20, by wired or
Wireless mode provides the operation information of all feasible routes from origin to destination for lorry traffic path generating means.
Preferably, it further includes that restrictive condition provides device 30 that lorry traffic path, which generates system, for going out walking along the street for lorry
Line generating means 10 provide restrictive condition.
Specifically, it can be the input units such as keyboard, touch screen that restrictive condition, which provides device 30, for when being inputted to user
Between, the restrictive conditions such as cost.
In this embodiment, a kind of lorry traffic path generation system is provided, operation information or/and limit can be voluntarily provided
Condition processed, the complete determination process for completing lorry traffic path.
Each technical characteristic of embodiment described above can be combined arbitrarily, to keep description succinct, not to above-mentioned reality
It applies all possible combination of each technical characteristic in example to be all described, as long as however, the combination of these technical characteristics is not deposited
In contradiction, it is all considered to be the range of this specification record.
Several embodiments of the invention above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to the protection of the present invention
Range.Therefore, the protection domain of patent of the present invention should be determined by the appended claims.
Claims (6)
1. a kind of lorry traffic path generation method based on time and cost, which is characterized in that including：
Obtaining lorry n ranks from origin to destination can go on a journey network；
Can go on a journey the operation information of every route in network described in acquisition；
According to the operation information of the go on a journey network and every route, structure is from the departure place to the destination
Time model；
According to the operation information of the go on a journey network and every route, structure is from the departure place to the destination
Cost model；
Obtain time restriction and the cost limitation of user；
It is limited according to the time model, the cost model, the time restriction and the cost, generates the lorry trip
Route；
Can go on a journey described in the acquisition operation information of every route in network the step of, including obtain every route
Distance, the traffic lights stand-by period, road conditions coefficient, congestion coefficient and every route average speed；
Can go on a journey the operation information of network and every route described in the basis, build from the departure place to the mesh
The time model on ground be：
Tij=tij+lij×rij×bij/vij
Wherein, n can go on a journey all corners in network, the intersection of two different routes, all traffic lights according to
Locate, any one or more setting at the generation increase and decrease of the track of all circuits, is denoted as node 1, node 2 ... node n, i=
1 ... n, j=1 ... n, tijFor the traffic lights stand-by period of route shown in node i to node j, lijFor node i to node j institutes
Show the distance of route, rijFor the road conditions coefficient of route shown in node i to node j, bijFor gathering around for route shown in node i to node j
Stifled coefficient, vijFor the average speed that the lorry is run on the route shown in node i to node j, TijIt is the lorry from node
Run time needed for route shown in i to node j,T is
Total time of the lorry needed for from the departure place to the destination；
Can go on a journey described in the acquisition operation information of every route in network the step of, including obtain every route
Distance, road and bridge expense and road conditions coefficient；
Can go on a journey the operation information of network and every route described in the basis, build from the departure place to the mesh
The cost model on ground be：
Cij=cij+lijrijc
Wherein, n can go on a journey according to all corners in network, the intersection of two different routes, all traffic lights,
Any one or more setting at increase and decrease occurs for the track of all circuits, is denoted as node 1, node 2 ... node n, i=1 ...
N, j=1 ... n, cijFor the road and bridge expense of route shown in node i to node j, lijFor the distance of route shown in node i to node j, rijFor
The road conditions coefficient of route shown in node i to node j, c are the freight charges needed for lorry full load operation 1km, are constant, CijFor the goods
Operating cost needed for vehicle route shown in from node i to node j,
C is totle drilling cost of the lorry needed for from the departure place to the destination.
2. the lorry traffic path generation method according to claim 1 based on time and cost, which is characterized in that described
It is limited according to the time model, the cost model, the time restriction and the cost, generates the lorry traffic path
The step of, including：
Obtain the first weights of the time model；
Obtain the second weights of the cost model；
Under the premise of meeting the time restriction and the cost limits, according to the time model, the cost model, institute
The first weights and second weights are stated, determine the lorry traffic path.
3. a kind of lorry traffic path generating means based on time and cost, which is characterized in that including：
Network acquisition module can go on a journey network for obtaining the n ranks of lorry from origin to destination；
Operation information acquisition module, the operation information for obtaining every route in the network that can go on a journey；
Time model builds module, for the operation information of network and every route of can going on a journey according to, structure from
Time model of the departure place to the destination；
Cost model builds module, for the operation information of network and every route of can going on a journey according to, structure from
Cost model of the departure place to the destination；
Restrictive condition acquisition module, the time restriction for obtaining user and cost limitation；
Route Generation module, for being limited according to the time model, the cost model, the time restriction and the cost
System, generates the lorry traffic path；
The operation information acquisition module is specifically used for obtaining the distance of every route, traffic lights stand-by period, road conditions system
The average speed of number, congestion coefficient and every route；
The time model is：
Tij=tij+lij×rij×bij/vij
Wherein, n can go on a journey all corners in network, the intersection of two different routes, all traffic lights according to
Locate, any one or more setting at the generation increase and decrease of the track of all circuits, is denoted as node 1, node 2 ... node n, i=
1 ... n, j=1 ... n, tijFor the traffic lights stand-by period of route shown in node i to node j, lijFor node i to node j institutes
Show the distance of route, rijFor the road conditions coefficient of route shown in node i to node j, bijFor gathering around for route shown in node i to node j
Stifled coefficient, vijFor the average speed that the lorry is run on the route shown in node i to node j, TijIt is the lorry from node
Run time needed for route shown in i to node j,T is
Total time of the lorry needed for from the departure place to the destination；
The operation information acquisition module is specifically used for obtaining distance, road and bridge expense and the road conditions coefficient of every route；
The cost model is：
Cij=cij+lijrijc
Wherein, n can go on a journey all corners in network, the intersection of two different routes, Suo Youhong according to
Any one or more setting at green light, at the generation increase and decrease of the track of all circuits is denoted as node 1, node 2 ... section
Point n, i=1 ... n, j=1 ... n, cijFor the road and bridge expense of route shown in node i to node j, lijFor node i to section
The distance of route, r shown in point jijFor the road conditions coefficient of route shown in node i to node j, c runs for lorry full load
Freight charges needed for 1km are constant, CijFor the operating cost needed for lorry route shown in from node i to node j,C is the lorry from the departure place to the purpose
Totle drilling cost needed for ground.
4. the lorry traffic path generating means according to claim 3 based on time and cost, which is characterized in that described
Route Generation module, including：
First acquisition unit, the first weights for obtaining the time model；
Second acquisition unit, the second weights for obtaining the cost model；
Determination unit, under the premise of meeting the time restriction and the cost and limiting, according to the time model, institute
Cost model, first weights and second weights are stated, determine the lorry traffic path.
5. a kind of generating system based on the lorry traffic path of time and cost, which is characterized in that arbitrary including claim 3-4
Lorry traffic path generating means and operation information described in one provide device, for being generated for the lorry traffic path
Device provides the operation information of every route.
6. according to claim 5 generate system based on the lorry traffic path of time and cost, which is characterized in that also wrap
It includes restrictive condition and device is provided, for providing restrictive condition for lorry traffic path generating means.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510585877.6A CN105091898B (en) | 2015-09-15 | 2015-09-15 | Lorry traffic path generation method, device and system based on time and cost |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510585877.6A CN105091898B (en) | 2015-09-15 | 2015-09-15 | Lorry traffic path generation method, device and system based on time and cost |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105091898A CN105091898A (en) | 2015-11-25 |
| CN105091898B true CN105091898B (en) | 2018-09-11 |
Family
ID=54572847
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510585877.6A Expired - Fee Related CN105091898B (en) | 2015-09-15 | 2015-09-15 | Lorry traffic path generation method, device and system based on time and cost |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105091898B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10546254B2 (en) * | 2016-01-26 | 2020-01-28 | Oracle International Corporation | System and method for efficient storage of point-to-point traffic patterns |
| CN105571605A (en) * | 2016-01-29 | 2016-05-11 | 宇龙计算机通信科技(深圳)有限公司 | Navigation route planning method and device, terminal and server |
| CN107545314B (en) * | 2016-06-23 | 2020-12-15 | 阿里巴巴（中国）有限公司 | Method and device for sequencing public travel routes |
| CN106846869B (en) * | 2017-02-21 | 2019-03-08 | 驼队重卡（北京）物流信息技术有限责任公司 | A kind of update method of lorry navigation road auxiliary information |
| CN107490383B (en) * | 2017-08-09 | 2020-03-03 | 百度在线网络技术（北京）有限公司 | Service providing method, server and readable medium for path health information in navigation |
| CN110285820A (en) * | 2018-03-19 | 2019-09-27 | 上海博泰悦臻网络技术服务有限公司 | A kind of trip road condition predicting method and system for vehicle device |
| CN108648440B (en) * | 2018-05-31 | 2021-08-13 | 广州亿程交通信息集团有限公司 | Vehicle dispatching platform based on internet of vehicles monitoring |
| CN110232544B (en) * | 2019-06-11 | 2022-02-11 | 海南电网有限责任公司 | Transportation path planning method and device, storage medium and electronic equipment |
| CN112185151A (en) * | 2020-09-15 | 2021-01-05 | 上海思寒环保科技有限公司 | Intelligent path planning method and system |
| CN116337104B (en) * | 2023-05-29 | 2023-08-18 | 佳都科技集团股份有限公司 | Regional path navigation method, system, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101294817A (en) * | 2007-04-28 | 2008-10-29 | 佛山市顺德区顺达电脑厂有限公司 | Vehicle navigation system and method thereof |
| CN101621735A (en) * | 2009-08-07 | 2010-01-06 | 赵阳 | Vehicle real-time information system based on the third-generation mobile communication |
| CN101807349A (en) * | 2010-01-08 | 2010-08-18 | 北京世纪高通科技有限公司 | Road condition distribution system and method based on Web |
| CN102853842A (en) * | 2012-05-15 | 2013-01-02 | 董路 | Navigation path planning method, apparatus, and system |
| CN103854505A (en) * | 2013-12-18 | 2014-06-11 | 招商局重庆交通科研设计院有限公司 | Vehicle real-time navigation method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8886453B2 (en) * | 2008-12-11 | 2014-11-11 | Telogis, Inc. | System and method for efficient routing on a network in the presence of multiple-edge restrictions and other constraints |
-
2015
- 2015-09-15 CN CN201510585877.6A patent/CN105091898B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101294817A (en) * | 2007-04-28 | 2008-10-29 | 佛山市顺德区顺达电脑厂有限公司 | Vehicle navigation system and method thereof |
| CN101621735A (en) * | 2009-08-07 | 2010-01-06 | 赵阳 | Vehicle real-time information system based on the third-generation mobile communication |
| CN101807349A (en) * | 2010-01-08 | 2010-08-18 | 北京世纪高通科技有限公司 | Road condition distribution system and method based on Web |
| CN102853842A (en) * | 2012-05-15 | 2013-01-02 | 董路 | Navigation path planning method, apparatus, and system |
| CN103854505A (en) * | 2013-12-18 | 2014-06-11 | 招商局重庆交通科研设计院有限公司 | Vehicle real-time navigation method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105091898A (en) | 2015-11-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105091898B (en) | Lorry traffic path generation method, device and system based on time and cost | |
| US11537146B2 (en) | Fleet vehicle feature activation | |
| Boriboonsomsin et al. | Eco-routing navigation system based on multisource historical and real-time traffic information | |
| US9037406B2 (en) | Vehicle fleet routing system | |
| CN105222798B (en) | Time-based lorry traffic path generation method, device and system | |
| EP3683549B1 (en) | Method, apparatus, and computer program product for lane-level route guidance | |
| US20170011465A1 (en) | Method and apparatus for providing fee rate based on safety score | |
| US9301099B2 (en) | Method of analyzing points of interest with probe data | |
| JP5549353B2 (en) | Car navigation system | |
| CN107305131A (en) | Navigation optimization centered on node | |
| US20080120021A1 (en) | Guide Route Search Device, Guide Route Search Method, and Computer Program Thereof | |
| EP3591339A2 (en) | Method, apparatus, and computer program product for generation of a route including multiple waypoints | |
| CN113763741B (en) | Trunk road traffic guidance method in Internet of vehicles environment | |
| WO2013014612A1 (en) | Multi-modal journey planner | |
| CN104567898A (en) | Traffic route planning method, system and device | |
| JP6190627B2 (en) | Information processing system, information processing server, information processing method, and information processing program | |
| JP2011038794A (en) | Route search device, route search method, computer program, and map database | |
| JP2013205868A (en) | Server, route search system, information processing method and computer program | |
| CN105157716B (en) | Lorry trip network drawing generating method, device and system | |
| CN107063279A (en) | A kind of Traffic Net combined type introduction route generating means and route generation method | |
| JP2011027524A (en) | Navigation system, route search server, route search method, and navigation apparatus | |
| JP2020067677A (en) | Delivery management system | |
| JP2004062364A (en) | Accident information processing system | |
| CN106323317A (en) | Navigation method and device | |
| JP6687680B2 (en) | Information processing system, information processing server, information processing method, and information processing program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180911 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |