A computing system for alternate path generation is disclosed. In aspects, the computing system can implement methods to generate the alternate paths by: identifying an optimal path to a destination node on a first graph, generating a path graph, and generating an alternate path sequence based on the path graph. In aspects, the computing system can further generate an interactive graphical user interface (GUI) for displaying the alternate path sequence and transmit the interactive GUI to a display unit for display.

A system and method for en-route business selection and ordering with optimized packaging for food delivery and takeout. The system is a cloud-based network containing an optimization server, portals for restaurants, customers, and drivers to enter their information, a rules library, a label manager, and a food packaging optimization module which determines optimal packaging groupings and configurations based on a multitude of variables associated with the restaurant, customer preferences, and the available menu. The system may be accessed through web browsers or purpose-built computer and mobile phone applications.

A real-time delivery operation management system, primarily for local or last mile delivery services to consumers. A management interface works in tandem with an instant delivery route-making algorithm to visualize the route plan for hired or contracted couriers in a dynamic interface, allowing depot managers to view or alter the delivery plan in real time. Visible route paths connect the depot, couriers, and their relevant orders for both assigned and offered routes. Orders can be selected and dragged and dropped to reconfigure routes and assignment of orders to couriers. Orders can be drag-and-dropped on either existing routes, couriers, or depots and thereby instantiate any of the underlying management operations.

Techniques relating to delivery plan generation are improved. A delivery plan generation method comprises: generating a plurality of delivery patterns (S110); narrowing the plurality of delivery patterns down to a designated number of delivery patterns, based on a plurality of solutions calculated as a result of inputting the plurality of delivery patterns to an annealing machine (30) (S120); and generating a delivery plan based on delivery patterns selected from the designated number of delivery patterns (S130).

A non-transitory computer-readable storage medium storing a route search program that causes a computer to execute a process that includes acquiring a storage period of an item for each point of a plurality of points in a case where the item is moved from a departure point to a destination point, the plurality of points including the departure point, the destination point, and one or more relay points; and searching for a route along which the item is moved from the departure point to the destination point based on a traveling cost, storage information, and the acquired storage period, a traveling cost indicating a cost for moving the item between each two points of the plurality of points, the storage information indicating a storage coefficient being used for calculation of a storage cost of the item at each point of the plurality of points in accordance with the storage period.

This paper discloses a delivery system in which delivery of an object to an event is carried out by a mobile body which travels autonomously and can flexibly cope with the change without bothering a user even when a schedule for the event is changed in the middle of the delivery. The delivery system acquires the schedule of a target event to which the object is delivered from the database in which the event can be registered by the user. Then, it creates the delivery plan based on the acquired schedule. The mobile body travels according to the delivery plan. When the schedule is changed during the delivery, the delivery system modifies the delivery plan based on a changed schedule and a current position of the mobile body and moves the mobile body according to the modified delivery plan.

A method of deploying an unmanned aerial vehicle (UAV) operation system may be provided. A method may include estimating an amount of traffic for one or more routes based on a demand of the one or more routes. The method may also include determining a required number of docking stations for each route of the one or more routes based on the estimated amount of traffic for the route, a distance of the route, and a maximum travel distance for a UAV. Further, the method may include installing the required number of docking stations for each route of the one or more routes, wherein each docking station of the required number of docking stations including at least one of a power supply, a wireless charger, a communication module, a control module, and a camera.

An information processing apparatus includes a controller, the controller being configured to select a first mobile body to deliver baggage to a delivery destination existing in a predetermined facility from among a plurality of types of delivery mobile bodies, wherein the controller selects the first mobile body, based on required time necessary to deliver the baggage to the delivery destination in a site of the predetermined facility, for each delivery mobile body.

In implementations of item transfer control systems, a computing device implements a transfer system to receive input data describing types of requested items and corresponding quantities of the types of requested items to receive at each of a plurality of destination sites and types of available items and corresponding quantities of the types of available items that are available at each of a plurality of source sites. The transfer system constructs a flow network having a source node for each of the plurality of the source sites and a destination node for each of the plurality of the destination sites. An integral approximate solution is generated that transfers the corresponding quantities of the types of requested items to each of the plurality of the destination sites using a maximum flow solver and the flow network. The transfer system causes transferences of the corresponding quantities of the types of requested items to each of the plurality of the destination sites based on the integral approximate solution.

Methods, apparatuses, and systems for scheduling tasks to field professionals include: storing, in a database, a plurality of records reflecting characteristics associated with completing a set of technical services, wherein information in each record is derived from historical experience of completing each of the technical services; receiving a request for a new technical service associated with a location; and assigning a field professional to perform the new service having determined from information in the database a likelihood that the field professional will complete the new technical service in a single on-site visit at the location.