CN111325370A - Dispatching task allocation method, device, equipment and storage medium - Google Patents

Dispatching task allocation method, device, equipment and storage medium Download PDF

Info

Publication number
CN111325370A
CN111325370A CN201811526027.9A CN201811526027A CN111325370A CN 111325370 A CN111325370 A CN 111325370A CN 201811526027 A CN201811526027 A CN 201811526027A CN 111325370 A CN111325370 A CN 111325370A
Authority
CN
China
Prior art keywords
dispatching
dispatch
express
processed
task
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201811526027.9A
Other languages
Chinese (zh)
Inventor
王婧
杨金辉
朱彬林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SF Technology Co Ltd
SF Tech Co Ltd
Original Assignee
SF Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by SF Technology Co Ltd filed Critical SF Technology Co Ltd
Priority to CN201811526027.9A priority Critical patent/CN111325370A/en
Publication of CN111325370A publication Critical patent/CN111325370A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311Scheduling, planning or task assignment for a person or group
    • G06Q10/063114Status monitoring or status determination for a person or group
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (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)

Abstract

The application discloses a dispatch task allocation method, a device, equipment and a storage medium, wherein the method comprises the following steps: obtaining a statistical result of a unit area to which a dispatch address of an express to be processed belongs; the unit area is obtained by dividing a distribution range area of a target mesh point; determining a member dispatching member capable of newly adding a member dispatching task according to the real-time state information of the target website member dispatching member; determining the distribution scheme of the to-be-processed express according to the statistical result and the real-time state information of the dispatchers of the newly-added dispatch tasks; and sending the task information of the to-be-processed express to a corresponding dispatcher who can add a dispatch task newly according to the distribution scheme. The method can realize scientific allocation of tasks and resources, and greatly improves the dispatch efficiency.

Description

