CN115438826A - Path planning method and device - Google Patents

Path planning method and device Download PDF

Info

Publication number
CN115438826A
CN115438826A CN202110620169.7A CN202110620169A CN115438826A CN 115438826 A CN115438826 A CN 115438826A CN 202110620169 A CN202110620169 A CN 202110620169A CN 115438826 A CN115438826 A CN 115438826A
Authority
CN
China
Prior art keywords
task
tail box
distributed
early
tasks
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
CN202110620169.7A
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.)
Beijing Ruidanjin Road Technology Co ltd
Original Assignee
Beijing Ruidanjin Road 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 Beijing Ruidanjin Road Technology Co ltd filed Critical Beijing Ruidanjin Road Technology Co ltd
Priority to CN202110620169.7A priority Critical patent/CN115438826A/en
Publication of CN115438826A publication Critical patent/CN115438826A/en
Pending legal-status Critical Current

Links

Images

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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • 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
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/02—Banking, e.g. interest calculation or account maintenance

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Theoretical Computer Science (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Finance (AREA)
  • Quality & Reliability (AREA)
  • Accounting & Taxation (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Technology Law (AREA)
  • Computer And Data Communications (AREA)

Abstract

According to the method, after the escort task group is obtained, the escort tasks in the escort task group are divided into the early tail box task group, the late tail box task group and the non-tail box task group according to the preset classification rule, and then the escort tasks in the early tail box task group, the late tail box task group and the non-tail box task group are distributed to all lines to be distributed.

Description

Path planning method and device
Technical Field
The invention relates to the technical field of computers, in particular to a path planning method and a path planning device.
Background
In the financial industry, an escort company signs escort contracts with a plurality of banks, escorts cash, precious metals and important certificates among subordinates of the banks, branches or self-service equipment, and if the escorts are respectively carried out, the loss of manpower and material resources is caused, so that the escort company needs to carry out unified path planning on escort tasks among the banks.
In the prior art, route planning is generally performed by service personnel of escort companies. However, as the banking industry starts to implement regional management, the number of banks involved in path planning increases, and the complexity of path planning further increases. On the basis, the artificial path planning cannot support the future business scale, and meanwhile, after the escort task is temporarily inserted, the artificial path planning cannot be adjusted globally.
Disclosure of Invention
In view of this, embodiments of the present invention provide a path planning method and an apparatus, by which a path with high complexity can be planned, and a temporary escort task can be inserted into a planned route and global adjustment can be performed.
In a first aspect, an embodiment of the present invention provides a path planning method, where the method includes:
acquiring an escort task group;
classifying escorting tasks in the escorting task group into an early tail box task group, a late tail box task group and a non-tail box task group according to a preset classification rule;
allocating the early tail box tasks in the early tail box task group to each line to be allocated according to a first allocation rule;
allocating the late tail box tasks in the late tail box task group to each line to be allocated;
distributing the non-trunk tasks in the non-trunk task group to each line to be distributed;
wherein the early tail box task in the early tail box task group corresponds to the late tail box task in the late tail box task group;
the early-tail box task is a morning-tail box money delivering task, and the late-tail box task is an evening-tail box money receiving task.
Further, before obtaining the escorting task group, the method further comprises the following steps:
acquiring all escorting tasks from a task database;
dividing all the escorting tasks into a plurality of escorting task groups according to a preset grouping rule;
merging escort tasks with the same delivery time and the same network points in each escort task group;
wherein, according to a predetermined grouping rule, dividing all the escorting tasks into a plurality of escorting task groups comprises:
and dividing the escorting tasks into a plurality of escorting task groups according to at least one of the ownership of the warehouse of the escorting tasks, the area of the network points or the escorting task merging rules of different service objects.
Further, the classifying escorting tasks in the escorting task group into an early-tail box task group, a late-tail box task group and a non-tail box task group according to a preset classification rule includes:
classifying escorting tasks in the escorting task group into a trunk task group and a non-trunk task group according to escorting categories;
classifying escort tasks in the tail box task group into the early tail box task and the late tail box task according to escort attributes;
forming a data set by escorting tasks in the escorting task group;
wherein the data set comprises at least: the network points corresponding to each escort task, the delivery time, the storage home, the area where the network points are located and the different service objects after combination.
Further, the allocating the early tail box task in the early tail box task group to each line according to a first allocation rule includes:
and executing the following steps in an iterative mode until all the early-tail box tasks in the early-tail box task group are completely distributed:
creating a line to be distributed;
allocating the early-tail box task to the currently created line to be allocated according to a first allocation rule;
moving the allocated early-tail box task out of the early-tail box task group;
wherein the allocating the early-tail box task to the currently created line to be allocated according to the first allocation rule comprises:
selecting at least one early-tail box task from the early-tail box task group according to the sequence of delivery time;
determining a target early tail box task from the selected early tail box tasks;
responding to the first early-tail box task allocation of the current line to be allocated, and allocating the target early-tail box task to the current line to be allocated;
responding to the fact that the current line to be distributed is not distributed with the first early-tail box task, and the required distance time from the target early-tail box task network point to the last early-tail box task network point is smaller than the arrival time difference between the target early-tail box task and the last early-tail box task, and distributing the target early-tail box task to the current line to be distributed;
wherein the determining a target early-tail box task from the selected early-tail box tasks comprises:
in response to the fact that a plurality of early-tail box tasks are selected and no early-tail box task is distributed on the current line to be distributed, determining the early-tail box task with the mesh point farthest from the warehouse as the target early-tail box task;
and in response to the fact that the multiple early-tail box tasks are selected and the current line to be distributed is distributed with the early-tail box task, determining the early-tail box task with the mesh point closest to the mesh point of the last early-tail box task as the target early-tail box task.
Further, the allocating late tail box tasks in the late tail box task group to the lines to be allocated includes:
and executing the following steps in an iterative mode until all the late tail box tasks in the late tail box task group are completely distributed:
selecting a line to be distributed which is not subjected to the late boot task distribution from the established lines to be distributed;
selecting a late tail box task corresponding to an allocated early tail box task in the line to be allocated from the late tail box task group;
and distributing the selected late tail box tasks to the currently selected line to be distributed according to the sequence of delivery time.
Further, the allocating the non-trunk tasks in the non-trunk task group to the lines to be allocated includes:
dividing non-boot tasks in the non-boot task group into a non-boot time point task group and a non-boot time period task group according to time limit requirements;
distributing the non-trunk time point tasks in the non-trunk time point task group to each line to be distributed;
and distributing the non-trunk time period tasks in the non-trunk time period task group to each line to be distributed.
Further, the allocating the non-trunk time point tasks in the non-trunk time point task group to the lines to be allocated includes:
executing the following steps in an iterative mode until all the non-tail box time point tasks in the non-tail box time point task group are completely distributed:
selecting a line to be distributed which is not subjected to non-trunk time point task distribution from the established lines to be distributed, wherein if all the lines to be distributed are subjected to non-trunk time point task distribution currently, a new line to be distributed is established, and the newly established line to be distributed is selected;
distributing the non-trunk time point tasks to the currently selected line to be distributed according to a second distribution rule;
moving the allocated non-boot time point tasks out of the non-boot time point task group;
wherein the allocating the non-trunk time point task to the currently selected line to be allocated according to the second allocation rule includes:
selecting at least one non-boot time point task from the non-boot time point task group according to the sequence of delivery time;
determining a first non-trunk time point task from the selected non-trunk time point tasks;
determining the first non-boot time point task as a target non-boot time point task according to actual distribution conditions;
responding to the fact that the delivery time of the target non-trunk time point task is before the preset time and the target non-trunk time point task does not need to return to a warehouse, and distributing the target non-trunk time point task to a current line to be distributed;
responding to the fact that the target non-trunk time point task needs to return to the warehouse, and the time of arriving at a warehouse after the task is completed does not exceed the preset time, and distributing the target non-trunk time point task to a current line to be distributed;
responding to the situation that the delivery time of the target non-tail box time point task is behind a preset time, and the distance time from a network point of the target non-tail box time point task to a network point of a first late tail box task in a current line to be distributed is less than the delivery time difference between the target non-tail box time point task and the first late tail box task, and distributing the target non-tail box time point task to the current line to be distributed;
responding to the situation that the delivery time of the target non-trunk time point task is behind a preset moment and no late trunk task exists in the current line to be distributed, and distributing the target non-trunk time point task to the current line to be distributed;
wherein the determining a first non-tail-box time point task from the selected non-tail-box time point tasks comprises:
in response to the fact that a plurality of non-trunk time point tasks are selected and any non-trunk time point task is distributed on the current line to be distributed, determining the non-trunk time point task with the nearest node to the node of the last non-trunk time point task as the first non-trunk time point task;
in response to the fact that a plurality of non-trunk time point tasks are selected, no non-trunk time point task is distributed to the current line to be distributed, and an early trunk task exists in the current line to be distributed, the non-trunk time point task with the mesh point closest to the mesh point of the early trunk task is determined as the first non-trunk time point task;
in response to the fact that a plurality of non-trunk time point tasks are selected, no non-trunk time point task is distributed to the current line to be distributed, and no early trunk task exists in the current line to be distributed, determining the non-trunk time point task with the nearest network point to the warehouse as the first non-trunk time point task;
wherein determining the first non-boot time point task as the target non-boot time point task according to the actual allocation comprises:
in response to the fact that the current line to be distributed is not distributed with any non-tail box time point task and early tail box task, determining the first non-tail box time point task as a target non-tail box time point task;
responding to the situation that no non-tail box time point task is distributed on the current line to be distributed, an early tail box task is distributed on the current line to be distributed, and the distance time from a network point of the first non-tail box time point task to a network point of the last early tail box task is less than the arrival time difference between the first non-tail box time point task and the last early tail box task, and determining the first non-tail box time point task as a target non-tail box time point task;
and in response to the fact that the current line to be distributed is distributed with a non-trunk time point task, and the distance time from the network point of the first non-trunk time point task to the network point of the last non-trunk time point task is less than the arrival time difference between the first non-trunk time point task and the last non-trunk time point task, determining the first non-trunk time point task as a target non-trunk time point task.
Further, the allocating the non-trunk time period tasks of the non-trunk time period task group to the lines comprises:
executing the following steps in an iterative manner until all the non-tail box time period tasks in the non-tail box time period task group are completely allocated:
selecting a line to be distributed without non-trunk time period task distribution from the lines to be distributed without non-trunk time point tasks, wherein if all the lines to be distributed have non-trunk time period tasks or non-trunk time point tasks, a new line to be distributed is created, and the newly created line to be distributed is selected;
distributing the tasks of the non-trunk time periods to the currently selected line to be distributed according to a third distribution rule;
moving the allocated non-boot time period tasks out of the non-boot time period task group;
wherein, the allocating the non-trunk time period task to the currently selected line to be allocated according to the third allocation rule includes:
confirming a target non-boot time period task from the non-boot time period tasks and calculating delivery time;
responding to the condition that the delivery time is before the preset time and the warehouse does not need to be returned, or the time which needs to be returned but reaches the warehouse is before the preset time, and allocating the target non-trunk time period task to the current line to be allocated;
wherein, confirming the target non-boot time period task from the non-boot time period task and calculating the delivery time comprises:
responding to the fact that no early-tail box task is distributed in the current line to be distributed and is distributed for a first non-tail box time period task, selecting a non-tail box time period task with a net point closest to a warehouse from a non-tail box time period task group as a target non-tail box time period task, and calculating the arrival time;
in response to the fact that the early-tail box task is not distributed in the current line to be distributed and the non-first non-tail box time period task is distributed, selecting the non-tail box time period task with the nearest node to the last non-tail box time period task node from the non-tail box time period task group as a target non-tail box time period task and calculating the arrival time;
responding to the fact that the early-tail box tasks are distributed in the current line to be distributed and are distributed for first-time non-tail box time period tasks, selecting the non-tail box time period task with the mesh point closest to the mesh point of the last early-tail box task from the non-tail box time period task group as a target non-tail box time period task, and calculating the delivery time;
and responding to the fact that the early-tail box task is distributed in the current line to be distributed and the non-first non-tail box time period task is distributed, selecting the non-tail box time period task with the mesh point closest to the mesh point of the last non-tail box time period task from the non-tail box time period task group as a target non-tail box time period task, and calculating the delivery time.
In a second aspect, an embodiment of the present invention provides an electronic device, including a memory and a processor, the memory being configured to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to implement the method according to the first aspect.
In a third aspect, an embodiment of the present invention provides a computer-readable storage medium for storing computer program instructions, which when executed by a processor implement the method according to the first aspect.
According to the method, after the escort task group is obtained, the escort tasks in the escort task group are divided into the early tail box task group, the late tail box task group and the non-tail box task group according to the preset classification rule, and then the escort tasks in the early tail box task group, the late tail box task group and the non-tail box task group are distributed to all lines to be distributed.
Drawings
The above and other objects, features and advantages of the present invention will become more apparent from the following description of the embodiments of the present invention with reference to the accompanying drawings, in which:
fig. 1 is a schematic flow chart of a path planning method according to an embodiment of the present invention;
FIG. 2 is a flow chart illustrating pre-grouping of escort tasks according to an embodiment of the present invention;
FIG. 3 is a schematic flow chart of escort task grouping according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of escort task grouping according to an embodiment of the present invention;
FIG. 5 is a flow chart illustrating early tail box task allocation according to an embodiment of the present invention;
FIG. 6 is a flowchart illustrating a first allocation rule for allocating early tail box tasks according to an embodiment of the present invention;
FIG. 7 is a flow chart illustrating assignment of late boot tasks according to an embodiment of the present invention;
FIG. 8 is a schematic diagram of a line to be distributed according to an embodiment of the present invention;
FIG. 9 is a flow diagram illustrating non-boot task allocation according to an embodiment of the present invention;
FIG. 10 is a flow chart illustrating task allocation at a non-boot time point according to an embodiment of the present invention;
FIG. 11 is a flowchart illustrating a second allocation rule allocating non-tail-box time-point tasks according to an embodiment of the present invention;
FIG. 12 is a flowchart illustrating task allocation for non-boot time periods according to an embodiment of the present invention;
FIG. 13 is a flowchart illustrating a third allocation rule allocating non-boot time period tasks according to an embodiment of the present invention;
fig. 14 is a schematic diagram of an electronic device of an embodiment of the invention.
Detailed Description
The present invention will be described below based on examples, but the present invention is not limited to only these examples. In the following detailed description of the present invention, certain specific details are set forth. It will be apparent to one skilled in the art that the present invention may be practiced without these specific details. Well-known methods, procedures, flows, components and circuits have not been described in detail so as not to obscure the present invention.
Further, those of ordinary skill in the art will appreciate that the drawings provided herein are for illustrative purposes and are not necessarily drawn to scale.
Unless the context clearly requires otherwise, throughout the description, the words "comprise", "comprising", and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is, what is meant is "including, but not limited to".
In the description of the present invention, it is to be understood that the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. In addition, in the description of the present invention, "a plurality" means two or more unless otherwise specified.
Fig. 1 is a schematic flow chart of a path planning method according to an embodiment of the present invention. As shown in fig. 1, the path planning method of this embodiment includes the following steps:
in step S11, a escort task group is acquired from the database.
The escorting task group is a set formed by a plurality of escorting tasks, the escorting tasks are the escorting services of cash, precious metals and important certificates between subordinate branches/self-service equipment of the bank, and the escorting tasks or the escorting task group can be stored in a database.
Specifically, one escort group may be acquired from a plurality of escort groups stored in the database.
In an optional implementation manner, before obtaining the escort task group, all the escort tasks may be grouped in advance, fig. 2 is a schematic flow diagram of the escort task grouping in advance according to an embodiment of the present invention, and as shown in fig. 2, the escort task grouping in advance according to the embodiment includes the following steps:
step S21: and acquiring all escorting tasks from the task database.
Step S22: and dividing all the escorting tasks into a plurality of escorting task groups according to a preset grouping rule.
Step S23: and merging escort tasks with the same delivery time and the same network points in each escort task group.
For step S21, the escort task acquired may be a task that needs to be escorted on the current day.
For step S22, the predetermined grouping rule is a rule for grouping escort tasks belonging to a warehouse, a region where a website is located, or a combination rule of escort tasks of different service objects, and the obtained escort tasks may be classified according to at least one of the rules, where the rule for combining escort tasks of different service objects refers to grouping escort tasks allowed to be combined between different banks into one group, and the website is a place where a branch/self-service device corresponding to the escort task is located.
Specifically, after all the escorting tasks are obtained, all the escorting tasks can be divided into a plurality of escorting task groups according to at least one rule of escorting task combination rules of the storage home attribution, the area where the network points are located or different service objects corresponding to the escorting tasks.
For example: after the tasks needing to be escorted on the same day are obtained from the task database, the escorted tasks using the same storeroom can be divided into a group, the escorted tasks in the same area where the network points are located are divided into a group from the rest escorted tasks, and finally the escorted tasks allowed to be combined among different banks are divided into a group.
Optionally, the obtained escort tasks may be grouped by using a corresponding grouping rule according to an actual situation, which is not limited in this embodiment.
In step S23, after all the escort tasks are divided into a plurality of escort task groups, for each escort task group, escort tasks with the same delivery time and the same delivery time of the escort task group are merged into one escort task, wherein if the escort task corresponds to a self-service device, the escort tasks are not merged.
For example: the escorting task A and the escorting task B are contained in one escorting task group, the delivery time and the delivery time of the escorting task A and the escorting task B are the same as those of the escorting task A and the escorting task B, and the escorting task A and the escorting task B can be combined if the escorting task A and the escorting task B are not self-service equipment.
After merging the different escorting tasks, corresponding marking should be performed on the merged tasks, for example, after merging escorting tasks a and B, a "COMMON" character string may be marked on the dot information of escorting task a or B.
Through the steps S21-S23, the escort tasks of the same day acquired from the database can be divided into different escort task groups in advance, and meanwhile, the network points in the escort task groups and the escort tasks with the same delivery time are merged, so that the system memory occupied in the path planning process can be reduced, and meanwhile, the task distribution is carried out on the basis, the accuracy and the rationality of the path planning can be improved, and the path planning speed is accelerated.
In step S12, the escort tasks in the escort task group are divided into an early tail box task group, a late tail box task group, and a non-tail box task group according to a preset classification rule.
In an alternative implementation, the escort tasks may be grouped by the flow shown in FIG. 3. Fig. 3 is a schematic flow diagram of escort task grouping according to an embodiment of the present invention, and as shown in fig. 3, the escort task grouping according to the embodiment includes the following steps:
step S31: and classifying escorting tasks in the escorting task group into a trunk task group and the non-trunk task group according to the escorting category.
Step S32: classifying escorting tasks in the tail box task group into the early tail box task and the late tail box task according to escorting attributes
In step S33: and forming the escorting tasks in the escorting task group into a data set.
For step S31, the escort category is a category to which escort articles in the escort task belong.
Specifically, fig. 4 is a schematic diagram illustrating the grouping of escorting tasks according to the embodiment of the present invention, and as shown in fig. 4, after the escorting task group 41 is obtained, escorting tasks belonging to the cash reconciliation and the tail box in the escorting task group 41 are divided into a tail box task group 42, and the remaining escorting tasks are divided into a non-tail box task group 43.
In step S32, the escort attribute is an attribute of the escort task, the early-tail box task is a task that requires money to be delivered in the morning, and the late-tail box task is a task that requires money to be collected at night, wherein each escort task that requires money to be delivered in the morning needs money to be collected at night, that is, each early-tail box task has an late-tail box task corresponding to the previous-tail box task.
Specifically, as shown in fig. 4, the escort task that requires money to be paid in the morning in the tail box task group 42 is divided into an early tail box task 44, and the escort task that requires money to be paid in the evening is divided into an early tail box task 45.
As for step S33, specifically, after grouping the escort tasks in the escort task group, the escort tasks in the escort task group form a data set, where the data set at least includes: the network points corresponding to each escort task, the delivery time, the storage home, the area where the network points are located and the different service objects after combination.
Through steps S31 to S33, the escorting tasks in the escorting task group can be further grouped, and the escorting tasks in the escorting task group are divided into early-tail box tasks, late-tail box tasks and non-tail box tasks, and meanwhile, the escorting tasks in the escorting task group form corresponding data sets, so as to reduce the computing resources occupied by the system in the path planning process and accelerate the path planning speed.
In step S13, the early-tail box task in the early-tail box task group is allocated to each line to be allocated according to a first allocation rule.
The first distribution rule is a task distribution rule corresponding to the early tail box task, the early tail box task can be distributed according to the first distribution rule, the escort line formed by the escort task needing escort on the same day is used as the line to be distributed, each escort line corresponds to a group of escort personnel, and the information and delivery time of the website corresponding to the escort task needing escort on the same day are at least included in the line to be distributed.
Specifically, after the early-tail box task is separated from the escort task group, a plurality of lines to be distributed may be created according to the early-tail box task, and the early-tail box task may be distributed to each created line to be distributed according to the first distribution rule.
In an alternative manner of this embodiment, the early-tail box task may be distributed through the flow shown in fig. 5, that is, the flow shown in fig. 5 is adopted to implement step S13. Fig. 5 is a schematic flow chart of allocating an early-tail box task according to an embodiment of the present invention, and as shown in fig. 5, allocating an early-tail box task according to the embodiment includes the following steps:
step S51: and creating a line to be distributed.
Step S52: and allocating the early-tail box task to the currently created line to be allocated according to a first allocation rule.
Specifically, after a line to be allocated is created, the early-tail box task may be allocated to the line according to the first allocation rule.
The escort system comprises a plurality of escort tasks, wherein the escort tasks are distributed in different lines, and each escort task is corresponding to one of the lines, wherein the different escort tasks correspond to different network points, a certain distance time is needed from one network point to another network point, and a certain time is needed for carrying escort objects after reaching one network point.
Step S53: moving the allocated early tail box task out of the group of early tail box tasks.
Step S54: and judging whether a condition 54 is met currently, wherein the condition 54 is that all the early-tail box tasks in the early-tail box task group are not completely allocated, specifically, if all the early-tail box tasks in the early-tail box task group are not completely allocated, jumping back to S51, otherwise, ending the early-tail box task allocation process.
Fig. 6 is a schematic flow chart of allocating an early-tail box task according to a first allocation rule of an embodiment of the present invention, in an optional manner of this embodiment, the early-tail box task may be allocated to a line to be allocated through the flow shown in fig. 6, that is, the flow shown in fig. 6 is adopted to implement step S52, and as shown in fig. 6, allocating the early-tail box task according to the first allocation rule of this embodiment includes the following steps:
step S61: and selecting at least one task according to the sequence of the delivery time, specifically, selecting at least one early-tail box task from the early-tail box task group according to the sequence of the delivery time.
For example: the early-tail box task group comprises early-tail box tasks A, B and C, and the corresponding time is respectively 9:00,9:00, 10:00, selecting early tail box tasks A and B in the first selection, and selecting an early tail box task C in the second selection.
Step S62: and judging whether the number of the selected early tail box tasks is multiple or not, if so, executing S64, and otherwise, executing S63.
Step S63: and determining the task as a target task, specifically determining the task as a target early tail box task.
Step S64: and judging whether the current situation meets a condition 64, wherein the condition 64 is that the current line to be distributed is not distributed with any early tail box task, specifically, if the current line to be distributed is not distributed with any early tail box task, executing S66, otherwise, executing S65.
Step S65: and determining the task closest to the last task as a target task, specifically determining the early-tail box task closest to the mesh point of the last early-tail box task as the target early-tail box task.
Step S66: and determining the task farthest from the warehouse as a target task, specifically, determining the early-tail box task of the website farthest from the warehouse as the target early-tail box task.
Step S67: and judging whether the current condition meets a condition 67, wherein the condition 67 is that the current line to be distributed is distributed for the first early-tail box task, specifically, if the current line to be distributed is distributed for the first early-tail box task, executing S69, otherwise, executing S68.
Step S68: and judging whether the current situation meets a condition 68, wherein the condition 68 is that the required distance time from the target early-tail box task site to the last early-tail box task site is less than the difference between the delivery time of the target early-tail box task and the delivery time of the last early-tail box task, specifically, if the required distance time from the target early-tail box task site to the last early-tail box task site is less than the difference between the delivery time of the target early-tail box task and the delivery time of the last early-tail box task, executing S69, and otherwise, jumping back to S61. When the required journey time is calculated, corresponding algorithms can be used for calculation according to the congestion coefficient of the city to which the network point belongs, so that the accuracy of calculation is ensured.
Step S68: and allocating the target task to the current line to be allocated, specifically, allocating the target early tail box task to the current line to be allocated.
In step S14, the late box tasks in the late box task group are allocated to the lines to be allocated.
Specifically, after the early tail box task is distributed to each line to be distributed, the late tail box task is also distributed to each line to be distributed.
In an optional manner of this embodiment, the late box task may be allocated by the method shown in fig. 7, that is, the flow shown in fig. 7 is adopted to implement step S14, fig. 7 is a schematic flow diagram of the late box task allocation according to the embodiment of the present invention, and as shown in fig. 7, the late box task allocation according to this embodiment includes the following steps:
step S71: and selecting a line to be distributed which is not subjected to the late boot task distribution from the created lines to be distributed.
Step S72: and selecting the late tail box task corresponding to the distributed early tail box task in the line to be distributed from the late tail box task group. Specifically, fig. 8 is a schematic diagram of a line to be distributed according to an embodiment of the present invention, as shown in fig. 8, the line to be distributed 81 includes allocated early-tail box tasks 811, and a late-tail box task 812 corresponding to the early-tail box task 811 in the selected line to be distributed can be selected from the late-tail box task group.
Step S73: and distributing the selected late tail box tasks to the currently selected line to be distributed according to the sequence of delivery time. Specifically, as shown in fig. 8, the selected late tail box task 812 is allocated to the currently selected line 81 to be allocated according to the sequence of the delivery times. And for each line to be distributed, before executing the first early tail box task, the escort objects in the process of all the early tail box tasks need to be taken out at one time from the warehouse, and then escort is carried out. Correspondingly, when carrying out the task of tail-box late, need be after receiving all the escort article of tail-box late task in-process, transport storehouse with escort article.
Step S74: and judging whether the current situation meets a condition 74, wherein the condition 74 indicates that the line to be distributed does not perform late boot task distribution, specifically, if the line to be distributed does not perform late boot task distribution, the process jumps back to 71, otherwise, the late boot task distribution process is finished.
In step S15, the non-boot tasks in the non-boot task group are allocated to the lines to be allocated.
Specifically, as shown in fig. 8, after allocating an early-tail box task and a late-tail box task to each line to be allocated, a non-tail box task is allocated to each line to be allocated.
In an alternative manner of this embodiment, the late boot task may be assigned by the method shown in fig. 9, that is, the flow shown in fig. 9 is adopted to implement step S15. Fig. 9 is a schematic flow chart of non-boot task allocation according to an embodiment of the present invention, and as shown in fig. 9, the non-boot task allocation according to the embodiment includes the following steps:
step S91: and dividing the non-boot tasks in the non-boot task group into a non-boot time point task group and a non-boot time period task group according to time limit requirements.
Step S92: and distributing the non-tail box time point tasks in the non-tail box time point task group to each line to be distributed.
Step S93: and distributing the non-trunk time period tasks in the non-trunk time period task group to each line to be distributed.
For step S91, specifically, the non-tail box tasks include time-limited tasks and time-unlimited tasks, and the non-tail box tasks in the non-tail box task group may be divided into a non-tail box time point task group and a non-tail box time period task group according to the task time limit requirement.
In step S92, specifically, after the non-trunk escort task is divided into the non-trunk time point task group and the non-trunk time point task group, the non-trunk time point tasks in the non-trunk time point task group are first allocated to each to-be-allocated route.
Fig. 10 is a schematic flow chart of non-trunk time point task allocation according to an embodiment of the present invention, in an alternative manner of this embodiment, a non-trunk time point task may be allocated to a line to be allocated through the flow shown in fig. 10, that is, the flow shown in fig. 10 is used to implement step S92, and as shown in fig. 10, the non-trunk time point task allocation according to this embodiment includes the following steps:
step S101: and selecting a line to be distributed which is not subjected to non-tail box time point task distribution from the established lines to be distributed. If all the current lines to be distributed are subjected to non-trunk time point task distribution, a new line to be distributed is created, and the newly created line to be distributed is selected.
Step S102: and distributing the non-trunk time point tasks to the currently selected line to be distributed according to a second distribution rule.
Step S103: moving the assigned non-boot time point tasks out of the non-boot time point task group.
Step S104: and judging whether the current situation meets a condition 104, wherein the condition 104 is that the tasks of the non-boot time points in the task group of the non-boot time points are not completely distributed, specifically, if the tasks of the non-boot time points in the task group of the non-boot time points are not completely distributed, jumping back to S101, otherwise, ending the task distribution process of the non-boot time points.
Fig. 11 is a schematic flowchart of a process of allocating a non-trunk time point task by a second allocation rule according to an embodiment of the present invention, and in an alternative manner of this embodiment, the non-trunk time point task may be allocated to a line to be allocated as shown in fig. 11, that is, step S102 is implemented by using the process shown in fig. 11, and as shown in fig. 11, the allocating of the non-trunk time point task by the second allocation rule according to this embodiment includes the following steps:
step S111: and selecting at least one task according to the sequence of the delivery time, specifically, selecting at least one non-boot time point task from the non-boot time point task group according to the sequence of the delivery time.
Step S112: and judging whether the number of the tasks at the selected non-tail box time point is multiple, if so, executing S114, otherwise, executing S113.
Step S113: the task is determined as a first task, in particular, the task is determined as a first non-boot point-in-time task.
Step S114: and judging whether the current condition meets a condition 114, wherein the condition 114 is that the current line to be distributed is not distributed with any non-trunk time point task. Specifically, if the current line to be allocated does not allocate any non-trunk time point task, S116 is executed, otherwise S115 is executed.
Step S115: determining a task closest to a previous task as a first task, specifically determining a non-tail box time point task whose mesh point is closest to a mesh point of a previous non-tail box time point task as a first non-tail box time point task
Step S116: and judging whether the current condition meets a condition 116, wherein the condition 116 is that no early tail box task exists in the current line to be distributed. Specifically, if the current line to be distributed does not distribute any early tail box task, S118 is executed, otherwise, S117 is executed.
Step S117: and determining a task closest to the early-tail box task as a first task, specifically determining a non-tail box time point task with a mesh point closest to the mesh point of the early-tail box task as a first non-tail box time point task.
Step S118: and determining the task closest to the storehouse as a first task, specifically determining the non-boot time point task of the website closest to the storehouse as the first non-boot time point task.
In order to ensure that the allocated early-tail box task is not affected in the process of allocating the non-tail box time point task, the influence of the non-tail box time point task on the early-tail box task needs to be considered in the allocation process.
Step S119: and judging whether the current condition meets a condition 114, wherein the condition 114 is that no non-trunk time point task is distributed to the current line to be distributed. Specifically, if the current line to be distributed does not distribute any non-trunk time point task, S1111 is executed, otherwise S1110 is executed.
Step S1110: and judging whether the current condition meets a condition 1110, wherein the condition 1110 is that the required distance time from the first non-boot time point task point to the last non-boot time point task point is less than the delivery time difference between the first non-boot time point task and the last non-boot time point task. Specifically, if the required distance time from the first non-trunk time point task point to the last non-trunk time point task point is less than the difference between the delivery time of the first non-trunk time point task and the delivery time of the last non-trunk time point task, S1113 is executed, otherwise, S111 is skipped.
Step S1111: and judging whether the current condition meets a condition 116, wherein the condition 116 is that no early tail box task exists in the current line to be distributed. Specifically, if the current line to be allocated does not allocate any early tail box task, S1113 is executed, otherwise, S1112 is executed.
Step S1112: and judging whether the current condition meets a condition 1112, wherein the condition 1112 is that the distance from the mesh point of the first non-tail box time point task to the mesh point of the last early tail box task is less than the difference of the delivery time of the first non-tail box time point task and the last early tail box task. Specifically, if the required distance time from the node of the first non-tail box time point task to the node of the last early-tail box task is less than the arrival time difference between the first non-tail box time point task and the last early-tail box task, S1113 is executed, otherwise, S111 is skipped.
Step S1113: and determining the first task as a target task, specifically determining the first non-boot time point task as a target non-boot time point task.
Step S1114: and allocating the target non-tail box time point task to the current line to be allocated.
And in the distribution process, the task needing to be returned to the warehouse can reach the warehouse before a certain moment after the task is completed.
Specifically, in response to that the delivery time of the target non-boot time point task is before a preset time and the return to the base is not needed, the target non-boot time point task is allocated to the current line to be allocated.
For example: and the delivery time of the target non-trunk time point task A is before 3 points, and the task does not need to return to the base, and the target non-trunk time point task A is directly allocated to the current line to be allocated.
And responding to the fact that the target non-boot time point task needs to return to the warehouse, and the time of arriving at the warehouse after the task is completed does not exceed the preset time, and distributing the target non-boot time point task to the current line to be distributed.
For example: and if the delivery time of the target non-boot time point task is before 3 points and the task needs to return to the warehouse, calculating the time of the non-boot time point task reaching the warehouse after the task is completed, if the time does not exceed 3 points, distributing the target non-boot time point task to the current line to be distributed, and otherwise, returning to S111.
Meanwhile, in step S1114, for a task whose arrival time is a certain time later, in order to ensure that the assignment process for assigning a non-tail-box time-point task does not affect the assigned late tail-box task, the effect on the late tail-box task needs to be considered.
Specifically, in response to that the arrival time of the target non-trunk time point task is after a preset time and that the required distance time from the node point of the target non-trunk time point task to the node point of the first late trunk task in the current line to be distributed is less than the arrival time difference between the target non-trunk time point task and the first late trunk task, the target non-trunk time point task is distributed to the current line to be distributed.
And responding to the situation that the delivery time of the target non-trunk time point task is behind a preset moment and no late trunk task exists in the current line to be distributed, and distributing the target non-trunk time point task to the current line to be distributed.
For example: when the delivery time of the target non-tail box time point task is after 3 points, the influence of the target non-tail box time point task on the late tail box task needs to be considered, that is, if the current to-be-distributed line contains the late tail box task, but the target non-tail box time point task can arrive at the mesh point of the first late tail box task on time after the task is completed, the target non-tail box time point task is distributed to the current to-be-distributed line, otherwise, the process jumps back to S111, and correspondingly, when the current to-be-distributed line does not contain the late tail box task, the target non-tail box time point task is directly distributed to the current to-be-distributed line.
For step S93, specifically, after allocating the early-tail box task, the late-tail box task, and the non-tail box time point task to each line to be allocated, the non-tail box time period task without time limitation is allocated.
Fig. 12 is a schematic flow chart illustrating allocation of non-trunk time period tasks according to an embodiment of the present invention, in an optional manner of this embodiment, the non-trunk time period tasks may be allocated to a line to be allocated through the flow shown in fig. 12, that is, the flow shown in fig. 12 is adopted to implement step S93, and as shown in fig. 12, the allocation of the non-trunk time period tasks according to this embodiment includes the following steps:
step S121: and selecting a to-be-distributed line which is not subjected to the non-trunk time period task distribution from the to-be-distributed lines which are not subjected to the non-trunk time period task distribution.
For example: and if three lines to be distributed exist, wherein one line contains a non-trunk time point task, and the other two lines do not contain the non-trunk time point task, one line to be distributed is selected from the two lines to be distributed which do not contain the non-trunk time point task, and then the other line to be distributed is selected.
Step S122: and distributing the tasks of the non-trunk time periods to the currently selected line to be distributed according to a third distribution rule. The third allocation rule is an allocation rule used for selecting a proper non-trunk time period task from the non-trunk time period task group as a target non-trunk time period task and allocating the target non-trunk time period task to a line to be allocated according to actual conditions.
Step S123: moving the allocated non-boot time period tasks out of the non-boot time period task group.
Step S124: and judging whether the current situation meets a condition 124, wherein the condition 124 is that all the non-trunk time period tasks in the non-trunk time period task group are not completely allocated, specifically, if all the non-trunk time period tasks in the non-trunk time period task group are not completely allocated, jumping back to S122, otherwise, ending the non-trunk time period task allocation.
Step S125: and judging whether the current situation meets a condition 125, wherein the condition 125 is that all non-boot time period tasks in the non-boot time period task group are selected to have the target non-boot time period tasks, specifically, if all the non-boot time period tasks in the non-boot time period task group are selected to have the target non-boot time period tasks, jumping back to S121, otherwise, jumping back to 122.
Fig. 13 is a schematic flow chart of allocating a non-boot time period task according to a third allocation rule in the embodiment of the present invention, where step S122 may be implemented by using the flow shown in fig. 13, and as shown in fig. 13, allocating the non-boot time period task according to the third allocation rule in the embodiment includes the following steps:
step S131: judging whether the current situation meets a condition 131, wherein the condition 131 is that no early tail box task is allocated to the current line to be allocated, specifically, if no early tail box task is allocated to the current line to be allocated, executing S133, otherwise, executing S132.
Step S132: judging whether the current situation meets a condition 132, wherein the condition 132 is that the current line to be distributed is distributed for the first non-tail box time period task, specifically, if the current line to be distributed is not distributed with the early tail box task, executing S135, otherwise executing S134.
Step S133: judging whether the current situation meets a condition 132, wherein the condition 132 is that the current line to be distributed is distributed for the first non-trunk time period task, specifically, if the current line to be distributed is not distributed with the early trunk task, executing S136, otherwise executing S137.
Step S134: specifically, a non-boot time period task with a mesh point closest to a mesh point of the last non-boot time period task is selected from a non-boot time period task group as a target non-boot time period task, delivery time is calculated, and task completion time when the target non-boot time period task is distributed behind the last non-boot time period task is calculated as delivery time.
Step S135: selecting a task closest to the last early-tail box task from a task group as a target task and calculating the delivery time, specifically, selecting a non-tail box time period task closest to a network point of the last early-tail box task from a non-tail box time period task group as a target non-tail box time period task, and calculating the task completion time if the target non-tail box time period task is distributed behind the last early-tail box task as the delivery time.
Step S136: and selecting a task closest to the warehouse from the task group as a target task and calculating the delivery time, specifically, selecting a non-boot time period task closest to the warehouse from a non-boot time period task group as a target non-boot time period task, and calculating the task completion time if the target non-boot time period task is taken as the first task in the current to-be-distributed line as the delivery time.
Step S137: and selecting a task closest to the last task from the task group as a target task and calculating the delivery time, specifically, selecting a non-boot time period task closest to a last non-boot time period task node from a non-boot time period task group as a target non-boot time period task, and calculating the task completion time as the delivery time if the target non-boot time period task is distributed behind the last non-boot time period task.
Step S138: and judging whether the current situation meets a condition 138, wherein the condition 138 is that the delivery time is before a preset time and the warehouse does not need to be returned, or the time required to be returned but the time required to reach the warehouse is before the preset time, specifically, if the delivery time is before the preset time and the warehouse does not need to be returned, or the time required to be returned but the time required to reach the warehouse is before the preset time, executing S139, otherwise executing S140.
Step S139: and distributing the target task to the current line to be distributed, specifically, distributing the target non-trunk time period task to the current line to be distributed. In another implementation, tasks may also be assigned according to other points in time, such as: at present, the line to be distributed needs to have a noon break from 12 o 'clock to 13 o' clock, and in the distribution process, corresponding limitation may be performed, which is not limited by the present application.
Step S140: and judging whether the current situation meets a condition 140, wherein the condition 140 is that all the non-trunk time period tasks in the non-trunk time period task group have been selected, specifically, if all the non-trunk time period tasks in the non-trunk time period task group have been selected, jumping to S121, and otherwise, jumping back to S131.
According to the method, after the escort task group is obtained, the escort tasks in the escort task group are divided into the early tail box task group, the late tail box task group and the non-tail box task group according to the preset classification rule, and then the escort tasks in the early tail box task group, the late tail box task group and the non-tail box task group are distributed to all lines to be distributed.
Fig. 14 is a schematic view of an electronic device of an embodiment of the invention. As shown in fig. 14, the electronic device is a general-purpose data processing apparatus including a general-purpose computer hardware structure including at least a processor 141 and a memory 142. Processor 141 and memory 142 are connected by bus 143. Memory 142 is adapted to store instructions or programs executable by processor 141. Processor 141 may be a stand-alone microprocessor or a collection of one or more microprocessors. Thus, processor 141 implements the processing of data and the control of other devices by executing instructions stored by memory 142 to perform the method flows of embodiments of the present invention as described above. The bus 143 connects the above components together, and also connects the above components to a display controller 144 and a display device and an input/output (I/O) device 145. Input/output (I/O) device 145 may be a mouse, keyboard, modem, network interface, touch input device, motion sensitive input device, printer, and other devices known in the art. Typically, the input/output devices 145 are coupled to the system through input/output (I/O) controllers 146.
As will be appreciated by one of skill in the art, embodiments of the present application may be provided as a method, apparatus (device) or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may employ a computer program product embodied on one or more computer-readable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations of methods, apparatus (devices) and computer program products according to embodiments of the application. It will be understood that each flow in the flow diagrams can be implemented by computer program instructions.
These computer program instructions may be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows.
These computer program instructions may also be provided to a processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows.
Another embodiment of the invention is directed to a non-transitory storage medium storing a computer-readable program for causing a computer to perform some or all of the above-described method embodiments.
That is, as can be understood by those skilled in the art, all or part of the steps in the method for implementing the embodiments described above may be accomplished by specifying the relevant hardware through a program, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (10)

1. A method of path planning, the method comprising:
acquiring an escort task group;
classifying escorting tasks in the escorting task group into an early tail box task group, a late tail box task group and a non-tail box task group according to a preset classification rule;
allocating the early tail box tasks in the early tail box task group to each line to be allocated according to a first allocation rule;
allocating the late tail box tasks in the late tail box task group to each line to be allocated;
distributing the non-trunk tasks in the non-trunk task group to each line to be distributed;
wherein the early tail box task in the early tail box task group corresponds to the late tail box task in the late tail box task group;
the early boot task is a morning boot money sending task, and the late boot task is an evening boot money receiving task.
2. The method of claim 1, prior to obtaining the escort task group, further comprising:
acquiring all escorting tasks from a task database;
dividing all the escorting tasks into a plurality of escorting task groups according to a preset grouping rule;
merging escort tasks with the same delivery time and the same network points in each escort task group;
wherein, according to a predetermined grouping rule, dividing all the escorting tasks into a plurality of escorting task groups comprises:
and dividing the escorting tasks into a plurality of escorting task groups according to at least one of the ownership of the warehouse of the escorting tasks, the area of the network points or the escorting task merging rules of different service objects.
3. The method of claim 1, wherein the classifying escort tasks in the escort task group into an early tail box task group, a late tail box task group, and a non-tail box task group according to a preset classification rule comprises:
classifying escorting tasks in the escorting task group into a trunk task group and a non-trunk task group according to escorting categories;
classifying escort tasks in the tail box task group into the early tail box task and the late tail box task according to escort attributes;
forming a data set by escorting tasks in the escorting task group;
wherein the data set comprises at least: the network points corresponding to each escort task, the delivery time, the storage home, the area where the network points are located and the different service objects after combination.
4. The method of claim 3, wherein said assigning early tail box tasks in the early tail box task group to lines according to a first assignment rule comprises:
and executing the following steps in an iterative mode until all the early-tail box tasks in the early-tail box task group are completely distributed:
creating a line to be distributed;
allocating the early-tail box task to the currently created line to be allocated according to a first allocation rule;
moving the allocated early tail box task out of the early tail box task group;
wherein the allocating the early-tail box task to the currently created line to be allocated according to the first allocation rule comprises:
selecting at least one early-tail box task from the early-tail box task group according to the sequence of delivery time;
determining a target early tail box task from the selected early tail box tasks;
responding to the first early-tail box task allocation of the current line to be allocated, and allocating the target early-tail box task to the current line to be allocated;
responding to the fact that the current line to be distributed is not distributed with the first early-tail box task, and the required distance time from the target early-tail box task network point to the last early-tail box task network point is smaller than the arrival time difference between the target early-tail box task and the last early-tail box task, and distributing the target early-tail box task to the current line to be distributed;
wherein the determining a target early-tail box task from the selected early-tail box tasks comprises:
in response to the fact that a plurality of early-tail box tasks are selected and no early-tail box task is distributed on the current line to be distributed, determining the early-tail box task with the most distance from the network node to the warehouse as the target early-tail box task;
and in response to the fact that the multiple early-tail box tasks are selected and the current line to be distributed is distributed with the early-tail box task, determining the early-tail box task with the mesh point closest to the mesh point of the last early-tail box task as the target early-tail box task.
5. The method of claim 4, wherein said assigning late tail box tasks of said late tail box task group to said each route to be assigned comprises:
and executing the following steps in an iterative mode until all the late tail box tasks in the late tail box task group are completely distributed:
selecting a line to be distributed which is not subjected to the late boot task distribution from the established lines to be distributed;
selecting a late tail box task corresponding to the distributed early tail box task in the line to be distributed from the late tail box task group;
and distributing the selected late tail box tasks to the currently selected line to be distributed according to the sequence of delivery time.
6. The method of claim 5, wherein the allocating non-boot tasks of the set of non-boot tasks to the lines to be allocated comprises:
dividing non-trunk tasks in the non-trunk task groups into non-trunk time point task groups and non-trunk time period task groups according to time limit requirements;
distributing the non-trunk time point tasks in the non-trunk time point task group to each line to be distributed;
and distributing the non-trunk time period tasks in the non-trunk time period task group to each line to be distributed.
7. The method of claim 6, wherein the allocating non-trunk point-in-time tasks of the non-trunk point-in-time task group to the respective line to be allocated comprises:
executing the following steps in an iterative mode until all the non-tail box time point tasks in the non-tail box time point task group are completely distributed:
selecting a to-be-distributed line which is not subjected to non-trunk time point task distribution from the created to-be-distributed lines, wherein if all the to-be-distributed lines are subjected to the non-trunk time point task distribution at present, a new to-be-distributed line is created, and the newly-created to-be-distributed line is selected;
distributing the non-trunk time point tasks to the currently selected line to be distributed according to a second distribution rule;
moving the distributed non-boot time point tasks out of the non-boot time point task group;
wherein the allocating the non-trunk time point task to the currently selected line to be allocated according to the second allocation rule includes:
selecting at least one non-trunk time point task from the non-trunk time point task group according to the sequence of delivery time;
determining a first non-boot time point task from the selected non-boot time point tasks;
determining the first non-boot time point task as a target non-boot time point task according to actual distribution conditions;
responding to the fact that the delivery time of the target non-trunk time point task is before the preset time and the target non-trunk time point task does not need to return to the base, and distributing the target non-trunk time point task to the current line to be distributed;
responding to the fact that the target non-trunk time point task needs to return to the warehouse, and the time of arriving at a warehouse after the task is completed does not exceed the preset time, and distributing the target non-trunk time point task to a current line to be distributed;
responding to the situation that the delivery time of the target non-tail box time point task is behind a preset time, and the distance time from a network point of the target non-tail box time point task to a network point of a first late tail box task in a current line to be distributed is less than the delivery time difference between the target non-tail box time point task and the first late tail box task, and distributing the target non-tail box time point task to the current line to be distributed;
responding to the fact that the delivery time of the target non-tail box time point task is behind a preset time and no late tail box task exists in the current line to be distributed, and distributing the target non-tail box time point task to the current line to be distributed;
wherein the determining a first non-boot time point task from the selected non-boot time point tasks comprises:
in response to the fact that a plurality of non-trunk time point tasks are selected and any non-trunk time point task is distributed to a current line to be distributed, determining the non-trunk time point task with the net point closest to the net point of the last non-trunk time point task as the first non-trunk time point task;
in response to the fact that a plurality of non-trunk time point tasks are selected, no non-trunk time point task is distributed to the current line to be distributed, and an early trunk task exists in the current line to be distributed, the non-trunk time point task with the mesh point closest to the mesh point of the early trunk task is determined as the first non-trunk time point task;
in response to the fact that a plurality of non-trunk time point tasks are selected, no non-trunk time point task is distributed to the current line to be distributed, and no early trunk task exists in the current line to be distributed, determining the non-trunk time point task with the nearest network point to the warehouse as the first non-trunk time point task;
wherein determining the first non-boot time point task as the target non-boot time point task according to the actual allocation comprises:
in response to the fact that the current line to be distributed is not distributed with any non-tail box time point task and early tail box task, determining the first non-tail box time point task as a target non-tail box time point task;
responding to the situation that no non-tail box time point task is distributed on the current line to be distributed, an early tail box task is distributed on the current line to be distributed, and the distance time from a network point of the first non-tail box time point task to a network point of the last early tail box task is less than the arrival time difference between the first non-tail box time point task and the last early tail box task, and determining the first non-tail box time point task as a target non-tail box time point task;
and in response to the fact that the current line to be distributed is distributed with a non-trunk time point task and the required distance time from the network point of the first non-trunk time point task to the network point of the last non-trunk time point task is less than the delivery time difference between the first non-trunk time point task and the last non-trunk time point task, determining the first non-trunk time point task as a target non-trunk time point task.
8. The method of claim 7, wherein the assigning non-boot period tasks of the non-boot period task groups to the lines comprises:
executing the following steps in an iterative manner until all the non-tail box time period tasks in the non-tail box time period task group are completely allocated:
selecting a line to be distributed without non-trunk time period task distribution from the lines to be distributed without non-trunk time point tasks, wherein if all the lines to be distributed have non-trunk time period tasks or non-trunk time point tasks, a new line to be distributed is created, and the newly created line to be distributed is selected;
distributing the tasks of the non-trunk time periods to the currently selected line to be distributed according to a third distribution rule;
moving the allocated non-boot time period tasks out of the non-boot time period task group;
wherein, the allocating the non-trunk time period task to the currently selected line to be allocated according to the third allocation rule includes:
confirming a target non-boot time period task from the non-boot time period tasks and calculating delivery time;
responding to the condition that the delivery time is before the preset time and the warehouse does not need to be returned, or the time which needs to be returned but reaches the warehouse is before the preset time, and allocating the target non-trunk time period task to the current line to be allocated;
wherein, confirming the target non-boot time period task from the non-boot time period tasks and calculating the delivery time comprises:
responding to the fact that no early-tail box task is distributed in the current line to be distributed and is distributed for a first non-tail box time period task, selecting a non-tail box time period task with a net point closest to a warehouse from a non-tail box time period task group as a target non-tail box time period task, and calculating the arrival time;
responding to the fact that the early-tail box task is not distributed in the current line to be distributed and the non-first non-tail box time period task is not distributed, selecting the non-tail box time period task with the mesh point closest to the last non-tail box time period task mesh point from the non-tail box time period task group as a target non-tail box time period task, and calculating the delivery time;
responding to the fact that the early-tail box tasks are distributed in the current line to be distributed and are distributed for first-time non-tail box time period tasks, selecting the non-tail box time period task with the mesh point closest to the mesh point of the last early-tail box task from the non-tail box time period task group as a target non-tail box time period task, and calculating the delivery time;
and responding to the fact that the early-tail box task is distributed in the current line to be distributed and the non-first-time non-tail box time period task is distributed, selecting the non-tail box time period task with the mesh point closest to the mesh point of the last non-tail box time period task from the non-tail box time period task group as a target non-tail box time period task, and calculating the arrival time.
9. An electronic device comprising a memory and a processor, wherein the memory is configured to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to implement the method of any of claims 1-8.
10. A computer-readable storage medium storing computer program instructions, which when executed by a processor implement the method of any one of claims 1-8.
CN202110620169.7A 2021-06-03 2021-06-03 Path planning method and device Pending CN115438826A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110620169.7A CN115438826A (en) 2021-06-03 2021-06-03 Path planning method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110620169.7A CN115438826A (en) 2021-06-03 2021-06-03 Path planning method and device

Publications (1)

Publication Number Publication Date
CN115438826A true CN115438826A (en) 2022-12-06

Family

ID=84271548

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110620169.7A Pending CN115438826A (en) 2021-06-03 2021-06-03 Path planning method and device

Country Status (1)

Country Link
CN (1) CN115438826A (en)

Similar Documents

Publication Publication Date Title
CN103927643B (en) A kind of method that large-scale order form treatment optimizes with Distribution path
EP3928473B1 (en) Systems and methods for communications node upgrade and selection
Coelho et al. Improved solutions for inventory-routing problems through valid inequalities and input ordering
CN109544054A (en) Inventory's dispatching method, device and computer readable storage medium
Russell Mathematical programming heuristics for the production routing problem
CN108364146A (en) Logistics distribution emulation mode and device
JP6027666B1 (en) Delivery route rearrangement system
CN104345974A (en) Method and system for performing ensemble model based prediction for set (IDS) of input data record
CN105608886A (en) Method and device for scheduling traffic tools
Michel et al. A column-generation based tactical planning method for inventory routing
CN105260785A (en) Logistic distribution vehicle path optimizing method based on improved Cuckoo algorithm
CN112700180A (en) Goods picking method and goods picking device
CN105205052A (en) Method and device for mining data
CN111401801A (en) Processing system and method for determining decentralized storage of target article warehouse
CN110910054B (en) Track determining method and device and time recommending method and device
CN111985862A (en) Method and apparatus for locating inventory items
CN115147185A (en) Order processing method and device and computer readable storage medium
CN109661359A (en) Movement routine determines methods and procedures
KR20160054281A (en) Apparatus for designing processing modeling and method for designing processing modeling based on the binary bills of material structure
CN102402606A (en) High-efficiency text data mining method
CN115438826A (en) Path planning method and device
JP7414931B1 (en) Information processing device, information processing method, program, and information processing system
CN112988403B (en) Integrated circuit simulation multithread management parallel method and device with security function
Qin et al. Cutting down the travel distance of put systems at Kunming International Flower Auction Market
JP6621142B2 (en) Delivery route rearrangement system

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