[go: up one dir, main page]

CN106600036A - Multi-point express delivery distribution method based on Android - Google Patents

Multi-point express delivery distribution method based on Android Download PDF

Info

Publication number
CN106600036A
CN106600036A CN201610983582.9A CN201610983582A CN106600036A CN 106600036 A CN106600036 A CN 106600036A CN 201610983582 A CN201610983582 A CN 201610983582A CN 106600036 A CN106600036 A CN 106600036A
Authority
CN
China
Prior art keywords
address
delivery
route
express delivery
current
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201610983582.9A
Other languages
Chinese (zh)
Other versions
CN106600036B (en
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.)
Zhejiang University of Technology ZJUT
Original Assignee
Zhejiang University of Technology ZJUT
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 Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201610983582.9A priority Critical patent/CN106600036B/en
Publication of CN106600036A publication Critical patent/CN106600036A/en
Application granted granted Critical
Publication of CN106600036B publication Critical patent/CN106600036B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/451Execution arrangements for user interfaces
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • G06Q10/0835Relationships between shipper or supplier and carriers
    • G06Q10/08355Routing methods

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Software Systems (AREA)
  • Human Computer Interaction (AREA)
  • General Engineering & Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Navigation (AREA)

Abstract

基于Android多点快递配送方法,首先,将出发点、各个配送地址和最终目的地存进数据库,在配送员登录用户界面并获取快递配送信息表后,一键短信群发通知收件人;其次结合百度地图应用的SDK,通过A*算法中的全局路径优化与局部路径优化寻找出最优路径;然后将规划好的路径以文字或地图的形式显示出来,还可以加入语音播报功能,播报当前最优配送快递路线;最后,编写计算机软件,满足任意Android移动端的操作。本发明能够智能化地实现配送路径的规划,提供配送效率。

Based on the Android multi-point express delivery method, firstly, the starting point, each delivery address and the final destination are stored in the database, and after the delivery member logs in the user interface and obtains the express delivery information form, one-click group SMS notification to the recipient; secondly, combined with Baidu The SDK of the map application finds the optimal path through the global path optimization and local path optimization in the A* algorithm; then displays the planned path in the form of text or a map, and can also add a voice broadcast function to broadcast the current optimal path. Delivery route; finally, write computer software to meet the operation of any Android mobile terminal. The present invention can intelligently realize the planning of delivery routes and improve delivery efficiency.

Description

基于Android多点快递配送方法Android-based multi-point express delivery method

技术领域technical field

本发明涉及一种快递配送方法,基于Android多点快递配送最优路径规划,针对具体的配送环境和配送任务需求采用A*算法来进行路径规划,并结合百度地图,规划出既能够满足任务需求,又符合环境信息的最优路径,以确保配送员能够高效的完成指定的派送任务,从而提高工作效率。The present invention relates to an express delivery method. Based on the optimal path planning of Android multi-point express delivery, the A* algorithm is used for path planning according to the specific delivery environment and delivery task requirements. , and conform to the optimal path of environmental information to ensure that the delivery staff can efficiently complete the specified delivery tasks, thereby improving work efficiency.

背景技术Background technique

随着电子商务的快速发展,带来火爆的网上购物,快递配送就成为一种现代化的流通方式,是供应商和客户之间的纽带。然而,目前中国的快递行业仍然处于严重依赖人工的发展阶段,尤其在配送环节中,每个快递员的配送效率差异很大,浪费的时间和经济代价无法估量,其中最主要的问题是配送路径的优化问题。近年来,随着物联网的兴起,信息技术也被逐渐应用到快递行业中去,并进一步催生了“智能物流”的新兴概念。快递配送的最优路径对加快配送速度、提高服务质量、降低配送成本以及增加经济效益都有较大的影响,而基于Android多点快递配最优送路径规划是模拟快递配送“最后一公里”的过程,使其按照最短路程、最少时间的策略生成配送路线,提高工作效率,缓解当前物流行业供不应求的现状。因此,如何让配送员利用Android手机高效完成配送任务,从而提高电商的库存管理能力与配载能力是当前物流配送领域的热点之一。With the rapid development of e-commerce and popular online shopping, express delivery has become a modern circulation method and a link between suppliers and customers. However, at present, China's express delivery industry is still in a stage of development that relies heavily on labor. Especially in the delivery link, the delivery efficiency of each courier varies greatly, and the time wasted and economic costs are immeasurable. The most important problem is the delivery route. optimization problem. In recent years, with the rise of the Internet of Things, information technology has also been gradually applied to the express delivery industry, and further gave birth to the emerging concept of "smart logistics". The optimal path of express delivery has a great impact on speeding up delivery, improving service quality, reducing delivery costs and increasing economic benefits, and the optimal delivery path planning based on Android multi-point express delivery is to simulate the "last mile" of express delivery The process enables it to generate distribution routes according to the strategy of the shortest distance and the least time, improve work efficiency, and alleviate the current situation that the logistics industry is in short supply. Therefore, how to let the delivery staff use Android mobile phones to efficiently complete the delivery task, so as to improve the inventory management ability and loading capacity of e-commerce is one of the hot spots in the current logistics and distribution field.

目前快递配送的研究主要集中在运输成本的问题上,而路径规划算法又是物流配送领域的核心技术之一,对于针对具体的配送环境和具体派单任务实现路径规划的研究较少。相较传统的快递配送工作,雷鹏在基于Android系统下快递配送软件的设计与实现中主要研究软件设计层面,并没有对配送路线方法进行研究,在解决快递配送路线的规划方面不能提供帮助(基于Android系统下快递配送软件的设计与实现[D].电子科技大学,2014.);何萍提出了移动平台上的智能快递配送方法,该方法与本发明都是为了解决快递配送过程中配送效率低下,配送员繁重负担的共同目标,但并没有给出具体的应用平台和地图应用的SDK,选用的算法是带轮盘的贪心算法和全局k-opt方法来规划最优配送路线,它们能够解决路径规划当中的一些基本任务,但它们都需要根据任务节点顺序,按序分段进行规划,规划所得路径受任务节点的数目和顺序影响,无法保证规划所得路径的最优性,不能更好的适用于配送系统的复杂任务(移动平台上的智能快递配送方法:中国,201510522278.X[P].2015-08-24.)。At present, the research on express distribution mainly focuses on the problem of transportation cost, and the path planning algorithm is one of the core technologies in the field of logistics distribution. There are few researches on the realization of path planning for specific distribution environments and specific dispatch tasks. Compared with the traditional express delivery work, Lei Peng mainly researched the software design level in the design and implementation of the express delivery software based on the Android system, but did not study the delivery route method, and could not provide help in solving the planning of the express delivery route ( Design and implementation of express delivery software based on Android system [D]. University of Electronic Science and Technology of China, 2014.); He Ping proposed an intelligent express delivery method on the mobile platform. Inefficiency, the common goal of the heavy burden of the delivery staff, but did not give a specific application platform and map application SDK, the selected algorithm is the greedy algorithm with roulette and the global k-opt method to plan the optimal delivery route, they It can solve some basic tasks in path planning, but they all need to be planned in order and segmented according to the order of task nodes. The planned path is affected by the number and order of task nodes, and the optimality of the planned path cannot be guaranteed. Good for complex tasks in distribution systems (Smart express delivery methods on mobile platforms: China, 201510522278.X[P].2015-08-24.).

发明内容Contents of the invention

本发明要克服现有技术的上述缺点,研制设计出基于Android平台上多点快递配送方法。本发明采用A*算法来进行路径规划方法寻找最优路径,其具体的流程如图1所示,主要可分为建立bmob数据库和结合百度地图路径寻优两大部分。首先,将出发点、各个配送地址和最终目的地存进数据库,在配送员登录用户界面并获取快递配送信息表后,一键短信群发通知收件人;其次结合百度地图应用的SDK,通过A*算法中的全局路径优化与局部路径优化寻找出最优路径;然后将规划好的路径以文字或地图的形式显示出来,还可以加入语音播报功能,播报当前最优配送快递路线;最后,编写计算机软件,满足任意Android移动端的操作。其技术方案是:The present invention overcomes the above-mentioned shortcoming of prior art, develops and designs the multi-point express delivery method based on the Android platform. The present invention adopts A* algorithm to carry out the path planning method to find the optimal path, and its specific process is shown in Figure 1, which can be mainly divided into two parts: establishing bmob database and combining Baidu map path optimization. Firstly, the starting point, each delivery address and final destination are stored in the database, and after the courier logs in the user interface and obtains the courier delivery information form, one-click group SMS notification is sent to the recipients; secondly, combined with the SDK of Baidu map application, through A* The global path optimization and local path optimization in the algorithm find the optimal path; then the planned path is displayed in the form of text or a map, and a voice broadcast function can also be added to broadcast the current optimal delivery route; finally, the computer program The software satisfies the operation of any Android mobile terminal. Its technical solution is:

基于Android多点快递配送方法,包括以下步骤:The Android-based multi-point express delivery method includes the following steps:

步骤1:建立bmob移动端的数据库,将出发点、各个配送地址和最终目的地存进数据库,同时配送员进入用户登录界面,登录账号后获取快递派发任务表,并对收件人进行一键短信群发。数据库中包含快递详情表和配送位置信息表,在输入过程中允许因为错误输入而删除已录入的部分地址。Step 1: Create a database on the bmob mobile terminal, store the starting point, each delivery address and final destination in the database, and at the same time, the delivery staff enters the user login interface, and after logging in to the account, obtains the express delivery task list, and sends one-click group SMS to the recipients . The database contains the courier details table and the delivery location information table, and it is allowed to delete part of the entered addresses due to incorrect input during the input process.

步骤2:结合百度地图应用的SDK,使用A*全局路径寻优算法规划出发前的最优配送路径。A*算法是目前最流行的启发式搜索算法,对于搜索过程中遇到的每个新状态(或者新节点),先按估价函数计算出它的最佳代价估价值,然后选出当时估价值最小的状态,从该状态开始继续搜索,以节点的代价估价值为标准的最佳优先搜索。接下来对最优路线规划方法进行描述:首先,调用百度地图应用向开发者开放的SDK,根据输入的文字地址,获取其对应的经纬度,然后基于经纬度和周边的道路信息,计算得到每对地址之间适合快递人员的最短交通距离,使用A*全局路径寻优算法搜索得到满足任务需求的全局最优路径,寻找出发前的最优配送路径。A*算法对于搜索过程中遇到的每个新状态,先按估价函数计算出它的最佳代价估价值,然后选出当时估价值最小的状态,从该状态开始继续搜索,直到搜索出可能性较大的终点。Step 2: Combined with the SDK of Baidu Maps application, use the A* global route optimization algorithm to plan the optimal delivery route before departure. The A* algorithm is currently the most popular heuristic search algorithm. For each new state (or new node) encountered in the search process, first calculate its best cost estimate according to the evaluation function, and then select the estimated value at that time The smallest state, from which the search continues, and the best-first search is based on the estimated value of the node's cost. Next, the optimal route planning method is described: First, call the SDK of the Baidu map application open to developers, obtain the corresponding latitude and longitude according to the input text address, and then calculate each pair of addresses based on the latitude and longitude and surrounding road information The shortest traffic distance between couriers, use the A* global path optimization algorithm to search for the global optimal path that meets the task requirements, and find the optimal delivery path before departure. For each new state encountered in the search process, the A* algorithm first calculates its best cost estimation value according to the evaluation function, and then selects the state with the smallest estimated value at that time, and continues to search from this state until a possible value is found. Sexual end point.

步骤3:对于配送过程中出现的无法配送,配送地址改变或者新增取件订单等问题,再次使用A*算法重新规划当前最优配送路径。当快递员在配送过程中得知一些临时改变情况,如无法配送、配送地址变更,或者接到新的取件订单等,需先调用百度地图应用的SDK获得当前地址的经纬度,并将当前地址加入到地址数据库中,删除无需再配送的地址,同时增加更新的配送地址和要求去取件的地址;接下来,定义一个当前的可规划地址集合,包含所有尚未配送的地址,计算每个新增地址与集合中其它地址之间的点对距离,使用A*全局路径寻优算法为剩余地址规划一个初始的配送路线,再把当前位置作为出发点,可规划地址集合中作为规划目标,从当前位置开始,在可规划地址集合中利用A*全局路径寻优算法,依据计算出的集合中的点对距离,选取出下一个配送地址,将该地址从可规划地址集合中移除,并把它作为下一轮的当前地址,重复以上步骤,直至可规划地址集合为空,最后与目的地相连,形成一个初始的当前快递配送路线;最后,再利用A*算法的局部路径规划对该初始路线进行进一步的优化,在可规划地址集合与当前位置及目的地范围内进行局部操作,并要确保新构成的路线是一条从当前位置出发,经过可规划地址集合,最终达到目的地的局部路线,然后通过多次重复操作直至无法改善,最终得到当前的最优配送路线。Step 3: For problems such as undeliverable delivery, change of delivery address or new pick-up order during the delivery process, use the A* algorithm to re-plan the current optimal delivery route. When the courier learns of some temporary changes during the delivery process, such as failure to deliver, change of delivery address, or receiving a new pickup order, etc., he must first call the SDK of the Baidu Maps application to obtain the latitude and longitude of the current address, and update the current address Add it to the address database, delete addresses that do not need to be delivered, and add updated delivery addresses and addresses that require pickup; next, define a current set of planable addresses, including all addresses that have not yet been delivered, and calculate each new Increase the point-to-point distance between the address and other addresses in the set, use the A* global path optimization algorithm to plan an initial delivery route for the remaining addresses, and then use the current location as the starting point, and plan the address set as the planning target, starting from the current Starting from the location, use the A* global path optimization algorithm in the set of planable addresses, select the next delivery address according to the calculated point-to-point distance in the set, remove this address from the set of planable addresses, and put It is used as the current address of the next round, and the above steps are repeated until the set of planable addresses is empty, and finally connected to the destination to form an initial current express delivery route; finally, the local path planning of the A* algorithm is used to plan the initial The route is further optimized, and local operations are performed within the scope of the planable address set, the current location and the destination, and it is necessary to ensure that the newly formed route is a partial route starting from the current location, passing through the planable address set, and finally reaching the destination , and then repeat the operation until it cannot be improved, and finally get the current optimal delivery route.

步骤4:将规划好的最优路线详情以文字和地图的形式显示出来,必要时可以选用语音播报功能,实时播报当前的最优配送快递路线。Step 4: Display the details of the planned optimal route in the form of text and a map. If necessary, you can use the voice broadcast function to broadcast the current optimal delivery express route in real time.

最后,上述步骤过程均通过编写的计算机软件进行,该软件适用于任意Android移动端操作简单但满足配送需求,将步骤4得到的结果传输到配送员携带的Android移动端上。它包含四大部分,第一部分为建立移动端数据库,第二部分为初始规划最优配送路径,第三部分是重新规划当前最优路径,第四部分为配送员配送。配送员不需要输入任务公式的繁琐操作,只需将出发点、各个配送地址和最终目的地存进数据库,点击规划路径即可,操作简单易行。获取到最优规划路径后配送员只需带着Android移动端再选用任意交通工具就可进行快递配送。Finally, the above steps are all carried out through the written computer software, which is suitable for any Android mobile terminal, which is simple to operate but meets the delivery requirements, and transmits the results obtained in step 4 to the Android mobile terminal carried by the delivery staff. It consists of four parts, the first part is to establish the mobile terminal database, the second part is to initially plan the optimal delivery route, the third part is to re-plan the current optimal route, and the fourth part is the distribution of the delivery staff. The delivery staff does not need to enter the tedious operation of the task formula, but only needs to store the starting point, each delivery address and the final destination in the database, and click to plan the route. The operation is simple and easy. After obtaining the optimal planned route, the delivery staff only need to bring the Android mobile terminal and choose any means of transportation to carry out express delivery.

本发明从快递员角度出发,开发出一款适用于快递员高效配送快递的应用程序,快递员可以在该应用程序中输入需要配送快递的地址,然后由应用程序智能规划出一条最优的路线图,快递员就可以根据搜索出的路线图高效的完成递送任务,在最快的时间内将快递配送到客户手中,使客户满意,可以增加客户量的同时降低配送的人力、物力和财力等代价。From the perspective of the courier, the present invention develops an application program suitable for the courier to efficiently deliver the courier. The courier can input the address to be delivered in the application program, and then the application program intelligently plans an optimal route According to the map, the courier can efficiently complete the delivery task according to the searched route map, and deliver the courier to the customer in the fastest time to satisfy the customer. It can increase the number of customers and reduce the manpower, material and financial resources of delivery, etc. cost.

本发明是建立在Android移动平台上的多点快递配送系统,包括出发点,多个配送地址和最终目的地,结合百度地图应用的SDK,使用A*算法规划出发前的最优配送路线,并根据路况变化实时修改,将最优路径的详情以文字和地图的形式显现出来。本发明解决了快递配送效率低下,人力浪费且快递配送拖延的缺陷。本发明采用全局A*方法,可以优化配送前的快递配送路线;而采用局部A*方法,构建出可规划地址集,在不影响已经经过路线的基础上,再优化后续路径,不仅使快递公司的配送效率得到基本的保障,而且也能将快递员从配送路径规划的重担中解脱出来,体现配送服务质量的关键所在,实现真正的智慧物流。The present invention is a multi-point express delivery system built on the Android mobile platform, including the starting point, multiple delivery addresses and the final destination, combined with the SDK of Baidu map application, using the A* algorithm to plan the optimal delivery route before departure, and according to Changes in road conditions are modified in real time, and the details of the optimal route are displayed in the form of text and maps. The invention solves the defects of low efficiency of express delivery, waste of manpower and delay of express delivery. The present invention adopts the global A* method, which can optimize the express delivery route before delivery; and adopts the local A* method to construct a planable address set, and then optimizes the follow-up route on the basis of not affecting the route already passed, which not only makes the express delivery company The distribution efficiency is basically guaranteed, and it can also free the courier from the burden of distribution route planning, reflecting the key to the quality of distribution services and realizing real smart logistics.

本发明有如下优点:The present invention has following advantage:

(1)这款基于Android移动平台上多点快递配送最优路径规划方法在配送时,可以选用不同的交通工具,对车辆的配置要求很低,不需配有GPS,可使用三轮车等,在交通方式上选择灵活,因此可推广性较强。(1) This optimal path planning method for multi-point express delivery based on the Android mobile platform can choose different means of transportation during delivery, and has very low requirements for vehicle configuration. It does not need to be equipped with GPS, and tricycles can be used. The choice of transportation mode is flexible, so it can be widely promoted.

(2)此发明的开发平台较为普及,只需要携带Android移动设备即可,方便快递员的携带使用;另外结合百度地图应用,使用地图可视化,语音导航功能,使配送路线一目了然,为用户提供所有具体配送信息,功能丰富,使得配送的工作质量尽量摆脱人为因素,达到一个标准化的效果,即使新来不认识路的快递员也可以很好的完成配送任务。(2) The development platform of this invention is relatively popular, and only needs to carry Android mobile devices, which is convenient for couriers to carry and use; in addition, combined with Baidu map application, using map visualization and voice navigation functions, the delivery route is clear at a glance, providing users with all Specific delivery information, rich in functions, makes the delivery work quality get rid of human factors as much as possible, and achieve a standardized effect, even new couriers who don't know the way can complete the delivery task very well.

(3)针对快递员在配送发生的一些临时变更事件,如无法配送、配送地址改变,或者接到新的取件订单等时,以往的动态规划一般都是在服务端的中央配送系统统一安排,再把指令发送给各个车辆。但快递的特点是快递员直接获取第一手的信息,由快递员自行调度安排,而我们的这款基于Android移动平台上多点快递配送最优路径规划方法在这方面可以直接由快递员灵活做出响应,实时性很高。(3) In response to some temporary changes in the delivery of the courier, such as failure to deliver, change of delivery address, or receipt of a new pick-up order, etc., the previous dynamic planning was generally arranged in the central delivery system on the server side. Then send the command to each vehicle. However, the characteristic of express delivery is that the courier directly obtains the first-hand information, and the courier arranges it by himself. However, our optimal route planning method for multi-point express delivery based on the Android mobile platform can be directly flexible by the courier in this respect. Response is high in real time.

(4)这款基于Android移动平台上多点快递配送最优路径规划方法基于A*算法的全局路径规划和局部路径规划,可以产生比随机或贪心的算法更好的初始解;采用A*全局路径规划方法,可以优化配送前的快递配送路线;而采用A*局部路径规划方法,通过构建可规划地址集,在不影响已经经过路线的基础上,继续优化后续路径,从而使整个配送路径达到最优。(4) This optimal path planning method for multi-point express delivery on the Android mobile platform is based on the global path planning and local path planning of the A* algorithm, which can produce better initial solutions than random or greedy algorithms; using A* global The path planning method can optimize the express delivery route before delivery; and the A* partial path planning method can continue to optimize the follow-up path on the basis of not affecting the already passed route by constructing a planable address set, so that the entire delivery path reaches best.

附图说明Description of drawings

图1为本发明流程示意图Fig. 1 is the schematic flow chart of the present invention

图2为本发明用户登录界面Fig. 2 is the user login interface of the present invention

图3为本发明短信一键群发界面Fig. 3 is the short message one-key group sending interface of the present invention

图4为本发明的百度地图导入图Fig. 4 is Baidu map import figure of the present invention

图5为本发明获取派送界面图,其中,A浙江工业大学屏峰校区,B浙江大学(紫金港校区),C浙江大学(玉泉校区),D浙江工业大学朝晖校区,E杭州汽车北站。Fig. 5 is a map of the acquisition and delivery interface of the present invention, wherein A is the Pingfeng Campus of Zhejiang University of Technology, B is Zhejiang University (Zijingang Campus), C is Zhejiang University (Yuquan Campus), D is Zhaohui Campus of Zhejiang University of Technology, and E is Hangzhou North Bus Station.

图6为本发明的路径规划实现结果。Fig. 6 is the path planning implementation result of the present invention.

具体实施方式detailed description

以下结合附图对本发明基于Android多点快递配送最优路径规划方法作简单实例作进说明。在杭州选取A、B、C、D、E作为收件人所在地址进行快递配送:A点为起点,派送完快递后最终也要回到A点,途中需要经过B、C、D、E四个快递配送点。首先把这几个点的地址信息存储到bmob数据库中,配送员在Android移动端登录账号后,获取其信息并群发短信,提前告知收件人将有快递到达;然后在A点出发前击点击移动端上的获取最优路径键,实现出发前的路径规划,显示第一个最优点C点;配送员到达C点后,再点击获取最优路径键,对当前位置重新作出规划,直到完成所有点的快递配送,并返回A点,具体路径规划如图6所示。The following is a simple example of the Android-based multi-point express distribution optimal route planning method of the present invention in conjunction with the accompanying drawings. Select A, B, C, D, and E as the address of the recipient in Hangzhou for express delivery: point A is the starting point, and after the express delivery is completed, you will eventually return to point A, and you need to pass through B, C, D, and E on the way. A courier delivery point. First, store the address information of these points in the bmob database. After the delivery staff logs in to the account on the Android mobile terminal, they will obtain their information and send text messages to inform the recipients in advance that the courier will arrive; Get the optimal route key on the mobile terminal to realize the route planning before departure, and display the first best point C; after the courier arrives at point C, click the obtain optimal route key to re-plan the current location until the completion Express delivery at all points, and return to point A, the specific route planning is shown in Figure 6.

本发明基于Android多点快递配送最优路径规划方法主要有以下内容:首先,需要建立bmob移动端的数据库,将出发点、各个配送地址和最终目的地存进数据库,同时配送员进入用户登录界面,登录账号后获取快递派发任务表;然后结合百度地图应用的SDK,使用A*全局路径寻优算法规划出发前的最优配送路径;对于配送过程中出现的无法配送,配送地址改变或者新增取件订单等问题,再次使用A*算法重新规划当前最优配送路径;最后将最优路径详情以显示出来,并进行导航最优配送路线(具体流程见图1)。The present invention is based on the Android multi-point express distribution optimal path planning method mainly has the following contents: First, it is necessary to establish a database on the bmob mobile terminal, store the starting point, each delivery address and the final destination into the database, and at the same time, the delivery staff enters the user login interface and logs in Obtain the express delivery task list after account number; then combine the SDK of Baidu Maps application, use the A* global path optimization algorithm to plan the optimal delivery route before departure; for the failure of delivery during the delivery process, change the delivery address or add new pickups For issues such as orders, use the A* algorithm to re-plan the current optimal delivery route; finally, display the details of the optimal route and navigate the optimal delivery route (see Figure 1 for the specific process).

本发明主要用到Android SDK、百度地图API、导航SDK。快递配送的任务主要是实现减少配送成本以及满足客户的需求,因此快递公司考虑的一个主要方向是如何在保证客户满意度的前提下,尽量减少成本,而减少成本的关键在于寻找一条最优路径。而本发明将先进的信息技术应用到快递配送路线规划上,不仅使快递公司得到配送效率上的基本保障,而且也能把快递员从配送路径规划负担中解脱出来,实现真正的智慧物流。这里主要使用A*全局路径寻优算法规划出发前的最优路径,而对于配送过程中出现的无法配送,配送地址改变或者新增取件订单等问题,使用A*全局路径寻优算法和局部路径寻优算法相结合的方式重新规划出当前最优配送路径,从而使整个配送过程中配送路线最优,减少快递员的配送重担。The present invention mainly uses Android SDK, Baidu map API, and navigation SDK. The task of express delivery is mainly to reduce delivery costs and meet customer needs. Therefore, one of the main directions that express companies consider is how to reduce costs as much as possible while ensuring customer satisfaction. The key to reducing costs is to find an optimal path. . However, the present invention applies advanced information technology to express delivery route planning, which not only enables the express delivery company to obtain the basic guarantee of delivery efficiency, but also frees the courier from the burden of delivery route planning, realizing real smart logistics. Here, the A* global path optimization algorithm is mainly used to plan the optimal path before departure, and for problems such as undeliverable delivery, change of delivery address, or new pick-up order during the delivery process, the A* global path optimization algorithm and local The combination of route optimization algorithms re-plans the current optimal delivery route, so that the delivery route is optimal throughout the delivery process and the delivery burden of the courier is reduced.

本发明基于Android多点快递配送最优路径规划方法,其特征主要如下步骤,如图1所示:The present invention is based on the optimal path planning method for Android multi-point express delivery, and its features mainly follow the steps, as shown in Figure 1:

步骤1,建立bmob移动端的数据库,将出发点、各个配送地址和最终目的地存进数据库,数据库中包含快递详情表和配送位置信息表。同时配送员进入用户登录界面,如图2所示,登录账号后获取快递派发任务表,并对收件人进行一键短信群发,方便其收取快件,如图3。快递详情表包括订单号、寄件人姓名、寄件人电话、始发地、寄件人详细地址、寄件人单位名称、收件人姓名、收件人电话、目的地、收件人详细地址、收件人单位名称、费用总计、付款方式、重量、件数、寄件日期。作为第一次进入软件添加地址的配送员,在数据库中没有信息提示,但配送员输入地址进入数据库中,若再次输入相同或相似地址时,数据库的记忆功能会出现提示,给用户提供方便。在输入过程中允许因为错误输入而删除已录入的部分地址;Step 1. Establish a database on the bmob mobile terminal, and store the starting point, each delivery address and final destination into the database. The database includes a express delivery details table and a delivery location information table. At the same time, the courier enters the user login interface, as shown in Figure 2. After logging in to the account, he obtains the express delivery task list, and sends one-click group SMS to the recipients to facilitate them to receive the express, as shown in Figure 3. Express delivery details include order number, sender's name, sender's phone number, place of origin, sender's detailed address, sender's unit name, recipient's name, recipient's phone number, destination, recipient's details Address, recipient unit name, total cost, payment method, weight, number of pieces, and date of delivery. As the deliveryman who enters the software for the first time to add an address, there is no information prompt in the database, but the deliveryman enters the address into the database. If the same or similar address is entered again, the memory function of the database will prompt to provide convenience for the user. During the input process, it is allowed to delete part of the entered address due to incorrect input;

步骤2,结合百度地图应用的SDK,使用A*全局路径寻优算法规划出发前的最优配送路径。首先调用出百度地图,根据输入的文字地址,获取其对应的经纬度,然后基于经纬度和周边的道路信息进行定位,如图4所示。然后根据输入的地址信息,在地图上显示出来,如图5所示,并计算出每对地址之间适合快递人员的最短交通距离,使用A*全局路径寻优算法搜索得到满足任务需求的全局最优路径,寻找出发前的最优配送路径;Step 2, combined with the SDK of the Baidu map application, use the A* global route optimization algorithm to plan the optimal delivery route before departure. Firstly, Baidu Map is invoked, and the corresponding longitude and latitude are obtained according to the input text address, and then positioning is performed based on the longitude and latitude and surrounding road information, as shown in Figure 4. Then, according to the input address information, it is displayed on the map, as shown in Figure 5, and the shortest traffic distance suitable for couriers between each pair of addresses is calculated, and the A* global path optimization algorithm is used to search for a global location that meets the task requirements. Optimal route, find the optimal delivery route before departure;

步骤3,对于配送员在配送过程中出现的无法配送,配送地址改变或者新增取件订单等问题,如图5需要重新调用百度地图应用的SDK获取当前地址的经纬度,并将其加入到地址数据库中,除去无需再配送的地址,同时增加更新的配送地址和要求去取件的地址。再次使用A*算法重新规划当前最优配送路径。接下来,定义一个当前的可规划地址集合,包含所有尚未配送的地址,计算每个新增地址与集合中其它地址之间的点对距离,使用A*全局路径寻优算法为剩余地址规划一个初始的配送路线,再把当前位置作为出发点,可规划地址集合中作为规划目标,从当前位置开始,在可规划地址集合中利用A*全局路径寻优算法,依据计算出的集合中的点对距离,选取出下一个配送地址,将该地址从可规划地址集合中移除,并把它作为下一轮的当前地址,重复以上步骤,直至可规划地址集合为空,最后与目的地相连,形成一个初始的当前快递配送路线;最后,再利用A*算法的局部路径规划对该初始路线进行进一步的优化,在可规划地址集合与当前位置及目的地范围内进行局部操作,并要确保新构成的路线是一条从当前位置出发,经过可规划地址集合,最终达到目的地的局部路线,然后通过多次重复操作直至无法改善,最终得到当前的最优配送路线,如图6所示;Step 3. For problems such as inability to deliver, change of delivery address, or new pick-up order during the delivery process, as shown in Figure 5, it is necessary to re-call the SDK of the Baidu Map application to obtain the latitude and longitude of the current address and add it to the address In the database, remove the addresses that no longer need to be delivered, and add updated delivery addresses and addresses that require pickup. Use the A* algorithm again to replan the current optimal delivery route. Next, define a current planable address set, including all addresses that have not yet been delivered, calculate the point-to-point distance between each newly added address and other addresses in the set, and use the A* global path optimization algorithm to plan an address for the remaining addresses For the initial delivery route, the current location is taken as the starting point, and the planable address set is used as the planning target. Starting from the current location, the A* global path optimization algorithm is used in the planable address set, and the point pairs in the calculated set are used. distance, select the next delivery address, remove this address from the set of addressable addresses, and use it as the current address for the next round, repeat the above steps until the set of addressable addresses is empty, and finally connect to the destination, Form an initial current express delivery route; finally, use the local route planning of the A* algorithm to further optimize the initial route, perform local operations within the scope of the planable address set, current location and destination, and ensure that the new The formed route is a partial route starting from the current location, passing through a set of planable addresses, and finally reaching the destination, and then repeated operations until it cannot be improved, and finally obtains the current optimal delivery route, as shown in Figure 6;

步骤4,将规划好的最优路线详情以文字和地图的形式显示出来,必要时可以选用语音播报功能,实时播报当前的最优配送快递路线;Step 4: Display the details of the planned optimal route in the form of text and a map. If necessary, you can use the voice broadcast function to broadcast the current optimal delivery express route in real time;

步骤5,通过计算机软件系统,满足任意Android移动端的操作,将步骤4得到的结果传输到配送员携带的Android移动端上。可以看到配送的先后顺序以及具体路线信息,如距离、时间等。也可以用详细的文字来说明具体路线,由于手机屏幕的限制以及许多规划地址的存在,使得百度地图上的路线不利于查看,可以通过此功能显示路线的详情列表,了解地点的先后顺序。必要时可以选用语音播报功能,实时播报当前的最优配送快递路线,将快递迅速完整的配送到客户手中。Step 5. Through the computer software system, the operation of any Android mobile terminal is satisfied, and the result obtained in step 4 is transmitted to the Android mobile terminal carried by the courier. You can see the order of delivery and specific route information, such as distance, time, etc. You can also use detailed text to explain the specific route. Due to the limitation of the mobile phone screen and the existence of many planned addresses, it is not easy to view the route on the Baidu map. You can use this function to display the detailed list of the route to understand the order of the locations. If necessary, the voice broadcast function can be selected to broadcast the current optimal delivery express route in real time, and the express delivery can be delivered to the customer quickly and completely.

Claims (3)

1. Android multiple spot express delivery allocators are based on, are comprised the following steps:
Starting point, each dispensing address and final destination are deposited into data base by step 1, the data base for setting up bmob mobile terminals, Simultaneously dispensing person enters User logs in interface, express delivery is obtained after login account and distributes task list, and it is short to carry out a key to addressee Letter mass-sending, comprising express delivery details table and delivery location information table in data base, allows because of mistake input in input process Delete the partial address of typing;
Step 2, with reference to the SDK of Baidu map application, the optimum dispensing road before being set out using the planning of A* global paths optimizing algorithm Footpath, the description of optimal route planing method:First, the SDK for calling Baidu map application to open to developer, according to the word of input Address, obtains its corresponding longitude and latitude;The road information of longitude and latitude and periphery is then based on, is calculated between each pair address and is fitted The logical distance of most short delivery of courier is closed, using the search of A* global paths optimizing algorithm the global optimum of mission requirements is met Path, finds the optimum Distribution path before setting out;A* algorithms for each new state run in search procedure, first by appraisal letter Number calculates its optimal cost assessment values, then selects the minimum state of assessment values at that time, starts to continue search for from the state, Until searching out the larger terminal of probability;
Step 3, for what is occurred in delivery process cannot dispense, dispenses address modification or newly-increased pickup order problem, again Current optimum Distribution path is planned again using A* algorithms:When courier learns some Iterim Change situations in delivery process, Cannot such as dispense, dispense address change, or when being connected to new pickup order problem, need to first call the SDK of Baidu map application The longitude and latitude of current address is obtained, and current address is added in address database, delete the address without the need for dispensing again, while Increase dispense address and the requirement for updating and go to the address of pickup;Next, a current address set planned is defined, comprising All addresses for not yet dispensing, calculate each and Add Address and adjust the distance with the point in set between other addresses, global using A* Optimum path search algorithm is that address space left plans an initial distribution route, then using current location as starting point, can plan ground As the object of planning in the set of location, from the beginning of current location, A* global path optimizing algorithms are utilized in it can plan address set, Adjust the distance according to the point in the set that calculates, select next dispensing address, by the address from can plan in address set Remove, and it is repeated above step as the current address of next round, until address set can be planned for sky, finally and mesh Ground be connected, formed an initial current express delivery distribution route;Finally, recycle the local paths planning of A* algorithms first to this Beginning route is further optimized, and carry out partial operation in the range of address set and current location and destination planning, And to guarantee new composition route be one from current location, process can plan address set, be finally reached destination Local route, then by the way that operation is repeated several times until cannot improve, finally gives current optimum distribution route;
Step 4, the optimal route details planned is shown in the form of word and map, it may be necessary to select voice Report function, the current optimum dispensing express delivery route of real-time broadcasting;
Step 5, by computer software, meets the operation of any Android mobile terminals, and the result that step 4 is obtained is passed On the defeated Android mobile terminals carried to dispensing person.
2. it is according to claim 1 based on Android multiple spot express delivery allocators, it is characterised in that to tie in the step 2 The SDK of Baidu map application is closed, the optimum Distribution path before being set out using the global path optimizing planning of A* algorithms, and to dispensing During the express delivery information that occurs the problems such as change, reuse A* global paths optimizing algorithm and plan current optimum dispensing again Path.
3. it is according to claim 2 based on Android multiple spot express delivery allocators, it is characterised in that right in the step 3 Some Iterim Change situations are learnt in delivery process in courier, cannot such as be dispensed, be dispensed address change, or be connected to new The problems such as express delivery information such as pickup order is changed, reuse formed after A* global path optimizing algorithms are planned again one it is new After current express delivery distribution route, the local paths planning for recycling A* algorithms is further optimized to the original route, Can plan carry out partial operation in the range of address set and current location and destination, and guarantee that the new route for constituting is one From current location, process can plan address set, be finally reached the local route of destination, then by the way that behaviour is repeated several times Make, up to improving, to finally give current optimum distribution route.
CN201610983582.9A 2016-11-09 2016-11-09 Based on Android multiple spot express delivery allocator Active CN106600036B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610983582.9A CN106600036B (en) 2016-11-09 2016-11-09 Based on Android multiple spot express delivery allocator

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610983582.9A CN106600036B (en) 2016-11-09 2016-11-09 Based on Android multiple spot express delivery allocator

Publications (2)

Publication Number Publication Date
CN106600036A true CN106600036A (en) 2017-04-26
CN106600036B CN106600036B (en) 2019-10-29

Family

ID=58590779

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610983582.9A Active CN106600036B (en) 2016-11-09 2016-11-09 Based on Android multiple spot express delivery allocator

Country Status (1)

Country Link
CN (1) CN106600036B (en)

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107133771A (en) * 2017-06-05 2017-09-05 北京联合大学 The unmanned express delivery car delivery system in garden and its automatic delivery method
CN107918850A (en) * 2017-10-30 2018-04-17 努比亚技术有限公司 A kind of express delivery information processing method, terminal and computer-readable recording medium
CN108415428A (en) * 2018-02-11 2018-08-17 上海弗徕威智能科技有限公司 A kind of global path optimization method of mobile robot
CN108629532A (en) * 2017-10-31 2018-10-09 淄博职业学院 A kind of waybill management method pulled during sending express mail
CN108627170A (en) * 2018-04-13 2018-10-09 上海电机学院 A kind of path optimization's visualization method
CN108710542A (en) * 2018-05-16 2018-10-26 黄洲 A kind of employment dating site of mission mode
CN109062256A (en) * 2018-08-31 2018-12-21 深圳市研本品牌设计有限公司 A kind of food delivery unmanned plane
CN109118006A (en) * 2018-08-17 2019-01-01 安吉汽车物流股份有限公司 The determination method and device of share-car route, calculates equipment at storage medium
CN109218125A (en) * 2017-07-07 2019-01-15 北京京东尚科信息技术有限公司 A kind of method and system of heartbeat data interaction
CN109242214A (en) * 2018-10-25 2019-01-18 中国联合网络通信集团有限公司 Distribution route planing method and distribution route device for planning
CN109389237A (en) * 2017-08-08 2019-02-26 阿里巴巴集团控股有限公司 A kind of paths planning method and device
CN110264126A (en) * 2019-05-21 2019-09-20 重庆邮电大学 The method and system of the express mail parameter online change contract of real-time response user instruction
CN110826746A (en) * 2019-11-01 2020-02-21 贝壳技术有限公司 Management method for on-line invited house-viewing and management method for on-line reserved house-viewing
CN111723999A (en) * 2020-06-28 2020-09-29 北京京东乾石科技有限公司 Distribution route determining method, device, equipment and storage medium
WO2020207303A1 (en) * 2019-04-11 2020-10-15 北京三快在线科技有限公司 Path planning
CN111784045A (en) * 2020-06-29 2020-10-16 北京百度网讯科技有限公司 Optimization method, device, device and storage medium for delivery vehicle
CN112381293A (en) * 2020-11-13 2021-02-19 姚少弟 Intelligent express delivery distribution system and method based on big data
CN114415669A (en) * 2021-12-27 2022-04-29 江铃汽车股份有限公司 Article delivery method, system, storage medium and article delivery robot
CN117313979A (en) * 2023-11-30 2023-12-29 湖南木屋网络科技有限公司 Distribution route planning method and device

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101315731A (en) * 2008-07-17 2008-12-03 上海途锐信息技术有限公司 System for implementing vehicle monitoring scheduling by GPS intelligent vehicle mounted terminal
CN103927639A (en) * 2014-02-10 2014-07-16 武汉科技大学 Steel product logistics system and scheduling method thereof based on real-time information
CN105046338A (en) * 2015-08-24 2015-11-11 扬州大学 Intelligent express distribution method on mobile platform

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101315731A (en) * 2008-07-17 2008-12-03 上海途锐信息技术有限公司 System for implementing vehicle monitoring scheduling by GPS intelligent vehicle mounted terminal
CN103927639A (en) * 2014-02-10 2014-07-16 武汉科技大学 Steel product logistics system and scheduling method thereof based on real-time information
CN105046338A (en) * 2015-08-24 2015-11-11 扬州大学 Intelligent express distribution method on mobile platform