Dispatching task allocation method, device, equipment and storage medium
Technical Field
The invention relates to the technical field of logistics, in particular to a dispatching task allocation method, a dispatching task allocation device, dispatching task allocation equipment and a storage medium.
Background
With the increasing of economic development speed and the rapid development of electronic commerce, the logistics industry has become a new industry with great development prospects and huge market potential, express is taken as an important component of the logistics industry, and increasingly permeates into various fields such as society and economy, and in order to enable the service capacity of the express industry to meet the market demands, the express delivery speed is increased and the express delivery mode is improved.
At present, when express delivery needs to be delivered to each branch from a transfer station, a traditional delivery mode is generally adopted, to-be-processed express is transported to a designated network point from the transfer station, and is manually sorted according to unit areas, and further distributed to delivery personnel corresponding to the unit areas, so that task handover of the to-be-processed express is realized, and delivery operation is completed.
However, due to objective factors such as road conditions and weather, the express arrival time from the transition to each branch is earlier or delayed compared to the planned arrival time, which results in low work efficiency and difficulty in handling many emergency situations, such as: express delivery peak season, service rectification and the like, so that the flexibility is poor.
Disclosure of Invention
In view of the above-mentioned defects or shortcomings in the prior art, it is desirable to provide a dispatch task allocation method, device, apparatus and storage medium, which can reasonably allocate dispatch tasks and improve dispatch efficiency.
In a first aspect, the present invention provides a dispatch task allocation method, including:
obtaining a statistical result of a unit area to which a dispatch address of an express to be processed belongs; the unit area is obtained by dividing a distribution range area of a target mesh point;
determining a member dispatching member capable of newly adding a member dispatching task according to the real-time state information of the target website member dispatching member;
determining the distribution scheme of the to-be-processed express according to the statistical result and the real-time state information of the dispatchers of the newly-added dispatch tasks;
and sending the task information of the to-be-processed express to a corresponding dispatcher who can add a dispatch task newly according to the distribution scheme.
In one embodiment, obtaining a statistical result of a unit area to which a dispatch address of an express to be processed belongs includes:
determining longitude and latitude information of a delivery address of each express to be processed;
determining a unit area to which a delivery address of each express to be processed belongs according to the longitude and latitude information;
in one embodiment, determining a dispatch member capable of adding a new dispatch task according to real-time state information of a target website dispatch member includes:
acquiring real-time state information of a target website dispatch member; the real-time status information includes: the current position information of the dispatching personnel and the number of tasks to be received and dispatched are obtained;
based on the current position information of the dispatching members and the number of tasks to be received and dispatched, the dispatching members meeting preset conditions are screened from the dispatching members of the target network points, and the dispatching members are determined to be the dispatching members capable of newly adding the dispatching tasks; the preset condition is that the number of tasks to be received and dispatched on the dispatching shift and within the preset range of the current position is zero.
In one embodiment, determining the allocation scheme of the to-be-processed express according to the statistical result and the real-time status information of the dispatchers of the newly-added dispatch tasks includes:
the following operations are respectively executed for each piece of express to be processed:
determining a dispatcher closest to the designated connection point from the dispatchers of the newly added dispatch task according to the statistical result and the real-time state data of the dispatchers of the newly added dispatch task; the designated connection point is a connection point corresponding to a unit area to which the delivery address of the current express to be processed belongs;
and distributing the current to-be-processed express item to the dispatcher closest to the specified junction.
In one embodiment, the statistical result further includes: the number of the to-be-processed express items corresponding to each unit area and the time period of the to-be-processed express items which are expected to reach the target network point are determined;
the method further comprises the following steps:
and determining the delivery time period of each delivery member capable of newly adding the delivery task according to the estimated time period of the to-be-processed express delivery reaching the target network point and the time of the delivery member capable of newly adding the delivery task to the nearest connection point.
In a second aspect, an embodiment of the present invention provides a dispatch task allocation apparatus, where the apparatus includes:
the acquisition module is used for acquiring the statistical result of the unit area to which the dispatching address of the express to be processed belongs; the unit area is obtained by dividing a distribution range area of a target mesh point;
the dispatcher determining module is used for determining dispatchers capable of newly adding dispatch tasks according to the real-time state information of the target website dispatchers;
the distribution scheme determining module is used for determining the distribution scheme of the to-be-processed express according to the statistical result and the real-time state information of the dispatchers of the newly-added dispatch tasks;
and the sending module is used for sending the task information of the to-be-processed express to a corresponding dispatcher who can add a dispatch task newly according to the distribution scheme.
In one embodiment, the dispatcher determination module comprises:
the acquisition unit is used for acquiring real-time state information of the target website dispatch; the real-time status information includes: the current position information of the dispatching personnel and the number of tasks to be received and dispatched are obtained;
the screening unit is used for screening the dispatching members which do not meet a first preset condition from the dispatching members of the target network point based on the current position information of the dispatching members and the number of tasks to be received and dispatched, and determining the dispatching members as the dispatching members capable of newly adding the dispatching tasks; the first preset condition is that the number of tasks to be completed and dispatched, which are not in the in-taking and dispatching shift and in the dispatching and dispatching shift and are within the preset range of the current position of the dispatching member, is greater than zero.
In one embodiment, the allocation scheme determining module is configured to:
the following operations are respectively executed for each piece of express to be processed:
determining a dispatcher closest to the designated connection point from the dispatchers of the newly added dispatch task according to the statistical result and the real-time state data of the dispatchers of the newly added dispatch task; the designated connection point is a connection point corresponding to a unit area to which the delivery address of the current express to be processed belongs;
and distributing the current to-be-processed express item to the dispatcher closest to the specified junction.
In a third aspect, an embodiment of the present invention provides a computer device, including a memory and a processor, where the memory stores a computer program, and the processor implements the dispatch task allocation method when executing the computer program.
In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the dispatch task allocation method described above.
The dispatch task allocation method, device, equipment and storage medium provided by the embodiment of the invention are used for obtaining the statistical result of the unit area to which the dispatch address of the express to be processed belongs, determining the dispatcher capable of newly adding the dispatch task according to the real-time state information of the dispatcher at the target network point, further determining the allocation scheme of the express to be processed according to the statistical result and the real-time state information of the dispatcher capable of newly adding the dispatch task, and sending the task information of the express to be processed to the corresponding dispatcher capable of newly adding the dispatch task according to the allocation scheme. According to the technical scheme, the tasks are automatically matched with the dispatching personnel, so that the work tasks of the dispatching personnel are clearer and simpler, the tasks can be distributed more optimally through scientific matching of the tasks and the dispatching personnel, the efficiency of task distribution is improved to a great extent, reasonable matching of workload of the personnel is achieved, and dispatching efficiency is further improved.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a schematic flow chart of a dispatch task allocation method according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart illustrating a process of obtaining a statistical result of a unit area of an express to be processed according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating a process of determining a dispatcher who can add a new dispatch task according to an embodiment of the present invention;
FIG. 4 is a schematic flow chart illustrating a distribution scheme for each to-be-processed express item according to an embodiment of the present invention;
FIG. 5 is a schematic structural diagram of a dispatch task assignment device according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
As mentioned in the background art, the logistics industry is rapidly developed, logistics enterprises generally feel great potential effect and intense competition situation of information technology along with the continuous acceleration of logistics informatization process, in order to enable the service capacity of the express industry to meet the market demand, the dispatch allocation formula needs to be greatly improved, the number of shifts to each subsection or business department in the existing mode is fixed, a courier works according to the fixed dispatch shifts, the specific process is that after a courier arrives at a target unit area from a transfer center, the traditional dispatch mode is adopted, the courier divides a courier to be processed according to the unit area and distributes the courier to the corresponding unit area for task handover, and then dispatch operation is completed. However, due to different objective factors such as road conditions and weather, vehicles transiting to various network points often make a shift from the scheduled arrival time to the network points earlier or delayed, which leads to work efficiency of dispatching in subsequent processes, and the fixed dispatching mode needs to strictly execute a scheduling list to a certain extent, and is difficult to deal with various emergency situations, such as rush hours, service rectification and the like, which leads to poor flexibility and low dispatching efficiency.
Based on the defects, the embodiment of the invention provides a dispatch task allocation method, which determines an allocation scheme of an express to be processed according to a statistical result of a unit area to which a dispatch address of the express to be processed belongs and real-time state information of a dispatcher who can newly add a dispatch task, and further realizes that task information of the express to be processed is sent to the corresponding dispatcher who can newly add the dispatch task in advance.
The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
It should be noted that the execution subject of the following method embodiments may be a dispatch task assigning apparatus, which may be implemented as part or all of a terminal device by software, hardware, or a combination of software and hardware. The execution subjects of the method embodiments described below are described taking a computer device as an example.
Fig. 1 is a schematic flow chart of a dispatch task allocation method according to an embodiment of the present invention, and as shown in fig. 1, the method includes:
s101, obtaining a statistical result of a unit area to which a dispatch address of an express to be processed belongs; the unit area is obtained by dividing the distribution range area of the target mesh point.
Specifically, when the to-be-processed express mail is delivered to different websites from a transfer station, the to-be-processed express mail can be scanned by a bargun to obtain data information corresponding to the to-be-processed express mail, so that the statistical result of the to-be-processed express mail of the batch is updated in the system.
It should be noted that the statistical result may include, in addition to the unit region to which the delivery address of the to-be-processed express belongs, the number of to-be-processed express corresponding to each unit region and a time period in which the to-be-processed express is expected to reach the target site, where the unit region is a region obtained by dividing according to the delivery range region of the target site, and the number of unit regions corresponding to the target site may be multiple; the time period of the express to be processed which is expected to reach the target network point can be determined according to the starting time, the starting address and the address of the target network point of the express to be processed, wherein the distance of the express to be processed can be obtained through the starting address and the address of the target network point, and the time period of the express to be processed which is expected to reach the target network point is obtained according to the starting time.
In general, a target site may be divided into 30 unit areas according to distribution ranges, and each unit area may be an area in which two or three buildings are located.
Optionally, as an implementation manner of step S101, as shown in fig. 2, the method includes:
s201, determining longitude and latitude information of a dispatch address of each express to be processed.
S202, determining a unit area to which the delivery address of each express to be processed belongs according to the longitude and latitude information.
Specifically, the to-be-processed express mails can be scanned through a bargun to obtain dispatch addresses of the to-be-processed express mails, the dispatch addresses are subjected to address coding to obtain corresponding longitude and latitude information, the obtained longitude and latitude information is subjected to mapping processing in map software, and therefore the unit area to which the dispatch address of each to-be-processed express mail belongs is determined.
Furthermore, after the unit area to which the delivery address of each to-be-processed express belongs is determined, the number of to-be-processed express corresponding to each unit area can be determined.
It should be noted that after obtaining the cell area to which the dispatch address of the to-be-processed dispatch belongs, the number of to-be-processed dispatches corresponding to each cell area, and the expected time period of arrival at the target site of the to-be-processed dispatch, statistical processing is performed on the above data, so as to obtain a statistical result, where the statistical result may be represented in a form of a table or a graphic, for example, in a form of a table as follows:
Figure BDA0001904472400000071
according to the method for obtaining the statistical result of the to-be-processed express mails, the longitude and latitude information of the dispatch address of the to-be-processed express mail is determined, so that the unit area to which the dispatch address of the to-be-processed express mail belongs is accurately determined, the number of the to-be-processed express mails corresponding to each unit area and the expected time of arriving at a target network point are further determined, the dispatch condition of the batch of the to-be-processed express mails can be clearly and visually displayed, and the subsequent further distribution operation of the to-be-processed express mails is facilitated.
S102, determining the dispatching member capable of adding the dispatching task according to the real-time state information of the target website dispatching member.
Specifically, the real-time state information of the target website dispatch member may include the current number of tasks of receiving and dispatching the member and the current position of the member dispatching member, and the real-time state information of the target website dispatch member may be analyzed and processed to determine the member dispatching member capable of newly adding the dispatch task.
Optionally, as an implementable manner of step S102, the method includes:
s301, acquiring real-time state information of a target website dispatcher; the real-time status information includes: the current position information of the dispatching personnel and the number of the tasks to be completed and dispatched.
Specifically, the system can directly track and position the target website dispatch personnel in real time by aiming at the dispatch personnel in the target website, so that the current position information of the target website dispatch personnel is obtained, the quantity of the receiving and dispatching tasks of each dispatch personnel is tracked in real time through the system, and the real-time state information of the target website dispatch personnel is obtained.
S302, based on the current position information of the dispatching members and the number of tasks to be received and dispatched, the dispatching members meeting preset conditions are screened out from the dispatching members of the target network point, and the dispatching members are determined to be the dispatching members capable of newly adding the dispatching tasks; the preset condition is that the number of tasks to be received and dispatched is not required to be completed within a preset range of the current position on the dispatching shift.
Specifically, after the current position information of the dispatching member and the number of tasks to be received and dispatched are obtained, the data can be dynamically matched through calculation, and the dispatching member which meets preset conditions and can newly add the dispatching task is screened out from the dispatching members on the current scheduling shift of the target network point, wherein the preset conditions are that the dispatching members have no tasks to be received and dispatched within a preset range of the current position on the dispatching shift and the scheduling shift.
The system can acquire a current receiving and dispatching list of a target network point and a dispatcher list on the current dispatching list in real time, and does not distribute a new dispatching task to dispatchers on the receiving and dispatching list; for a dispatching member on a current dispatching work schedule of a target network point, checking the current position information of the dispatching member, monitoring whether the dispatching member still needs to finish a task within a preset range of the current position, and if the dispatching member still needs to finish the task within the preset range, not distributing a new dispatching task, wherein the preset range can be a circular area with the current position as the center and the radius within 100 meters; and the dispatching personnel on other dispatching shift shifts are listed in a dispatching personnel list capable of adding a dispatching task, namely, the dispatching personnel can go to the connecting point directly to take the added dispatching.
It should be noted that, the order list and some of the dispatchers on the order list may be the same or different, and generally, if there are fewer receiving tasks, the dispatchers on the order list may execute the receiving tasks.
According to the embodiment, the real-time state information of the target website dispatchers is obtained in real time, so that the dispatcher list of the newly added tasks can be accurately determined, resources are utilized to the maximum extent, the behavior management of the employee receiving and dispatching links is perfected, and the reasonable distribution of the tasks is further realized.
S103, determining the distribution scheme of the to-be-processed express according to the statistical result and the real-time state information of the dispatchers which can newly add the dispatch task.
Specifically, after the statistical result and the real-time state information of the dispatching member capable of newly adding the dispatching task are obtained, the batch of to-be-processed express items can be matched with the dispatching member capable of newly adding the dispatching task, and therefore the distribution scheme of the to-be-processed express items is determined.
Optionally, as an implementation manner of the step S103, referring to fig. 4, the following operations may be respectively performed for each to-be-processed express item:
s401, determining a dispatcher closest to the specified connection point from the dispatchers of the newly added dispatch tasks according to the statistical result and the real-time state data of the dispatchers of the newly added dispatch tasks; and the designated connection point is a connection point corresponding to the unit area to which the dispatch address of the current express to be processed belongs.
S402, distributing the current to-be-processed express to the deliverer closest to the specified junction.
It should be noted that, in the process of processing the to-be-processed express mail, after some express mails need to reach the target network point, the to-be-processed express mails are transported to the connection point for further dispatch processing, at this time, a dispatcher needs to go to the connection point to pick up a new dispatch task, after the dispatcher who can have the new dispatch task is determined, the current position information of each dispatcher is obtained, the connection point closest to the dispatcher is determined according to the connection point corresponding to the unit area to which the dispatch address of the to-be-processed express mail belongs, and the time of the dispatcher predicting to reach the connection point is further calculated according to the current position of the dispatcher and the closest connection point position.
Optionally, after the dispatching member receives the new tasks distributed by the system, it may also autonomously select whether to receive the new dispatching task, or autonomously select the number of receivable new dispatching tasks, and when the dispatching member cannot process the new dispatching task amount, after releasing the new tasks that are not processed, the system will continue to match the next dispatching member closest to the designated access point, and distribute the remaining new dispatching tasks to the next dispatching member, thereby implementing reasonable distribution of dispatching tasks.
Optionally, the real-time task information of the dispatch member that can add the dispatch task may be counted to obtain the following table:
Figure BDA0001904472400000091
furthermore, the delivery time period of each delivery member capable of newly adding the delivery task can be determined according to the time period of the to-be-processed express item expected to reach the target network point and the time of the delivery member capable of newly adding the delivery task to the nearest connection point.
When the express to be processed reaches the target network point, according to the system distribution result, the dispatcher performs dispatch responsibility handover operation on the express which is responsible for dispatching at the appointed place, and the system can regularly match dispatch task data of the current unsuccessfully distributed arrived network point, newly-added task data provided by the transfer station and dispatcher state data, so that the optimal distribution scheme of the current newly-added task is calculated, and the calculation distribution can be performed on the residual newly-added dispatch tasks in the next cycle time.
Illustratively, when the time period of the to-be-processed express delivery to the target network point is estimated to be 14: 00-14: 15, and the time period of the dispatch member to reach the connection point is estimated to be 15 minutes, assuming that the time period of the to-be-processed express delivery to reach the connection point from the target network point is also 15 minutes and is asynchronous with the time period of the dispatch member to reach the connection point, the delivery time period of each newly-added dispatch task is 14: 30-14: 45.
Optionally, newly added dispatch task information of a dispatcher who can newly add a dispatch task may be counted to obtain a newly added task list as follows:
shop number Connecting point for taking parts Number of newly added tasks Time of taking out
0001 Connection point 1 7 14:30–14:45
…… …… …… ……
And S104, sending the task information of the to-be-processed express to a corresponding dispatcher who can add a dispatch task according to the distribution scheme.
Specifically, after statistical analysis is performed on the dispatching member of each newly-added dispatching task, information of each newly-added task can be sent to the corresponding dispatching member of the newly-added dispatching task according to a newly-added task list, wherein the information of the newly-added task includes a newly-added task list number, a distribution address and the like.
The dispatch task allocation method, device, equipment and storage medium provided by the embodiment of the invention are used for obtaining the statistical result of the unit area to which the dispatch address of the express to be processed belongs, determining the dispatcher capable of newly adding the dispatch task according to the real-time state information of the dispatcher at the target network point, further determining the allocation scheme of the express to be processed according to the statistical result and the real-time state information of the dispatcher capable of newly adding the dispatch task, and sending the task information of the express to be processed to the corresponding dispatcher capable of newly adding the dispatch task according to the allocation scheme. According to the technical scheme, the tasks are automatically matched with the dispatching personnel, so that the work tasks of the dispatching personnel are clearer and simpler, the tasks can be distributed more optimally through scientific matching of the tasks and the dispatching personnel, the efficiency of task distribution is improved to a great extent, reasonable matching of workload of the personnel is achieved, and dispatching efficiency is further improved.
It should be noted that while the operations of the method of the present invention are depicted in the drawings in a particular order, this does not require or imply that the operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Rather, the steps depicted in the flowcharts may change the order of execution. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
Fig. 5 is a schematic structural diagram of a dispatch task allocation device according to an embodiment of the present invention. As shown in fig. 5, the apparatus may implement the methods shown in fig. 1 to 4, and may include:
the acquiring module 10 is configured to acquire a statistical result of a unit area to which a dispatch address of an express to be processed belongs; the unit area is obtained by dividing a distribution range area of a target mesh point;
the dispatcher determining module 20 is used for determining dispatchers capable of newly adding dispatch tasks according to the real-time state information of the target website dispatchers;
the distribution scheme determining module 30 is configured to determine a distribution scheme of the to-be-processed express mail according to the statistical result and the real-time state information of the dispatch member that can newly add the dispatch task;
and the sending module 40 is configured to send the task information of the to-be-processed express to a corresponding dispatcher who can add a dispatch task newly according to the allocation scheme.
Preferably, the obtaining module 10 may include:
a latitude and longitude information determining unit 101, configured to determine latitude and longitude information of a dispatch address of each to-be-processed express;
and the unit area determining unit 102 is configured to determine, according to the latitude and longitude information, a unit area to which a dispatch address of each to-be-processed express belongs.
Preferably, the dispatcher determination module 20 may include:
the acquiring unit 201 is configured to acquire real-time state information of a target website dispatcher; the real-time status information includes: the current position information of the dispatching personnel and the number of tasks to be received and dispatched are obtained;
the screening unit 202 is configured to screen a dispatch meeting a preset condition from dispatchers of the target website based on the current position information of the dispatch and the number of tasks to be received and dispatched, and determine that the dispatch meeting the preset condition is a dispatch meeting a newly added dispatch task; the preset condition is that no task to be received and dispatched is completed within a preset range of the current position on the dispatching shift.
Preferably, the allocation scheme determining module 30 is configured to:
the following operations are respectively executed for each piece of express to be processed:
determining a dispatcher closest to the designated connection point from the dispatchers of the newly added dispatch task according to the statistical result and the real-time state data of the dispatchers of the newly added dispatch task; the designated connection point is a connection point corresponding to a unit area to which the delivery address of the current express to be processed belongs;
and distributing the current to-be-processed express item to the dispatcher closest to the specified junction.
Preferably, the statistical result further includes: the number of the to-be-processed express items corresponding to each unit area and the time period of the to-be-processed express items expected to reach the target network point.
The device is used for determining the delivery time period of each delivery member capable of newly adding the delivery task according to the time period of the to-be-processed express item expected to reach the target network point and the time of the delivery member capable of newly adding the delivery task to the nearest connection point.
The dispatch task allocation apparatus provided in this embodiment may implement the embodiments of the method described above, and the implementation principle and the technical effect are similar, which are not described herein again.
Fig. 6 is a schematic structural diagram of a computer device according to an embodiment of the present invention. As shown in fig. 6, a schematic structural diagram of a computer system 600 suitable for implementing the terminal device or the server of the embodiment of the present application is shown.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM603, various programs and data necessary for the operation of the system 600 are also stored. The CPU601, ROM602, and RAM603 are connected to each other via a bus 604. An input/output (I/O) interface 606 is also connected to bus 604.
The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 606 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 as necessary.
In particular, the processes described above with reference to fig. 1-4 may be implemented as computer software programs, according to embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing the method of fig. 1-4. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, and may be described as: a processor includes an acquisition module, a dispatcher determination module, a distribution scheme determination module, and a sending module. The names of the units or modules do not form a limitation on the units or modules in some cases, for example, the obtaining module may also be described as "obtaining a statistical result of a unit area to which the dispatch address of the to-be-processed express belongs; the unit area is obtained by dividing a distribution range area of a target halftone dot.
As another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the foregoing device in the foregoing embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the dispatch task assignment methodology described herein.
In summary, the dispatch task allocation method, device, equipment and storage medium provided in the embodiments of the present invention obtain a statistical result of a unit area to which a dispatch address of an express to be processed belongs, determine a dispatcher who can newly add a dispatch task according to real-time status information of a dispatcher at a target site, further determine an allocation scheme of the express to be processed according to the statistical result and the real-time status information of the dispatcher who can newly add the dispatch task, and send task information of the express to be processed to the corresponding dispatcher who can newly add the dispatch task according to the allocation scheme. According to the technical scheme, the tasks are automatically matched with the dispatching personnel, so that the work tasks of the dispatching personnel are clearer and simpler, the tasks can be distributed more optimally through scientific matching of the tasks and the dispatching personnel, the efficiency of task distribution is improved to a great extent, reasonable matching of workload of the personnel is achieved, and dispatching efficiency is further improved.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by a person skilled in the art that the scope of the invention as referred to in the present application is not limited to the embodiments with a specific combination of the above-mentioned features, but also covers other embodiments with any combination of the above-mentioned features or their equivalents without departing from the inventive concept. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims (10)

