CN108960519A - Time based on big data analysis most short transportation route selection method - Google Patents
Time based on big data analysis most short transportation route selection method Download PDFInfo
- Publication number
- CN108960519A CN108960519A CN201810752601.6A CN201810752601A CN108960519A CN 108960519 A CN108960519 A CN 108960519A CN 201810752601 A CN201810752601 A CN 201810752601A CN 108960519 A CN108960519 A CN 108960519A
- Authority
- CN
- China
- Prior art keywords
- time
- route
- shortest path
- vehicle
- spent
- 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.)
- Granted
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/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
-
- 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
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)
- Traffic Control Systems (AREA)
Abstract
Time based on big data analysis most short transportation route selection method, belong to logistics field, solve the mode using wisdom logistics, in alternative path, the used time more optimized shorter path is cooked up in real time, and technical essential is to determine transport origin and terminate place and find out corresponding latitude and longitude coordinates；It is calculated respectively by static programming algorithm apart from shortest path and the corresponding distance of second shortest path and transit route；Investigate total revision time respectively by shortest path and second shortest path length, time includes the running time and charge station's residence time that two places are spent, effect is that this method makes in more logistics approach, use real-time Data Transmission, by Path selection with the used time to be oriented to, so that more times can be saved in transit.
Description
Technical field
The invention belongs to logistics fields, are related to a kind of most short transportation route selection method of the time based on big data analysis.
Background technique
As logistics is towards the development in information-based direction, the transmitting of logistics information and management orientation are more and more information-based.
It is considered as that computer is used on the basis of modern logistics for " wisdom logistics (Intelligent Logistics, IL) "
And all kinds of intelligent algorithms carry out classification and signature analysis to various information to each ring of complete independently logistics order
The work and scheduling of section；On the other hand viewpoint be wisdom logistics in addition to need to complete the automatic operation of each logistics links with
Outside, should also from logistics management angle, by using advanced laser, infrared, less radio-frequency, sensor, automatic identification,
New and high technologies, these advanced modern logistics systems such as coding, positioning, optical fiber, wireless, database have number substantially
The science and technology feature such as change, visualization, Agility, automation, networking, flexibility, integrated, information-based, intelligent, to make goods
Object efficiently can send big demander from supplier, finally make supplier obtain maximize profit, demander enjoys optimal service, it is natural and
Social resources consumption substantially reduces, natural ecological environment is protected to the maximum extent.
Summary of the invention
The invention solves the modes for using wisdom logistics to cook up more optimize in real time in alternative path
Used time shorter path, the present invention in order to achieve the above objectives, adopts the following technical scheme that
A kind of most short transportation route selection method of the time based on big data analysis:
It determines transport origin and terminates place and find out corresponding latitude and longitude coordinates, measured by map all
Can transit route；
By static programming algorithm in all transit routes, shortest path and the corresponding road of second shortest path are calculated respectively
Journey and corresponding transit route；
Investigate total revision time respectively by shortest path and second shortest path length, the time includes that two places are spent when driving
Between and charge station's residence time；
Shortest path between first and second two places is route 1, calculates what vehicle to second was spent from first ground by route 1
Running time TA；
Secondary short-circuit line between first and second two places is route 2, calculates what vehicle to second was spent from first ground by route 2
Running time TB；
The vehicle number of this Chinese herbaceous peony is come in queue before calculating the 1st, 2,3 ... n charge stations on route 1
n(1,2,3 ... ..., n)；
The vehicle number of this Chinese herbaceous peony is come in queue before calculating the 1st, 2,3 ... n charge stations on route 2
m(1,2,3 ... ..., m)；
Calculate each car it is average in the payment of each charge station the time spent in t；
Calculate the total time that vehicle is spent on route 1 by the 1st, 2,3 ... n charge stations
Calculate the total time that vehicle is spent on route 2 by the 1st, 2,3 ... n charge stations
Calculate the total time S that vehicle is spent with route 1, route 2 from city A to city B respectively1And S2；
It is in 1 charge station of route the spent time；
It is in 2 charge station of Jian Xian the spent time；
Compare S1And S2Size, if S1>S2, then the vehicle selects route 2；If S1<S2, keep route 1 constant.
Further, the second shortest path is other each paths in addition to shortest path.
Wherein:
μ i is the vehicle number that i-th of charge station comes this Chinese herbaceous peony,It is i-th
Charge station's queuing time；
σ i is the vehicle number that i-th of charge station comes this Chinese herbaceous peony,It is i-th
Charge station's queuing time.
Further, it is assumed that L is the linear distance between two cities, V0It is the running section of the section actual vehicle, S is
Practical road network distance before two cities；
According to formula:
S/V0=L/VIt repairs
Find out revised speed VIt repairs, by revised speed VIt repairsThe running time in the section found out is exactly revised
Running time.
Further, the vehicle number of this Chinese herbaceous peony is come in the queue on route 1 before the 1st, 2,3 ... n charge stations
n(1,2,3 ... ..., n)；The vehicle number m of this Chinese herbaceous peony is come in queue on route 2 before the 1st, 2,3 ... n charge stations(1,2,3 ... ..., m)
It is to be provided by real time data.
Further, the real time data transfers the travel speed of main road section on different paths, current by cloud computing platform
Wait in line vehicle fleet size by way of each toll station, count in a period of time by the vehicle fleet size of toll station, and thus
The time spent in obtained each car is averaged in the payment of each charge station.
Further, the data that cloud platform is transferred be by path driving vehicle upload and charge station's monitoring data upload and
?.
Further, if encountering traffic congestion, current shortest path and second shortest path are all unsatisfactory for time shortest condition,
New shortest path and second shortest path are calculated in real time according to static programming algorithm while in travel, and again by the algorithm
Select travel route.
The utility model has the advantages that the present invention finds out logistics route using existing static programming algorithm, in a certain range, consider real
When time-consuming to determining final path, this method makes in more logistics approach, using real-time Data Transmission, by Path selection
It is guiding with the used time, so that more times can be saved in transit.
Detailed description of the invention
Fig. 1 Logistics System Design block diagram；
Fig. 2 logistics algorithm flow chart；
Fig. 3 vehicle crosses charge station's schematic diagram；
Terminal schematic diagram is crossed in Fig. 4 express delivery；
Fig. 5 software starts surface chart；
Fig. 6 user's registration surface chart；
Fig. 7 enterprises registration surface chart；
Fig. 8 driver's register interface figure；
Fig. 9 user's login interface figure；
Single surface chart under Figure 10 user；
Figure 11 company delegates duties surface chart to our company office worker.
Specific embodiment
It is early just to have there are some intelligentized applications to appear among each running link of logistic industry several years ago,
In using Jingdone district and Taobao the two electric business giant as representative, not only can be applied in the operation of such as storehouse management etc
The intelligent facility of such as mechanical arm even robot etc, and even the estimated delivery time of cargo and position can provide
More accurate calculated result.And in terms of these above-mentioned intelligent Applications can be roughly divided into following two:
(1) wisdom logistics system: the building of wisdom logistic information systems must based on idea of Modern system,
Plan, manage and control and cargo handling operation etc. makes full use of information, quick feedback information, provides foundation for decision, it is excellent
Compound stream operation flow and raising logistic efficiency, to people, fund, service and time be combined, by information integration, to object
It flows enterprise and user carries out information feedback.
(2) Logistics Information Platform: the visual intelligent of so-called wisdom logistical applications system, its principal security product manages net
Network system, intelligent trace to the source network system and logistics networking public information platform etc..Nowadays start such as radio frequency identification
(RFID), the internet of things equipment of infrared inductor and sensor combines, and is achieved in intelligent positioning, intelligent knowledge
Not, intelligence tracking, monitoring and management, ultimately form the intelligent logistics platform an of low-energy-consumption high-efficiency.
For the application of wisdom logistics and Logistics Information Platform, the present invention proposes a kind of logistics algorithm, that is, is based on big data
The time of analysis most short transportation route selection method, mainly comprises the steps that
It determines transport origin and terminates place and find out corresponding latitude and longitude coordinates, measured by map all
Can transit route；
By static programming algorithm in all transit routes, shortest path and the corresponding road of second shortest path are calculated respectively
Journey and corresponding transit route；
Investigate total revision time respectively by shortest path and second shortest path length, the time includes that two places are spent when driving
Between and charge station's residence time；
Shortest path between first and second two places is route 1, calculates what vehicle to second was spent from first ground by route 1
Running time TA；
Secondary short-circuit line between first and second two places is route 2, calculates what vehicle to second was spent from first ground by route 2
Running time TB；
The vehicle number of this Chinese herbaceous peony is come in queue before calculating the 1st, 2,3 ... n charge stations on route 1
n(1,2,3 ... ..., n)；
The vehicle number of this Chinese herbaceous peony is come in queue before calculating the 1st, 2,3 ... n charge stations on route 2
m(1,2,3 ... ..., m)；
Calculate each car it is average in the payment of each charge station the time spent in t；
Calculate the total time that vehicle is spent on route 1 by the 1st, 2,3 ... n charge stations
Calculate the total time that vehicle is spent on route 2 by the 1st, 2,3 ... n charge stations
Calculate the total time S that vehicle is spent with route 1, route 2 from city A to city B respectively1And S2；
It is in 1 charge station of route the spent time；
It is in 2 charge station of Jian Xian the spent time；
Compare S1And S2Size, if S1>S2, then the vehicle selects route 2；If S1<S2, keep route 1 constant.
The second shortest path is other each paths in addition to shortest path
Wherein:μ i is the vehicle number that i-th of charge station comes this Chinese herbaceous peony,It is
I charge station's queuing time；
σ i is the vehicle number that i-th of charge station comes this Chinese herbaceous peony,It is i-th
Charge station's queuing time.
Assuming that L is the linear distance between two cities, V0The running section of the section actual vehicle, S be two cities it
Preceding practical road network distance；
According to formula
S/V0=L/VIt repairs
Find out revised speed VIt repairs, by revised speed VIt repairsThe running time in the section found out is exactly revised
Running time.
The vehicle number n of this Chinese herbaceous peony is come in queue on route 1 before the 1st, 2,3 ... n charge stations(1,2,3 ... ..., n),
The vehicle number m of this Chinese herbaceous peony is come in queue on route 2 before the 1st, 2,3 ... n charge stations(1,2,3 ... ..., m)It is by real-time
Data provide, and the real time data transfers the travel speed of main road section on different paths, currently by way of each by cloud computing platform
Toll station wait in line vehicle fleet size, in a period of time by the vehicle fleet size of toll station, and be thus calculated
The time spent in each car is averaged in the payment of each charge station, the data that cloud platform is transferred are uploaded by driving vehicle on path
It uploads and obtains with charge station's monitoring data.
If situations such as encountering traffic congestion, current path length is most short to be all unsatisfactory for time shortest condition with time short, this
If sample, recalculated if not disposably making most short and second shortest path, while can be in travel it is above it is static this
A process can re-execute algorithm to determine new route, first with above-mentioned according to real-time calculated result in this way
Static programming algorithm cooks up a shortest path warp and second shortest path after the traffic congestion route for excluding to occur in real time again, then leads to
Cross the transit route for determining final choice total time spent needed for comparing the two traffic programs.It is so in traditional planning
The chance for increasing repeatedly planning with selection route in algorithm again, to loss brought by the events such as the congestion of coping with burst.
Second shortest path planning algorithm adds the constraint condition of time window on the basis of traditional traveling salesman problem (TSP problem).
For the invention firstly uses traditional static programming algorithmic rules to go out a shortest path warp and second shortest path, then lead to
Cross the transit route for determining final choice total time spent needed for comparing the two traffic programs.It is so in traditional planning
The chance for increasing repeatedly planning with selection route in algorithm again, to loss brought by the events such as the congestion of coping with burst.
This section of words are to say, if situations such as encountering traffic congestion, path length is most short to be all unsatisfactory for time shortest condition with time short, such
Words recalculate above this mistake of static state if not disposably making most short and second shortest path, while can be in travel
Journey can re-execute algorithm according to real-time calculated result in this way to determine new route.
Such as Fig. 1, logistics system is divided into three primarily directed to designed by grand scale logistic transport by logistics system on demand
Macroplate: first part is with the fresh needs for being representative with changing transportation environment；Second part is using file contract as representative
Need to shorten haulage time as far as possible；Part III be with raw material be shipped to representative need as far as possible shorten transportation range
's.Different demand classifications is handled by the system, corresponding constraint is set further according to respective emphasis difference.
So on the one hand the management of system can be layered more apparentization, so as to improve the effect of system operation to a certain extent
Rate；On the other hand suiting the remedy to the case after the root for the problem of finding accurately, it is each on the time or even on space also rationally effectively to distribute
Class resource achievees the effect that mutually coordinated mutually promote.
It can be solved respectively with algorithm shown in FIG. 1 respectively for these three types of demands.Wherein, the correlation that algorithm is included
The setting of parameter is derived from the basic technology support that big data algorithm and cloud computing platform provide: to obtain on cloud computing platform
A large amount of dynamic data information be foundation, therefrom extract road transport situation, the cargo movement amount of each express delivery website and
Storage volume carries out collection and characteristic statistics, for determining all kinds of parameters in Route Planning Algorithm programming.Such system will
Enough pass through expands data search range to cover bigger service range to a certain extent.
Different transports for different cargos require the method for taking classification processing, i.e., require not for each transport
Together, different algorithms has been separately designed to solve.Wherein, in terms of the main design function of the system is divided into following three:
(1) first kind is the demand that has altered to transportation environment.The transport of this kind of cargos will not only be considered to transport
Route also rationally effectively to cook up the arrangement of means of transport, to ensure the intact of cargo quality.It first can be by quiet
The path planning system of state does an original arrangement path, then (for example temperature, wet of the demand according to article to ambient enviroment
Degree etc.), on the way regional relevant environmental parameter is transferred by cloud computing platform, is divided into original path according to these parameters multiple
Then sub- section selects corresponding means of transport by the environmental parameter in every sub- section.
(2) second classes are had higher requirements to haulage time.The Transport route planning needs of this kind of cargos are received
This constraint condition of angle of incidence window, the system is by second shortest path planning algorithm to solve this problem.In view of in cargo
The time it takes is broadly divided into running time in road during transportation, pass by each logistics website the processing time and
This three parts of the waiting time of logistics website.The algorithm is cooked up a shortest path using static programming algorithm respectively and is passed through and time short
The travel speed of main road section on this two paths is transferred, at the express mail of each logistics website by cloud computing platform in path
It manages time and website and overstocks problem etc. with the presence or absence of queuing problem and cargo.By two paths of comparison it is estimated spend when
Between, take the traffic program that the time is shorter.
(3) third class is to require transportation route most short.Mainly for the transport of raw material and other items, this is for this kind transport
Such issues that system is directed to solves using the method that anti-NN Query algorithm is combined with static path planning algorithm.It is sharp first
With the relatively reasonable raw material place of production of anti-NN Query algorithm search to various aspects condition, path planning algorithm is then applied
Shortest path warp is found, to form final traffic program.
As shown in Figure 2, according to the most short demand of transportation environment change request, haulage time and the most short demand of transportation route this
Three aspect logistics demand, the present invention designed by logistics system be respectively provided with targetedly algorithm to solve.And
These three types of demands also have corresponding typical case in practical application:
(1) transport of fresh class article: the corresponding transportation demand of the transport point of this kind of article is transportation environment change request.
As one can imagine the control that the transport of fresh class article has comparison stringent environment temperature, otherwise the quality of article is just difficult to ensure.
A shortest path warp first can be gone out by static programming algorithmic rule in this way, then pass through the temperature for transferring each urban area on the way
The route is divided into several sub- sections by degree, and the vehicles of section transport are determined further according to the environment temperature in each section,
Determine which section needs the vehicle with refrigeration effect, which section needs vehicle and which section of heat insulation effect
It can be directly with common vehicle transport.It is bigger that equipment can be concentrated on demand with complete vehicle resources by these
Section, so that high efficiency completes more logistics orders in high quality under the certain environment of resource.
(2) file close ware transport: the traffic program for this kind of article be exactly with the time it is most short for standard.By
Also will affect whole haulage time in the distance of transport, thus such issues that planning on both can guarantee it is temporal most
It is short, also to realize that path spatially is most short to a certain extent.In order to reconcile the two limiting factors, calculated herein using planning
Method cook up simultaneously two traffic programs respectively correspond a shortest path pass through and a second shortest path.Then in the two schemes
On the basis of spend time taking comparison by overall and determine a final traffic program.So final scheme can be
Meet this kind of cargo in maximization degree to the high request of haulage time.
(3) transport of raw material class: the most quantity of the transport of this kind of article is bigger, and transportation cost and time cost are all
It is key factor in need of consideration.A more advantageous raw material transport ground can be determined according to anti-NN Query algorithm, connect
Again passage path planning algorithm obtain final traffic program.
The operation workflow of logistics system are as follows: by determining place of delivery and the place of receipt of cargo to be transported, by this two
A place indicates to orient in map to cook up between two places substantially followed by Route Planning Algorithm with longitude and latitude
Route.According to the article in different temperatures (environmental condition) corresponding to different preserving type or means of transportation, take therewith
Corresponding means of transport.It can so ensure by the quality of transport article, it also can be maximized by well-equipped means of transport
It uses.
For fresh, since the fresh temperature to transportation environment has higher requirement, only meet this transport requirement
It just can guarantee the quality after cargo is sent to.It is especially southern and northern possible in long-distance transport since China's national territorial area is larger
It will appear the biggish temperature difference, therefore above-mentioned route can be divided into several sub- sections according to the temperature of transport on the way.Every road Ge Zi
Section has corresponding means of transportation, flexibly can not only neatly change means of transport depending on changes in ambient temperature, also
The certain scarce resource of quantity can be concentrated on into most critical section to a certain extent, thus the basis certain in infrastructure
On, the efficiency of whole logistics transportation is improved as far as possible.
In addition, the system also on the basis of traditional shortest path is through problem solving, is added to the constraint condition of time window.
Logistics is no longer limited to programme single in traditional mode, but same logistics order is furthermore achieved and realizes a plurality of road
The planning of diameter and time-optimized, so as to be bonded the actual demand of user in maximization degree.In the most short problem of solution path
On the basis of by comparison walk shortest path it is optimal further to select with second shortest path the time it takes through the time it takes
Path.Same express mail will do it the planning of mulitpath during transportation and therefrom select and guaranteeing in other words
An efficiency highest traffic program is selected while path is shorter.The substantially process of the algorithm is as shown in Figure 2:
Transport origin is determined first and is terminated place and is found out corresponding latitude and longitude coordinates.Utilize static programming
Algorithm calculates shortest path through distance corresponding with second shortest path and transit route respectively.For the ease of in the selection of scheme
This limiting factor of middle introducing time window assumes the traveling for being approximately equal to vehicle transport consumed by freight shipments total time herein
Time, cargo by all logistics websites on the way processing total time and the total time of waiting in line (this may be zero) it
With.For the algorithm further elucidated above, relevant variable has been done such as give a definition (as shown in table 1) herein:
The model is the inspiration by traffic flow and designs (as shown in Figure 3, Figure 4).Vehicle is waited in line when crossing charge station
And paying requires to take some time.For example a vehicle will leave for city B from from city A, and path 1 is shortest path
Diameter is needed on this route by n charge station.Assuming that the working efficiency of each charge station employee is consistent and waiting time is
Summation in the queue the time required to all vehicle payments of this Chinese herbaceous peony, then required for first charge station's vehicle etc.
To time are as follows:
Therefore, which passes through the total time of cost required for this n charge station between the first and second two places:
In summary: the vehicle from first is spent by running time in charge station to the total time of cost required for second ground
The summation of time, it may be assumed that
Similarly, from first there is m charge station into the secondary short-circuit line 2 on second ground, then the total time spent on route 2
Are as follows:
Compare S1And S2Size, if S1>S2, then the vehicle selects route 2；If S1<S2, keep route 1 constant.
In order to which this logistics system can incorporate people's lives as far as possible, the present invention is set with grand scale logistic system
Meter scheme and logistics legal model based on artificial intelligence are that core design goes out a application software for logistics company.When
After logistics company is connected to express delivery commission, it is only necessary to input express mail set out address and shipping address can obtain a rough fortune
Defeated route can then select the logistics driver transported on the section according to software prompt；And it is responsible in the route on the way from certain
One logistics home site (fixing tentatively as by way of the provincial capital in province) by the transport driver of cargo transport to next logistics home site then
It can be seen that more careful programme path, the positioning of the driver at the same time again can synchronous transfer to logistics company, such one
Not only can guarantee the space of two-way choice, but also the monitoring function that can be reached a certain level.
Software can be divided into two parts, and a part is in terms of logistics company, and a part is for logistics transportation department
Machine.Best route and corresponding sub- section are wherein selected by software after logistics company is connected to logistics commission.One
Aspect logistics company the transport task in each sub- section can be distributed directly under house flag or cooperative logistics house flag under
Logistics driver, on the one hand also can use software and place an order to other logistics driver.In this way, each logistics on the one hand can be promoted
Resource-sharing and cooperative relationship between company, to avoid the harmful competition in industry to a certain extent, on the other hand not
Private car driver in working out again can also earn extra income by way of order.
After user successfully downloads and is mounted with the logistics software, into software it can be seen that software as shown in Figure 5
Interface only needs to click that registration/login interface can be entered in next step in this interface.Next register interface can divide
For three aspects: user's registration, enterprises registration and driver register.The interface of individual consumer's registration is as shown in fig. 6, need to fill in
Some basic personal information are to guarantee system of real name.Furthermore enterprise can also pass through the software registration account, enrollment page such as Fig. 7
It is shown.In order to ensure its effect, all information of register interface must be filled in all and also suffer from narrow examination and prison
It superintends and directs.The registration of last driver can be divided into two parts again, and a part is to be directed to the driver to work in logistics company, this
Part driver has attached logistics company, if the registered account in software of the logistics company where the driver,
So last column of the driver in registration information needs to fill out "Yes" and also to supplement the every terms of information of subsidiary, with
The registration information of the driver will be issued affiliated company's verification verifying by software by software afterwards, only by that could succeed after verifying
Registration；On the other hand be for free car owner, car owners can go to work, in the even way of shopping of going on business into logistics website
Shi Shunlu takes a certain amount of express mail (logistics package) with you, and specifically quantity is also needed through the specification of host vehicle and car owner
The wish of people is comprehensive to determine (as shown in Figure 8).
If user has had registered account so can enter directly into following Fig. 9 institute after entering software
The login interface shown.User, which can start to place an order after account logs in etc., to be operated.Introduce first be forever without operation
Interface.User needs the place and destination for selecting to set out, and place requires as far as possible in detail to facilitate courier or department
The pickup of machine and send part.The classification of object is taken to transport additionally, due to the logistics system, so user is also required to fill in object
Type, rough weight range and volume range go pickup before facilitating the suitable type of vehicle of logistics company arrangement and send part.Such as
Shown in lower Figure 10, if " help " in interface can be clicked by always encountering problem in the process for filling in the above problem.Furthermore user
To read over safe logistics agreement before placing an order, and guarantee that article to be posted meets the terms and conditions in agreement, otherwise after
Fruit is paid for oneself.
Logistics company can be in company using software as one of office software, Ke Yizhi after the software registration account
It connected the software and appoints work to the logistics driver progress logistics order under house flag.If in certain sections or area
There is no the driver office worker of our company, it not only can be by the software under the driver under the logistics company of other register account numbers
It is single, also logistics also can be carried out to some free car owners place an order.It can not only so realize the human resources maximum in the sector
It uses with changing, moreover it is possible to call by scattered free car owner, participate among the transport of logistics, and then improve entire logistics
The working efficiency and benefit of system.(whole interface is illustrated in fig. 11 shown below)
The present invention optimizes system algorithm: due to being all to be calculated when path planning with the longitude and latitude in each city in model
The distance between two cities, inevitably there are some errors in practical applications.It is certain using distance, time and speed
The principle being inversely proportional.The error of two intercity longitude and latitude linear distances and actual range is made up by erection rate.Assuming that L
The linear distance between two cities, S be two cities before practical road network distance (i.e. by traffic route traveling actually away from
From)；V0It is the running section of the section actual vehicle, then according to formula S/V0=L/VIt repairs, revised speed V can be found outIt repairs,
The running time in the section found out at this time is exactly revised running time.
One aspect of the present invention is to have broken the means of transportation of " Yi Tiaolu is walked on earth ".It is being planned in traditional logistics transportation
Just no longer change after transportation route, means of transport, but after being gradually increased with requirement of the people to quality of the life, this fortune
Defeated mode is difficult meet the needs of people again.Multiple Sections included in grand scale logistic planning system designed by the present invention are dynamic
State planning algorithm is by being divided into multiple sub- sections of a logistics according to the difference of environmental factor for the original route planned, often
A sub- section selects most appropriate means of transportation or means of transport according to the environmental parameter on the section, then if multiple such
The set of static section program results is formed one section of dynamic and flexible active path planning scheme.It on the other hand is secondary short
Path planning algorithm adds the constraint condition of time window on the basis of traditional traveling salesman problem (TSP problem).First with biography
The static programming algorithmic rule of system goes out a shortest path warp and second shortest path, then is spent needed for the two traffic programs by comparing
The transit route for determining final choice total time.It is so to increase repeatedly planning and selection again in traditional planning algorithm
The chance of route, to loss brought by the events such as the congestion of coping with burst.
Claims (8)
1. a kind of most short transportation route selection method of time based on big data analysis, it is characterised in that:
It determines transport origin and terminates place and find out corresponding latitude and longitude coordinates；
It is calculated respectively by static programming algorithm apart from shortest path and the corresponding distance of second shortest path and transit route；
Investigate total revision time respectively by shortest path and second shortest path length, the time include the running time that two places are spent and
Charge station's residence time；
Shortest path between first and second two places is route 1, calculates the traveling that vehicle to second is spent from first ground by route 1
Time TA；
Secondary short-circuit line between first and second two places is route 2, calculates the traveling that vehicle to second is spent from first ground by route 2
Time TB；
The vehicle number n of this Chinese herbaceous peony is come in queue before calculating the 1st, 2,3 ... n charge stations on route 1(1,2,3 ... ..., n)；
The vehicle number m of this Chinese herbaceous peony is come in queue before calculating the 1st, 2,3 ... n charge stations on route 2(1,2,3 ... ..., m)；
Calculate each car it is average in the payment of each charge station the time spent in t；
Calculate the total time that vehicle is spent on route 1 by the 1st, 2,3 ... n charge stations
Calculate the total time that vehicle is spent on route 2 by the 1st, 2,3 ... n charge stations
Calculate the total time S that vehicle is spent with route 1, route 2 from city A to city B respectively1And S2；
It is in 1 charge station of route the spent time；
It is in 2 charge station of Jian Xian the spent time；
Compare S1And S2Size, if S1> S2, then the vehicle selects route 2；If S1<S2, keep route 1 constant.
2. the most short transportation route selection method of the time based on big data analysis as described in claim 1, it is characterised in that: institute
The second shortest path stated is other each paths in addition to shortest path.
3. the most short transportation route selection method of the time based on big data analysis as described in claim 1, it is characterised in that:
Wherein:
I=1,2,3 ... n, μ i are the vehicle number that i-th of charge station comes this Chinese herbaceous peony,For i-th of charge station
Queuing time；
I=1,2,3 ... n, σ i are the vehicle number that i-th of charge station comes this Chinese herbaceous peony,For i-th of charge station
Queuing time.
4. the most short transportation route selection method of the time based on big data analysis as described in claim 1, it is characterised in that:
Assuming that L is the linear distance between two cities, V0The running section of the section actual vehicle, S be two cities before reality
Border road network distance；
According to formula
S/V0=L/VIt repairs
Find out revised speed VIt repairs, by revised speed VIt repairsThe running time in the section found out is exactly revised traveling
Time.
5. the most short transportation route selection method of the time based on big data analysis as described in claim 1, it is characterised in that: road
The vehicle number n of this Chinese herbaceous peony is come in queue on line 1 before the 1st, 2,3 ... n charge stations(1,2,3 ... ..., n)；The 1st on route 2,
2, the vehicle number m of this Chinese herbaceous peony is come in the queue before 3 ... n charge stations(1,2,3 ... ..., m)It is to be provided by real time data.
6. the most short transportation route selection method of the time based on big data analysis as claimed in claim 5, it is characterised in that: institute
Real time data is stated, the travel speed of main road section on different paths is transferred, currently by way of each toll station by cloud computing platform
Wait in line vehicle fleet size, in a period of time by the vehicle fleet size of toll station, and each car that is thus calculated is average
The time spent in the payment of each charge station.
7. the most short transportation route selection method of the time based on big data analysis as claimed in claim 5, it is characterised in that: cloud
The data that platform is transferred are to be uploaded to upload and obtain with charge station's monitoring data by driving vehicle on path.
8. the most short transportation route selection method of the time based on big data analysis as described in right 1, it is characterised in that: if met
To traffic congestion, current shortest path and second shortest path are all unsatisfactory for time shortest condition, according to static state while in travel
Planning algorithm calculates new shortest path and second shortest path in real time, and again by algorithms selection travel route described in claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810752601.6A CN108960519B (en) | 2018-07-10 | 2018-07-10 | Method for selecting shortest time transportation route based on big data analysis |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810752601.6A CN108960519B (en) | 2018-07-10 | 2018-07-10 | Method for selecting shortest time transportation route based on big data analysis |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108960519A true CN108960519A (en) | 2018-12-07 |
| CN108960519B CN108960519B (en) | 2022-08-05 |
Family
ID=64482823
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810752601.6A Active CN108960519B (en) | 2018-07-10 | 2018-07-10 | Method for selecting shortest time transportation route based on big data analysis |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108960519B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109697881A (en) * | 2019-01-15 | 2019-04-30 | 南通大学 | A kind of detour guidance method based on Real-time Road congestion information |
| CN109829565A (en) * | 2018-12-25 | 2019-05-31 | 益萃网络科技（中国）有限公司 | Optimum choice method, apparatus, computer equipment and the storage medium of logistics route |
| CN110610278A (en) * | 2019-09-25 | 2019-12-24 | 亳州职业技术学院 | Intelligent optimization method for transportation route |
| CN111898824A (en) * | 2020-07-31 | 2020-11-06 | 沙师弟(重庆)网络科技有限公司 | Same-city logistics multipoint distribution path planning method |
| CN112950126A (en) * | 2021-04-07 | 2021-06-11 | 付强 | Logistics supply chain path optimization method applied to smart storage |
| CN113222282A (en) * | 2021-05-31 | 2021-08-06 | 北京京东乾石科技有限公司 | Method and device for determining conveying path, readable storage medium and electronic equipment |
| CN113885492A (en) * | 2021-09-17 | 2022-01-04 | 广东嘉腾机器人自动化有限公司 | AGV driving control method and system |
| CN114463963A (en) * | 2022-01-21 | 2022-05-10 | 北京金山云网络技术有限公司 | Automatic driving equipment scheduling method and device, storage medium and electronic equipment |
| CN117993589A (en) * | 2024-04-03 | 2024-05-07 | 广州华生网络科技股份有限公司 | Intelligent cold chain logistics scheduling method and system based on Internet of things |
| CN117993589B (en) * | 2024-04-03 | 2024-07-02 | 广州华生网络科技股份有限公司 | Intelligent cold chain logistics scheduling method and system based on Internet of things |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101494590A (en) * | 2008-01-23 | 2009-07-29 | 中兴通讯股份有限公司 | Optimum path selection method of communication network based on load balance |
| CN102679990A (en) * | 2011-03-16 | 2012-09-19 | 高德软件有限公司 | Navigation method and device |
| US9285218B2 (en) * | 2012-08-24 | 2016-03-15 | Regents Of The University Of Minnesota | Shortest travel path determination using critical start time points |
-
2018
- 2018-07-10 CN CN201810752601.6A patent/CN108960519B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101494590A (en) * | 2008-01-23 | 2009-07-29 | 中兴通讯股份有限公司 | Optimum path selection method of communication network based on load balance |
| CN102679990A (en) * | 2011-03-16 | 2012-09-19 | 高德软件有限公司 | Navigation method and device |
| US9285218B2 (en) * | 2012-08-24 | 2016-03-15 | Regents Of The University Of Minnesota | Shortest travel path determination using critical start time points |
Non-Patent Citations (2)
| Title |
|---|
| 孙涛等: "时间依赖网络中有效交通路由的仿真平台", 《计算机光盘软件与应用》 * |
| 谷宝慧: "基于时间窗的自动引导车系统路径优化研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109829565A (en) * | 2018-12-25 | 2019-05-31 | 益萃网络科技（中国）有限公司 | Optimum choice method, apparatus, computer equipment and the storage medium of logistics route |
| CN109697881A (en) * | 2019-01-15 | 2019-04-30 | 南通大学 | A kind of detour guidance method based on Real-time Road congestion information |
| CN109697881B (en) * | 2019-01-15 | 2021-04-27 | 南通大学 | Bypassing guidance method based on real-time road congestion information |
| CN110610278A (en) * | 2019-09-25 | 2019-12-24 | 亳州职业技术学院 | Intelligent optimization method for transportation route |
| CN111898824A (en) * | 2020-07-31 | 2020-11-06 | 沙师弟(重庆)网络科技有限公司 | Same-city logistics multipoint distribution path planning method |
| CN112950126A (en) * | 2021-04-07 | 2021-06-11 | 付强 | Logistics supply chain path optimization method applied to smart storage |
| CN113222282A (en) * | 2021-05-31 | 2021-08-06 | 北京京东乾石科技有限公司 | Method and device for determining conveying path, readable storage medium and electronic equipment |
| CN113885492A (en) * | 2021-09-17 | 2022-01-04 | 广东嘉腾机器人自动化有限公司 | AGV driving control method and system |
| CN113885492B (en) * | 2021-09-17 | 2023-12-05 | 广东嘉腾机器人自动化有限公司 | AGV driving control method and system |
| CN114463963A (en) * | 2022-01-21 | 2022-05-10 | 北京金山云网络技术有限公司 | Automatic driving equipment scheduling method and device, storage medium and electronic equipment |
| CN114463963B (en) * | 2022-01-21 | 2023-10-03 | 北京金山云网络技术有限公司 | Automatic driving equipment scheduling method and device, storage medium and electronic equipment |
| CN117993589A (en) * | 2024-04-03 | 2024-05-07 | 广州华生网络科技股份有限公司 | Intelligent cold chain logistics scheduling method and system based on Internet of things |
| CN117993589B (en) * | 2024-04-03 | 2024-07-02 | 广州华生网络科技股份有限公司 | Intelligent cold chain logistics scheduling method and system based on Internet of things |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108960519B (en) | 2022-08-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108960519A (en) | Time based on big data analysis most short transportation route selection method | |
| Chung | Applications of smart technologies in logistics and transport: A review | |
| KR101992828B1 (en) | System and method for dispatching cargo | |
| Magnanti et al. | Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria | |
| US20190130354A1 (en) | Depot dispatch protocol for aggregating on-demand deliveries | |
| US20240021083A1 (en) | Resource transportation systems and methods | |
| KR101992414B1 (en) | System and method for automatically calculating freight cost estimate | |
| US20130159208A1 (en) | Shipper-oriented logistics base optimization system | |
| AU2019380319A1 (en) | Depot dispatch protocol for autonomous last-mile deliveries | |
| CN108428084A (en) | A kind of Multimodal Transport System and method based on service chaining | |
| CN109596132A (en) | Vehicle dispatching method and device | |
| CN108364148A (en) | A kind of logistics service system, path analysis method and Logistics Distribution Method | |
| Wu et al. | Supply chain of things: A connected solution to enhance supply chain productivity | |
| CN108985510A (en) | Extensive Intelligent logistics path decision-making system based on artificial intelligence | |
| KR102524387B1 (en) | Method for logistics delivery management linking virtual logistics hubs and physical logistics hubs | |
| CN105976145A (en) | Internet-of-things constructed based on transportation | |
| Leung et al. | Community logistics: a dynamic strategy for facilitating immediate parcel delivery to smart lockers | |
| Correia et al. | Smart supply chain management: The 5W1H open and collaborative framework | |
| Çimen et al. | A review on sustainability, Industry 4.0 and collaboration implications in vehicle allocation operations | |
| Ucal Sari et al. | Analysis of intelligent software implementations in air cargo using fermatean fuzzy CODAS method | |
| KR20210018407A (en) | Delivery system, system for delivery management, apparatus and method for the same | |
| US20230230023A1 (en) | Collaborative Logistics Platform and Methods Thereof | |
| Cheng et al. | Design of a support system for complicated logistics location integrating big data | |
| CN110321399A (en) | The method and apparatus for selecting address | |
| Hou et al. | Matching models for crowd-shipping considering shipper’s acceptance uncertainty |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |