CN109064098A - A kind of vehicle dynamic dispatching method and system - Google Patents
A kind of vehicle dynamic dispatching method and system Download PDFInfo
- Publication number
- CN109064098A CN109064098A CN201810900508.5A CN201810900508A CN109064098A CN 109064098 A CN109064098 A CN 109064098A CN 201810900508 A CN201810900508 A CN 201810900508A CN 109064098 A CN109064098 A CN 109064098A
- Authority
- CN
- China
- Prior art keywords
- logistic car
- vehicle
- logistics
- priority
- service
- 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
- 238000000034 method Methods 0.000 title claims abstract description 40
- 238000010897 surface acoustic wave method Methods 0.000 claims description 6
- 238000005259 measurement Methods 0.000 claims 1
- 238000003860 storage Methods 0.000 description 11
- 238000005516 engineering process Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000000903 blocking effect Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 230000001934 delay Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000003339 best practice Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 238000005315 distribution function Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of vehicle dynamic dispatching method and systems, with good real-time and accuracy, implement simple and reliable, suitable for the vehicle scheduling in real-time logistics company garden, it solves the problems, such as to be accurately positioned simultaneously Real-Time Scheduling to logistics vehicles when logistics vehicles are excessively intensive in logistics company garden very well, the jam situation of logistics vehicles in Logistics Park is effectively improved, vehicle scheduling efficiency in garden is improved.Its technical solution are as follows: obtain the relevant information for reaching each logistic car in Logistics Park by RFID reader first, then the relevant information for determining the vehicle near a logistic car waits M/M/n queuing model processed to carry out dynamic dispatching to logistics vehicles further according to the accurate location of acquired logistics vehicles using priority mostly service window.
Description
Technical field
The present invention relates to vehicle locations and dynamic dispatching technology, and in particular to is used in Logistics Park based on queueing theory
The dynamic dispatching technology of vehicle.
Background technique
With the rapid development of the industries such as electric business, logistics company delivery, the business of unloading are more, so that on-site has largely
Logistics vehicles disengaging, but these vehicles have no the guidance of effective information in on-site, arbitrarily stop, frequently can lead to on-site
Vehicle congestion, rate of discharging be low, shipment not in time a series of problems, such as.And these problems also make enterprise's work efficiency low,
Seriously constrain the development of logistics company.Traditional vehicle scheduling is difficult to meet real-time, efficient, cheap under current electric business environment
It is required that.Currently, some logistics companies consider the demand of cargo transport, GPS vehicles dispatching system system has all been introduced, however
There are overpass, tunnel in the intensive section of skyscraper etc. when blocking GPS signal is weak serious, and is located in more mountains some
Signal strength is very weak in city, these can all cause GPS system jitter even to can not work normally.Simultaneously as GPS
Scheduling system signal is disturbed logistics vehicles and can often report by mistake when calling out the stops, make it possible to it is real-time, stable, accurately carry out Logistic Park
Vehicle scheduling in area becomes a difficult project.
It follows that being primarily present what following two big needs solved for the vehicle scheduling in logistics company garden at this stage
Problem:
(1) how logistics vehicles are accurately positioned in garden: sufficiently accurate positioning only is carried out to the vehicle for reaching garden,
Understand the specific location of each logistic car, preferably logistics vehicles could be scheduled.
(2) in garden logistics vehicles how real-time dynamic scheduling: when the position for specifying each logistic car, further according to specific
Situation carries out optimal scheduling to each vehicle, improves the efficiency of loading and unloading of logistic car.
RFID is radio RF recognition technology, it in the intensive section of skyscraper or has overhead not against satellite-signal
Bridge, tunnel etc. block or when mountainous region also can dispatch in real time vehicle, and construction cost is lower, penetrates when vehicle-mounted
After frequency card enters dual-mode antenna region, vehicle-mounted radio-frequency card will issue a signal automatically and be received by antenna, then by these
Relevant information carries out processing integration and is transmitted to control centre, and the control centre Zai You carries out efficient scheduling to numerous logistics vehicles.
Queueing theory is the mathematical theory and method that research system gathers scattered phenomenon and the stochastic service system course of work at random, into
Situations such as entering the logistics vehicles substantial amounts in Logistics Park, will appear crowded blocking certainly.And queue discipline be divided into waiting system,
Three kinds of loss system and mixing system.In fierce market competition, how efficiently transporting cargo, to be that express company is most concerned asked
Topic.
Summary of the invention
A brief summary of one or more aspects is given below to provide to the basic comprehension in terms of these.This general introduction is not
The extensive overview of all aspects contemplated, and be both not intended to identify critical or decisive element in all aspects also non-
Attempt to define the range in terms of any or all.Its unique purpose is to provide the one of one or more aspects in simplified form
A little concepts are with the sequence for more detailed description given later.
The purpose of the present invention is to solve the above problem, provides a kind of vehicle dynamic dispatching method and system, has very
Good real-time and accuracy, implementation is simple and reliable, suitable for the vehicle scheduling in real-time logistics company garden, solves very well
The problem of being accurately positioned simultaneously Real-Time Scheduling to logistics vehicles when logistics vehicles are excessively intensive in logistics company garden, effectively improves
The jam situation of logistics vehicles in Logistics Park, improves vehicle scheduling efficiency in garden.
The technical solution of the present invention is as follows: present invention discloses a kind of vehicle dynamic dispatching methods, comprising:
Step 1: obtaining the relevant information including vehicle location, destination for reaching the logistic car in Logistics Park；
Step 2: determining the correlation including vehicle location, destination of other logistic cars near a certain logistic car
Information；
Step 3: thering is priority to service window according to the foundation of the vehicle location of acquired logistic car more and M/M/n processed is waited to be lined up
Model；
Step 4: wait M/M/n queuing model processed to obtain optimal scheduling scheme based on there is priority to service window more, and according to
Optimal scheduling scheme carries out dynamic dispatching to each logistic car.
One embodiment of vehicle according to the invention dynamic dispatching method is in step 1 obtained by RFID reader
The relevant information of logistic car.
One embodiment of vehicle according to the invention dynamic dispatching method determines object using distance estimations method in step 1
Flow the position of vehicle: using surface acoustic wave identification tag, method based on time of arrival (toa) measure each reader and label it
Between distance, then label is positioned based on three distance values trilateration.
One embodiment of vehicle according to the invention dynamic dispatching method, in step 3, the windows that service refer in system more
Multiple information desks for Logistics Service vehicle；The queuing model of M/M/n refers to that the interval time reached based on logistic car is negative
Exponential distribution, the service time for loading and unloading website is quantum condition entropy, and has multiple handling website information desks these three satisfactions row
The queuing model that the element of team theory is established；Wait system refer to based on front have logistics vehicles when carrying out handling task after arrive
Logistics vehicles need the queuing model that the case where waiting in line is established；Priority is to be sent to certain according to the feedback of handling website
The logistic car of a regional division is i.e. by completed loading, system that preferentially the logistic car priority scheduling of corresponding branch of this area is come out
Degree.
One embodiment of vehicle according to the invention dynamic dispatching method, in step 4, optimal scheduling scheme refers to calculating
Obtain the number to make the most short required handling website being arranged of logistics vehicles queuing time.
Present invention further teaches a kind of vehicle dynamic scheduling system, system includes:
Logistic car data obtaining module obtains and reaches existing including vehicle location, destination for the logistic car in Logistics Park
Interior relevant information；
Data obtaining module near logistic car, determine other logistic cars near a certain logistic car includes vehicle position
It sets, the relevant information including destination；
Model building module has priority to service window more and waits M/ processed according to the foundation of the vehicle location of acquired logistic car
M/n queuing model；
Dynamic dispatching module waits M/M/n queuing model processed to obtain optimal scheduling scheme more based on there is priority to service window,
And dynamic dispatching is carried out to each logistic car according to optimal scheduling scheme.
One embodiment of vehicle according to the invention dynamic scheduling system is to pass through RFID in logistic car data obtaining module
The relevant information of reader acquisition logistic car.
One embodiment of vehicle according to the invention dynamic scheduling system is estimated using distance in logistic car data obtaining module
Meter method determines the position of logistic car: using surface acoustic wave identification tag, the method based on time of arrival (toa) measures each read-write
The distance between device and label, then label is positioned based on three distance values trilateration.
One embodiment of vehicle according to the invention dynamic scheduling system, in model building module, the windows that service refer to more
Multiple information desks for Logistics Service vehicle in system；The queuing model of M/M/n refers to the interval reached based on logistic car
Time is quantum condition entropy, load and unload website service time be quantum condition entropy, and have multiple handling website information desks this three
The queuing model that a element for meeting queueing theory is established；System is waited to refer to there are logistics vehicles carrying out handling task based on front
When after to the logistics vehicles queuing model that needs the case where waiting in line to be established；Priority is according to the anti-of handling website
Feedback is sent to the logistic car of some regional division i.e. by completed loading, preferentially the logistic car priority scheduling of corresponding branch of this area
System out.
One embodiment of vehicle according to the invention dynamic scheduling system, in dynamic dispatching module, optimal scheduling scheme
Refer to the number being calculated to make the most short required handling website being arranged of logistics vehicles queuing time.
The present invention, which compares the prior art, to be had following the utility model has the advantages that method of the invention is got by RFID reader first
Then the relevant information of each logistic car in up to Logistics Park determines the relevant information of the vehicle near a logistic car, then root
Serviced according to the accurate location of acquired logistics vehicles using priority more window wait M/M/n queuing model processed to logistics vehicles into
Mobile state scheduling.Compared to traditional technology, the present invention applies to RFID technique in vehicle scheduling, can be realized intelligent, high
The vehicles dispatching system of effectization works.The present invention services window using priority more and waits M/M/n queuing model processed, to Logistics Park
Interior logistics vehicles carry out rational management, the vehicle scheduling efficiency of garden are improved, to improve the market competition energy of logistics company
Power.
Detailed description of the invention
After the detailed description for reading embodiment of the disclosure in conjunction with the following drawings, it better understood when of the invention
Features described above and advantage.In the accompanying drawings, each component is not necessarily drawn to scale, and has similar correlation properties or feature
Component may have same or similar appended drawing reference.
Fig. 1 shows the flow chart of an embodiment of vehicle dynamic dispatching method of the invention.
Fig. 2 shows the schematic illustrations of trilateration.
Fig. 3 shows the structure chart of an embodiment of vehicle dynamic scheduling system of the invention.
Specific embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is described in detail.Note that below in conjunction with attached drawing and specifically real
The aspects for applying example description is merely exemplary, and is understood not to carry out any restrictions to protection scope of the present invention.
Fig. 1 shows the process of an embodiment of vehicle dynamic dispatching method of the invention.Referring to Figure 1, here is pair
The detailed description of the implementation steps of the vehicle dynamic dispatching method of the present embodiment.
Step S1: the relevant information for reaching each logistic car in Logistics Park is obtained by RFID reader.
RFID reader, that is, Radio Frequency Identification Technology, can perceive the RFID tag on any one logistic car, and acquisition includes
Relevant information including logistics vehicles position, destination etc..
In this step, determine that the position of logistics vehicles is (to utilize triangle using distance estimations method using RFID technique
The characteristics of shape, estimates the algorithm of the position of body to be positioned).Refering to what is shown in Fig. 2, being based on signal using surface acoustic wave identification tag
The method of arrival time measures the distance between each reader i and label di, formula can be expressed as:
di=Tt-Ts-Tx-Tc
Wherein, TxIt is the time delays of system, TcIt is cable transmission between receiving antenna and demodulator between pre-calibration pulse period
Delay, TSIt is the time delays of all labels, TtIndicate that signal reaches the time of each reader i.When having 3 estimated distances, it is
System positions label with trilateration.
Step S2: the relevant information of the vehicle near a logistic car is determined.
In this step, the relevant information of other vehicles near a certain logistic car is obtained according to RFID reader
The relevant informations such as each logistics vehicles position, destination in Logistics Park are reached, judge the logistics before and after this logistic car
The destination of vehicle.
Step S3: the position of each logistics vehicles according to acquired in step S1 uses has priority to service window waiting more
M/M/n queuing model processed.
Have priority to service window to wait M/M/n queuing model processed described in this step is more service object's Multiple server stations more
Waiting system the queuing model for having priority.Classify according to three main features of queuing system, with Kendall notation X/
Y/Z classifies: the distribution of successive interarrival time is filled at X；Numbers distribution in system is filled at Y；Clothes arranged side by side are filled at Z
Business number of units mesh.More service windows refer to multiple information desks for Logistics Service vehicle in system；The queuing model of M/M/n refers to
It is quantum condition entropy based on the interval time that logistic car reaches, the service time for loading and unloading website is quantum condition entropy, and is had more
The queuing model that a handling these three elements for meeting queueing theory of website information desk are established；System is waited to refer to there is object based on front
After flowing vehicle when carrying out handling task to the logistics vehicles queuing model that needs the case where waiting in line to be established；Priority
Do not refer to according to the feedback of handling website, is sent to the logistic car of some regional division i.e. by completed loading, it can be preferentially correspondence
The logistic car priority scheduling of branch of this area comes out.
The establishment process of model is as follows.
Service priority the research that window waits M/M/n queuing model processed for convenience, three based on queuing system want more
The sequence of element does certain hypothesis to real system:
(1) there are two priority, service order is primarily based on priority, and foundation " is arrived first and first taken in same priority
Business ".
(2) logistics vehicles are the vehicles for having arrived at garden, and two priority logistics vehicles arrival are random, single
, it is independent, mutual time interval obeys exponential distribution, and Number of Customers is reached in some period and obeys Poisson distribution.
(3) there are multiple information desks in system, each information desk can only once service a logistics vehicles, and assume each clothes
The service ability of business platform is identical.It is serviced if available free information desk when logistics vehicles are reached, if service
Platform all then selects shortest queue to be waited busy.
(4) time that service time and logistics vehicles reach is mutually indepedent, and in system each information desk logistics vehicles
Line up a team.
Logistics vehicles are random arrival Logistics Parks, obey Poisson distribution, n logistics vehicles are reached in time t
Probability are as follows:
Wherein λ indicates that logistics vehicles are reached by the Poisson distribution of parameter lambda (λ > 0).
When logistics vehicles reach, when all handling websites are occupied, then logistics vehicles needs are waited in line, so row
Team's model is to wait system.Carrying out handling to logistics vehicles is the service for having priority.
Multiple handling websites be it is arranged in parallel, service time is stochastic pattern, and stochastic pattern service time v obeys negative exponent
Distribution, distribution function is:
P (v≤t)=1-e-μt(t≥0)
μ is average service rate in formula,For average service time.
After handling above, establish one has priority to service window waiting M/M/n queuing model processed more.
Step S4: dynamic dispatching is carried out to logistics vehicles.
Wait M/M/n queuing model processed to calculate optimal dispatching party based on there is priority to service window in this step more
The number to make the most short required handling website being arranged of logistics vehicles queuing time is calculated, according to optimal scheduling scheme in case
Dynamic dispatching is carried out to each logistics vehicles.
Show that the treatment process of optimal scheduling scheme is for example as follows according to queuing model.
Assuming that level-one logistics vehicles press parameter lambda1(λ1> 0) Poisson distribution reaches, and two-stage logistics vehicle presses parameter lambda2(λ2>
0) and so on, wherein first class vehicle indicates that the normally vehicle in queuing, second level vehicle indicate if certain logistics vehicles row
It is waited in troop, but the handling website of its corresponding regional division is that no vehicle needs service, so that it may this
Vehicle sends its corresponding area branch handling website in advance.
Because service time needed for each logistics vehicles is independent, assumes to obey the quantum condition entropy of identical parameters μ (μ > 0).
Assuming that there is n logistics vehicles to reach, each regional division has m handling website.
It enablesρ is the scale for measuring handling website ability in terms of undertaking handling task and meeting needs.It is then steady
Determine index under state are as follows:
Enable Pn=limt→∞P { N (t)=n }, n=0,1,2 ...,
Then work as Pm< 1,It is unrelated with primary condition.
And have:
Wherein
Assuming that the probability that the logistics vehicles of high priority can preferentially go to corresponding handling point is αk(0 < αk< 1), whereinIt indicates.
Queue average length under stable state is indicated with N, uses NtIndicate average waiting queue length under stable state, then:
Use WkIndicate customer's average latency (including service time) of k priority under stable state, m indicates handling goods
The services sites quantity of object, then model can be expressed as follows:
When
B0=1,
It is assumed thatTo enable k-th of priority to reach stable state.
So the average queue length (customer including receiving service) of k-th of priority at steady state can indicate
Are as follows:
Lk=λkWk, k=1,2 ..., N
Assuming that we compare the quantity that the handling website an of regional division needs to be arranged now, it is assumed that logistics vehicles reach
Rate λ=1, wherein the vehicle arriving rate λ of the first priority1=0.4, the vehicle arriving rate λ of the second priority2==0.6,
Website ratess of loading & discharge μ=6 of each regional division the case where by when comparison s=1 and s=2, judge that each regional division needs
It is best to set up how many handling websites.
Work as s=1, λ1When=0.4, μ=6,
Work as s=2, λ1When=0.4, μ=6,
Work as s=1, λ2When=0.6, μ=6,
Work as s=2, λ2When=0.6, μ=6,
It can be obtained by calculating comparison above, when only one handling point of s=1, that is, each regional division, the first priority
Vehicle needs to wait for 0.238 hour, and the vehicle of the second priority simply waits for 0.325 hour.However when s=2, that is, distinguish eachly
Portion is there are two when handling point, and the vehicle of the first priority needs to wait for 0.029 hour, and the vehicle of the second priority simply waits for
0.066 hour.The waiting time of logistics vehicles can be allowed substantially to shorten it can be seen that increasing a regional division handling website.
In view of building the cost of Logistics Park, we do not need each regional division and set up multiple handling, we
Need to accomplish to reduce the best practice of vehicle waiting time and Building of Logistics Park cost simultaneously.Can according to big data analysis,
Multiple handling websites are set up in many regional divisions of express mail amount, and the less regional division of express mail amount only sets up a depot
Point.
Have example above just can make the waiting time of logistics vehicles big as it can be seen that each regional division sets up a website more
Amplitude shortens.In view of the construction cost of Logistics Park, we can set up 2-3 handling in the huge regional division of express mail amount
Website, and relatively large number of regional division sets up 1-2 handling website, fewer regional division only sets up 1 handling website,
The queuing rate of logistics vehicles in this way will substantially reduce, and can also greatly improve the vehicle scheduling efficiency of Logistics Park.
Fig. 3 shows the structure of an embodiment of vehicle dynamic scheduling system of the invention.Refer to Fig. 3, the present embodiment
System include: logistic car data obtaining module, logistic car nearby data obtaining module, model building module and dynamic dispatching
Module.
What logistic car data obtaining module was used to obtain the logistic car in arrival Logistics Park includes vehicle location, destination
Relevant information inside.Logistic car data obtaining module is the relevant information that logistic car is obtained by RFID reader.Logistic car
The position of logistic car is determined in data obtaining module using distance estimations method: using surface acoustic wave identification tag, being arrived based on signal
Method up to the time measures the distance between each reader and label, then is positioned and marked with trilateration based on three distance values
Label.
What data obtaining module was used to determine other logistic cars near a certain logistic car near logistic car includes vehicle
Relevant information including position, destination.
Model building module is used to be had priority to service window according to the foundation of the vehicle location of acquired logistic car more and wait
M/M/n queuing model processed.In model building module, the windows that service refer to multiple clothes for Logistics Service vehicle in system more
Business platform；The queuing model of M/M/n refers to that the interval time reached based on logistic car is quantum condition entropy, when loading and unloading the service of website
Between be quantum condition entropy, and have multiple queuing moulds for being established of handling these three elements for meeting queueing theory of website information desk
Type；Wait system refer to based on front have logistics vehicles when carrying out handling task after to logistics vehicles need the feelings waited in line
The queuing model that condition is established；Priority is according to the feedback of handling website, and the logistic car for being sent to some regional division will fill
It unloads and finishes, the system that preferentially the logistic car priority scheduling of corresponding branch of this area is come out.
Dynamic dispatching module is based on having priority mostly service window that M/M/n queuing model processed is waited to obtain optimal scheduling scheme,
The number to make the most short required handling website being arranged of logistics vehicles queuing time is calculated, and according to optimal scheduling scheme pair
Each logistic car carries out dynamic dispatching.
Although for simplify explain the above method is illustrated to and is described as a series of actions, it should be understood that and understand,
The order that these methods are not acted is limited, because according to one or more embodiments, some movements can occur in different order
And/or with from it is depicted and described herein or herein it is not shown and describe but it will be appreciated by those skilled in the art that other
Movement concomitantly occurs.
Those skilled in the art will further appreciate that, the various illustratives described in conjunction with the embodiments described herein
Logic plate, module, circuit and algorithm steps can be realized as electronic hardware, computer software or combination of the two.It is clear
Explain to Chu this interchangeability of hardware and software, various illustrative components, frame, module, circuit and step be above with
Its functional form makees generalization description.Such functionality be implemented as hardware or software depend on concrete application and
It is applied to the design constraint of total system.Technical staff can realize every kind of specific application described with different modes
Functionality, but such realization decision should not be interpreted to cause departing from the scope of the present invention.
General place can be used in conjunction with various illustrative logic plates, module and the circuit that presently disclosed embodiment describes
Reason device, digital signal processor (DSP), specific integrated circuit (ASIC), field programmable gate array (FPGA) other are compiled
Journey logical device, discrete door or transistor logic, discrete hardware component or its be designed to carry out function described herein
Any combination is realized or is executed.General processor can be microprocessor, but in alternative, which, which can be, appoints
What conventional processor, controller, microcontroller or state machine.Processor is also implemented as calculating the combination of equipment, example
As DSP and the combination of microprocessor, multi-microprocessor, the one or more microprocessors to cooperate with DSP core or it is any its
His such configuration.
The step of method or algorithm for describing in conjunction with embodiment disclosed herein, can be embodied directly in hardware, in by processor
It is embodied in the software module of execution or in combination of the two.Software module can reside in RAM memory, flash memory, ROM and deposit
Reservoir, eprom memory, eeprom memory, register, hard disk, removable disk, CD-ROM or known in the art appoint
In the storage medium of what other forms.Exemplary storage medium is coupled to processor so that the processor can be from/to the storage
Medium reads and writees information.In alternative, storage medium can be integrated into processor.Pocessor and storage media can
It resides in ASIC.ASIC can reside in user terminal.In alternative, pocessor and storage media can be used as discrete sets
Part is resident in the user terminal.
In one or more exemplary embodiments, described function can be in hardware, software, firmware, or any combination thereof
Middle realization.If being embodied as computer program product in software, each function can be used as one or more item instructions or generation
Code may be stored on the computer-readable medium or be transmitted by it.Computer-readable medium includes computer storage medium and communication
Both media comprising any medium for facilitating computer program to shift from one place to another.Storage medium can be can quilt
Any usable medium of computer access.It is non-limiting as example, such computer-readable medium may include RAM, ROM,
EEPROM, CD-ROM or other optical disc storages, disk storage or other magnetic storage apparatus can be used to carrying or store instruction
Or data structure form desirable program code and any other medium that can be accessed by a computer.Any connection is also by by rights
Referred to as computer-readable medium.For example, if software is using coaxial cable, fiber optic cables, twisted pair, digital subscriber line
(DSL) or the wireless technology of such as infrared, radio and microwave etc is passed from web site, server or other remote sources
It send, then the coaxial cable, fiber optic cables, twisted pair, DSL or such as infrared, radio and microwave etc is wireless
Technology is just included among the definition of medium.Disk (disk) and dish (disc) as used herein include compression dish
(CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and blu-ray disc, which disk (disk) are often reproduced in a manner of magnetic
Data, and dish (disc) with laser reproduce data optically.Combinations of the above should also be included in computer-readable medium
In the range of.
Offer is to make any person skilled in the art all and can make or use this public affairs to the previous description of the disclosure
It opens.The various modifications of the disclosure all will be apparent for a person skilled in the art, and as defined herein general
Suitable principle can be applied to other variants without departing from the spirit or scope of the disclosure.The disclosure is not intended to be limited as a result,
Due to example described herein and design, but should be awarded and principle disclosed herein and novel features phase one
The widest scope of cause.
Claims (10)
1. a kind of vehicle dynamic dispatching method characterized by comprising
Step 1: obtaining the relevant information including vehicle location, destination for reaching the logistic car in Logistics Park；
Step 2: determining the related letter including vehicle location, destination of other logistic cars near a certain logistic car
Breath；
Step 3: thering is priority to service window according to the foundation of the vehicle location of acquired logistic car more and M/M/n processed is waited to be lined up mould
Type；
Step 4: waiting M/M/n queuing model processed to obtain optimal scheduling scheme based on there is priority to service window, and according to optimal more
Scheduling scheme carries out dynamic dispatching to each logistic car.
2. vehicle dynamic dispatching method according to claim 1, which is characterized in that in step 1, read by RFID
The relevant information of device acquisition logistic car.
3. vehicle dynamic dispatching method according to claim 2, which is characterized in that in step 1, using distance estimations method
Determine the position of logistic car: using surface acoustic wave identification tag, the method based on time of arrival (toa) measure each reader with
The distance between label, then label is positioned based on three distance values trilateration.
4. vehicle dynamic dispatching method according to claim 1, which is characterized in that in step 3, more service windows, which refer to, is
Multiple information desks for Logistics Service vehicle in system；When the queuing model of M/M/n refers to the interval based on logistic car arrival
Between be quantum condition entropy, load and unload website service time be quantum condition entropy, and have multiple handling website information desks these three
Meet the queuing model that the element of queueing theory is established；System is waited to refer to there are logistics vehicles when carrying out handling task based on front
The logistics vehicles arrived afterwards need the queuing model that the case where waiting in line is established；Priority be according to handling website feedback,
The logistic car of some regional division is sent to i.e. by completed loading, preferentially the logistic car priority scheduling of corresponding branch of this area is come out
System.
5. vehicle dynamic dispatching method according to claim 1, which is characterized in that in step 4, optimal scheduling scheme is
Refer to the number being calculated to make the most short required handling website being arranged of logistics vehicles queuing time.
6. a kind of vehicle dynamic scheduling system, which is characterized in that system includes:
Logistic car data obtaining module, obtain reach Logistics Park in logistic car including vehicle location, destination
Relevant information；
Data obtaining module near logistic car, determine other logistic cars near a certain logistic car includes vehicle location, mesh
Ground including relevant information；
Model building module has priority to service window more and waits M/M/n processed according to the foundation of the vehicle location of acquired logistic car
Queuing model；
Dynamic dispatching module waits M/M/n queuing model processed to obtain optimal scheduling scheme, and root more based on there is priority to service window
Dynamic dispatching is carried out to each logistic car according to optimal scheduling scheme.
7. vehicle dynamic scheduling system according to claim 6, which is characterized in that be logical in logistic car data obtaining module
Cross the relevant information that RFID reader obtains logistic car.
8. vehicle dynamic scheduling system according to claim 7, which is characterized in that used in logistic car data obtaining module
Distance estimations method determines the position of logistic car: using surface acoustic wave identification tag, the method measurement based on time of arrival (toa) is every
The distance between a reader and label, then label is positioned based on three distance values trilateration.
9. vehicle dynamic scheduling system according to claim 6, which is characterized in that service in model building module more
Window refers to multiple information desks for Logistics Service vehicle in system；The queuing model of M/M/n refers to be reached based on logistic car
Interval time be quantum condition entropy, the service time for loading and unloading website is quantum condition entropy, and has multiple handling station services
The queuing model that these three elements for meeting queueing theory of platform are established；System is waited to refer to there are logistics vehicles being filled based on front
After when unloading task to the logistics vehicles queuing model that needs the case where waiting in line to be established；Priority is according to handling website
Feedback, be sent to the logistic car of some regional division i.e. by completed loading, it is preferentially that the logistic car of corresponding branch of this area is preferential
The system that scheduling comes out.
10. vehicle dynamic scheduling system according to claim 6, which is characterized in that in dynamic dispatching module, optimal tune
Degree scheme refers to the number being calculated to make the most short required handling website being arranged of logistics vehicles queuing time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810900508.5A CN109064098B (en) | 2018-08-09 | 2018-08-09 | Vehicle dynamic scheduling method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810900508.5A CN109064098B (en) | 2018-08-09 | 2018-08-09 | Vehicle dynamic scheduling method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109064098A true CN109064098A (en) | 2018-12-21 |
| CN109064098B CN109064098B (en) | 2021-11-23 |
Family
ID=64683075
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810900508.5A Active CN109064098B (en) | 2018-08-09 | 2018-08-09 | Vehicle dynamic scheduling method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109064098B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111191672A (en) * | 2019-11-20 | 2020-05-22 | 重庆特斯联智慧科技股份有限公司 | Community express receiving and dispatching method and system based on support vector machine |
| CN111401735A (en) * | 2020-03-13 | 2020-07-10 | 上海东普信息科技有限公司 | Intelligent queuing method, device, equipment and storage medium for logistics vehicles |
| CN111626578A (en) * | 2020-05-18 | 2020-09-04 | 上海东普信息科技有限公司 | Distribution method, device, equipment and storage medium of logistics truck |
| CN112037558A (en) * | 2020-08-31 | 2020-12-04 | 安徽海螺集团有限责任公司 | GPS truck scheduling method applied to intelligent cement factory |
| CN112381255A (en) * | 2020-11-13 | 2021-02-19 | 天津矿山工程有限公司 | Digital mine mining and transporting equipment scheduling method and system, intelligent terminal and storage medium |
| CN112699973A (en) * | 2020-12-03 | 2021-04-23 | 南理工泰兴智能制造研究院有限公司 | Internet of things service system applied to multi-field chemical production chain |
| CN113158462A (en) * | 2021-04-21 | 2021-07-23 | 电子科技大学成都学院 | Method for selecting taxi dispatching mode |
| CN113240906A (en) * | 2021-05-27 | 2021-08-10 | 山东产研信息与人工智能融合研究院有限公司 | Vehicle guiding method and system based on real-time monitoring of road congestion in logistics park |
| CN114096805A (en) * | 2019-07-08 | 2022-02-25 | 戴姆勒股份公司 | Method for scheduling autonomous vehicle fleet and vehicle fleet scheduling system |
| CN115083198A (en) * | 2022-06-15 | 2022-09-20 | 国汽(北京)智能网联汽车研究院有限公司 | Multi-vehicle transport capacity resource scheduling method and device |
| CN115123343A (en) * | 2021-03-25 | 2022-09-30 | 比亚迪股份有限公司 | Vehicle control method, device, vehicle and computer storage medium |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1665315A (en) * | 2005-04-15 | 2005-09-07 | 北京邮电大学 | Method for controlling overload of intelligent network based on service control point in multi-service environment |
| CN101604021A (en) * | 2009-07-09 | 2009-12-16 | 复旦大学 | A kind of localization method of radio frequency identification system and device |
| JP2013025545A (en) * | 2011-07-20 | 2013-02-04 | Sumitomo Electric Ind Ltd | Traffic evaluation device, computer program and traffic evaluation method |
| JP2013036932A (en) * | 2011-08-10 | 2013-02-21 | Fujitsu Ltd | Vehicle line length measurement device, vehicle line length measurement method, and computer program for measuring vehicle line length |
| CN103399295A (en) * | 2013-07-30 | 2013-11-20 | 福建师范大学 | Location implementation method based on RFID (Radio Frequency Identification) indoor positioning device |
| CN103646295A (en) * | 2013-11-28 | 2014-03-19 | 东南大学 | Service station general model-based electric vehicle battery charging/swapping network integrated scheduling method |
| CN104508509A (en) * | 2012-07-06 | 2015-04-08 | 奈达科技瑞典有限公司 | Methods, nodes and computer program for positioning of a device |
| CN105184525A (en) * | 2015-05-21 | 2015-12-23 | 北京巨柱智伟能源环保科技有限公司 | Green logistics service system |
| CN106991492A (en) * | 2017-03-13 | 2017-07-28 | 北京交通大学 | A kind of boreal climate fills pure electric bus transit operation optimization method soon |
| CN107918849A (en) * | 2017-10-23 | 2018-04-17 | 深圳职业技术学院 | A kind of intelligent scheduling device and method of electronic logistics van |
| WO2018073667A2 (en) * | 2016-10-17 | 2018-04-26 | Uber Technologies, Inc. | Determining service provider behavior with ranged transmissions |
| CN108322615A (en) * | 2018-02-01 | 2018-07-24 | 福建工程学院 | A kind of more technical ability calling customer service system method for optimizing configuration |
-
2018
- 2018-08-09 CN CN201810900508.5A patent/CN109064098B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1665315A (en) * | 2005-04-15 | 2005-09-07 | 北京邮电大学 | Method for controlling overload of intelligent network based on service control point in multi-service environment |
| CN101604021A (en) * | 2009-07-09 | 2009-12-16 | 复旦大学 | A kind of localization method of radio frequency identification system and device |
| JP2013025545A (en) * | 2011-07-20 | 2013-02-04 | Sumitomo Electric Ind Ltd | Traffic evaluation device, computer program and traffic evaluation method |
| JP2013036932A (en) * | 2011-08-10 | 2013-02-21 | Fujitsu Ltd | Vehicle line length measurement device, vehicle line length measurement method, and computer program for measuring vehicle line length |
| CN104508509A (en) * | 2012-07-06 | 2015-04-08 | 奈达科技瑞典有限公司 | Methods, nodes and computer program for positioning of a device |
| CN103399295A (en) * | 2013-07-30 | 2013-11-20 | 福建师范大学 | Location implementation method based on RFID (Radio Frequency Identification) indoor positioning device |
| CN103646295A (en) * | 2013-11-28 | 2014-03-19 | 东南大学 | Service station general model-based electric vehicle battery charging/swapping network integrated scheduling method |
| CN105184525A (en) * | 2015-05-21 | 2015-12-23 | 北京巨柱智伟能源环保科技有限公司 | Green logistics service system |
| WO2018073667A2 (en) * | 2016-10-17 | 2018-04-26 | Uber Technologies, Inc. | Determining service provider behavior with ranged transmissions |
| CN106991492A (en) * | 2017-03-13 | 2017-07-28 | 北京交通大学 | A kind of boreal climate fills pure electric bus transit operation optimization method soon |
| CN107918849A (en) * | 2017-10-23 | 2018-04-17 | 深圳职业技术学院 | A kind of intelligent scheduling device and method of electronic logistics van |
| CN108322615A (en) * | 2018-02-01 | 2018-07-24 | 福建工程学院 | A kind of more technical ability calling customer service system method for optimizing configuration |
Non-Patent Citations (1)
| Title |
|---|
| 游卓浩: "基于M/M/n排队模型的云资源调度策略研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114096805A (en) * | 2019-07-08 | 2022-02-25 | 戴姆勒股份公司 | Method for scheduling autonomous vehicle fleet and vehicle fleet scheduling system |
| CN111191672A (en) * | 2019-11-20 | 2020-05-22 | 重庆特斯联智慧科技股份有限公司 | Community express receiving and dispatching method and system based on support vector machine |
| CN111191672B (en) * | 2019-11-20 | 2023-05-12 | 重庆特斯联智慧科技股份有限公司 | Community express receiving and sending method and system based on support vector machine |
| CN111401735A (en) * | 2020-03-13 | 2020-07-10 | 上海东普信息科技有限公司 | Intelligent queuing method, device, equipment and storage medium for logistics vehicles |
| CN111626578A (en) * | 2020-05-18 | 2020-09-04 | 上海东普信息科技有限公司 | Distribution method, device, equipment and storage medium of logistics truck |
| CN112037558A (en) * | 2020-08-31 | 2020-12-04 | 安徽海螺集团有限责任公司 | GPS truck scheduling method applied to intelligent cement factory |
| CN112381255A (en) * | 2020-11-13 | 2021-02-19 | 天津矿山工程有限公司 | Digital mine mining and transporting equipment scheduling method and system, intelligent terminal and storage medium |
| CN112699973A (en) * | 2020-12-03 | 2021-04-23 | 南理工泰兴智能制造研究院有限公司 | Internet of things service system applied to multi-field chemical production chain |
| CN115123343A (en) * | 2021-03-25 | 2022-09-30 | 比亚迪股份有限公司 | Vehicle control method, device, vehicle and computer storage medium |
| CN113158462A (en) * | 2021-04-21 | 2021-07-23 | 电子科技大学成都学院 | Method for selecting taxi dispatching mode |
| CN113240906B (en) * | 2021-05-27 | 2022-06-14 | 山东产研信息与人工智能融合研究院有限公司 | Vehicle guiding method and system based on real-time monitoring of road congestion in logistics park |
| CN113240906A (en) * | 2021-05-27 | 2021-08-10 | 山东产研信息与人工智能融合研究院有限公司 | Vehicle guiding method and system based on real-time monitoring of road congestion in logistics park |
| CN115083198A (en) * | 2022-06-15 | 2022-09-20 | 国汽(北京)智能网联汽车研究院有限公司 | Multi-vehicle transport capacity resource scheduling method and device |
| CN115083198B (en) * | 2022-06-15 | 2023-11-24 | 国汽(北京)智能网联汽车研究院有限公司 | Multi-vehicle power resource scheduling method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109064098B (en) | 2021-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109064098A (en) | A kind of vehicle dynamic dispatching method and system | |
| CN107331200B (en) | CBD underground garage parking intelligent guiding system, method and device | |
| CN111507667B (en) | Order distribution method and server applied to short-distance logistics | |
| CN110525823A (en) | A kind of method, apparatus and system that monitoring rubbish is put on by classification | |
| CN109816128B (en) | Method, device and equipment for processing network taxi appointment orders and readable storage medium | |
| CN102723002A (en) | Radio frequency identification (RFID)-technology-based ship lockage management system and method thereof | |
| CN108806302A (en) | A kind of vehicle dispatching method and device | |
| CN109409811A (en) | A kind of Logistic Scheduling method, apparatus, computer equipment and storage medium | |
| CN105489061A (en) | Public bike cloud intelligent parking and allocating system | |
| CN108986328A (en) | The self-service lease management system of pallet | |
| CN111445179A (en) | Three-in-one intelligent park management platform based on Internet of things and optimization algorithm | |
| CN103218699B (en) | Precursor chemicals flow to monitoring and managing method and system | |
| CN202067407U (en) | Logistics parking management system | |
| CN108182558A (en) | A kind of haul distance computational methods and device based on statistical nature | |
| Ferreira et al. | RFID for real time passenger monitoring | |
| Kho et al. | A development of punctuality index for bus operation | |
| CN103617678B (en) | A kind of automatic Dining Room Self-service System | |
| CN111932177A (en) | Intelligence commodity circulation garden goods blending device for business administration | |
| CN109147219A (en) | Intelligent storehouse system, electronic equipment and computer-readable medium | |
| CN111784931B (en) | Method and apparatus for sharing distribution boxes | |
| CN109472947A (en) | Article seals the method and apparatus with article deblocking up for safekeeping | |
| CN111652440A (en) | Logistics node cargo quantity information management method and device | |
| Zhen et al. | Analysis of three container routing strategies | |
| CN113793195B (en) | Network about vehicle order processing method and device, computer equipment and readable storage medium | |
| CN110660216B (en) | Travel time threshold determination method and system and intelligent equipment |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231228 Address after: Room 263, area s, 2nd floor, 158 Shuanglian Road, Qingpu District, Shanghai, 201702 Patentee after: Shanghai Yuanqin Information Technology Co.,Ltd. Address before: 201705 No.18, Lane 3029, Huaxu highway, Huaxin Town, Qingpu District, Shanghai Patentee before: YTO EXPRESS Co.,Ltd. |
|
| TR01 | Transfer of patent right |