1. A dispatch task allocation method, comprising:
obtaining a statistical result of a unit area to which a dispatch address of an express to be processed belongs; the unit area is obtained by dividing a distribution range area of a target mesh point;
determining a member dispatching member capable of newly adding a member dispatching task according to the real-time state information of the target website member dispatching member;
determining the distribution scheme of the to-be-processed express according to the statistical result and the real-time state information of the dispatchers of the newly-added dispatch tasks;
and sending the task information of the to-be-processed express to a corresponding dispatcher who can add a dispatch task newly according to the distribution scheme.
2. The dispatch task allocation method of claim 1, wherein obtaining statistics of unit areas to which dispatch addresses of dispatches to be processed belong comprises:
determining longitude and latitude information of a delivery address of each express to be processed;
and determining the unit area to which the delivery address of each express to be processed belongs according to the longitude and latitude information.
3. The dispatch task allocation method of claim 1, wherein determining a dispatcher who can add a new dispatch task based on real-time status information of a target site dispatcher comprises:
acquiring real-time state information of a target website dispatch member; the real-time status information includes: the current position information of the dispatching personnel and the number of tasks to be received and dispatched are obtained;
based on the current position information of the dispatching members and the number of tasks to be received and dispatched, the dispatching members meeting preset conditions are screened from the dispatching members of the target network points, and the dispatching members are determined to be the dispatching members capable of newly adding the dispatching tasks; the preset condition is that no task to be received and dispatched is completed within a preset range of the current position on the dispatching shift.
4. The dispatch task allocation method of claim 1, wherein determining the allocation scheme of the to-be-processed dispatch according to the statistical result and the real-time status information of dispatchers of the newly-added dispatch task comprises:
the following operations are respectively executed for each piece of express to be processed:
determining a dispatcher closest to the designated connection point from the dispatchers of the newly added dispatch task according to the statistical result and the real-time state data of the dispatchers of the newly added dispatch task; the designated connection point is a connection point corresponding to a unit area to which the delivery address of the current express to be processed belongs;
and distributing the current to-be-processed express item to the dispatcher closest to the specified junction.
5. The dispatch task allocation method of claim 4, wherein the statistical result further comprises: the number of the to-be-processed express items corresponding to each unit area and the time period of the to-be-processed express items which are expected to reach the target network point are determined;
the method further comprises the following steps:
and determining the delivery time period of each delivery member capable of newly adding the delivery task according to the estimated time period of the to-be-processed express delivery reaching the target network point and the time of the delivery member capable of newly adding the delivery task to the nearest connection point.
6. A dispatch task assignment device, the device comprising:
the acquisition module is used for acquiring the statistical result of the unit area to which the dispatching address of the express to be processed belongs; the unit area is obtained by dividing a distribution range area of a target mesh point;
the dispatcher determining module is used for determining dispatchers capable of newly adding dispatch tasks according to the real-time state information of the target website dispatchers;
the distribution scheme determining module is used for determining the distribution scheme of the to-be-processed express according to the statistical result and the real-time state information of the dispatchers of the newly-added dispatch tasks;
and the sending module is used for sending the task information of the to-be-processed express to a corresponding dispatcher who can add a dispatch task newly according to the distribution scheme.
7. The dispatch task assignment device of claim 6, wherein the dispatcher determination module comprises:
the acquisition unit is used for acquiring real-time state information of the target website dispatch; the real-time status information includes: the current position information of the dispatching personnel and the number of tasks to be received and dispatched are obtained;
the screening unit is used for screening the dispatching members which do not meet a first preset condition from the dispatching members of the target network point based on the current position information of the dispatching members and the number of tasks to be received and dispatched, and determining the dispatching members as the dispatching members capable of newly adding the dispatching tasks; the first preset condition is that the number of tasks to be completed and dispatched, which are not in the in-taking and dispatching shift and in the dispatching and dispatching shift and are within the preset range of the current position of the dispatching member, is greater than zero.
8. The dispatch task allocation device of claim 6, wherein the allocation plan determination module is to:
the following operations are respectively executed for each piece of express to be processed:
determining a dispatcher closest to the designated connection point from the dispatchers of the newly added dispatch task according to the statistical result and the real-time state data of the dispatchers of the newly added dispatch task; the designated connection point is a connection point corresponding to a unit area to which the delivery address of the current express to be processed belongs;
and distributing the current to-be-processed express item to the dispatcher closest to the specified junction.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method according to any of claims 1-5 when executing the program.
10. A computer-readable storage medium having stored thereon a computer program for:
the computer program, when executed by a processor, implementing the method of any one of claims 1-5.
CN201811526027.9A 2018-12-13 2018-12-13 Dispatching task allocation method, device, equipment and storage medium Pending CN111325370A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811526027.9A CN111325370A (en) 2018-12-13 2018-12-13 Dispatching task allocation method, device, equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811526027.9A CN111325370A (en) 2018-12-13 2018-12-13 Dispatching task allocation method, device, equipment and storage medium

