CN110276467A - Logistic Scheduling method, Logistic Scheduling server and logistic dispatching system - Google Patents
Logistic Scheduling method, Logistic Scheduling server and logistic dispatching system Download PDFInfo
- Publication number
- CN110276467A CN110276467A CN201810209568.2A CN201810209568A CN110276467A CN 110276467 A CN110276467 A CN 110276467A CN 201810209568 A CN201810209568 A CN 201810209568A CN 110276467 A CN110276467 A CN 110276467A
- Authority
- CN
- China
- Prior art keywords
- client
- information
- dispatching
- distribution route
- distribution
- 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 43
- 238000005457 optimization Methods 0.000 claims abstract description 42
- 238000012384 transportation and delivery Methods 0.000 claims description 49
- 238000012545 processing Methods 0.000 claims description 35
- 238000004891 communication Methods 0.000 claims description 21
- 230000000630 rising effect Effects 0.000 claims 1
- 230000008569 process Effects 0.000 description 9
- 230000003111 delayed effect Effects 0.000 description 8
- 230000003068 static effect Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 238000007726 management method Methods 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 5
- 238000012544 monitoring process Methods 0.000 description 5
- 230000002159 abnormal effect Effects 0.000 description 4
- 238000007630 basic procedure Methods 0.000 description 4
- 230000008859 change Effects 0.000 description 4
- 239000000203 mixture Substances 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000010276 construction Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000000446 fuel Substances 0.000 description 2
- 230000014509 gene expression Effects 0.000 description 2
- 230000010354 integration Effects 0.000 description 2
- 206010039203 Road traffic accident Diseases 0.000 description 1
- 241001515806 Stictis Species 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005553 drilling Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 239000009153 huxin Substances 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 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/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/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
-
- 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
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Operations Research (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)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The present invention provides a kind of Logistic Scheduling method and scheduling system.This method at least includes the following steps.Step 1: the selected distribution information and customer information for not accessing client being stored in logistic dispatching system server sets the 1st given client based on specific road network information；Step 2: according to the home-delivery center's information for including in the distribution information and the customer information, based on specific road network information and setting initial distribution route；Step 3: not accessing client's specified time element in client according on the initial distribution route, judge whether to optimize the initial distribution route based on specific road network information.According to the method for the present invention, it is capable of providing that a kind of can reasonably to set the distribution cost low and specific specified services time in view of particular customer using simple step be a kind of simple and highly efficient Logistic Scheduling method and system of Optimization Steps.
Description
Technical field
The present invention relates to a kind of Logistic Scheduling method, server and system, more particularly to one kind in view of home-delivery center with
Relationship between the specifying information of client dispenses under minimum distribution cost reasonably to set distribution route to realize in batches
Logistic Scheduling method, server and the system of optimization allotment between task and distribution route.
Background technique
In recent years, with the fast development of e-commerce industry and logistic industry, based on the technology of Internet of Things highly to believe
Breathization, the intelligent Intelligent logistics business being characterized also are come into being.Also, in country under the premise of vigorously advocating, and
" Accelerating The Construction socialization, specialization, informationization modern logistics information desk system, improve physical-distribution intelligent management and standard
Under the overall situation of change level ", the technologies such as materials stream informationization, Logistic Scheduling, scheduling are gradually paid attention to and are reached its maturity by people.
In the above-described techniques, route optimization is an important link in logistics distribution system, arranges to match with holding water
It send route that can be effectively reduced transportation cost, saves haulage time, and improve level of customer service.
In addition, in route optimization technology, it will usually map navigation system and real-time traffic system etc. be used to prop up
The design of logistics route is helped, people is helped to look for the optimal path arrived at the destination from departure place.And optimal road is being set in the past
During diameter, static programming generally more is carried out to path according to the electronic map information (data) saved in system.
But the client other than the case where road conditions are to change in real time in reality, as the service object in dispatching task
Different according to the service characteristic (requirement especially on service time window) of itself can generate great shadow to the setting in path
It rings.And the characteristics of being directed to client itself and setting this project of path is that must be considered in reality rationally and at low cost
To but a content not well solved.
Therefore, incomplete being still remained to the route optimization before dispatching in logistics distribution system domestic at present
Thus the specific situation of client cannot be corresponded to well come the problem of setting distribution route.Further, such as occurring
When the former planned factor of emergency event or other influences generates, Distribution path and safety, reasonably in time, are efficiently adjusted
The service for dispatching dispatching task is also a kind of adjustment indispensable in logistics service industry.Thus it is possible to flexibly and rationally
Ground corresponds to various changed conditions and the technology of the various dispatching demands of client is urgently expected for people.
Summary of the invention
In order to achieve the above object, the present invention provides a kind of Logistic Scheduling method, Logistic Scheduling server and Logistic Scheduling
System.Logistic Scheduling method of the invention is characterized by having following steps:
Step 1: the selected distribution information for not accessing client being stored in logistic dispatching system server in control centre and
Customer information, logistic dispatching system server are based on specific road network information and according to the specified visitors of the 1st ad hoc rules setting the 1st
Family, wherein include dispatching mission bit stream and home-delivery center's information in distribution information；
Step 2: the logistic dispatching system server is according to the home-delivery center's information for including in the distribution information
With the customer information, initial distribution route is set based on specific road network information and using the 1st regulation algorithm；
Step 3: the logistic dispatching system server does not access in client according on the initial distribution route
Client's specified time element, and judge whether to optimize the initial distribution route based on specific road network information, when
When judgement needs to optimize the distribution route, optimize the distribution route according to the 2nd ad hoc rules, obtains optimization distribution route；
Step 4: the control centre wireless mobile being selected according to the initial distribution route or the optimization distribution route
Terminal distributes distribution vehicle, and by communication unit by the initial distribution route set in through the above steps 2 or by upper
The optimization distribution route obtained in step 3 is stated to send out together with distribution information corresponding with above-mentioned distribution route and customer information
Give monitoring center and the mobile radio terminal.
Preferably, this Logistic Scheduling method also includes
Step 5: the monitoring center is dispensed according to the initial distribution route or optimization that send in the step 4
Route, distribution information corresponding with above-mentioned distribution route and customer information and from the position that the mobile radio terminal is sent
Confidence breath monitors the real-time moving-wire information of the distribution vehicle based on specific road network information, also, when the monitoring center is supervised
Controlling the real-time moving-wire information of the distribution vehicle, there are specified values relative to the delivery information for including in the distribution route
When the above deviation, the prompting message for indicating the departure degree is sent to by the control centre and described wireless by communication unit
Mobile terminal.
Step 6: the prompting message that the control centre is sent according to the monitoring center utilizes the logistics tune
Degree system server according to the 2nd ad hoc rules and based on specific road network information adjust on the distribution route described in not
The dispatching sequence or dispatching sequence and dispatching quantity of access client, and will indicate adjusted by communication unit and do not access client's
After the adjustment of dispatching sequence or dispatching sequence and dispatching quantity distribution information be sent to the monitoring center and it is described without it is mobile eventually
End.
Preferably, this Logistic Scheduling method is further characterized in that: in the step 1, the logistic dispatching system service
Device calculates each visitor for not accessing client based on specific road network information not access client as object described in chosen
The distance between family and home-delivery center and traveling time are the 1st index value of parameter, the 1st ad hoc rules are as follows: will be to described
The 1st index value that distribution cost is evaluated is minimum and it is expected that the client that delivery time meets client's element of time is set to
1st given client.
Preferably, this Logistic Scheduling method is further characterized in that: in the second step, the 1st regulation algorithm be with
1st given client is the starting point of the initial distribution route, is referred to based on the selection of specific road network information relative to the described 1st
Determine client the 2nd index value be it is the smallest do not access client, and be set into the 2nd given client,
Then, logistic dispatching system server selection is respectively relative to the 1st given client and described 2nd specified
The sum of described 2nd index value of client be it is the smallest do not access client, and be set into the 3rd given client,
Then, the logistic dispatching system server successively selects to be respectively relative to kth given client and the specified visitor of kth+1
The sum of 2nd index value at family be it is the smallest do not access client, and+2 given client of kth is set into, until to all
Described do not access client and set, wherein k is greater than 1 integer,
To set each dispatching sequence for not accessing client on the initial distribution route, the initial dispatching road is determined
Line.
Preferably, this Logistic Scheduling method is further characterized in that: the 2nd ad hoc rules is a kind of following rule: described
Logistic dispatching system server according to the arrival in the initial distribution route do not access client estimated delivery time and this not
The relationship between the specified time element of client is accessed, and this is adjusted based on specific road network information one by one and does not access client
Front and back dispatching sequence.
In above-mentioned steps 6, in addition to being adjusted according to the 2nd ad hoc rules to the front and back dispatching sequence for not accessing client
It is whole, and the selected of specific road network information is all carried out during adjusting each adjustment for not accessing client one by one, and use choosing
Fixed road network information carries out the calculating of the distribution cost.
Preferably, in the step 5, the prompting message indicates the deviation journey by eye-catching color displays
Degree.The specific road network information includes real-time road network information and history road network information.
The present invention also provides a kind of logistic dispatching system servers, it is characterised in that: by basic information database, geographical number
According to library, database of dispatching buses, traffic information database, temporary scheduling database, the 1st arithmetic processing section and the 2nd calculation process
Portion is constituted,
The 1st arithmetic processing section framework at: according to control centre from the basic information database select do not access
The distribution information and customer information of client sets the 1st given client based on specific road network information and according to the 1st ad hoc rules,
It wherein, include dispatching mission bit stream and home-delivery center's information in distribution information；And according to the institute for including in the distribution information
Home-delivery center's information and the customer information are stated, sets initial dispatching based on specific road network information and using the 1st regulation algorithm
Route；
The 2nd arithmetic processing section framework at: do not access according on the initial distribution route visitor in client
Family specified time element, and judge whether to optimize the initial distribution route based on specific road network information, work as judgement
When needing to optimize the distribution route, optimize the distribution route according to the 2nd ad hoc rules, obtains optimization distribution route；According to
The initial distribution route or the optimization distribution route select mobile radio terminal, distribute distribution vehicle, and pass through communication unit
The optimization dispatching road obtained in 3 by the initial distribution route set in through the above steps 2 or through the above steps
Line is sent to monitoring center together with distribution information corresponding with above-mentioned distribution route and customer information and the wireless mobile is whole
End.
The present invention also provides a kind of logistic dispatching systems, it is characterised in that by above-mentioned logistic dispatching system server, scheduling
Center, monitoring center and mobile radio terminal are constituted.
Invention effect
Above-mentioned composition according to the present invention, be capable of providing it is a kind of using simple step can reasonably set dispatching at
This low and in view of particular customer specific specified services time be a kind of simple and highly efficient Logistic Scheduling method of Optimization Steps and
System.In addition, in calculating distribution cost, by time using including real-time road network information and history road network information
Specific road network information, even if the emergency event including traffic jam occurs in front of distribution route in delivery process
When, on the basis of also capable of evading the section that above-mentioned emergency event occurs while maintaining low cost dispatching, to distribution route
It is adjusted in real time.
Detailed description of the invention
Fig. 1 is the structural schematic diagram for indicating the logistic dispatching system of embodiment of the present invention.
Fig. 2 is the flow chart for indicating the basic procedure of logistic dispatching system of embodiment of the present invention.
Fig. 3 is the process of the route setting process in the basic procedure for indicate the logistic dispatching system of embodiment of the present invention
Figure.
Fig. 4 is the outline flowchart for optimizing the basic procedure of route.
Fig. 5 is the schematic diagram for indicating an example monitored picture of monitoring center.
Fig. 6 is the schematic diagram for indicating the login screen of mobile radio terminal.
Fig. 7 is the schematic diagram for indicating the dispatching mission bit stream shown on mobile radio terminal.
Fig. 8 is that the dispatching task for indicating to show on mobile radio terminal has abnormal schematic diagram.
Specific embodiment
The illustrative embodiments that the present invention will be described in more detail referring to the drawings.Although shown in the drawings of the present invention
Illustrative embodiments, be implemented it should be appreciated, however, that can change and combine by various forms etc., without
It should be limited by embodiment described herein.Typical embodiment provided here is to be able to allow the skill of this field
Art personnel can thoroughly understand the present invention.
In addition, for function substantially having the same, the element of composition, passing through imparting in this specification and attached drawing
Identical appended drawing reference and omit repeated explanation, furthermore illustrated with the omitting elements that are not directly dependent upon of the present invention.
Fig. 1 shows the structural schematic diagram of the logistic dispatching system of one embodiment of the present invention.Object in the present embodiment
Flowing scheduling system includes control centre 10, logistic dispatching system server 20, monitoring center 30 and mobile radio terminal 40.
Respectively have in control centre 10, logistic dispatching system server 20, monitoring center 30 and mobile radio terminal 40
General communication module (not shown, to be equivalent to communication unit of the invention) realizes information exchange for being communicated with the external world.
Control centre 10 can be made of equipment such as computers (PC).Control centre 10 has control interface.Utilize the control
Interface processed is made of output device (display device etc.) and input unit (control key, control-rod or touch screen etc.), can be to this hair
Modification and integration of the information (data) used in bright logistic dispatching system etc. are controlled.
Meanwhile control centre 10 as system center control unit can with logistic dispatching system server 20, monitoring in
The heart 30 and mobile radio terminal 40 carry out information exchange respectively, obtain extraneous various information.
The various information in the above-mentioned external world include: home-delivery center's information (data such as geographical locations such as contact method, longitude and latitude),
Goods information (data such as volume and weight including cargo), goods delivery ground information (addresses of all clients etc.), Ke Huxin
Cease (service time window and client's specified services time including client), all kinds of geography information, Real-time Traffic Information and interim
Scheduling information etc..
The composition of logistic dispatching system server 20 is as shown in Figure 1.Logistic dispatching system server 20 is by database and fortune
Processing unit two large divisions is calculated to constitute.Database part specifically includes: basic information database 211, geographical data bank 212, scheduling
Vehicle database 213, traffic information database 214 and temporary scheduling database 215.Arithmetic processing section specifically includes the 1st operation
Processing unit 221 and the 2nd arithmetic processing section 222.The process content and function of the data content of each database and each arithmetic processing section
It is described below.
Control centre 10 and logistic dispatching system server 20 are as the management end equipment in system of the invention, between the two
Information exchange can by dedicated local area network or pass through communication module (being equivalent to communication unit of the invention) Lai Shixian.
Control centre 10 issues instruction the 1st arithmetic processing section 221 of control and the 2nd arithmetic processing section 222 carries out defined operation.Also,
Control centre 10 can utilize communication module (being equivalent to communication unit of the invention) and monitoring center 30 and mobile radio terminal 40
It is communicated, realizes information exchange.
Monitoring center 30 realized using framework, has that distribution vehicle monitoring, position tracking, distribution information monitors, system mentions
The functions such as awake.Monitoring center 30 is identical as control centre 10, can be by having output device (for example, display device etc.) and input
The computer of device (control key, control-rod or touch screen etc.) is constituted.
Monitoring center 30 can individually framework form, can also be with 10 framework of control centre at the equipment of an entirety.It should
Occasion, control centre 10 and monitoring center 30 can realize information exchange by internal bus.
Mobile radio terminal 40 in this system is constituted such as the intelligent terminal by mobile phone.The intelligent terminal is also possible to put down
The portable equipment such as plate computer.When executing dispatching task, mobile radio terminal 40 can be mounted on the middle control of the vehicle
On the positions such as platform, for allowing dispatching person to be able to confirm that at any time, what is shown on mobile radio terminal 40 exists including dispatching modification information
Interior relevant information.
Mobile radio terminal 40, can also be by not shown other than it can carry out information exchange with control centre 10
Communication module (being equivalent to communication unit of the invention) communicated with logistic dispatching system server 20 and monitoring center 30, it is real
The interaction of existing information.It is imported with GPS function in mobile radio terminal 40, (of the invention lead to can be equivalent to using communication module
Letter portion) constantly to the real-time position information of logistic dispatching system server 20 and the transmission distribution vehicle of monitoring center 30.
It should be noted that being equipped in advance in the mobile radio terminal 40 for carrying out the dedicated of information exchange with extraneous
Application software (APP).Detailed operations and functions about the specialized application software are described below.
(composition of logistic dispatching system server 20)
The basic information database 211 of logistic dispatching system server 20 preserves distribution information and customer information, dispatching
It include dispatching mission bit stream and home-delivery center's information in information.
Dispensing mission bit stream includes dispatching goods information (volume and weight etc. including cargo) and corresponding client
Basic information (customer name, ID etc.).Home-delivery center's information includes: the address of home-delivery center and the geography for indicating the home-delivery center
The longitude and latitude data of position；Home-delivery center service time window information (for example, 8:00~19:00,8:00~20:00,9:00~
20:00 etc.).
Customer information include customer name or ID (in above-mentioned customer basis information customer name or ID foundation have it is corresponding
Relationship), customer address and the goods information (body including cargo for indicating the longitude and latitude data in geographical location of the client, client
Long-pending and weight etc.) and client service time window information (for example, 8:00~19:00,8:00~20:00,9:00~20:00
Deng).Wherein, since same client may be simultaneously present different order informations, above mentioned goods information is other than client
Also there is corresponding relationship with the foundation of the number of the specific order conduct of expressions such as order number.
In addition, can also include client requirement information in customer information.Client requirement information includes the specified services of client
Time (or avoiding service time) indicates that period difference then dispenses the different specific information in address, penalty cost information etc.
Indicate client to the information of the specific requirements of dispatching task.
Geographical data bank 212 belongs to a kind of spatial database, is a kind of appliance computer database technology to geodata
Carry out the hardware and software systems of the organization and management of science.Geographical data bank 212 includes one group of ground independently of application purpose
The set of data is managed, geographical data sets are carried out with the data management system software of scientific management and supports to manage movable calculating
Machine hardware.Geographical data bank 212 is specifically used for integration and analyzes all geography information and data.Wherein, indicate geographical entity and
The data of its feature have determining space coordinate.Such as in the present embodiment, institute can be obtained from the geographical data bank 212
There are home-delivery center and all clients, the geodata (including longitude and latitude data etc.) of all roads in dispatching region and all
The geodata (including longitude and latitude data etc.) of related facility.
Geographical data bank 212 simultaneously cooperates with aftermentioned traffic information database 214 to control centre and monitoring center offer
Geodata and traffic information data including real-time traffic and historical traffic data.Specifically, 212 energy of geographical data bank
It is enough retrieved according to the instruction from external equipment rapid the, more new data.Also, as needed can to these data into
Row analysis, to achieve the purpose that provide rationally accurately data in time.
Dispatch buses include in database 213 vehicle being scheduled for related data.It specifically includes: being used in these data
The data such as vehicle model, quantity, car number, loading amount and the unit mileage fuel consumption of all vehicles of dispatching.It needs
Bright, database 213 of dispatching buses further includes establishing the mobile radio terminal 40 for having corresponding relationship with above-mentioned all vehicles
Information.
The information dispatched buses in database 213 passes through tune according to the change etc. of the information for the vehicle that can be used in scheduling
The input unit at degree center 10 etc. is updated at any time.
Traffic information database 214 for manage Real-time Traffic Information and historical traffic information, road information, being capable of basis
Traffic condition generates the data (road network information data) such as event description, weather conditions, coverage, duration.It needs to illustrate
, traffic information database 214 saves static road network information (history road network information) and dynamic road network information (real-time road network letter
Breath).The static road network information and dynamic road network information being stored in traffic information database 214 can be from third party's traffic informations
Supplier periodically obtains or obtains at any time by specific instruction required road network information and saved.
In the present system, aftermentioned distribution cost and penalty cost are calculated according to these road network informations.Wherein, road network is believed
It is specifically included in breath: traffic flow information, highway information, weather information, construction operation information, traffic accident information,
The traffic informations such as his unexpected incidents information.
Traffic information database 214 can also be with 212 framework of geographical data bank at a database.10 basis of control centre
The demand of data calculation processing obtains relevant data from the database.
Information of the temporary scheduling database 215 for the temporary scheduling in the provisional preservation stipulated time.Such as it is dispensing
Vehicle is temporarily saved in temporary scheduling database 215 scheduling information etc. that the distribution vehicle is scheduled after setting out.
It should be noted that system is also configured to the above-mentioned scheduling information etc. of provisional scheduling being saved in car hauler
In database 213, and omit the configuration of temporary scheduling database 215.
The 1st arithmetic processing section 221 and the 2nd arithmetic processing section 222 in logistic dispatching system server 20 are used for basis and match
It delivers letters breath and customer information, determines to include scheduler object and tune using other each databases in logistic dispatching system server 20
The scheduling information including route is spent, and the scheduling information is sent to control centre 10, monitoring center 30 and mobile radio terminal
40。
The concrete operation content and operation method of 1st arithmetic processing section 221 and the 2nd arithmetic processing section 222 are illustrating logistics
It is described in detail during the dispatching method of scheduling system.
(explanation of the dispatching method of logistic dispatching system)
Referring to Fig. 2, illustrate the basic procedure of control centre 10 in the present invention.Firstly, the specified dispatching in selection system is appointed
It is engaged in (STEP100).System is automatic or operator can be selected by the input unit of control centre 10 all dispatching tasks or
Person according to the same day dispatch buses quantity limitation, client promise delivery time (including client's specified services time) situations such as
Only select specific a part of dispatching task (not accessing client in the present embodiment of the invention for 7~11).In this implementation
In the explanation of example, the input step into the username and password of system is eliminated.
Further, input executes the exact date and time (STEP200) dispatched a car when dispatching task.The specific day dispatched a car
Phase and time can be the time window time started of the date of delivery that system is defaulted automatically and home-delivery center or by operator's hand
The date and time etc. that work is directly modified.
According to above-mentioned selected dispatching task and the exact date and time dispatched a car, initial distribution route is generated, and select
Initial dispatching person (STEP300).The algorithm of initial distribution route in this step (STEP300) is (corresponding to the 1st rule of the invention
Determine algorithm) it is described in detail below referring in particular to Fig. 3.
Then, it according to the particular demands for not accessing client, determines a need for optimizing initial distribution route (STEP400).
(STEP400/ the is no) (explanation as be described hereinafter, that is, the initial dispatching road when determining to be not necessarily to optimize the initial distribution route
Line meets the condition of the service time window of client and the specific specified services time of client), then the initial distribution route is sent out
Monitoring center 30 and corresponding mobile radio terminal 40 (STEP700) are given, and is saved into temporary scheduling database
In 215.Meanwhile terminating the route setting and optimization of the scheduled date.
When above-mentioned judgement is to need to adjust distribution route (STEP400/ is), optimize distribution route (STEP500), and root
Final dispatching person (STEP600) is selected according to the distribution route after optimization.After all distribution routes setting of scheduled date, it will set
Initial distribution route and optimization distribution route (respective setting method is aftermentioned) after fixed are sent to monitoring center 30 and respectively right
The mobile radio terminal 40 (STEP700') answered, and these above-mentioned distribution routes are saved in temporary scheduling database respectively
In 215.Meanwhile terminating the route setting and optimization of the scheduled date.
(about the explanation for generating initial distribution route)
Then, referring to Fig. 3, the generation step of initial distribution route in the step STEP300 in Fig. 2 is illustrated.
Control centre 10 issues to logistic dispatching system server 20 and instructs, and the 1st arithmetic processing section 221 is made to carry out following fortune
It calculates, and obtains its operation result.Firstly, basic information number of the 1st arithmetic processing section 221 from logistic dispatching system server 20
Basic information data (STEP301) is obtained according in library 211.In this step, control centre 10 obtains home-delivery center's information and visitor
Family information, for selecting initial client and generating initial distribution route.
Then, the 1st arithmetic processing section 221 obtains corresponding road network information (STEP302).In this step, at the 1st operation
Reason portion 221 obtains the history road network information to match with the date of delivery according to date of delivery from traffic information database 214.
Above-mentioned matching way for example may is that from traffic information database 214 select it is identical as the property of the date of delivery (for example,
Be all some day of working day or day off or the Monday of being into Sunday) date road network information.Equally, exist
In the setting of distribution route, road network information can be accurate on the corresponding time of specific date, further increase dispatching
The accuracy and reasonability of road network information in route setting.
It, can be in the premise for reflecting actual traffic situation as much as possible using the history road network information on same nature date
Under, it is relatively accurate and reasonably select initial client, and then accurately generate the initial dispatching road using the initial client as starting point
Line.
Then, road network information and customer information based on acquisition, using the geodata saved in geographical data bank 212,
Calculate the specified time not accessed between client and home-delivery center and distance being selected in the STEP100 of Fig. 2
(STEP303)。
Then, into (STEP304) the step of setting initial client.In this step, to being calculated in STEP303
Time and distance between each client and home-delivery center are evaluated, specifically evaluation method is as follows stating formula (1) and formula (2).
C (i)=ω 1 × d+ ω, 2 × e (1)
Wherein, C (i) indicates that each client (i) adds with home-delivery center at a distance from the time window time started of client (i)
Quan He；D indicates home-delivery center at a distance from client；E is the parameter for indicating the time window time started of client (i)；2 table of ω 1, ω
Show weighting coefficient, ω 1+ ω 2=1.It should be noted that C (i) corresponds to " the 1st index value " in the present invention.
The size of ω 1, ω 2 can carry out setting appropriate according to historical experience value.For example, stressing to consider home-delivery center
Between client apart from the case where when, suitably the value of ω 1 can be set to it is bigger than the value of ω 2, for example, by using 0.6 or more
Numerical value.And when stressing the case where considering the time window time started of client, it can be suitably by the ratio ω 1 of the value setting of ω 2
Value it is big, for example, by using 0.6 or more numerical value.By this setting, the pass between distribution cost and dispatching promise breaking can be balanced
System, is efficiently controlled in minimum level for the totle drilling cost for embodying distribution cost and penalty cost to reach.Alternatively, it is also possible to
ω 1 and ω 2 are reasonably set with reference to past effective empirical value.
B(i)≤s+t(i)≤L(i)···(2)
Wherein, B (i) indicates the time window time started of client (i)；S indicates the distribution vehicle time of departure；T (i) expression reaches
The time required to client (i)；L (i) indicates the time window latest time of client (i).
Above-mentioned weighted sum C (i) corresponds to " the 1st index value " of the invention.Above-mentioned formula (2) indicates in the present invention " to meet visitor
The condition of family service time ".
To each client of all clients, calculates C (i) value of above-mentioned formula (1) and judge whether formula (2) meets and (correspond to
" the 1st ad hoc rules " in the present invention).And judgement formula (2) will be met and the smallest client of C (i) value is (corresponding as initial client
" the 1st given client " in the present invention).
In addition, the total weight and volume of the cargo of the initial client (the 1st given client) are not as other additional conditions
Overload；And chosen distribution vehicle is when being off-duty train (vehicle that is to say home-delivery center return to), back in dispensing
Before the end time of service time window that the time of the heart is home-delivery center.
Then, into (STEP305) the step of setting initial distribution route.In this step, the 1st arithmetic processing section 221
Execute following steps.With the initial client (the 1st given client) that is set in STEP304 as starting point, using nearest neighbor algorithm according to
Secondary selection " distribution cost " the smallest client.Successively selection " distribution cost " the smallest client determines initially in turn in this step
The method (algorithm) of distribution route corresponds to " the 1st regulation algorithm " of the invention.
Hereinafter, illustrating the calculation method of above-mentioned initial distribution route.Wherein, the selection for not accessing client is successively selected
Object range is that not accessing of selecting in step (STEP100) in Fig. 2 removes above-mentioned initial client (the 1st is specified in client
Client) do not access client.
In this step, illustrate the calculation method for realizing that " distribution cost " is minimum referring to following formula (3)~(6).
Firstly, calculate all each clients for not accessing client in above-mentioned range of choice with through the above steps
(STEP304) " distribution cost " between selected initial client.Shown in the calculation method such as following formula (3) for being somebody's turn to do " distribution cost ".
It should be noted that in calculating process, form identical with the road network information acquisition modes in the setting of aforementioned initial client
Road network information is obtained, and calculates above-mentioned " distribution cost " (omitting the explanation of the step in Fig. 3) using the road network information obtained.
Cij=δ 1 × Tij+ δ 2 × Wij+ δ, 3 × Eij (3)
Wherein, Cij indicate initial client (i) to the traveling time of next client (j), service time window degree of closeness with
And the urgent weighted sum of the service time window of next client (j), Cij correspond to " the 2nd index value " of the invention；Tij table
Show based on the journey time between the calculated initial client (i) of road network information obtained through the above way and client (j)；
Wij is the parameter for indicating the degree of closeness of service time window of client (i) and client (j)；Eij is the service for indicating client (j)
The parameter of time window urgency.Wherein, δ 1+ δ 2+ δ 3=1.
The parameter Wij of degree of closeness as the service time window between above-mentioned client, such as latter client can be used
Service time window service start times and previous client deadline difference.For example, with reference to following formula (4) and (5).
Wij=ej- (Bi+SVTi) (4)
Ej=MAX (Bj, Bi+SVTi+Tij) (5)
Wherein, ej indicate client (j) service start times with from client (i) reach client (j) time in maximum
Value；Bi indicates the service start times of client (i)；SVTi indicates the service time of client (i)；Bj indicates the service of client (j)
Time started；Tij indicates the calculated client (i) of road network information based on above-mentioned acquisition and the traveling time between client (j).
In this way, the value of Wij can be calculated by substituting into formula (5) in formula (4).
In addition, indicating that the Eij of the service time window urgency parameter of client (j) can for example be acquired by following formula.
Eij=Lj- (Bi+SVTi+Tij) (6)
Wherein, Lj indicates the service time at the latest of client (j).The value of Eij can be calculated by above formula (6).
Then, the Wij value and Eij value calculated using above formula (4) and (6), obtaining each client (is strictly speaking to remove just
Do not access client after beginning client) reach initial client needed for " distribution cost " value Cij.
Determine that it is minimum visitor that the distribution cost of above-mentioned initial client (i) is reached in above-mentioned each client by the above method
Behind family, which is determined as not access client after initial client (i).Here, which is marked
Make 2 given clients (j).
Equally, it is calculated using above-mentioned calculating formula (3) to (6) in addition to above-mentioned determined given client (i) and the 2nd refer to
Determine not accessing except client (j) arrived separately in client it is above-mentioned be designated client (i), the sum of distribution cost (j) (Cki+
Ckj) be it is minimum do not access client, and as the 3rd given client (k).
Then, in the same way, the 4th given client to the 7th given client is successively determined.Specifically, it calculates
Arrive separately at the distribution cost (Clj, Clk) of the 2nd given client (j) He the 3rd given client (k), and by the sum of the two (Clj+
It Clk is) that the minimum client that do not access is determined as the 4th given client (l).
By it is above-mentioned it is identical in the way of, successively determine that the sum of distribution cost relative to the first two given client is minimum
Client is not accessed, and is successively determined into the 5th given client (m), the 6th given client (n) and the 7th given client (o).
In this way, being initial distribution route by the route determination for being sequentially connected the 1st given client to the 7th given client.It needs
Illustrate, although setting initial distribution route so that 7 do not access client as an example in the present embodiment, according to not accessing respectively
The concrete condition of the distance between client and respective service time window etc., can take the circumstances into consideration to increase and decrease not visiting in initial distribution route
Ask the quantity (such as 5 to 12 etc.) of client.
Calculated initial distribution route through the above way, on the basis of suitably considering distribution cost, rear
Have the advantages that be easier to optimize and revise not access client during the route optimization stated.
After above-mentioned initial distribution route determines, which is temporarily held in temporary scheduling database 215
In.Also, the 1st arithmetic processing section 221 is based on road network information (the static road network and dynamic obtained from traffic information database 214
State road network) calculate separately out each service start times for not accessing client on the initial distribution route and front and back does not access
The data such as the stroke distances of client, and these data are saved in temporary scheduling database 215.
According to above-mentioned algorithm it is found that " distribution cost " that uses in initial distribution route generating process of the invention considers
The factor of the service time window of client is not accessed, and is weighted by the time window degree of closeness (urgency) to client
It calculates, the initial distribution route of generation can be allowed more reasonably to reflect the relevance of the service time window between client, and then can
Setting out one " distribution cost " lower and in view of each client service time window as much as possible is reasonable distribution route.It (closes
In the explanation for optimizing initial distribution route)
Referring to Fig. 3, into next step (STEP306).In this step, client requirement information is obtained.It has been observed that client
Demand information includes the specified services time (or avoiding service time), indicates that period difference then dispenses different specific in address
The various informations such as information, penalty cost information.
As shown in figure 3, being determined a need for according to the client requirement information obtained in step STEP306 to by upper
The initial distribution route that the mode of stating is set optimizes adjustment (STEP307).If the decision is that (STEP307/ when negative
It is no), control centre 10 executes control and the initial distribution route being stored in temporary scheduling database 215 is sent to monitoring center
30 and mobile radio terminal 40 STEP700 of Fig. 2 (STEP309/ correspond to).
On the other hand, when determining in step STEP307 is to need to optimize route (STEP307/ is), optimization road is executed
Line step (STEP500 that STEP308/ corresponds to Fig. 2).Then, the optimization after all optimizations of system scheduled date is dispensed
Route is sent to monitoring center 30 and mobile radio terminal 40 (STEP700' of STEP309'/correspond to Fig. 2), and is saved
Into temporary scheduling database 215.
(corresponding to of the invention, " the 2nd is specific for the optimization method of initial distribution route Optimization Steps (STEP308) in Fig. 3
Rule ") it is described as follows.
Firstly, executing the step of obtaining client requirement information (STEP501).As previously mentioned, the client requirement information includes
The specified services time of client is (for example, dispensing or/and avoid 12:00~13:00 dispatching etc. between 11:00~15:00 needs
It asks).When the client being stored in basic information database 211 have client requirement information when, obtain the customer information and with this
Client establishes the client requirement information for having corresponding relationship.
The purpose for optimizing initial distribution route is to avoid the occurrence of penalty cost according to the specific requirements of client or to the greatest extent may be used
It can ground reduction penalty cost." penalty cost " of the invention be include that " default time ", " illegal building ", " promise breaking expense " etc. are general
It reads.
It is right one by one for not accessing there are the client of specific specified services time in client for above-mentioned initial distribution route
It is adjusted (STEP502) in the middle sequence of the initial distribution route and recalculates according to static road network information adjusted
The dispatching sequence and time (STEP503) of each client of route.
Specific optimization method is realized by the 2nd arithmetic processing section 222 according to following rules.Firstly, for initial dispatching
One of them in route does not access client with customer demand, judges its specific specified services time (below sometimes
Claim " customer service hours ") and its initial distribution route (hereinafter, sometimes also referred to as " route ") beginning service time (with
Under, sometimes referred to as " delivery time ") relationship.
Above-mentioned relation is roughly divided into tri- kinds of situations of following A~C.
Situation A. delivery time is less than (hereinafter referred to as " service is opened at the beginning of client's required specified services time
Begin the time ").
Situation B. delivery time is within client's required specified services time but at client's (e.g. noon time of having a rest
The not time, it is also possible to that client is special specified to avoid service time) in.
Situation C. delivery time is greater than client's required specified services time (hereinafter referred to as " service ending time ").
2nd arithmetic processing section 222 is directed to above-mentioned three kinds of situations, executes following adjustment.
In situation A, and the client has come the occasion at the end of initial distribution route, does not adjust matching for the client
Send sequence (situation A-1)；And when the client does not come the occasion at the end of initial distribution route, after the dispatching sequence of the client
One is moved, and recalculates the client estimated delivery time adjusted, and judge whether still less than service start times (situation
A-2)。
In above situation A-2, the size (namely rear or first) of delivery time and service start times adjusted is judged.
When delivery time adjusted is still less than the customer service time started, and the client continues to hold not in the occasion at route end
Row moves back one operation (situation A-2-1)；When delivery time adjusted is still less than the customer service time started, and the visitor
Family no longer adjusts the client in the occasion at route end, continues to adjust next client (situation A-2-2)；It is sent when adjusted
It is greater than the occasion of customer service time started up to the time, continues to adjust next client (situation A-2-3).
In situation B, delivery time is within client's time of having a rest and the client is that the first hand of route dispenses the field of client
It closes, does not adjust the client (situation B-1)；Delivery time is within client's time of having a rest and the client is not the first hand dispatching of route
The occasion of client by client's dispatching sequence Forward one, and recalculates the client estimated delivery time adjusted, and sentence
Break whether in customer service hours (situation B-2).
In above situation B-2, when estimated delivery time adjusted not in customer service hours and the client not
The occasion that client is dispensed for the first hand of route continues to execute the operation (situation B-2-1) of Forward one；When adjusted estimated
Delivery time is not in customer service hours and the client is the occasion that route first hand dispenses client, no longer adjusts the visitor
Next client (situation B-2-2) is continued at family；When estimated delivery time adjusted is greater than the customer service time started (and not
Within client's time of having a rest) occasion, continue to adjust next client (situation B-2-3).
In addition, delivery time is greater than the customer service end time, and the client is that route first hand is matched in situation C
It sees a visitor out the occasion at family, does not adjust the client (situation C-1)；Delivery time is greater than the customer service end time, and the client is not
The occasion that client is dispensed for route first hand by client's dispatching sequence Forward one, and recalculates the estimated of the client and send
Up to the time, and judge whether in customer service hours (situation C-2).
In above situation C-2, when estimated delivery time adjusted not in customer service hours and the client not
The occasion that client is dispensed for route first hand continues to execute the operation (situation C-2-1) of Forward one；Expect to send when adjusted
Up to the time not in customer service hours and the client be route first hand dispense client occasion, no longer adjust the client,
Continue next client (situation C-2-2)；Occasion of the delivery time greater than the customer service end time is expected when adjusted, after
The continuous next client (situation C-2-3) of adjustment.
These three situations of A~C described above refer to the adjustment mode under more than one occasion of the client with demand,
It, can not also be on the dispatching road if having a case that the client of demand only has one and its delivery time not within service time
The dispatching task (for example, situation D) of the client is executed in line.
It is optimized and revised by above-mentioned, can will include having on the basis of guaranteeing to realize minimum distribution cost as far as possible
Penalty cost including the client of demand is controlled in minimum level.
Then, as shown in figure 4, the 2nd arithmetic processing section 222 executes predetermined operation, optimization distribution route is determined
(STEP503).In this step, the client that default time will be present removes from the route of generation, namely the choosing from Fig. 2
It selects and is removed in the client specified involved in the specified dispatching task (STEP100) in system.
In removal there are after the client of default time, respectively according to the dispatching E. T. D. of each client, from traffic
Static certainty road network corresponding with each client is obtained in information database 214, also, corresponding according to each client respectively
Static certainty road network calculate the delivery time for obtaining the client, and finally judge the delivery time of each client whether at this
In the service time window of client.
If the delivery time not occasion in the service time window of the client, removes the client from route；If sent
Up to occasion of the time in the service time window of the client, then continue to judge next client in route adjusted, also,
Calculate the time that home-delivery center is gone back in the last one customer service in route after the completion, it is ensured that distribution vehicle can be in home-delivery center
Service time window in back to dispatching in.
Adjustment and preferred routes through the above way, can be on the basis for the distribution cost for fully taking into account distribution route
On, emphasis considers that setting one or more reasonably dispenses there are while the demand of the client of specific specified services time
Route.
Also, it is above-mentioned optimize and revise on the basis of, when the 2nd arithmetic processing section 222 calculates the distance and dispatching of whole route
Between, while according to the dispatching task of route has been determined, the weight and volume of entire cargo in the route is calculated, by entire cargo
Volume and weight compared with each vehicle, searches most suitable vehicle and determines aftermentioned mobile radio terminal respectively.
Through the above way dispatching route generate after, continue next route generation (Fig. 2/STEP100~
STEP500).Also, the optimization distribution route that each time generates is saved in respectively in temporary scheduling database 215.
All Route Generations of system scheduled date and after optimizing, the 2nd arithmetic processing section 222 takes by logistic dispatching system
Be engaged in device communication module (being equivalent to communication unit of the invention) by the distribution route ultimately generated together with being related to the distribution route
Customer information and dispatching mission bit stream are sent to monitoring center 30 and mobile radio terminal 40.
Step STEP600 according to fig. 2, control centre 10 is according to the final dispatching of optimization distribution route selection after optimization
Member.
It should be noted that the dispatching person's information managed in logistic dispatching system, the information of mobile radio terminal 40 and matching
Sending has specific relationship between information of vehicles.Dispatching person in system can be to establish with the mobile radio terminal 40 in system
Having the mobile radio terminal 40 in only one-to-one correspondence or system and establishing between distribution vehicle has only one-to-one correspondence
Either dispatching person and distribution vehicle foundation has only one-to-one correspondence.But it is also possible between above-mentioned three according to specific
The corresponding relationship that situation is temporarily adjusted.For example, system can be according to the distribution route information and dispatching cargo after optimization
Volume and weight and the fuel consumption information of vehicle etc., interim adjustment collocation dispatching person and distribution vehicle, to realize distribution cost
Low and reasonable combination.At this point, mobile radio terminal 40 follows specific dispatching person or follows specific distribution vehicle.
Then, control centre 10 controls logistic dispatching system server 20 and matches the optimization after initial distribution route or optimization
Send route and according to the distribution vehicle information for dispensing goods information etc. and distributing in these routes and dispatching mission bit stream
(establishing including dispatching person's information and with the distribution vehicle information information for having the mobile radio terminal of unique corresponding relation) sends
To monitoring center 30.Meanwhile control centre 10 control logistic dispatching system server 20 will initial distribution route or optimization after
Optimize distribution route and according to the distribution vehicle for dispensing goods information etc. and distributing in these routes and dispatching mission bit stream
Information (including distribution vehicle information, establishes the information for having the mobile radio terminal of unique corresponding relation with the distribution vehicle information)
It is sent to mobile radio terminal 40.
In this way, generating the distribution route and distribution vehicle information corresponding thereto, dispatching of (setting) through the above way
Member information and mobile radio terminal information logistic dispatching system server 20, monitoring center 30 and mobile radio terminal 40 this three
Synchronous save is realized between person.
Below to monitoring center 30 execute dispatching real-time management and logistic dispatching system in control centre 10, logistics tune
Spend information exchange, monitoring center 30 and control centre 10 between system server 20 and monitoring center 30 and mobile radio terminal 40
The content of the information exchange of part is illustrated.(function declaration of monitoring center 30)
The distribution route and customer information and dispatching that monitoring center 30 is sent according to logistic dispatching system server 20 are appointed
Business information implements the real-time moving-wire for executing the distribution vehicle (saying it is mobile radio terminal 40 on stricti jurise) in dispatching task
Monitoring.
The mobile radio terminal 40 executed in dispatching task is constantly sent respectively to monitoring center 30 using GPS function (module)
The location information at a moment.What monitoring center 30 was sent by arithmetic processing section (not shown) according to each mobile radio terminal 40
The information such as GPS data and the dispatching task corresponding with the mobile radio terminal 40 being stored in its storage unit (not shown) are (just
Begin or optimization distribution route, the estimated delivery time of each client and to information such as the estimated traveling times of next client) progress
Comparison.In the comparison, the calculating of estimated delivery time is carried out using foregoing static road network or dynamic road network.
When the moving-wire of each mobile radio terminal 40 obtained using GPS data dispenses when expecting to be sent to of task relative to it
Between expected latency or when the case where having delayed to a certain degree, sending to control centre 10 and mobile radio terminal 40 indicates
Dispense abnormal information (data).
Fig. 5 indicates a picture of the dispatching real-time management shown in the display devices such as the monitor screen of monitoring center 30.
It finds that dispatching is abnormal for the ease of administrative staff, such as indicates that expected latency or delayed dispatching are appointed with eye-catching color
Business.In the present embodiment, such as with yellow display field estimated dispatching task (the 2nd row in table shown in fig. 5 that will postpone is indicated
Shown in task)；Delayed dispatching task is indicated using such as red display column.
In task display field shown in Fig. 5, expected latency and delayed estimated time can be confirmed.Wherein,
Although expected latency refers to the latest delivery time of the estimated delivery time than client (that is, the end of the service time window of client
Moment) earlier, but the case where postponing (showing using yellow) is likely in delivery process before.And prolong
Refer to current estimated delivery time than the delivery time the latest of client (that is, the end of the service time window of client late
Moment) evening situation (use red display).
When control centre 10 receives the information for indicating above-mentioned dispatching exception from monitoring center, match to efficiently control
Cost and penalty cost are sent, current distribution route is further adjusted (corresponding to " step 6 " of the invention).It is specific next
It says, control centre 10 is using logistic dispatching system server 20 in addition to not accessing according to above-mentioned " the 2nd ad hoc rules " residue
Client carries out the adjustment of dispatching sequence, and specific road network is all carried out during adjusting each adjustment for not accessing client one by one
Selected (that is, selecting real-time road network information or history road network information) of information.
According to the above configuration, such as dispatching task is being implemented with the sequence of client j, client k, client l, client m and client n
When, it is assumed that 9 points of the morning sections between client j and client k get congestion or car accident etc. and cause subsequent not visit
In the case where asking that the delivery time of client l, m and n are estimated and delay occur, such as adjustable appoint at first carrying out dispatching to client l
Business.After this adjustment, such as according to history road network information, so that last to client k, again to client m from client l after adjustment
To client n whole distribution cost reduce (this refers to the times to shorten) when, then can be by current dispatching sequence k, l, m, n tune
It is made into l, k, m, n.Equally, according to the difference of history road network information, the minimum dispatching sequence of entirety distribution cost adjusted
It is likely to be the sequence such as m, n, k, l or n, m, l, k.And the information such as dispatching sequence adjusted are sent to control centre 10 and hand
Machine 10 executes actual dispatching task.
In addition, howsoever adjusted there is also by the calculating of the 2nd arithmetic processing section, wherein have a client (for example,
Client n) delivery time be unable to reach the situation in its service time window.Then cancel in this case to the client (for example,
Client n) dispatching task.Here, even if being finally the dispatching eliminated to client, by prominent in generation road traffic congestion etc.
After hair event by above-mentioned 2nd ad hoc rules and in the way of selecting specific road network information, from the rational angle of distribution route
It is to belong to a kind of adjustment the most reasonable from the point of view of degree.
It should be noted that the dispatching person for holding mobile phone 40 can also be according to the similar burst faced in delivery process
Event and select to cancel in mobile phone 40 to the dispatching task of a certain client.At this moment, it can be grasped by the correlation of operating handset 40
Make the information such as the reason of page input includes the dispatching task and cancellation task for cancelling a certain client, and sends that information to
Control centre 10 and logistic dispatching system server 20 simultaneously can also be sent to (the mobile phone 40 of monitoring center 30 simultaneously as needed
The information can not also be issued to monitoring center 30, but be sent to the dispatching mission bit stream after variation by control centre 10
Monitoring center 30, to its, current information is updated).
Equally, the selected of above-mentioned this specific road network information can also be first according to the 1st above-mentioned regulation algorithm setting
It is embodied when optimizing above-mentioned distribution route when beginning distribution route and according to the 2nd ad hoc rules.It is based on closing so as to obtain
The road network information of reason sets out the effect of best distribution route.
(explanation about mobile radio terminal 40)
Mobile radio terminal 40 of the invention can be to be constituted such as the intelligent terminal by mobile phone.The intelligent terminal can also be with
It is the portable equipment such as tablet computer.When dispatching task starts to execute, since distribution vehicle, dispatching person and wireless mobile are whole
End be establish unique corresponding relation and the mobile radio terminal be usually be mounted in the distribution vehicle (when vehicle driving) or
Person is carried when dispatching task () by dispatching person, this three can be regarded as the mobile terminal of an entirety.
Be equipped in advance in as described above, mobile radio terminal 40 (hereinafter, sometimes referred to as " mobile phone 40 ") for the external world
Carry out the specialized application software (APP) of information exchange.
Referring for example to Fig. 6, the initial picture shown when opening the APP on the display unit of the mobile phone 40 of APP is installed in advance.
By inserting specific usernames and password by system administration in username and password column, the APP is able to enter (that is, real
Now enter in logistic dispatching system of the invention).
Into after this system, can be confirmed at once and clicking or touching the dispatching task key in APP picture by object
Stream scheduling system control centre 10 control send it is initial or optimization distribution route, be related to the distribution route customer information and
Dispense mission bit stream.Dispatching person according to these information, carry out goods sorting, delivery of cargo, scanning confirmation relevant information, be placed into it is specified
The working links such as cage vehicle, delivery of cargo are completed to prepare with goods.
During dispatching person executes dispatching task, dispatching person can also confirm dispatching mission bit stream and dispatching progress at any time
Etc. information.It can be shown referring for example to the left figure of Fig. 7 when clicking or touching " dispatching task " touching key below APP picture
Relevant information and dispatching progress of this dispatching task etc..Also, match clicking or touching dispatching the uppermost of task screen
When sending task display area (the dotted line frame region in the left figure of Fig. 7), the dispatching task as shown in the right figure of Fig. 7 can be jumped out
Details.Dispatching task shown in fig. 7 shows that the information shown in picture includes items shown in the right figure right side of Fig. 7
(1 to 10) information).
Meanwhile dispatching person can directly confirm every dispatching task since the dispatching task screen estimated dispatching
Time (delivery time) and remaining time etc., consequently facilitating dispatching person confirms the progress of dispatching task at any time.
Fig. 8 shows show expected latency and delayed dispatching task in the display picture of mobile phone 40.Due to
Monitoring center 30 can postpone or when delayed situation, automatically send delay situation simultaneously monitoring dispatching task
To control centre 10 and corresponding mobile radio terminal 40.
It is identical as the display mode of monitoring center 30 shown in fig. 5, the specific picture of the APP of mobile phone 40 shown in Fig. 8
The relevant information of middle display expected latency or/and delayed dispatching task.
Since it is expected that the relevant information of delay or/and delayed dispatching task is sent to mobile phone from monitoring center 30
While 40, it is also sent to control centre 10, as described in above-mentioned steps 6, control centre 10 is specific according to the above-mentioned 2nd
Rule the front and back dispatching sequence for not accessing client is adjusted after adjustment after distribution information be sent to mobile phone 40, in mobile phone 40
The upper display information adjusted for not accessing client similar to Figure 7 and dispatching mission bit stream (dispense after here, omitting adjustment
The diagram of information).The dispatching person for holding the mobile phone 40 then implements dispatching work according to the new dispatching mission bit stream sent.
(information exchange between monitoring center 30 and control centre 10)
Information exchange between monitoring center 30 and control centre includes: that monitoring center 30 will be deposited in the dispatching task under monitoring
Control centre 10 can be sent in the abnormal dispatching task dispatching information of dispatching；There is dispatching exception according to above-mentioned in control centre 10
Dispatching task dispatching information further distribution route is coordinated after new route be sent to monitoring center 30 and (while also sending out
Give mobile phone 40)；
Above embodiments are only exemplary embodiment of the present invention, are not used in the limitation present invention, protection scope of the present invention
It is defined by the claims.Those skilled in the art can within the spirit and scope of the present invention make respectively the present invention
Kind modification or equivalent replacement, this modification or equivalent replacement also should be regarded as being within the scope of the present invention.
Claims (14)
1. a kind of Logistic Scheduling method, which is characterized in that have follow steps:
Step 1: the selected distribution information for not accessing client and the client being stored in logistic dispatching system server in control centre
Information, logistic dispatching system server are based on specific road network information and set the 1st given client according to the 1st ad hoc rules,
In, it include dispatching mission bit stream and home-delivery center's information in distribution information；
Step 2: the logistic dispatching system server is according to the home-delivery center's information for including in the distribution information and institute
Customer information is stated, sets initial distribution route based on specific road network information and using the 1st regulation algorithm；
Step 3: the logistic dispatching system server does not access the visitor in client according on the initial distribution route
Family specified time element judges whether to optimize the initial distribution route based on specific road network information, when judgement needs
When optimizing the distribution route, optimize the distribution route according to the 2nd ad hoc rules, obtains optimization distribution route；
Step 4: the control centre it is whole to be selected according to the initial distribution route or the optimization distribution route for wireless mobile
Distribution vehicle is distributed at end, and by communication unit by the initial distribution route set in through the above steps 2 or by above-mentioned
The optimization distribution route obtained in step 3 is sent together with distribution information corresponding with above-mentioned distribution route and customer information
To monitoring center and the mobile radio terminal.
2. Logistic Scheduling method as described in claim 1, which is characterized in that also include
Step 5: the monitoring center is according to the initial distribution route or optimization dispatching road sent in the step 4
Line, distribution information corresponding with above-mentioned distribution route and customer information and from the position that the mobile radio terminal is sent
Information monitors the real-time moving-wire information of the distribution vehicle based on specific road network information, also, when the monitoring center monitors
To the distribution vehicle real-time moving-wire information relative to the delivery information for including in the distribution route there are specified value with
On deviation when, the prompting message for indicating the departure degree is sent to by the control centre and the wireless shifting by communication unit
Dynamic terminal.
Step 6: the prompting message that the control centre is sent according to the monitoring center utilizes the Logistic Scheduling system
System server according to the 2nd ad hoc rules and based on specific road network information adjust on the distribution route described in do not access
The dispatching sequence or dispatching sequence and dispatching quantity of client, and the dispatching adjusted for not accessing client will be indicated by communication unit
Distribution information is sent to the monitoring center and the no mobile terminal after the adjustment of sequence or dispatching sequence and dispatching quantity.
3. Logistic Scheduling method as claimed in claim 1 or 2, which is characterized in that
In the step 1, the logistic dispatching system server is not to access client as object, based on spy described in chosen
Fixed road network information calculates the distance between each client and home-delivery center of client and the traveling time of not accessing as parameter
The 1st index value, the 1st ad hoc rules are as follows: by the 1st index value evaluated the distribution cost be minimum and pre-
The client that meter delivery time meets client's element of time is set to the 1st given client.
4. Logistic Scheduling method as claimed in claim 3, which is characterized in that
In the second step, the 1st regulation algorithm is rising for the initial distribution route with the 1st given client
Point, and be the smallest not access visitor relative to the 2nd index value of the 1st given client based on the selection of specific road network information
Family, and it is set into the 2nd given client,
Then, the logistic dispatching system server selection is respectively relative to the 1st given client and the 2nd given client
The sum of the 2nd index value be it is the smallest do not access client, and be set into the 3rd given client,
Then, the logistic dispatching system server successively selects to be respectively relative to+1 given client of kth given client and kth
The sum of described 2nd index value be it is the smallest do not access client, and+2 given client of kth is set into, until to all institutes
It stating and does not access client and set, wherein k is greater than 1 integer,
To set each dispatching sequence for not accessing client on the initial distribution route, the initial distribution route is determined.
5. Logistic Scheduling method as claimed in claim 4, which is characterized in that
In above-mentioned steps 3, the 2nd ad hoc rules is a kind of following rule:
The logistic dispatching system server does not access when expecting to be sent to of client according to the arrival in the initial distribution route
Between do not access relationship between the specified time element of client with this, and this is adjusted not based on specific road network information one by one
Access the front and back dispatching sequence of client.
In above-mentioned steps 6, in addition to being adjusted according to the 2nd ad hoc rules to the front and back dispatching sequence for not accessing client,
And the selected of specific road network information is all carried out during adjusting each adjustment for not accessing client one by one, and using selected
Road network information carries out the calculating of the distribution cost.
6. Logistic Scheduling method as claimed in claim 1 or 2, which is characterized in that
In the step 5, the prompting message indicates the departure degree by eye-catching color displays.
7. Logistic Scheduling method as claimed in claim 3, which is characterized in that
The specific road network information includes real-time road network information and history road network information.
8. a kind of logistic dispatching system server, it is characterised in that: by basic information database, geographical data bank, dispatch buses
Database, traffic information database, temporary scheduling database, the 1st arithmetic processing section and the 2nd arithmetic processing section are constituted,
The 1st arithmetic processing section framework at: according to control centre from the basic information database select do not access client
Distribution information and customer information, based on specific road network information and according to the 1st ad hoc rules set the 1st given client, wherein
It include dispatching mission bit stream and home-delivery center's information in distribution information；And according to the dispatching for including in the distribution information
Central information and the customer information set initial distribution route based on specific road network information and using the 1st regulation algorithm；
The 2nd arithmetic processing section framework at: do not access the client in client according on the initial distribution route and refer to
It fixes time element, and judges whether to optimize the initial distribution route based on specific road network information, when determining to need
When optimizing the distribution route, optimize the distribution route according to the 2nd ad hoc rules, obtains optimization distribution route；According to described
Initial distribution route or the optimization distribution route select mobile radio terminal, distribute distribution vehicle, and will lead to by communication unit
The optimization distribution route obtained in the initial distribution route set in above-mentioned steps 2 or through the above steps 3 is crossed to connect
Monitoring center and the mobile radio terminal are sent to distribution information corresponding with above-mentioned distribution route and customer information.
9. logistic dispatching system server as claimed in claim 8, it is characterised in that:
The monitoring center framework at: according to the initial distribution route that is sent in the step 4 or optimization dispatching road
Line, distribution information corresponding with above-mentioned distribution route and customer information and from the position that the mobile radio terminal is sent
Information is monitored the real-time moving-wire information of the distribution vehicle based on specific road network information, also, works as and monitor the dispensing vehicle
Real-time moving-wire information relative to the delivery information for including in the distribution route there are when more than specified value deviation, lead to
It crosses communication unit and the prompting message for indicating the departure degree is sent to the control centre and the mobile radio terminal.
Control centre's framework at: the prompting message sent according to the monitoring center adjusts on the distribution route
The dispatching sequence for not accessing client or dispatching sequence and dispatching quantity, and will indicate adjusted by communication unit and not visit
Distribution information is sent to the monitoring center and described after asking the adjustment of the dispatching sequence or dispatching sequence and dispatching quantity of client
Without mobile terminal.
10. logistic dispatching system server as claimed in claim 8 or 9, which is characterized in that
1st arithmetic processing section executes following processing: not accessing client as object using chosen, is believed based on specific road network
Breath calculates the distance between each client and home-delivery center of client and the traveling time of not accessing as the 1st index of parameter
Value, the 1st ad hoc rules are as follows: by the 1st index value evaluated the distribution cost for minimum and it is expected that when being sent to
Between meet the client of client's element of time and be set to the 1st given client.
11. logistic dispatching system server as claimed in claim 10, which is characterized in that
The 1st regulation algorithm that 1st arithmetic processing section executes is with the 1st given client for the initial dispatching road
The starting point of line, and be the smallest not visit relative to the 2nd index value of the 1st given client based on the selection of specific road network information
It asks client, and is set into the 2nd given client,
Then it is most that selection, which is respectively relative to the sum of the 1st given client and described 2nd index value of the 2nd given client,
Small does not access client, and is set into the 3rd given client,
Then, it is most that successively selection, which is respectively relative to the sum of the 2nd index value of+1 given client of kth given client and kth,
Small does not access client, and is set into+2 given client of kth, sets until to all clients that do not access, wherein
K is greater than 1 integer,
To set each dispatching sequence for not accessing client on the initial distribution route, the initial distribution route is determined.
12. logistic dispatching system server as claimed in claim 11, which is characterized in that
The 2nd ad hoc rules that 2nd arithmetic processing section executes is a kind of following rule:
The estimated delivery time for not accessing client according to the arrival in the initial distribution route does not access described in client with this
Relationship between specified time element adjusts the front and back dispatching sequence for not accessing client based on specific road network information one by one.
13. Logistic Scheduling method as claimed in claim 8 or 9, which is characterized in that
The specific road network information includes real-time road network information and history road network information.
14. a kind of logistic dispatching system, it is characterised in that by logistic dispatching system server according to any one of claims 8, scheduling
The heart, monitoring center and mobile radio terminal are constituted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810209568.2A CN110276467B (en) | 2018-03-14 | 2018-03-14 | Logistics scheduling method, logistics scheduling server and logistics scheduling system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810209568.2A CN110276467B (en) | 2018-03-14 | 2018-03-14 | Logistics scheduling method, logistics scheduling server and logistics scheduling system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110276467A true CN110276467A (en) | 2019-09-24 |
| CN110276467B CN110276467B (en) | 2023-04-25 |
Family
ID=67958448
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810209568.2A Active CN110276467B (en) | 2018-03-14 | 2018-03-14 | Logistics scheduling method, logistics scheduling server and logistics scheduling system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110276467B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110853349A (en) * | 2019-10-24 | 2020-02-28 | 杭州飞步科技有限公司 | Vehicle scheduling method, device and equipment |
| CN112529281A (en) * | 2020-12-03 | 2021-03-19 | 中邮信息科技(北京)有限公司 | Cable-seizing area determining method and device, electronic equipment and medium |
| CN113434589A (en) * | 2021-06-30 | 2021-09-24 | 北京三快在线科技有限公司 | Distribution route display method, device, equipment and computer readable storage medium |
| US20220018666A1 (en) * | 2016-12-22 | 2022-01-20 | Nissan North America, Inc. | Autonomous vehicle service system |
| CN115907405A (en) * | 2022-12-08 | 2023-04-04 | 力景(北京)系统技术有限公司 | Intelligent airport alarm receiving processing method and device, electronic equipment and medium |
| CN116307636A (en) * | 2023-05-17 | 2023-06-23 | 彼图科技(青岛)有限公司 | Intelligent regulation and control method and system for intelligent tool cabinet terminal |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103927639A (en) * | 2014-02-10 | 2014-07-16 | 武汉科技大学 | Steel product logistics system and scheduling method thereof based on real-time information |
| CN106156897A (en) * | 2016-08-22 | 2016-11-23 | 武汉轻工大学 | Optimum path planning analog systems in logistics distribution |
| CN106779183A (en) * | 2016-11-29 | 2017-05-31 | 北京小度信息科技有限公司 | Order is assembled and send sequential program(me) method, route planning method and device |
| CN107358326A (en) * | 2017-07-20 | 2017-11-17 | 深圳市凯立德科技股份有限公司 | A kind of bicycle multiple spot dispenses circuitry processing method |
-
2018
- 2018-03-14 CN CN201810209568.2A patent/CN110276467B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103927639A (en) * | 2014-02-10 | 2014-07-16 | 武汉科技大学 | Steel product logistics system and scheduling method thereof based on real-time information |
| CN106156897A (en) * | 2016-08-22 | 2016-11-23 | 武汉轻工大学 | Optimum path planning analog systems in logistics distribution |
| CN106779183A (en) * | 2016-11-29 | 2017-05-31 | 北京小度信息科技有限公司 | Order is assembled and send sequential program(me) method, route planning method and device |
| CN107358326A (en) * | 2017-07-20 | 2017-11-17 | 深圳市凯立德科技股份有限公司 | A kind of bicycle multiple spot dispenses circuitry processing method |
Non-Patent Citations (1)
| Title |
|---|
| 余博文: "配送中心车辆调度问题研究", 《中国优秀硕士学位论文全文数据库 经济与管理科学辑》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20220018666A1 (en) * | 2016-12-22 | 2022-01-20 | Nissan North America, Inc. | Autonomous vehicle service system |
| CN110853349A (en) * | 2019-10-24 | 2020-02-28 | 杭州飞步科技有限公司 | Vehicle scheduling method, device and equipment |
| CN112529281A (en) * | 2020-12-03 | 2021-03-19 | 中邮信息科技(北京)有限公司 | Cable-seizing area determining method and device, electronic equipment and medium |
| CN112529281B (en) * | 2020-12-03 | 2024-02-23 | 中邮信息科技(北京)有限公司 | Method and device for determining cable-throwing area, electronic equipment and medium |
| CN113434589A (en) * | 2021-06-30 | 2021-09-24 | 北京三快在线科技有限公司 | Distribution route display method, device, equipment and computer readable storage medium |
| CN113434589B (en) * | 2021-06-30 | 2023-01-06 | 汉海信息技术(上海)有限公司 | Distribution route display method, device, equipment and computer readable storage medium |
| CN115907405A (en) * | 2022-12-08 | 2023-04-04 | 力景(北京)系统技术有限公司 | Intelligent airport alarm receiving processing method and device, electronic equipment and medium |
| CN116307636A (en) * | 2023-05-17 | 2023-06-23 | 彼图科技(青岛)有限公司 | Intelligent regulation and control method and system for intelligent tool cabinet terminal |
| CN116307636B (en) * | 2023-05-17 | 2023-08-04 | 彼图科技(青岛)有限公司 | Intelligent regulation and control method and system for intelligent tool cabinet terminal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110276467B (en) | 2023-04-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110276467A (en) | Logistic Scheduling method, Logistic Scheduling server and logistic dispatching system | |
| CN110472764B (en) | Method and system for coordinating multiparty services using semi-collaborative Nash balancing based on reinforcement learning | |
| Hua et al. | Joint infrastructure planning and fleet management for one-way electric car sharing under time-varying uncertain demand | |
| Glaschenko et al. | Multi-agent real time scheduling system for taxi companies | |
| JP6059514B2 (en) | System and method for controlling flight operations | |
| CN113811915A (en) | Unified order serving and fleet management for online shared travel platform | |
| US8781726B2 (en) | Method and system for adjusting a demand-response transit schedule | |
| US7828202B2 (en) | System and method for controlling the transport of articles | |
| US20030191678A1 (en) | Disruption handling for scheduling system | |
| Lesaint et al. | Dynamic workforce scheduling for British telecommunications plc | |
| Evler et al. | Integration of turnaround and aircraft recovery to mitigate delay propagation in airline networks | |
| EP3080774A1 (en) | Optimizing selection of drivers for transport requests | |
| WO2001020409A2 (en) | System and method of providing personal calendar services | |
| CA3059918A1 (en) | Technician control system | |
| CN109034456B (en) | Method, system, server and computer readable storage medium for scheduling vehicles | |
| Pouls et al. | Idle vehicle repositioning for dynamic ride-sharing | |
| CN112906980A (en) | Order processing method, device and system and readable storage medium | |
| Deng et al. | Multi-objective vehicle rebalancing for ridehailing system using a reinforcement learning approach | |
| Imran et al. | A-VRPD: Automating drone-based last-mile delivery using self-driving cars | |
| CN113554198B (en) | Data processing system of receiving and sending machine based on block chain | |
| Husemann et al. | The impact of dispatching logic on the efficiency of Urban Air Mobility operations | |
| CN108711311A (en) | Parking assistance system and its parking assistance method | |
| Zhou et al. | Computationally efficient dynamic assignment for on-demand ridesharing in congested networks | |
| Andreev et al. | Magenta multi-agent systems for dynamic scheduling | |
| Gomes et al. | Design and operation of Demand Responsive Transportation systems |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240426 Address after: No. 100 Tongda Road, Nantong Economic and Technological Development Zone, Jiangsu Province, 226017 Patentee after: Silk Road Coffee Precision Machinery (Nantong) Co.,Ltd. Country or region after: China Address before: 201401 building 10, No. 999, Huancheng North Road, Fengxian District, Shanghai Patentee before: MISUMI (CHINA) PRECISION MACHINERY TRADING CO.,LTD. Country or region before: China |