WO2021244233A1 - 一种处理订单数据的方法和装置 - Google Patents

一种处理订单数据的方法和装置 Download PDF

Info

Publication number
WO2021244233A1
WO2021244233A1 PCT/CN2021/092999 CN2021092999W WO2021244233A1 WO 2021244233 A1 WO2021244233 A1 WO 2021244233A1 CN 2021092999 W CN2021092999 W CN 2021092999W WO 2021244233 A1 WO2021244233 A1 WO 2021244233A1
Authority
WO
WIPO (PCT)
Prior art keywords
order
address information
delivery
resolved
master table
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.)
Ceased
Application number
PCT/CN2021/092999
Other languages
English (en)
French (fr)
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 Jingdong Zhenshi Information Technology Co Ltd
Original Assignee
Beijing Jingdong Zhenshi Information 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 Jingdong Zhenshi Information Technology Co Ltd filed Critical Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority to EP21816738.5A priority Critical patent/EP4145300A4/en
Priority to JP2022570663A priority patent/JP7481067B2/ja
Priority to US17/926,883 priority patent/US20230196271A1/en
Publication of WO2021244233A1 publication Critical patent/WO2021244233A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29—Geographical information databases
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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 OR CALCULATING; COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/08355—Routing methods

Definitions

  • the present disclosure relates to the technical field of logistics and distribution, and in particular to a method and device for processing order data.
  • the delivery staff can't remember which floors or the goods of the residents, they need to check the goods one by one again until they confirm which floors are in stock. If a little more goods are delivered, it will seriously affect the delivery efficiency.
  • the delivery address filled in by the user is not detailed enough or there is missing information, causing the delivery person to be unable to correctly find the specific house number, and unable to provide door-to-door delivery services in time, and need to call the user to confirm. This situation will also seriously affect the delivery efficiency.
  • the embodiments of the present disclosure provide a method and device for processing order data to solve the technical problem of low delivery efficiency.
  • a method for processing order data including:
  • Route optimization is performed based on the delivery address information of each order in the updated order master table, and the optimization result is sent to the terminal.
  • the missing information in the delivery address information corresponding to each of the order IDs to be resolved is supplemented, thereby updating the order master Table, including:
  • each order identifier to be resolved based on the user identifier and delivery address information corresponding to the order identifier to be resolved, the corresponding relationship between each user identifier and each detailed address information stored in the address database table is matched to find the pending order. Resolve the detailed address information corresponding to the order ID;
  • the missing information in the delivery address information corresponding to the to-be-resolved order identifier is supplemented, thereby updating the order master table.
  • the missing information in the delivery address information corresponding to each of the order IDs to be resolved is supplemented, thereby updating the order master Table, also includes:
  • the corresponding relationship between the user ID corresponding to the order ID to be resolved and the completed delivery address information is written into the address library table.
  • the missing information in the delivery address information corresponding to each of the order IDs to be resolved is supplemented, thereby updating the order master Table, also includes:
  • the missing information in the delivery address information corresponding to the order identifier to be resolved is completed, so as to update the order master table;
  • the corresponding relationship between the user ID corresponding to the order ID to be resolved and the completed delivery address information is written into the address library table.
  • the route optimization is performed based on the delivery address information of each order in the updated order master table, including:
  • the route optimization based on the delivery address information of each order in the updated order master table further includes:
  • the missing information includes at least one of a building number, a unit number, a floor number, and a house number.
  • an apparatus for processing order data including:
  • the storage module is used to receive several order identifiers uploaded by the terminal, obtain the user identifier and delivery address information corresponding to each of the order identifiers, and store them in the order master table;
  • the screening module is used to screen out the order identifiers to be resolved with missing information in the delivery address information from the order master table;
  • the completion module is used to complete the missing information in the delivery address information corresponding to each order identifier to be resolved according to the correspondence between each user identifier stored in the address library table and each detailed address information, thereby updating the Order master table;
  • the optimization module is configured to perform route optimization based on the delivery address information of each order in the updated order master table, and send the optimization result to the terminal.
  • an electronic device including:
  • One or more processors are One or more processors;
  • Storage device used to store one or more programs
  • the one or more processors When the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any one of the foregoing embodiments.
  • a computer-readable medium having a computer program stored thereon, and when the program is executed by a processor, the method described in any of the foregoing embodiments is implemented.
  • An embodiment in the above disclosure has the following advantages or beneficial effects: because the missing information in the delivery address information corresponding to each order identifier to be resolved is determined based on the correspondence between each user identifier stored in the address library table and each detailed address information The technical means of supplementing and optimizing the route of the completed delivery address information overcomes the technical problem of low delivery efficiency in the prior art.
  • the missing information in the delivery address information is complemented by the correspondence between each user ID stored in the address library table and each detailed address information, eliminating the need for the delivery person and the user to determine the detailed address, thereby improving The delivery efficiency of the delivery staff; and by optimizing the information such as the building number, unit number, floor number and house number, the delivery efficiency of the delivery staff is further improved.
  • Fig. 1 is a schematic diagram of the main flow of a method for processing order data according to an embodiment of the present disclosure
  • Fig. 2 is a schematic diagram of an order list that fails to parse according to an embodiment of the present disclosure
  • Fig. 3 is a schematic diagram of an address editing details page according to an embodiment of the present disclosure.
  • Fig. 4 is a schematic diagram of a wave arrangement page according to an embodiment of the present disclosure.
  • Fig. 5 is a schematic diagram of a delivery navigation page according to an embodiment of the present disclosure.
  • FIG. 6 is a schematic diagram of the main flow of a method for processing order data according to a reference embodiment of the present disclosure
  • FIG. 7 is a schematic diagram of main modules of an apparatus for processing order data according to an embodiment of the present disclosure.
  • FIG. 8 is an exemplary system architecture diagram to which the embodiments of the present disclosure can be applied.
  • Fig. 9 is a schematic structural diagram of a computer system suitable for implementing a terminal device or a server according to an embodiment of the present disclosure.
  • Fig. 1 is a schematic diagram of the main flow of a method for processing order data according to an embodiment of the present disclosure.
  • the method for processing order data may include:
  • Step 101 Receive several order identifiers uploaded by the terminal, obtain the user identifier and delivery address information corresponding to each of the order identifiers, and store them in the order master table.
  • the delivery person After the delivery person arrives in the community, he scans the orders of a certain building or several buildings (of course, if there are not many goods in the entire community, you can scan all of them, not according to the building number), or even randomly take out several orders for scanning , The delivery person can decide to deliver several packages at a time, and these several package waybills are called a wave.
  • the delivery person can scan through the delivery terminal he carries, scan through the mobile phone, or scan through other terminals, and then the terminal uploads the scanned order identifiers of these packages to the server.
  • the order system is one of the core systems of the distribution system, which is equivalent to an order pool and stores all order information.
  • the order master table may contain the following fields: user PIN (pin), order number (order_no), delivery address (address), building number (building_no), unit number (unit), house number (room_no) and State.
  • delivery address information obtained from the order system is filled in by the user, and there may be missing information.
  • the floor number or house number is not filled in, then the missing fields will not be filled in.
  • the missing fields will be filled in by the following steps.
  • the information is filled in the corresponding fields.
  • the house number includes the floor number.
  • the field of the floor number can also be added, which is not limited in the embodiment of the present disclosure.
  • the embodiment of this application is to complete and complete the information of more detailed building number, unit number, floor number, house number, etc. Route optimization, thereby improving the delivery efficiency of the delivery staff in the district.
  • Step 102 Filter out the order identifiers to be resolved with missing information in the delivery address information from the order master table.
  • the missing information includes at least one of a building number, a unit number, a floor number, and a house number.
  • the house number is missing, the unit number and house number are missing, or the building number, unit number, and house number are all missing.
  • Step 103 According to the corresponding relationship between each user identifier and each detailed address information stored in the address library table, complete missing information in the delivery address information corresponding to each of the order identifiers to be resolved, thereby updating the order master table .
  • the corresponding relationship between each user ID and each detailed address information, building number, unit number, house number, etc. is stored in the address library table.
  • the address library table may include the following fields: user PIN (pin), order number (order_no), detailed address information (address), building number (building_no), unit number (unit) and house number (room_no) .
  • step 103 may include: for each order identifier to be resolved, based on the user identifier and delivery address information corresponding to the order identifier to be resolved, from each user identifier and each detailed address information stored in the address database table The detailed address information corresponding to the order identifier to be resolved is matched in the correspondence relationship; according to the matched detailed address information, the missing information in the delivery address information corresponding to the order identifier to be resolved is completed, thereby updating the Order master table.
  • the user ID and delivery address information corresponding to the order ID to be resolved can be used to match the detailed address information corresponding to the order ID to be resolved from the address library table, and then according to the detailed address
  • the information corresponding to the building number (building_no), unit number (unit) and house number (room_no) and other information complete the missing information in the delivery address information corresponding to the order identifier to be resolved.
  • the delivery address information corresponding to the order identifier to be resolved is "Nanhai Jiayuan Erli, Daxing District, Beijing", there is a lack of information, and a result is matched from the address database table through the user PIN and "Nanhai Jiayuan Erli, Daxing District, Beijing” : Room 301, Unit 2, 1st Floor, Nanhaijiayuan Erli, Daxing District, Beijing. Then the corresponding building number (building_no), unit number (unit) and house number (room_no) fields corresponding to the result are 1, 2 and 301 respectively, and then fill in the numbers of these fields into the corresponding fields in the main order table, complete Completion of missing information.
  • the server can complete the missing information according to the detailed address in the address database table, and accurately locate the user’s building number, unit number, house number and other information.
  • the step of determining the detailed address between the delivery staff and the user is eliminated, thereby improving the delivery efficiency of the delivery staff.
  • the embodiment of this application only completes the missing fields in the delivery address information. For example, if the missing field in the delivery address information is the house number, then only the house number is completed. Generally speaking, the detailed address information is more detailed than the delivery address information. Therefore, the detailed address information can be queried in the address database table according to the user identification and the delivery address information.
  • step 103 further includes: if the matching result is empty, analyzing the delivery address information corresponding to the order identification to be resolved based on preset address writing rules; and analyzing the order identification to be resolved according to the analysis result
  • the missing information in the corresponding delivery address information is completed to update the order master table; the correspondence between the user ID corresponding to the order ID to be resolved and the completed delivery address information is written into the address Library table.
  • the preset address writing rules will analyze the delivery address information with missing information, and then complete the missing information based on the analysis result, and finally The corresponding relationship between the order identifier to be resolved and the completed delivery address information is written into the address library table, so that the result can be matched from the address library table during the next delivery.
  • some common address writing rules such as ***Building ****Unit**** or ***# ⁇ ***Unit***, etc., are used to resolve the effective address writing rules. Address information. Specifically, big data analysis and other methods can be used to make statistics of writing rules commonly used by users to improve the parsing success rate.
  • step 103 further includes: if the parsing fails, receiving the to-be-resolved order identifier and its corresponding address editing information uploaded by the terminal; The missing information in the delivery address information is completed to update the order master table; the correspondence between the user ID corresponding to the order ID to be resolved and the completed delivery address information is written into the address database table .
  • the delivery person randomly selects a list and clicks "Edit" to enter the address editing details page, as shown in Figure 3.
  • the delivery person can contact the user offline to obtain the correct detailed address information, enter the page, and upload it to the server.
  • the server receives the order identification to be resolved uploaded by the terminal and its corresponding address editing information (that is, the detailed address information entered by the delivery person), and then completes the address editing information into the main order table, and combines the user identification with the completed address
  • the corresponding relationship of the detailed address information is written into the address library table. Then the next time the user places an order, it can be matched correctly. This step seems cumbersome, but it is actually very practical. After several waves of maintenance, the distribution scope that is basically responsible for a delivery person can be completely covered.
  • the address database table even if the user's delivery address information has not been modified, the detailed address information of the user can be easily obtained next time the delivery.
  • Step 104 Perform route optimization based on the updated delivery address information of each order in the order master table, and send the optimization result to the terminal.
  • step 104 may include: arranging each order in the order master table in ascending order based on the updated delivery address information of each order in the order master table, thereby generating a delivery queue.
  • step 104 may further include: arranging orders with missing information in the delivery address information in the order master table to the end of the delivery queue. After step 103, there may still be orders with missing information, then these orders with missing information are placed at the end of the delivery queue to prevent these orders from affecting the delivery efficiency of the entire wave.
  • step 103 if the delivery person does not want to maintain after manual intervention, or wants to maintain in free time, it is also possible.
  • the server will enter the manual optimization order when the route is optimized. Arrange to the end of the delivery queue.
  • the server will optimize the route and the order that has not completed the address matching for this wave Perform the last address library method analysis, and the wave orders will be sorted in ascending order according to the building number, unit number, floor number, and house number.
  • This is a more optimized delivery path, which allows the delivery staff to deliver from the first floor to the nearest location, so that the more the delivery staff goes to the higher floors, the less goods are in the trolley.
  • the delivery staff only needs to follow the guidelines shown in Figure 5. Delivery, which reduces the time to check the next delivery location.
  • the optimized delivery plan is to gradually increase according to the building number, the same building number is arranged in ascending order of unit number, the same unit number is arranged in ascending order of floor height, and the same floor is arranged in ascending order of house number.
  • the delivery person enters a delivery wave, clicks "after starting delivery", the page jumps to the "delivery navigation interface", as shown in Figure 5, the delivery person only needs to operate according to the terminal’s delivery navigation interface prompts, click Next You can view the address of the last user to be delivered for delivery.
  • the embodiments of the present disclosure determine the distribution address information corresponding to each order identifier to be resolved according to the corresponding relationship between each user identifier stored in the address library table and each detailed address information.
  • the technical means of supplementing the missing information and optimizing the route of the completed delivery address information solves the technical problem of low delivery efficiency in the prior art.
  • the missing information in the delivery address information is complemented by the correspondence between each user ID stored in the address library table and each detailed address information, eliminating the need for the delivery person and the user to determine the detailed address, thereby improving The delivery efficiency of the delivery staff; and by optimizing the information such as the building number, unit number, floor number and house number, the delivery efficiency of the delivery staff is further improved.
  • Fig. 6 is a schematic diagram of the main flow of a method for processing order data according to a reference embodiment of the present disclosure.
  • the address resolution process in the method for processing order data may include the following steps:
  • the delivery staff After the delivery staff arrive at the community, they scan the orders of a certain building or several buildings through the delivery terminal they carry with them, and then upload the scanned order numbers to the server.
  • the server receives the order number uploaded by the terminal, queries the user pin and delivery address information corresponding to each order number by calling the order system, and then stores the order number, user pin, and delivery address information in the order master table.
  • the server screens out the order numbers to be resolved with missing information in the delivery address information from the order master table.
  • the server determines whether there is detailed address information in the address database table that matches the user pin and delivery address information; if so, the order will be resolved based on the matched detailed address information
  • the missing information in the delivery address information corresponding to the number is completed to update the order master table; if not, the delivery address information corresponding to the order number to be resolved is analyzed based on the preset address writing rules.
  • the missing information in the delivery address information corresponding to the order number to be resolved will be completed to update the order master table, and then the user pin corresponding to the order number to be resolved will be combined with the completed delivery address information The corresponding relationship is written into the address library table.
  • the delivery person can obtain the correct detailed address information by contacting the user offline, which can be used as the address editing information and uploaded to the server.
  • the server After the server receives the order number to be resolved and the corresponding address editing information uploaded by the terminal, it fills in the missing information in the shipping address information corresponding to the order number to be resolved according to the address editing information, thereby updating the order master table, and then compiling the to be resolved The correspondence between the user pin corresponding to the order number and the completed delivery address information is written into the address library table.
  • FIG. 7 is a schematic diagram of the main modules of the apparatus for processing order data according to an embodiment of the present disclosure.
  • the apparatus for processing order data 700 includes a storage module 701, a screening module 702, a completion module 703, and an optimization module 704; where the storage module 701 is used to receive a number of order identifiers uploaded by the terminal, obtain the user identifier and delivery address information corresponding to each of the order identifiers, and store them in the order master table; the filtering module 702 is used to retrieve the order from the order The main table filters out the order identifiers to be resolved that have missing information in the delivery address information; the completion module 703 is used to perform the analysis on each order to be resolved according to the correspondence between each user identifier stored in the address library table and each detailed address information. The missing information in the delivery address information corresponding to the identification is completed, thereby updating the order master table; the optimization module 704 is configured to optimize the route based on the delivery address information of each order in the updated order master table, and optimize the
  • completion module 703 is also used to:
  • each order identifier to be resolved based on the user identifier and delivery address information corresponding to the order identifier to be resolved, the corresponding relationship between each user identifier and each detailed address information stored in the address database table is matched to find the pending order. Resolve the detailed address information corresponding to the order ID;
  • the missing information in the delivery address information corresponding to the to-be-resolved order identifier is supplemented, thereby updating the order master table.
  • completion module 703 is also used to:
  • the corresponding relationship between the user ID corresponding to the order ID to be resolved and the completed delivery address information is written into the address library table.
  • completion module 703 is also used to:
  • the missing information in the delivery address information corresponding to the order identifier to be resolved is completed, so as to update the order master table;
  • the corresponding relationship between the user ID corresponding to the order ID to be resolved and the completed delivery address information is written into the address library table.
  • optimization module 704 is further configured to:
  • optimization module 704 is further configured to:
  • the missing information includes at least one of a building number, a unit number, a floor number, and a house number.
  • the embodiments of the present disclosure determine the distribution address information corresponding to each order identifier to be resolved according to the corresponding relationship between each user identifier stored in the address library table and each detailed address information.
  • the technical means of supplementing the missing information and optimizing the route of the completed delivery address information solves the technical problem of low delivery efficiency in the prior art.
  • the missing information in the delivery address information is complemented by the correspondence between each user ID stored in the address library table and each detailed address information, eliminating the need for the delivery person and the user to determine the detailed address, thereby improving The delivery efficiency of the delivery staff; and by optimizing the information such as the building number, unit number, floor number and house number, the delivery efficiency of the delivery staff is further improved.
  • FIG. 8 shows an exemplary system architecture 800 of the method for processing order data or the apparatus for processing order data to which the embodiments of the present disclosure can be applied.
  • the system architecture 800 may include terminal devices 801, 802, and 803, a network 804, and a server 805.
  • the network 804 is used to provide a medium for communication links between the terminal devices 801, 802, 803 and the server 805.
  • the network 804 may include various connection types, such as wired, wireless communication links, or fiber optic cables, and so on.
  • the user can use the terminal devices 801, 802, 803 to interact with the server 805 through the network 804 to receive or send messages and so on.
  • Various communication client applications such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc., may be installed on the terminal devices 801, 802, and 803 (only examples).
  • the terminal devices 801, 802, and 803 may be various electronic devices that have a display screen and support web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and so on.
  • the server 805 may be a server that provides various services, for example, a back-end management server (just an example) that provides support for shopping websites browsed by users using the terminal devices 801, 802, and 803.
  • the background management server can analyze and process the received item information query request and other data, and feed back the processing result (for example, target push information, item information-only examples) to the terminal device.
  • the method for processing order data provided by the embodiments of the present disclosure is generally executed by the server 805, and accordingly, the device for processing order data is generally set in the server 805.
  • terminal devices, networks, and servers in FIG. 8 are merely illustrative. According to implementation needs, there can be any number of terminal devices, networks, and servers.
  • FIG. 9 shows a schematic structural diagram of a computer system 900 suitable for implementing a terminal device of an embodiment of the present disclosure.
  • the terminal device shown in FIG. 9 is only an example, and should not bring any limitation to the function and scope of use of the embodiments of the present disclosure.
  • the computer system 900 includes a central processing unit (CPU) 901, which can be based on a program stored in a read-only memory (ROM) 902 or a program loaded from a storage portion 908 into a random access memory (RAM) 903 And perform various appropriate actions and processing.
  • ROM read-only memory
  • RAM random access memory
  • various programs and data required for the operation of the system 900 are also stored.
  • the CPU 901, the ROM 902, and the RAM 903 are connected to each other through a bus 904.
  • An input/output (I/O) interface 905 is also connected to the bus 904.
  • the following components are connected to the I/O interface 905: an input part 906 including a keyboard, a mouse, etc.; an output part 907 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and speakers, etc.; a storage part 908 including a hard disk, etc. ; And a communication section 909 including a network interface card such as a LAN card, a modem, and the like. The communication section 909 performs communication processing via a network such as the Internet.
  • the drive 910 is also connected to the I/O interface 905 as needed.
  • a removable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 910 as needed, so that the computer program read from it is installed into the storage portion 908 as needed.
  • the process described above with reference to the flowchart can be implemented as a computer software program.
  • the embodiments disclosed in the present disclosure include a computer program, which includes a computer program carried on a computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart.
  • the computer program may be downloaded and installed from the network through the communication part 909, and/or installed from the removable medium 911.
  • the central processing unit (CPU) 901 the above-mentioned functions defined in the system of the present disclosure are executed.
  • the computer-readable medium shown in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the two.
  • the computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or a combination of any of the above. More specific examples of computer-readable storage media may include, but are not limited to: electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable Programmable read only memory (EPROM or flash memory), optical fiber, portable compact disk read only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the above.
  • a computer-readable storage medium may be any tangible medium that contains or stores a program, and the program may be used by or in combination with an instruction execution system, apparatus, or device.
  • a computer-readable signal medium may include a data signal propagated in a baseband or as a part of a carrier wave, and a computer-readable program code is carried therein. This propagated data signal can take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • the computer-readable signal medium may also be any computer-readable medium other than the computer-readable storage medium.
  • the computer-readable medium may send, propagate or transmit the program for use by or in combination with the instruction execution system, apparatus, or device .
  • the program code contained on the computer-readable medium can be transmitted by any suitable medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.
  • each block in the flowchart or block diagram may represent a module, program segment, or part of code, and the above-mentioned module, program segment, or part of code contains one or more for realizing the specified logic function.
  • Executable instructions may also occur in a different order from the order marked in the drawings. For example, two blocks shown one after the other can actually be executed substantially in parallel, or they can sometimes be executed in the reverse order, depending on the functions involved.
  • each block in the block diagram or flowchart, and the combination of blocks in the block diagram or flowchart can be implemented by a dedicated hardware-based system that performs the specified function or operation, or can be implemented by It is realized by a combination of dedicated hardware and computer instructions.
  • the modules involved in the embodiments described in the present disclosure can be implemented in software or hardware.
  • the described modules can also be set in the processor.
  • a processor includes a storage module, a filter module, a completion module, and an optimization module, where the names of these modules do not constitute in some cases Restrictions on the module itself.
  • the present disclosure also provides a computer-readable medium.
  • the computer-readable medium may be included in the device described in the above embodiment; or it may exist alone without being assembled into the device.
  • the above-mentioned computer-readable medium carries one or more programs.
  • the device implements the following method: receiving several order identifiers uploaded by the terminal, and obtaining the corresponding order identifiers.
  • the user identification and delivery address information are stored in the order master table; the order identifications to be resolved with missing information in the delivery address information are filtered from the order master table; according to the user identifications and details stored in the address library table Correspondence of address information, complete missing information in the delivery address information corresponding to each of the order identifiers to be resolved, thereby updating the order master table; based on the updated delivery address of each order in the order master table
  • the information performs path optimization, and the optimization result is sent to the terminal.
  • the missing information in the delivery address information corresponding to each order identifier to be resolved is complemented based on the correspondence between each user identifier stored in the address library table and each detailed address information, and
  • the technical means of optimizing the route of the completed delivery address information overcomes the technical problem of low delivery efficiency in the prior art.
  • the missing information in the delivery address information is complemented by the correspondence between each user ID stored in the address library table and each detailed address information, eliminating the need for the delivery person and the user to determine the detailed address, thereby improving The delivery efficiency of the delivery staff; and by optimizing the information such as the building number, unit number, floor number and house number, the delivery efficiency of the delivery staff is further improved.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Human Resources & Organizations (AREA)
  • Theoretical Computer Science (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Databases & Information Systems (AREA)
  • Game Theory and Decision Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Remote Sensing (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Information Transfer Between Computers (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

一种处理订单数据的方法和装置，涉及物流配送技术领域。该方法包括：接收终端上传的若干个订单标识，获取各个所述订单标识对应的用户标识和配送地址信息，并存储在订单主表中（S101）；从所述订单主表中筛选出配送地址信息中存在缺失信息的待解析订单标识（S102）；根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表（S103）；基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，将优化结果发送至所述终端（S104）。该方法能够解决配送效率低的技术问题。

Description

一种处理订单数据的方法和装置
本申请要求于2020年6月5日提交的中国申请号202010505474.7、发明名称为“一种处理订单数据的方法和装置”的申请的优先权，其全部内容通过引用的方式并入本文中。
技术领域
本公开涉及物流配送技术领域，尤其涉及一种处理订单数据的方法和装置。
背景技术
配送员上楼送货时，如果货物较多，一般都会把货物放在一个小推车里面，然后一户一户的送货，有时候货物比较多，就很难找到最优的送货路径，一般是靠记忆力去配送。
在实现本公开过程中，发明人发现现有技术中至少存在如下问题：
如果配送员记不住哪几个楼层或者住户的货物，那么就需要再次逐个查看货物，直到确认哪几个楼层有货，如果配送的货物稍多就会严重影响配送效率。
用户填写的配送地址不够详细或者是存在缺失信息，导致配送员无法正确的找到具体门牌号，无法及时提供上门送货服务，需要打电话与用户确认，这种情况也会严重影响配送效率。
发明内容
有鉴于此，本公开实施例提供一种处理订单数据的方法和装置，以解决配送效率低的技术问题。
为实现上述目的，根据本公开实施例的一个方面，提供了一种处理订单数据的方法，包括：
接收终端上传的若干个订单标识，获取各个所述订单标识对应的用户标识和配送地址信息，并存储在订单主表中；
从所述订单主表中筛选出配送地址信息中存在缺失信息的待解析订单标识；
根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；
基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，将优化结果发送至所述终端。
可选地，根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表，包括：
对于每个所述待解析订单标识，基于所述待解析订单标识对应的用户标识和配送地址信息，从地址库表中存储的各个用户标识与各个详细地址信息的对应关系中匹配出所述待解析订单标识对应的详细地址信息；
根据匹配出的详细地址信息，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表。
可选地，根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表，还包括：
若匹配结果为空，则基于预设的地址书写规则，对所述待解析订单标识对应的配送地址信息进行解析；
根据解析结果，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；
将所述待解析订单标识对应的用户标识与补全后的所述配送地址信息的对应关系写入所述地址库表。
可选地，根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的 缺失信息进行补全，从而更新所述订单主表，还包括：
若解析失败，则接收所述终端上传的所述待解析订单标识及其对应的地址编辑信息；
根据所述地址编辑信息，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；
将所述待解析订单标识对应的用户标识与补全后的所述配送地址信息的对应关系写入所述地址库表。
可选地，基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，包括：
基于更新后的所述订单主表中各个订单的配送地址信息，对所述订单主表中各个订单进行升序排列，从而生成投递队列。
可选地，基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，还包括：
将所述订单主表中配送地址信息中存在缺失信息的订单排列到所述投递队列的最后。
可选地，所述缺失信息包括楼号、单元号、楼层号和门牌号中的至少一种。
另外，根据本公开实施例的另一个方面，提供了一种处理订单数据的装置，包括：
存储模块，用于接收终端上传的若干个订单标识，获取各个所述订单标识对应的用户标识和配送地址信息，并存储在订单主表中；
筛选模块，用于从所述订单主表中筛选出配送地址信息中存在缺失信息的待解析订单标识；
补全模块，用于根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；
优化模块，用于基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，将优化结果发送至所述终端。
根据本公开实施例的另一个方面，还提供了一种电子设备，包括：
一个或多个处理器；
存储装置，用于存储一个或多个程序，
当所述一个或多个程序被所述一个或多个处理器执行时，所述一个或多个处理器实现上述任一实施例所述的方法。
根据本公开实施例的另一个方面，还提供了一种计算机可读介质，其上存储有计算机程序，所述程序被处理器执行时实现上述任一实施例所述的方法。
上述公开中的一个实施例具有如下优点或有益效果：因为采用根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个待解析订单标识对应的配送地址信息中的缺失信息进行补全，并对补全后的配送地址信息进行路径优化的技术手段，所以克服了现有技术中配送效率低的技术问题。本公开实施例通过地址库表中存储的各个用户标识与各个详细地址信息的对应关系对配送地址信息中的缺失信息进行补全，省去了配送员与用户确定详细地址的步骤，从而提高了配送员的配送效率；而且通过对楼号、单元号、楼层号和门牌号等信息进行路径优化，进一步提高了配送员的配送效率。
上述的非惯用的可选方式所具有的进一步效果将在下文中结合具体实施方式加以说明。
附图说明
附图用于更好地理解本公开，不构成对本公开的不当限定。其中：
图1是根据本公开实施例的处理订单数据的方法的主要流程的示 意图；
图2是根据本公开实施例的解析失败的订单列表的示意图；
图3是根据本公开实施例的地址编辑详情页面的示意图；
图4是根据本公开实施例的波次安排页面的示意图；
图5是根据本公开实施例的配送导航页面的示意图；
图6是根据本公开一个可参考实施例的处理订单数据的方法的主要流程的示意图；
图7是根据本公开实施例的处理订单数据的装置的主要模块的示意图；
图8是本公开实施例可以应用于其中的示例性系统架构图；
图9是适于用来实现本公开实施例的终端设备或服务器的计算机系统的结构示意图。
具体实施方式
以下结合附图对本公开的示范性实施例做出说明，其中包括本公开实施例的各种细节以助于理解，应当将它们认为仅仅是示范性的。因此，本领域普通技术人员应当认识到，可以对这里描述的实施例做出各种改变和修改，而不会背离本公开的范围和精神。同样，为了清楚和简明，以下的描述中省略了对公知功能和结构的描述。
目前，配送员上门送货时都需要自己提前排放好配送顺序，没有优化的楼层路径方案，导致可能某个楼层漏送，还要反复去某个楼层，导致配送效率低。而且配送完一个波次的货物后，无法查看哪些包裹送出，哪些包裹没有送出，不方便数据汇总。对于地址不完整的用户，若不及时修改收货地址，每次配送员都要通过电话或者短信等方式与用户确认详细地址，流程非常繁琐，导致配送效率下降。
图1是根据本公开实施例的处理订单数据的方法的主要流程的示意图。作为本公开的一个实施例，如图1所示，所述处理订单数据的方法可以包括：
步骤101，接收终端上传的若干个订单标识，获取各个所述订单标 识对应的用户标识和配送地址信息，并存储在订单主表中。
配送员到达小区后，对于某一个楼或者几栋楼的订单进行扫描(当然如果整个小区的货物不多，可以全部扫描，不按照楼号扫描)，甚至也可以随机拿出几个订单进行扫描，配送员可以决定一次送几个包裹，这几个包裹运单就称作一个波次。配送员可以通过随身携带的配送终端进行扫描，也可以通过手机进行扫描，还可以通过其他终端进行扫描，然后终端将扫描的这几个包裹的订单标识上传至服务端。
服务端接收终端上传的一个波次的订单标识后，调用订单系统查询各个订单标识对应的用户标识(比如用户PIN)和配送地址信息，然后将订单标识及其对应的用户标识、配送地址信息都存储在订单主表中，此时各个订单的状态state＝0，表示订单未解析。在本公开的实施例中，订单系统是配送系统的核心系统之一，相当于一个订单池，存储有所有的订单信息。
可选地，所述订单主表可以包含以下字段：用户PIN(pin)、订单号(order_no)、配送地址(address)、楼号(building_no)、单元号(unit)、门牌号(room_no)和状态(state)。需要指出的是，从订单系统中获取的配送地址信息是用户填写的，可能存在信息缺失，例如没有填写楼层号或者门牌号等信息，那么这些缺失字段则不填写信息，通过后续步骤将这些缺失信息补齐到对应的字段中。通常来说，门牌号包含了楼层号。可选地，也可以增加楼层号的字段，本公开实施例对此不作限制。
需要说明的是，当配送员到达小区后，相当于已经确定了各个订单的小区信息，因此本申请实施例是对更详细的楼号、单元号、楼层号、门牌号等进行信息补全和路径优化，从而提高配送员在该小区内的配送效率。
步骤102，从所述订单主表中筛选出配送地址信息中存在缺失信息的待解析订单标识。
将配送地址信息存储到订单主表之后，开始对订单主表中的各个配送地址信息进行异步解析(步骤102)和补全(步骤103)。可选地，可以通过查询订单主表中的各个字段，筛选出配送地址信息中存在缺 失信息的待解析订单标识。可选地，所述缺失信息包括楼号、单元号、楼层号和门牌号中的至少一种。比如筛选出的待解析订单标识的配送地址信息中门牌号缺失，单元号和门牌号都缺失，或者，楼号、单元号和门牌号都缺失。
步骤103，根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表。
在本公开的实施例中，地址库表中存储有各个用户标识与各个详细地址信息、楼号、单元号、门牌号等的对应关系。可选地，所述地址库表可以包含以下字段：用户PIN(pin)、订单号(order_no)、详细地址信息(address)、楼号(building_no)、单元号(unit)和门牌号(room_no)。
可选地，步骤103可以包括：对于每个所述待解析订单标识，基于所述待解析订单标识对应的用户标识和配送地址信息，从地址库表中存储的各个用户标识与各个详细地址信息的对应关系中匹配出所述待解析订单标识对应的详细地址信息；根据匹配出的详细地址信息，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表。由于地址库表中存储有详细地址信息，因此可以通过待解析订单标识对应的用户标识和配送地址信息，从地址库表中匹配出所述待解析订单标识对应的详细地址信息，然后根据详细地址信息对应的楼号(building_no)、单元号(unit)和门牌号(room_no)等信息对待解析订单标识对应的配送地址信息中的缺失信息进行补全。
比如，待解析订单标识对应的配送地址信息为“北京市大兴区南海家园二里”，存在信息缺失，通过用户PIN和“北京市大兴区南海家园二里”从地址库表中匹配出一条结果：北京市大兴区南海家园二里1楼2单元301房间。那么该结果对应的楼号(building_no)、单元号(unit)和门牌号(room_no)等字段分别为1、2和301，然后将这些字段的数字分别填充到订单主表中的对应字段，完成对缺失信息的补全。那么，即使用户填写的配送地址存在缺失信息，服务端也可以根据地址 库表中的详细地址对缺失的信息进行补全，精确地定位出用户所在楼号、单元号、门牌号等信息，省去了配送员与用户确定详细地址的步骤，从而提高了配送员的配送效率。
需要指出的是，本申请实施例只补全配送地址信息中缺失的字段，比如，配送地址信息中缺失字段为门牌号，那么只对门牌号进行补全。一般来说，详细地址信息比配送地址信息更加详细，因此根据用户标识和配送地址信息可以在地址库表中查询出详细地址信息。
可选地，步骤103还包括：若匹配结果为空，则基于预设的地址书写规则，对所述待解析订单标识对应的配送地址信息进行解析；根据解析结果，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；将所述待解析订单标识对应的用户标识与补全后的所述配送地址信息的对应关系写入所述地址库表。
如果匹配结果为空或者无法匹配出唯一一条详细地址信息，说明匹配失败，则预设的地址书写规则对存在缺失信息的配送地址信息进行解析，然后根据解析结果对缺失信息进行补全，最后将待解析订单标识与补全后的配送地址信息的对应关系写入地址库表，以便于下次配送时能够从地址库表中匹配出结果。
在本公开的实施例中，通过一些常见的地址书写规则，比如***号楼****单元****或者***#楼***单元***等书写规则解析出有效的地址信息。具体地，可以经过大数据分析等方法，统计出用户常用的书写规则，以提高解析成功率。
完成信息补全后，将订单状态state标记为1，说明表示订单已解析并且信息完整。
可选地，步骤103还包括：若解析失败，则接收所述终端上传的所述待解析订单标识及其对应的地址编辑信息；根据所述地址编辑信息，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；将所述待解析订单标识对应的用户标识与补全后的所述配送地址信息的对应关系写入所述地址库表。
如果前面两种方式都无法实现对缺失信息的补全，接下来进入人工干预阶段。具体地，配送员通过终端进入页面地址编辑，可以看到 所有未被正确解析地址的订单(state＝0)，如图2所示。配送员随机选出一个单子，点击“编辑”，进入地址编辑详情页面，如图3所示，配送员可以通过线下联系用户获得正确的详细地址信息，录入该页面，并上传服务端。服务端接收终端上传的待解析订单标识及其对应的地址编辑信息(即配送员输入的详细地址信息)，然后将地址编辑信息补全到订单主表中，并将用户标识与补全后的详细地址信息的对应关系写入地址库表。那么下次该用户下单就能正确匹配，该步骤看似繁琐，其实非常实用，经过几个波次的维护，基本一个配送员负责的配送范围就能完全覆盖。本公开实施例通过维护地址库表，即使用户的配送地址信息一直没有修改，那么下次配送也能很容易得到用户的详细地址信息。
步骤104，基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，将优化结果发送至所述终端。
完成信息补全后，服务端基于更新后的所述订单主表中所有未配送的订单的配送地址信息进行路径优化，然后将将优化结果发送至所述终端。可选地，步骤104可以包括：基于更新后的所述订单主表中各个订单的配送地址信息，对所述订单主表中各个订单进行升序排列，从而生成投递队列。
可选地，步骤104还可以包括：将所述订单主表中配送地址信息中存在缺失信息的订单排列到所述投递队列的最后。经过步骤103之后，可能仍然存在缺失信息的订单，那么将这些缺失信息的订单排到投递队列的最后，避免这些订单影响整个波次的配送效率。
需要指出的是，在步骤103中，如果进入人工干预之后，配送员不想去维护，或者是想在空闲时间去维护，也是可以的，服务端会在路径优化时将这种进入人工优化的订单排列到投递队列的最后。
当配送员扫描完一个送货波次的包裹，可以进入波次安排界面，如图4所示，点击“开始配送”后，服务端进行路径优化，并对该波次未完成地址匹配的订单进行最后一次地址库方式解析，同时该波次订单会按照楼号、单元号、楼层号、门牌号进行升序排列。这样就是 一条比较优化的配送路径，可以让配送员从一层开始就近配送，使得配送员越往高楼层走，小车里面的货物越少，同时配送员只需按照如图5所示的指引进行配送，这样减少了查看下一个投递位置的时间。优化后的投递方案就是按照楼号逐渐升高，同一楼号按照单元号升序排列，同一单元号按照层高升序排列，同一楼层按照门牌号升序排列。
配送员进入一个配送波次，点击“开始配送之后”，页面跳转至“配送导航界面”，如图5所示，配送员只需按照终端的配送导航界面提示进行操作即可，点击下一单即可查看到最近一个待投递用户的地址进行投递。
根据上面所述的各种实施例，可以看出本公开实施例通过根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个待解析订单标识对应的配送地址信息中的缺失信息进行补全，并对补全后的配送地址信息进行路径优化的技术手段，解决了现有技术中配送效率低的技术问题。本公开实施例通过地址库表中存储的各个用户标识与各个详细地址信息的对应关系对配送地址信息中的缺失信息进行补全，省去了配送员与用户确定详细地址的步骤，从而提高了配送员的配送效率；而且通过对楼号、单元号、楼层号和门牌号等信息进行路径优化，进一步提高了配送员的配送效率。
图6是根据本公开一个可参考实施例的处理订单数据的方法的主要流程的示意图。作为本公开的又一个实施例，如图6所示，所述处理订单数据的方法中的地址解析流程可以包括以下步骤：
配送员到达小区后，通过随身携带的配送终端对某一个楼或者几栋楼的订单进行扫描，然后将扫描到的若干个订单号上传至服务端。
服务端接收终端上传的订单号，通过调用订单系统查询各个订单号对应的用户pin和配送地址信息，然后将订单号、用户pin和配送地址信息等信息存储到订单主表中。
服务端从所述订单主表中筛选出配送地址信息中存在缺失信息的待解析订单号。
服务端基于待解析订单号对应的用户pin和配送地址信息，判断地址库表中是否存在与用户pin、配送地址信息匹配的详细地址信息；若是，则根据匹配出的详细地址信息，对待解析订单号对应的配送地址信息中的缺失信息进行补全，从而更新订单主表；若否，则基于预设的地址书写规则，对待解析订单号对应的配送地址信息进行解析。
若解析成功，则根据解析结果，对待解析订单号对应的配送地址信息中的缺失信息进行补全，从而更新订单主表，然后将待解析订单号对应的用户pin与补全后的配送地址信息的对应关系写入地址库表。
若解析失败，则进入人工处理。配送员可以通过线下联系用户获得正确的详细地址信息，作为地址编辑信息，上传服务端。
服务端接收终端上传的待解析订单号及其对应的地址编辑信息之后，根据地址编辑信息对待解析订单号对应的配送地址信息中的缺失信息进行补全，从而更新订单主表，然后将待解析订单号对应的用户pin与补全后的配送地址信息的对应关系写入地址库表。
另外，在本公开一个可参考实施例中处理订单数据的方法的具体实施内容，在上面所述处理订单数据的方法中已经详细说明了，故在此重复内容不再说明。
图7是根据本公开实施例的处理订单数据的装置的主要模块的示意图，如图7所示，所述处理订单数据的装置700包括存储模块701、筛选模块702、补全模块703和优化模块704；其中，存储模块701用于接收终端上传的若干个订单标识，获取各个所述订单标识对应的用户标识和配送地址信息，并存储在订单主表中；筛选模块702用于从所述订单主表中筛选出配送地址信息中存在缺失信息的待解析订单标识；补全模块703用于根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；优化模块704用于基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，将优化结果发送至所述终端。
可选地，所述补全模块703还用于：
对于每个所述待解析订单标识，基于所述待解析订单标识对应的用户标识和配送地址信息，从地址库表中存储的各个用户标识与各个详细地址信息的对应关系中匹配出所述待解析订单标识对应的详细地址信息；
根据匹配出的详细地址信息，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表。
可选地，所述补全模块703还用于：
若匹配结果为空，则基于预设的地址书写规则，对所述待解析订单标识对应的配送地址信息进行解析；
根据解析结果，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；
将所述待解析订单标识对应的用户标识与补全后的所述配送地址信息的对应关系写入所述地址库表。
可选地，所述补全模块703还用于：
若解析失败，则接收所述终端上传的所述待解析订单标识及其对应的地址编辑信息；
根据所述地址编辑信息，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；
将所述待解析订单标识对应的用户标识与补全后的所述配送地址信息的对应关系写入所述地址库表。
可选地，所述优化模块704还用于：
基于更新后的所述订单主表中各个订单的配送地址信息，对所述订单主表中各个订单进行升序排列，从而生成投递队列。
可选地，所述优化模块704还用于：
将所述订单主表中配送地址信息中存在缺失信息的订单排列到所 述投递队列的最后。
可选地，所述缺失信息包括楼号、单元号、楼层号和门牌号中的至少一种。
根据上面所述的各种实施例，可以看出本公开实施例通过根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个待解析订单标识对应的配送地址信息中的缺失信息进行补全，并对补全后的配送地址信息进行路径优化的技术手段，解决了现有技术中配送效率低的技术问题。本公开实施例通过地址库表中存储的各个用户标识与各个详细地址信息的对应关系对配送地址信息中的缺失信息进行补全，省去了配送员与用户确定详细地址的步骤，从而提高了配送员的配送效率；而且通过对楼号、单元号、楼层号和门牌号等信息进行路径优化，进一步提高了配送员的配送效率。
需要说明的是，在本公开所述处理订单数据的装置的具体实施内容，在上面所述处理订单数据的方法中已经详细说明了，故在此重复内容不再说明。
图8示出了可以应用本公开实施例的处理订单数据的方法或处理订单数据的装置的示例性系统架构800。
如图8所示，系统架构800可以包括终端设备801、802、803，网络804和服务器805。网络804用以在终端设备801、802、803和服务器805之间提供通信链路的介质。网络804可以包括各种连接类型，例如有线、无线通信链路或者光纤电缆等等。
用户可以使用终端设备801、802、803通过网络804与服务器805交互，以接收或发送消息等。终端设备801、802、803上可以安装有各种通讯客户端应用，例如购物类应用、网页浏览器应用、搜索类应用、即时通信工具、邮箱客户端、社交平台软件等(仅为示例)。
终端设备801、802、803可以是具有显示屏并且支持网页浏览的各种电子设备，包括但不限于智能手机、平板电脑、膝上型便携计算 机和台式计算机等等。
服务器805可以是提供各种服务的服务器，例如对用户利用终端设备801、802、803所浏览的购物类网站提供支持的后台管理服务器(仅为示例)。后台管理服务器可以对接收到的物品信息查询请求等数据进行分析等处理，并将处理结果(例如目标推送信息、物品信息——仅为示例)反馈给终端设备。
需要说明的是，本公开实施例所提供的处理订单数据的方法一般由服务器805执行，相应地，所述处理订单数据的装置一般设置在服务器805中。
应该理解，图8中的终端设备、网络和服务器的数目仅仅是示意性的。根据实现需要，可以具有任意数目的终端设备、网络和服务器。
下面参考图9，其示出了适于用来实现本公开实施例的终端设备的计算机系统900的结构示意图。图9示出的终端设备仅仅是一个示例，不应对本公开实施例的功能和使用范围带来任何限制。
如图9所示，计算机系统900包括中央处理单元(CPU)901，其可以根据存储在只读存储器(ROM)902中的程序或者从存储部分908加载到随机访问存储器(RAM)903中的程序而执行各种适当的动作和处理。在RAM 903中，还存储有系统900操作所需的各种程序和数据。CPU 901、ROM 902以及RAM903通过总线904彼此相连。输入/输出(I/O)接口905也连接至总线904。
以下部件连接至I/O接口905：包括键盘、鼠标等的输入部分906；包括诸如阴极射线管(CRT)、液晶显示器(LCD)等以及扬声器等的输出部分907；包括硬盘等的存储部分908；以及包括诸如LAN卡、调制解调器等的网络接口卡的通信部分909。通信部分909经由诸如因特网的网络执行通信处理。驱动器910也根据需要连接至I/O接口905。可拆卸介质911，诸如磁盘、光盘、磁光盘、半导体存储器等等，根据需要安装在驱动器910上，以便于从其上读出的计算机程序根据需要被安装入存储部分908。
特别地，根据本公开公开的实施例，上文参考流程图描述的过程可以被实现为计算机软件程序。例如，本公开公开的实施例包括一种计算机程序，其包括承载在计算机可读介质上的计算机程序，该计算机程序包含用于执行流程图所示的方法的程序代码。在这样的实施例中，该计算机程序可以通过通信部分909从网络上被下载和安装，和/或从可拆卸介质911被安装。在该计算机程序被中央处理单元(CPU)901执行时，执行本公开的系统中限定的上述功能。
需要说明的是，本公开所示的计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质或者是上述两者的任意组合。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。计算机可读存储介质的更具体的例子可以包括但不限于：具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机访问存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑磁盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。在本公开中，计算机可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、装置或者器件使用或者与其结合使用。而在本公开中，计算机可读的信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。计算机可读的信号介质还可以是计算机可读存储介质以外的任何计算机可读介质，该计算机可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。计算机可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于：无线、电线、光缆、RF等等，或者上述的任意合适的组合。
附图中的流程图和框图，图示了按照本公开各种实施例的系统、 方法和计算机程序的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个模块、程序段、或代码的一部分，上述模块、程序段、或代码的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个接连地表示的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是，框图或流程图中的每个方框、以及框图或流程图中的方框的组合，可以用执行规定的功能或操作的专用的基于硬件的系统来实现，或者可以用专用硬件与计算机指令的组合来实现。
描述于本公开实施例中所涉及到的模块可以通过软件的方式实现，也可以通过硬件的方式来实现。所描述的模块也可以设置在处理器中，例如，可以描述为：一种处理器包括存储模块、筛选模块、补全模块和优化模块，其中，这些模块的名称在某种情况下并不构成对该模块本身的限定。
作为另一方面，本公开还提供了一种计算机可读介质，该计算机可读介质可以是上述实施例中描述的设备中所包含的；也可以是单独存在，而未装配入该设备中。上述计算机可读介质承载有一个或者多个程序，当上述一个或者多个程序被一个该设备执行时，该设备实现如下方法：接收终端上传的若干个订单标识，获取各个所述订单标识对应的用户标识和配送地址信息，并存储在订单主表中；从所述订单主表中筛选出配送地址信息中存在缺失信息的待解析订单标识；根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，将优化结果发送至所述终端。
根据本公开实施例的技术方案，因为采用根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个待解析订单标 识对应的配送地址信息中的缺失信息进行补全，并对补全后的配送地址信息进行路径优化的技术手段，所以克服了现有技术中配送效率低的技术问题。本公开实施例通过地址库表中存储的各个用户标识与各个详细地址信息的对应关系对配送地址信息中的缺失信息进行补全，省去了配送员与用户确定详细地址的步骤，从而提高了配送员的配送效率；而且通过对楼号、单元号、楼层号和门牌号等信息进行路径优化，进一步提高了配送员的配送效率。
上述具体实施方式，并不构成对本公开保护范围的限制。本领域技术人员应该明白的是，取决于设计要求和其他因素，可以发生各种各样的修改、组合、子组合和替代。任何在本公开的精神和原则之内所作的修改、等同替换和改进等，均应包含在本公开保护范围之内。

Claims (9)

  1. 一种处理订单数据的方法，包括：
    接收终端上传的若干个订单标识，获取各个所述订单标识对应的用户标识和配送地址信息，并存储在订单主表中；
    从所述订单主表中筛选出配送地址信息中存在缺失信息的待解析订单标识；
    根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；以及
    基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，将优化结果发送至所述终端。
  2. 根据权利要求1所述的方法，其中，根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表，包括：
    对于每个所述待解析订单标识，基于所述待解析订单标识对应的用户标识和配送地址信息，从地址库表中存储的各个用户标识与各个详细地址信息的对应关系中匹配出所述待解析订单标识对应的详细地址信息；
    根据匹配出的详细地址信息，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表。
  3. 根据权利要求2所述的方法，其中，根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表，还包括：
    若匹配结果为空，则基于预设的地址书写规则，对所述待解析订 单标识对应的配送地址信息进行解析；
    根据解析结果，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；
    将所述待解析订单标识对应的用户标识与补全后的所述配送地址信息的对应关系写入所述地址库表。
  4. 根据权利要求3所述的方法，其中，根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表，还包括：
    若解析失败，则接收所述终端上传的所述待解析订单标识及其对应的地址编辑信息；
    根据所述地址编辑信息，对所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；
    将所述待解析订单标识对应的用户标识与补全后的所述配送地址信息的对应关系写入所述地址库表。
  5. 根据权利要求1所述的方法，其中，基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，包括：
    基于更新后的所述订单主表中各个订单的配送地址信息，对所述订单主表中各个订单进行升序排列，从而生成投递队列。
  6. 根据权利要求5所述的方法，其中，基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，还包括：
    将所述订单主表中配送地址信息中存在缺失信息的订单排列到所述投递队列的最后。
  7. 根据权利要求1所述的方法，其中，所述缺失信息包括楼号、单元号、楼层号和门牌号中的至少一种。
  8. 一种处理订单数据的装置，包括：
    至少一个处理器，所述至少一个处理器被配置为：
    接收终端上传的若干个订单标识，获取各个所述订单标识对应的用户标识和配送地址信息，并存储在订单主表中；
    从所述订单主表中筛选出配送地址信息中存在缺失信息的待解析订单标识；
    根据地址库表中存储的各个用户标识与各个详细地址信息的对应关系，对各个所述待解析订单标识对应的配送地址信息中的缺失信息进行补全，从而更新所述订单主表；以及
    基于更新后的所述订单主表中各个订单的配送地址信息进行路径优化，将优化结果发送至所述终端。
  9. 一种计算机可读介质，其上存储有计算机程序，所述程序被处理器执行时实现如权利要求1-7中任一所述的方法。
PCT/CN2021/092999 2020-06-05 2021-05-11 一种处理订单数据的方法和装置 Ceased WO2021244233A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP21816738.5A EP4145300A4 (en) 2020-06-05 2021-05-11 METHOD AND DEVICE FOR PROCESSING ORDER DATA
JP2022570663A JP7481067B2 (ja) 2020-06-05 2021-05-11 注文データの処理方法及び処理装置並びにコンピュータ読み取り可能な媒体
US17/926,883 US20230196271A1 (en) 2020-06-05 2021-05-11 Method and apparatus for processing order data

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010505474.7A CN113761085B (zh) 2020-06-05 2020-06-05 一种处理订单数据的方法和装置
CN202010505474.7 2020-06-05

Publications (1)

Publication Number Publication Date
WO2021244233A1 true WO2021244233A1 (zh) 2021-12-09

Family

ID=78784940

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/092999 Ceased WO2021244233A1 (zh) 2020-06-05 2021-05-11 一种处理订单数据的方法和装置

Country Status (5)

Country Link
US (1) US20230196271A1 (zh)
EP (1) EP4145300A4 (zh)
JP (1) JP7481067B2 (zh)
CN (1) CN113761085B (zh)
WO (1) WO2021244233A1 (zh)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP7480746B2 (ja) * 2021-05-14 2024-05-10 トヨタ自動車株式会社 物流システム、物流ロボット、及び物流ロボット制御方法
CN117217849A (zh) * 2022-05-30 2023-12-12 北京京东乾石科技有限公司 订单处理方法、装置、电子设备和计算机可读介质
CN117333086A (zh) * 2022-06-24 2024-01-02 北京京东振世信息技术有限公司 运单信息处理方法、装置、电子设备和计算机可读介质
CN115422431A (zh) * 2022-08-10 2022-12-02 北京声智科技有限公司 一种数据处理方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050137991A1 (en) * 2003-12-18 2005-06-23 Bruce Ben F. Method and system for name and address validation and correction
CN106033460A (zh) * 2015-03-19 2016-10-19 阿里巴巴集团控股有限公司 地址数据处理方法及装置
CN109697523A (zh) * 2017-10-23 2019-04-30 顺丰科技有限公司 优化收派件路径的方法、系统及设备
CN109886618A (zh) * 2019-01-17 2019-06-14 江苏苏宁物流有限公司 一种优化物流作业的方法及装置
CN110569239A (zh) * 2019-09-19 2019-12-13 圆通速递有限公司 一种快递包裹地址标准化的方法和系统

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002082982A (ja) * 2000-09-06 2002-03-22 Nippon Telegr & Teleph Corp <Ntt> 情報提供装置および方法と情報提供プログラムを記録した記録媒体
KR100638641B1 (ko) * 2004-03-12 2006-10-27 한국전자통신연구원 실시간 물류 접수 및 배달 실행을 위한 지능형 관제 장치및 그 방법과 그에 따른 단말 장치 및 그 운용 방법
EP2423865A1 (en) * 2010-08-26 2012-02-29 RAF Technology, Inc. Multiple address verification system for delivery routing
US10796270B1 (en) * 2013-02-07 2020-10-06 United Parcel Service Of America, Inc. Systems and methods for synchronized delivery
JP2016159245A (ja) * 2015-03-03 2016-09-05 株式会社東芝 配達物処理装置、および配達物処理プログラム
CN107145577A (zh) * 2017-05-08 2017-09-08 上海东方网络金融服务有限公司 地址标准化方法、装置、存储介质及计算机
CN107609890A (zh) * 2017-08-03 2018-01-19 北京京东尚科信息技术有限公司 一种订单跟踪的方法和装置
CN110570137B (zh) * 2018-06-05 2024-06-21 北京京东振世信息技术有限公司 信息推送方法和装置
CN111047229A (zh) * 2018-10-11 2020-04-21 北京京东尚科信息技术有限公司 一种订单配送信息的处理方法和系统
CN111038906B (zh) * 2018-10-11 2023-11-03 北京京东振世信息技术有限公司 一种订单分拣方法和装置
CN110334162B (zh) * 2019-05-09 2021-11-09 德邦物流股份有限公司 地址识别方法及装置
US11455594B2 (en) * 2019-11-26 2022-09-27 Target Brands, Inc. Load tracking computing platform and user interface
CN111027906B (zh) * 2019-12-05 2023-12-05 北京京东振世信息技术有限公司 配送订单确定方法、装置、存储介质与终端设备

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050137991A1 (en) * 2003-12-18 2005-06-23 Bruce Ben F. Method and system for name and address validation and correction
CN106033460A (zh) * 2015-03-19 2016-10-19 阿里巴巴集团控股有限公司 地址数据处理方法及装置
CN109697523A (zh) * 2017-10-23 2019-04-30 顺丰科技有限公司 优化收派件路径的方法、系统及设备
CN109886618A (zh) * 2019-01-17 2019-06-14 江苏苏宁物流有限公司 一种优化物流作业的方法及装置
CN110569239A (zh) * 2019-09-19 2019-12-13 圆通速递有限公司 一种快递包裹地址标准化的方法和系统

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4145300A4

Also Published As

Publication number Publication date
CN113761085A (zh) 2021-12-07
JP7481067B2 (ja) 2024-05-10
EP4145300A1 (en) 2023-03-08
JP2023526467A (ja) 2023-06-21
EP4145300A4 (en) 2024-05-08
CN113761085B (zh) 2023-09-26
US20230196271A1 (en) 2023-06-22

Similar Documents

Publication Publication Date Title
CN113760948B (zh) 一种数据查询的方法及装置
WO2021197432A1 (zh) 一种数据库集群的路由方法和装置
JP7481067B2 (ja) 注文データの処理方法及び処理装置並びにコンピュータ読み取り可能な媒体
CN108629029A (zh) 一种应用于数据仓库的数据处理方法和装置
CN113760890A (zh) 关系型数据库管理的方法和装置
CN113704222B (zh) 一种处理业务请求的方法和装置
CN108959294B (zh) 一种访问搜索引擎的方法和装置
CN111038906B (zh) 一种订单分拣方法和装置
CN110909022B (zh) 一种数据查询方法和装置
CN110321252B (zh) 一种技能服务资源调度的方法和装置
WO2021023149A1 (zh) 一种动态返回报文的方法和装置
WO2021169553A1 (zh) 一种处理订单的方法和装置
CN115529271B (zh) 业务请求分发方法、装置、设备及介质
CN113760745A (zh) 一种接口自动化测试用例生成方法和装置
CN111861298A (zh) 一种订单取消的方法和装置
CN113076186B (zh) 任务处理的方法、装置、电子设备和存储介质
CN112148705A (zh) 数据迁移的方法和装置
CN112948334A (zh) 日志处理方法和装置
CN116775613A (zh) 一种数据迁移方法、装置、电子设备及计算机可读介质
CN113765958A (zh) 一种作业任务处理方法和作业客户端
CN113986948A (zh) 即时消息的查询方法、装置、服务器及存储介质
CN116303428A (zh) 一种数据处理方法和装置
CN113077201A (zh) 一种解析业务参数的方法、装置和系统
CN112148726A (zh) 一种删除表的方法和装置
CN112100168A (zh) 一种确定数据关联关系的方法和装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21816738

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2022570663

Country of ref document: JP

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2021816738

Country of ref document: EP

Effective date: 20221201

NENP Non-entry into the national phase

Ref country code: DE