Publications (1)

Publication Number Publication Date
CN111325370A true CN111325370A (en) 2020-06-23

Family

ID=71168408

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811526027.9A Pending CN111325370A (en) 2018-12-13 2018-12-13 Dispatching task allocation method, device, equipment and storage medium

Country Status (1)

Country Link
CN (1) CN111325370A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112488195A (en) * 2020-11-30 2021-03-12 上海寻梦信息技术有限公司 Party delivery identification method, device, equipment and storage medium
CN112508474A (en) * 2020-11-19 2021-03-16 深圳市智莱科技股份有限公司 Express delivery method and express cabinet system
CN113469575A (en) * 2021-07-23 2021-10-01 拉扎斯网络科技(上海)有限公司 User scheduling method and device in distribution scene, electronic equipment and storage medium
CN113627752A (en) * 2021-07-26 2021-11-09 苏州巴涛信息科技有限公司 Express logistics management method and system based on block chain technology

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108629532A (en) * 2017-10-31 2018-10-09 淄博职业学院 A kind of waybill management method pulled during sending express mail
CN108960722A (en) * 2018-06-28 2018-12-07 上海中通吉网络技术有限公司 Logistics receipts send part dispatching method and device

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108629532A (en) * 2017-10-31 2018-10-09 淄博职业学院 A kind of waybill management method pulled during sending express mail
CN108960722A (en) * 2018-06-28 2018-12-07 上海中通吉网络技术有限公司 Logistics receipts send part dispatching method and device

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
李文斌等: "矿井移动目标安全监控原理及关键技术", 华中科技大学出版社, pages: 208 - 210 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112508474A (en) * 2020-11-19 2021-03-16 深圳市智莱科技股份有限公司 Express delivery method and express cabinet system
CN112508474B (en) * 2020-11-19 2024-01-19 深圳市智莱科技股份有限公司 Express delivery method and express cabinet system
CN112488195A (en) * 2020-11-30 2021-03-12 上海寻梦信息技术有限公司 Party delivery identification method, device, equipment and storage medium
CN112488195B (en) * 2020-11-30 2024-04-19 上海寻梦信息技术有限公司 Method, device, equipment and storage medium for identifying dispatch of dispatcher
CN113469575A (en) * 2021-07-23 2021-10-01 拉扎斯网络科技(上海)有限公司 User scheduling method and device in distribution scene, electronic equipment and storage medium
CN113469575B (en) * 2021-07-23 2023-09-22 拉扎斯网络科技(上海)有限公司 User scheduling method and device in distribution scene, electronic equipment and storage medium
CN113627752A (en) * 2021-07-26 2021-11-09 苏州巴涛信息科技有限公司 Express logistics management method and system based on block chain technology

Similar Documents

Publication Publication Date Title
CN111325370A (en) Dispatching task allocation method, device, equipment and storage medium
CN107437144B (en) Order scheduling method, system, computer equipment and storage medium
CN108171452B (en) Express delivery point addressing method and device
CN110245791B (en) Order processing method and system
CN111191920A (en) Large-scale ground resource scheduling method and device
CN110070289B (en) Task allocation method, device, equipment and storage medium
CN103020755A (en) Staff dispatching system
CN101483601A (en) Scheduling method and apparatus based on service priority
CN110097226A (en) A kind of resource regulating method, system, electronic equipment and readable storage medium storing program for executing
Sharma et al. Queueing theory appr oach with queueing model: A study
CN111353663A (en) Task allocation method, device, equipment and storage medium thereof
CN115239223A (en) Allocation center task scheduling method, device, equipment and storage medium
CN115862823B (en) Intelligent scheduling method and system for equipment based on mobile network
CN112381418A (en) Case allocation method, device, equipment and storage medium
CN111105137A (en) Work order distribution method, device, medium and electronic equipment
CN112184092A (en) Logistics node determination method, device, server and storage medium
CN109300335B (en) Flight time exchange system and method
CN112651673A (en) Resource planning method and related equipment
CN111724089B (en) Order receiving and dispatching distribution method, system, terminal and storage medium
CN113283830B (en) Method, device, equipment and computer readable medium for generating waybill information sequence
CN115204849A (en) Enterprise human resource management method and system based on artificial intelligence
CN113222671A (en) Working platform cost evaluation method based on human resources
CN111445053B (en) Labor requirement information processing method and device and electronic equipment
CN111915119A (en) Task distribution method and device
Dong et al. Modelling and implementation of manufacturing direct labour allocation: a case study in semiconductor production operations

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20200623