Method and apparatus for planning route

An apparatus for planning a route, the apparatus comprising:

• at least one processor;
• and
• a memory storing instructions, wherein the instructions when executed by the at least one processor, cause the at least one processor to perform operations, the operations comprising:
• acquiring task information, the task information comprising a location of an initial node where to-be-delivered items are located, a location of a destination node of the to-be-delivered items, and a location of an intermediate node between the initial node and the destination node;
• generating initial route information based on the task information, the initial route information comprising a first sequence set and a second sequence set, the first sequence set comprising at least one first sequence, the first sequence being used to indicate a route of a delivery unit delivering the to-be-delivered items from the initial node to one of the intermediate node, the second sequence set comprising at least one second sequence, and the second sequence being used to indicate a route of the delivery unit delivering the to-be-delivered items from the one of the intermediate node to the destination node of the to-be-delivered items;
• performing an updating step comprising:
• updating the second sequence in the second sequence set based on a preset rule;
• updating the first sequence in the first sequence set based on the updated second sequence set;
• and determining a delivery cost of the delivery unit based on the updated first sequence set and the updated second sequence set;
• and
• determining, based on the updated first sequence set and the updated second sequence set, a route of the to-be-delivered items delivered from the initial node to the destination node via the intermediate node, in response to the determined delivery cost meeting a preset delivery cost condition.

A non-transitory computer readable medium, storing a computer program thereon, the program, when executed by a processor, causes the processor to perform operations, the operations comprising:

• acquiring task information, the task information comprising a location of an initial node where to-be-delivered items are located, a location of a destination node of the to-be-delivered items, and a location of an intermediate node between the initial node and the destination node;
• generating initial route information based on the task information, the initial route information comprising a first sequence set and a second sequence set, the first sequence set comprising at least one first sequence, the first sequence being used to indicate a route of a delivery unit delivering the to-be-delivered items from the initial node to one of the intermediate node, the second sequence set comprising at least one second sequence, and the second sequence being used to indicate a route of the delivery unit delivering the to-be-delivered items from one of the intermediate node to the destination node of the to-be-delivered items;
• performing an updating step comprising:
• updating the second sequence in the second sequence set based on a preset rule;
• updating the first sequence in the first sequence set based on the updated second sequence set;
• and determining a delivery cost of the delivery unit based on the updated first sequence set and the updated second sequence set;
• and
• determining, based on the updated first sequence set and the updated second sequence set, a route of the to-be-delivered items delivered from the initial node to the destination node via the intermediate node, in response to the determined delivery cost meeting a preset delivery cost condition.