Cited By (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107133771A (en) * 2017-06-05 2017-09-05 北京联合大学 The unmanned express delivery car delivery system in garden and its automatic delivery method
CN109218125A (en) * 2017-07-07 2019-01-15 北京京东尚科信息技术有限公司 A kind of method and system of heartbeat data interaction
CN109389237B (en) * 2017-08-08 2022-05-24 阿里巴巴集团控股有限公司 Path planning method and device
CN109389237A (en) * 2017-08-08 2019-02-26 阿里巴巴集团控股有限公司 A kind of paths planning method and device
CN107918850A (en) * 2017-10-30 2018-04-17 努比亚技术有限公司 A kind of express delivery information processing method, terminal and computer-readable recording medium
CN108629532A (en) * 2017-10-31 2018-10-09 淄博职业学院 A kind of waybill management method pulled during sending express mail
CN108415428A (en) * 2018-02-11 2018-08-17 上海弗徕威智能科技有限公司 A kind of global path optimization method of mobile robot
CN108627170A (en) * 2018-04-13 2018-10-09 上海电机学院 A kind of path optimization's visualization method
CN108710542A (en) * 2018-05-16 2018-10-26 黄洲 A kind of employment dating site of mission mode
CN109118006B (en) * 2018-08-17 2021-05-28 安吉汽车物流股份有限公司 Method and device for determining carpooling route, storage medium and computing equipment
CN109118006A (en) * 2018-08-17 2019-01-01 安吉汽车物流股份有限公司 The determination method and device of share-car route, calculates equipment at storage medium
CN109062256A (en) * 2018-08-31 2018-12-21 深圳市研本品牌设计有限公司 A kind of food delivery unmanned plane
CN109242214A (en) * 2018-10-25 2019-01-18 中国联合网络通信集团有限公司 Distribution route planing method and distribution route device for planning
CN111815212A (en) * 2019-04-11 2020-10-23 北京三快在线科技有限公司 Path planning method, device and storage medium
WO2020207303A1 (en) * 2019-04-11 2020-10-15 北京三快在线科技有限公司 Path planning
CN110264126A (en) * 2019-05-21 2019-09-20 重庆邮电大学 The method and system of the express mail parameter online change contract of real-time response user instruction
CN110826746A (en) * 2019-11-01 2020-02-21 贝壳技术有限公司 Management method for on-line invited house-viewing and management method for on-line reserved house-viewing
CN110826746B (en) * 2019-11-01 2020-11-10 贝壳找房(北京)科技有限公司 Management method for on-line invited house-viewing and management method for on-line reserved house-viewing
CN111723999A (en) * 2020-06-28 2020-09-29 北京京东乾石科技有限公司 Distribution route determining method, device, equipment and storage medium
CN111784045A (en) * 2020-06-29 2020-10-16 北京百度网讯科技有限公司 Optimization method, device, device and storage medium for delivery vehicle
CN111784045B (en) * 2020-06-29 2023-09-22 北京百度网讯科技有限公司 Optimization method, device, equipment and storage medium for delivery vehicle
CN112381293A (en) * 2020-11-13 2021-02-19 姚少弟 Intelligent express delivery distribution system and method based on big data
CN114415669A (en) * 2021-12-27 2022-04-29 江铃汽车股份有限公司 Article delivery method, system, storage medium and article delivery robot
CN117313979A (en) * 2023-11-30 2023-12-29 湖南木屋网络科技有限公司 Distribution route planning method and device
CN117313979B (en) * 2023-11-30 2024-02-20 湖南木屋网络科技有限公司 Distribution route planning method and device

Also Published As

Publication number Publication date
CN106600036B (en) 2019-10-29

Similar Documents

Publication Publication Date Title
CN106600036B (en) Based on Android multiple spot express delivery allocator
CN105046338B (en) Intelligent express delivery allocator on mobile platform
CN104809601B (en) The mutual auxiliary system of express delivery based on electronic map
KR102035864B1 (en) Method for providing multiple shortest-way finding service
CN110081876B (en) Navigation interface display method, logistics navigation method and logistics navigation device
CN107169591B (en) Mobile express delivery path planning method based on linear sequential logic
US9785897B2 (en) Methods and systems for optimizing efficiency of a workforce management system
CN102265114B (en) System and method for storing and providing routes
CN109784820A (en) A kind of express delivery routing intelligence solution, device, terminal device and storage medium
CN104567894B (en) For providing the apparatus and method of map datum and its system
CN104732289A (en) Distribution path planning method and system
JP5732340B2 (en) Map data distribution server, map data distribution system, and map data distribution method
US20120173448A1 (en) Systems and methods for providing delivery flexibility and communication
CN110222893B (en) Method and device for recommending delivery places of shared traffic resources and electronic equipment
CN109214732A (en) Method, device and equipment for selecting logistics objects and determining logistics line overload
CN106022535A (en) Distribution route automatic generating method and distribution route automatic generating system
CN105868939A (en) Automatic distribution method and system of delivery objects
CN105069594A (en) Transport processing method, device, terminal and server
CN104899647A (en) Urban logistics distribution place name and address system
CN105869512A (en) Multi-information mixed measurement mapping method and device
CN110222860A (en) A kind of method and apparatus for the dispatching storehouse list generating order
CN117474185A (en) Order dispatching optimization method, device, equipment and storage medium
Li et al. Design of dynamic vehicle routing system based on online map service
CN105403225A (en) Method, server, terminal and system for navigation by using freight transport information
CN115759504A (en) Path planning method and device, electronic equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant