Information processing device, information processing method, and program

Abstract

To realize the delivery of a package in accordance with delivery cooperation from a delivery partner in a more suitable manner. [Solution] The information processing device has a delivery management means that recruits and accepts applications from deliverers to deliver packages along multiple partial routes divided by one or more third boarding and disembarking points from a route that is defined to connect a first boarding and disembarking point that is the starting point of a journey related to the delivery of packages using the transportation means, and a second boarding and disembarking point that is the destination, in order of proximity to the first boarding and disembarking point on the route, after the delivery management means has accepted an application from a deliverer for a first partial route of the multiple partial routes on the route, the information processing device then recruits deliverers to deliver the packages along a second partial route that is the next partial route on the route after the first partial route.

Description

[Technical Field]

[0001] The present disclosure relates to an information processing device, an information processing method, and a program. [Background technology]

[0002] In recent years, the demand for home delivery has increased due to factors such as the expansion of the e-commerce market, but at the same time, labor shortages and rising CO2 emissions have become social issues with truck transport, which is the main method of home delivery. Against this background, various mechanisms for delivering packages without using truck transport are being considered. For example, Patent Document 1 discloses an example of a logistics support system that achieves delivery of packages within a target delivery section without using truck transport by obtaining delivery cooperation from one or more delivery partners. In the logistics support system disclosed in Patent Document 1, delivery partners are responsible for delivering packages within an assigned section using public transportation or the like, and the packages are delivered to the delivery partner in charge in succession in a relay format via delivery lockers, thereby achieving delivery of the packages within the target delivery section. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Patent No. 6476232 Summary of the Invention [Problem to be solved by the invention]

[0004] On the other hand, the technology disclosed in Patent Document 1 combines offers from delivery partners in advance to determine the delivery route for the package and assign a deliverer (delivery partner in charge of delivery) to each section of the delivery route, and then begins delivery of the target package. Due to this characteristic, for example, if there are insufficient offers of delivery cooperation, it may be difficult to assign a deliverer to each section of the delivery route, making it difficult to start delivery of the package. Furthermore, if a deliverer assigned to at least some sections has difficulty delivering the package due to an unforeseen accident or other reason, a situation may arise in which delivery of packages is halted in those sections where the deliverer is absent. In such cases, it may be necessary to collect and deliver the target package using an alternative means, such as truck transport. Given this background, there is a need for a system that will enable delivery to continue even in situations where parcels are delivered with the cooperation of delivery partners, by more flexibly controlling the setting of delivery routes and the allocation of delivery personnel according to the situation at the time.

[0005] In view of the above problems, the present invention aims to realize the delivery of packages in a more suitable manner in response to delivery cooperation from delivery partners. [Means for solving the problem]

[0006] The information processing device according to the present invention includes: a first boarding and alighting point that is a departure point of a trip related to delivery of a package using the transportation facility, and a second boarding and alighting point that is a destination point of the trip; a route setting means for setting a route that is specified to connect at least one or more third boarding and disembarking points related to the delivery of the package and the one or more third boarding and disembarking points; From the route, The aforementioned Each of the plurality of partial routes divided by one or more third boarding and alighting points is sorted in order of proximity to the first boarding and alighting point on the route. , sequentially until delivery of the luggage to the second boarding / disembarking point is completed. A delivery management means for recruiting and accepting applications from deliverers who will deliver the parcels along the partial route. and, and after accepting an application from the deliverer for a first partial route among the plurality of partial routes on the route, the delivery management means selects a deliverer who will deliver the package along a second partial route that is next to the first partial route on the route. of Recruitment Start . [Effects of the Invention]

[0007] According to the present invention, it is possible to realize the delivery of packages in association with delivery cooperation from delivery partners in a more suitable manner. [Brief explanation of the drawings]

[0008] [Figure 1] FIG. 1 is a diagram illustrating an overview of an information processing system. [Figure 2] FIG. 1 illustrates an example of a hardware configuration of an information processing device. [Figure 3] FIG. 2 is a functional block diagram illustrating an example of a functional configuration of the information processing system. [Figure 4] FIG. 10 is a diagram showing an example of a search screen for searching for delivery person recruitment. [Figure 5] FIG. 10 is a diagram showing an example of a reception screen related to registration of conditions for information notification. [Figure 6] FIG. 10 is a diagram showing an example of a notification screen for information regarding recruitment settings. [Figure 7] FIG. 10 is a diagram illustrating an example of a management table related to management of information notification targets. [Figure 8] 10 is a flowchart illustrating an example of information processing system processing. [Figure 9] FIG. 10 is a diagram showing an example of a method for setting a route for delivery of a package. [Figure 10] FIG. 10 is a diagram showing an example of a method for setting a route for delivery of a package. [Figure 11] FIG. 10 is a diagram showing an example of a method for setting a route for delivery of a package. [Figure 12] FIG. 10 is a diagram showing an example of a method for setting a route for delivery of a package. [Figure 13] FIG. 10 is a diagram showing an example of route candidates for package delivery. DETAILED DESCRIPTION OF THE INVENTION

[0009] Preferred embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings. In this specification and drawings, components having substantially the same functional configurations are designated by the same reference numerals, and redundant description will be omitted. This disclosure also describes an example of a technology for delivering packages using transportation means that transport passengers (people), such as trains and buses, where passengers get on and off at predetermined points, such as train stations and bus stops. Therefore, the following definitions are provided for terms used in describing the technology according to an embodiment of the present disclosure. In this disclosure, a "boarding and disembarking point" is a point that is set in a predetermined location, such as a train station or a bus stop, where people get on and off a means of transportation that transports passengers. Therefore, in this disclosure, when the term "boarding and disembarking point" is used, it should be interpreted appropriately depending on the type of transportation where the target person (passenger) gets on and off, such as a "station" when the transportation means is a "railway." Furthermore, transportation that can be used when applying the technology according to the present disclosure is not limited to the trains and buses exemplified above, as long as the boarding and disembarking points are set in advance as described above and the transportation can transport people (passengers). Specific examples include circular ferries and airplanes. Furthermore, as long as the transportation has the characteristics described above, it is not limited to so-called public transportation, and non-public transportation such as buses exclusively for employees and building personnel, or shuttle buses used by accommodation facilities to transport guests, can also be applied. For convenience, in this disclosure, various explanations will be given assuming that public transportation such as buses and trains is used as the transportation.

[0010] <Summary> An overview of an information processing system according to this embodiment will be described with reference to FIG. 1. The information processing system according to this embodiment is a system that realizes delivery of parcels, such as home delivery, with cooperation from a series of users who are pre-registered as delivery collaborators. For convenience, in this embodiment, various explanations will be given assuming that a user set as the parcel deliverer uses a railroad as the public transportation used to deliver the parcel. However, as described above, the public transportation used for parcel delivery is not limited; for example, transportation other than railroads, such as a bus, may also be used, and multiple types of public transportation may also be used. Furthermore, when other public transportation is used, terms specific to public transportation, such as the names of boarding and disembarking points, may be interpreted appropriately.

[0011] The information processing system 1 according to the present embodiment includes a server 100 that manages users registered as delivery collaborators and performs various management tasks related to package delivery; a terminal device 200 used by each of multiple users to access the system; and a storage facility 300 (e.g., a locker, warehouse, etc.) for temporarily storing packages to be delivered. For convenience, in this embodiment, the terminal device 200 used by a user responsible for package delivery (a user set as a deliverer) is also referred to as a "terminal device 210" to distinguish it from the terminal devices 200 of other users (users corresponding to senders and recipients, described below). The terminal device 200 of a user who sends a package is also referred to as a "terminal device 250," and the terminal device 200 of a user who receives a package is also referred to as a "terminal device 270." The server 100 and the series of terminal devices 200 (terminal devices 210, 250, and 270) are communicatively connected via a network such as the Internet. The type of network is not particularly limited.

[0012] In the information processing system 1 according to this embodiment, a package requested for delivery by a user who is a sender is delivered to a location where it will be handed over to a user who is a recipient by one or more users who are set as deliverers from among a group of users registered as delivery associates. Furthermore, in the information processing system 1 according to this embodiment, it is assumed that a user who is a delivery associate will deliver a package along the route he or she is taking while traveling using public transportation such as a train or bus. Furthermore, in the information processing system 1 according to this embodiment, the receipt of the package from the sender, the delivery of the package to the deliverer, and the receipt of the package by the recipient are carried out via a storage facility capable of temporarily storing packages, such as a locker or warehouse, located near a boarding or disembarking point of the public transportation (e.g., a station or bus stop). For convenience, hereafter, "delivery collaborator" refers to a user registered in the system as a candidate for package delivery, and "deliverer" refers to a user who is a delivery collaborator who has actually been requested to deliver a package (a user assigned as a deliverer). Furthermore, "sender" refers to a user who has requested the system to send a package, and "receiver" refers to a user who is the delivery destination of the package for which delivery has been requested.

[0013] Based on the above assumptions, the server 100 sets a public transportation route connecting a first boarding / disembarking point associated with a storage facility where a sender will store a package and a second boarding / disembarking point associated with a storage facility where the package will be delivered to a recipient as a route for delivering the package. The server 100 then solicits deliverers to deliver the package along the set route and accepts applications from a series of users registered as delivery associates. In this case, the server 100 may also solicit deliverers individually for each of multiple partial routes that divide the package delivery route by one or more third boarding / disembarking points that serve as relay points. The server 100 then selects a deliverer from among the users who are delivery associates whose applications have been accepted, assigns the user as the deliverer for the target route or partial route, and notifies the terminal device 210 of the user that the user has been selected as the deliverer. Upon receiving this notification, the target user (deliverer) collects the package from the designated storage facility and delivers the package to another designated storage facility.

[0014] As a specific example, in the example shown in FIG. 1, server 100 receives a package delivery request from a sender via terminal device 250 and sets a package delivery route for the package with Station P as the departure point (start station), Stations A and B as intermediate points, and Station D as the destination (end station). Server 100 then divides the series of delivery routes into partial routes from Station P to Station A, Station A to Station B, and Station B to Station D, and solicits package deliverers for the partial routes, and sets users who are delivery collaborators and whose applications have been accepted as deliverers for the partial routes. In this case, server 100 solicits deliverers to deliver the package along each partial route, sequentially targeting each partial route in order of proximity to Station P as the departure point.

[0015] For example, in the example shown in FIG. 1, the server 100 first solicits delivery partners for a partial route from Station P to Station A, and assigns the delivery partner who applied as a delivery partner Ua for that partial route. The server 100 requests the delivery partner Ua to deliver the package, along with information on the storage facility 300p where the package will be stored, information related to unlocking the lock on the storage facility 300p, and information on the time the package will be stored in the storage facility 300p, to the terminal device 210 held by the delivery partner Ua. Upon receiving this request, the delivery partner who is the delivery partner Ua collects the package from the storage facility 300p installed near Station P, delivers the package to the storage facility 300a installed near Station A, which serves as a relay point, and stores the package in the storage facility 300a. Furthermore, once a deliverer is set for the partial route from Station P to Station A, the server 100 similarly recruits deliverers for the next partial route, that is, the partial route from Station A to Station B. In the example shown in FIG. 1, the server 100 assigns the applied delivery partner as deliverer Ub for the partial route from Station A to Station B, and requests the deliverer Ub to deliver the package along that partial route, along with information about the storage unit 300a and information related to unlocking the lock on the storage unit 300a. Upon receiving this request, the delivery partner as deliverer Ub collects the package from the storage unit 300a installed near Station A, delivers the package to the storage unit 300b installed near Station B, which serves as a relay point, and stores the package in the storage unit 300a. Similarly, the server 100 also solicits deliverers for the partial route from Station B to Station D, and as a result of this solicitation, sets the delivery partner who has applied as the deliverer Uc for that partial route. The server 100 then requests the deliverer Uc to deliver the package along that partial route, along with information about the storage unit 300b and information related to unlocking the lock on the storage unit 300b. Upon receiving this request, the delivery partner who is the deliverer Uc collects the package from the storage unit 300b installed near Station B, delivers the package to the storage unit 300d installed near the destination station D, and stores the package in the storage unit 300d. Then, when the target package is stored in storage 300d linked to station D, which is the destination, server 100 notifies the recipient of the package of the arrival of the package together with information about storage 300d where the package is stored, information related to unlocking the lock on storage 300d, etc. via the recipient's terminal device 270. This allows the recipient to receive the package addressed to them that has been delivered to storage 300d and stored therein.

[0016] As described above, the information processing system 1 according to this embodiment realizes delivery of a target package from a first boarding / disembarking point, which is the starting point of a journey for delivering the package using public transportation, to a second boarding / disembarking point, which is the destination, with the cooperation of a user who is a delivery collaborator. The configuration and processing of the information processing system 1 according to this embodiment will be described in more detail below.

[0017] <Hardware configuration> Referring to FIG. 2, an example of the hardware configuration of an information processing device 900 applicable as a device constituting the information processing system according to this embodiment (e.g., the server 100 and the terminal devices 210, 250, and 270) will be described. As shown in FIG. 2, the information processing device 900 according to this embodiment includes a central processing unit (CPU) 910, a read-only memory (ROM) 920, and a random access memory (RAM) 930. The information processing device 900 also includes an auxiliary storage device 940 and a network I / F 970. The information processing device 900 may also include at least one of an output device 950 and an input device 960. The CPU 910, the ROM 920, the RAM 930, the auxiliary storage device 940, the output device 950, the input device 960, and the network I / F 970 are connected to one another via a bus 980.

[0018] The CPU 910 is a central processing unit that controls various operations of the information processing device 900. For example, the CPU 910 may control the operation of the entire information processing device 900. The ROM 920 stores control programs, boot programs, and the like that can be executed by the CPU 910. The RAM 930 is the main storage memory of the CPU 910, and is used as a work area or a temporary storage area for expanding various programs.

[0019] The auxiliary storage device 940 stores various data and programs. The auxiliary storage device 940 is realized by a storage device capable of temporarily or permanently storing various data, such as a hard disk drive (HDD) or a nonvolatile memory such as a solid state drive (SSD).

[0020] The output device 950 is a device that outputs various types of information and is used to present various types of information to a user. For example, the output device 950 is realized by a display device such as a display. In this case, the output device 950 presents information to a user by displaying various types of display information. As another example, the output device 950 may be realized by an audio output device that outputs sounds such as voices and electronic sounds. In this case, the output device 950 presents information to a user by outputting sounds such as voices and electronic sounds. Furthermore, the device used as the output device 950 may be changed as appropriate depending on the medium used to present information to a user.

[0021] The input device 960 is used to receive various instructions from the user. In this embodiment, the input device 960 includes input devices such as a mouse, a keyboard, and a touch panel. As another example, the input device 960 may include a sound collection device such as a microphone, and collect voices uttered by the user. In this case, various analysis processes such as acoustic analysis and natural language processing are performed on the collected voices, and the contents of the voices are recognized as instructions from the user. Furthermore, the device applied as the input device 960 may be changed as appropriate depending on the method for recognizing instructions from the user. Furthermore, multiple types of devices may be applied as the input device 960.

[0022] The network I / F 970 is used for communication with external devices via a network. The device used as the network I / F 970 may be changed as appropriate depending on the type of communication path and the communication method used.

[0023] The CPU 910 expands a program stored in the ROM 920 or the auxiliary storage device 940 into the RAM 930 and executes this program, thereby realizing the functional configuration of the information processing system 1 shown in Figure 3 and the processing of the information processing system 1 described below with reference to Figure 8.

[0024] An example of the hardware configuration of the information processing device 900 that can be used as a device constituting the information processing system 1 according to this embodiment has been described above with reference to FIG.

[0025] <Functional configuration> 3, an example of the functional configuration of the information processing system 1 according to this embodiment will be described, focusing particularly on the configuration of the server 100. The server 100 includes a delivery management unit 101, a route setting unit 102, a user management unit 103, a storage status management unit 104, and a memory unit 105.

[0026] The delivery management unit 101 performs various management operations related to the delivery of packages. For example, the delivery management unit 101 receives a package delivery request from a package sender via the terminal device 250. At this time, the delivery management unit 101 receives information related to package delivery from the sender, such as the sender's origin and destination, the type of package, and the weight of the package. As described above, the information processing system 1 according to this embodiment uses storage facilities such as lockers installed near boarding and disembarking points such as train stations and bus stops to store packages to be delivered from the sender and deliver the packages to recipients. Therefore, when the delivery management unit 101 receives a package delivery request from the sender, it sets, in accordance with instructions from the sender, a first boarding and disembarking point and storage facility where the package from the sender will be stored, and a second boarding and disembarking point and storage facility where the package will be delivered to the recipient. For example, in the example shown in Figure 1, the delivery management unit 101 sets P station and storage facility 300p as the first boarding / disembarking point and storage facility where the package is received from the sender, and sets D station and storage facility 300d as the second boarding / disembarking point and storage facility where the package is handed over to the recipient.

[0027] There are no particular limitations on the method for setting the boarding and unloading points and storage facilities for storing and delivering luggage. For example, the delivery management unit 101 may receive a designation of boarding and unloading points for storing and delivering luggage from the sender, and set a storage facility for storing the luggage at each boarding and unloading point. As another example, the delivery management unit 101 may automatically set boarding and unloading points and storage facilities located near each point upon receiving designation of the addresses of the sender and destination of the luggage. Furthermore, the delivery management unit 101 may limit the boarding and unloading points and storage facilities where a package is temporarily stored when the package is delivered, i.e., the boarding and unloading points and storage facilities used for receiving the package from the sender, delivering the package between deliverers, and delivering the package to the recipient, depending on the type and characteristics of the package to be delivered. As a specific example, the storage facilities that can store the package may be limited depending on the size of the package. In such a case, the delivery management unit 101 may limit the storage facilities and boarding and unloading points where the package is temporarily stored for delivery when the package is delivered to the storage facilities that can store the package and the boarding and unloading points linked to the storage facilities.

[0028] Furthermore, when a first boarding and disembarking point, which is the departure point of the movement related to the delivery of the package, and a second boarding and disembarking point, which is the destination, are set, the delivery management unit 101 causes the route setting unit 102, which will be described later, to set a route for delivering the package from the first boarding and disembarking point to the second boarding and disembarking point using public transportation. For example, in the example shown in Fig. 1, a route is set that connects Station P, which is the departure point (starting station) of the movement related to the delivery of the package, with Station D, which is the destination (terminal station), with Stations A and B as third boarding and disembarking points that serve as relay points. When a route for package delivery is set, the delivery management unit 101 divides the route into multiple partial routes based on a series of relay points along the route. The delivery management unit 101 then recruits deliverers to deliver packages along each of the multiple partial routes, targeting those closest to the starting point on the route, and accepts applications from a series of delivery associates registered in the system. In this case, the delivery management unit 101 may start recruiting deliverers for the next partial route after accepting applications for the partial route for which deliverers are being recruited, without any particular limitations on the timing. As a specific example, the delivery management unit 101 may start recruiting deliverers for the next partial route after completing delivery of the package along the partial route for which deliverers are being recruited. As another example, when an application for a delivery person is accepted for a partial route for which delivery people are being recruited, the delivery management unit 101 may start recruiting a delivery person for the parcel for the next partial route in advance, even before the delivery of the parcel is completed, taking into account the estimated arrival time of the parcel and the influence of time that may occur as an error. The delivery management unit 101 may also provide each delivery partner with a UI for accepting applications from delivery partners in response to a delivery partner recruitment, a UI for searching for such recruitment, etc., via the delivery partner's terminal device 210. Under this premise, each delivery partner accesses the server 100 via their own terminal device 210, searches for recruitments for delivery partners for packages that they can deliver, and then applies for recruitments that meet their requirements.

[0029] For example, FIG. 4 shows an example of a search screen for searching for package delivery personnel recruitment. The search screen V101 shows an example of a screen for accepting search conditions for delivery recruitment from a delivery partner. The search screen V101 accepts search conditions for delivery recruitment, such as the origin and destination of the package and the weight of the package that can be delivered, when the delivery partner is responsible for delivering the package along at least a partial route of the package's delivery route. The delivery management unit 101 searches for recruitments that meet the specified conditions from a series of recruitments set based on package delivery requests received from each sender, and presents the search results to the delivery partner via the terminal device 210. In the example shown in FIG. 4, the search conditions for delivery recruitment are specified as the origin of the package being Station A, the destination being Station B, and the weight of the package being 1000g or less. The search result screen V102 shows an example of a screen presenting the search results for delivery job postings. In the example shown in FIG. 4, the search results presented include a job posting for the delivery of a 300g package of clothing from Warehouse No. 01 at Station A to Warehouse No. 01 at Station B, and a job posting for the delivery of a 500g stuffed toy from Warehouse No. 02 at Station A to Warehouse No. 03 at Station B. The search result screen V102 also presents an interface for selecting each searched job posting and accepting applications for that job posting. Delivery associates can apply for the selected delivery job posting by selecting an application target from the series of job postings presented and pressing the button for application (i.e., expressing their intention to deliver).

[0030] In addition, the delivery management unit 101 may accept advance registration of application conditions from delivery associates, and when it sets up a recruitment for delivery associates who meet those conditions, it may notify the delivery associates about the setting up of the recruitment.

[0031] For example, FIG. 5 shows an example of a reception screen for receiving registration of conditions related to a notification regarding the setting of a delivery worker recruitment from a delivery partner. The reception screen V111 shown in FIG. 5 is configured to accept specification of conditions regarding the route (section) along which the package can be delivered based on the departure point (package delivery origin) and arrival point (package delivery destination), as well as conditions regarding the date and time when the package can be delivered, such as the day of the week and time. The reception screen V111 also allows specification of route conditions, such as whether to allow package delivery in a partial section within the section between the departure point and arrival point (end point), for example, a section in which at least one of the relay points within the section is used as the package delivery origin or destination. In the example shown in FIG. 5, the departure point is Station C, the arrival point (end point) is Station D, the days of the week when package delivery is available are Monday, Tuesday, Wednesday, Thursday, and Friday, and the time is 7:00 a.m., and the condition that delivery in a partial section within the section between the departure point and arrival point is also allowed is specified.

[0032] FIG. 6 also shows an example of a notification screen for notifying delivery associates of the setting of a solicitation of a deliverer who meets the pre-registered conditions. The notification screen V121 shown in FIG. 6 presents information such as the delivery origin, delivery destination, package name, and package weight as conditions related to the set solicitation of a deliverer. The example shown in FIG. 6 notifies that a solicitation of a deliverer who meets the conditions specified in the example shown in FIG. 5 has been set, with the delivery origin being Warehouse No. 01 at Station C, the delivery destination being Warehouse No. 05 at Station D, the package name being miscellaneous goods, and the package weight being 500g. The notification screen V121 also presents an interface for accepting applications from delivery associates for the solicitation of a deliverer for which the information has been notified. Delivery associates can apply for the solicitation for which the information has been notified by pressing a button related to application (i.e., expressing their intention to deliver).

[0033] 7 shows an example of a management table used by the delivery management unit 101 to manage notification targets for setting up a solicitation of deliverers for a package in accordance with the delivery status of the package. The example shown in FIG. 7 shows an example of a case where the package is delivered from station P as the departure station, station D as the destination station, and with stations A and B as relay points. For convenience, in the example shown in FIG. 7, it is assumed that after delivery of the package on the target partial route is completed, solicitation of deliverers for the next partial route begins.

[0034] In the example shown in Figure 7, delivery partners Ua to Uf are managed as delivery partners who have registered at least a partial route from station P to station D for the delivery of the target package as a deliverable section. Based on this premise, the example shown in Figure 7 shows an example of the notification target setting status for the delivery partner recruitment setting when the target package is located at stations other than the terminal station D, i.e., stations P, A, and B.

[0035] As a specific example, if a package is at station P, delivery associates who can deliver the package to a destination station after station P on the route, i.e., station A, station B, or station D, are set as recipients of notifications regarding the settings for recruiting delivery associates. In this case, delivery associates Ua, Ub, and Uc are set as recipients of notifications. If the package is at station A, delivery associates who can deliver the package to a destination station after station A on the route, i.e., station B or station D, are set as recipients of notifications regarding the delivery associate recruitment settings. In this case, delivery associates Ud and Ue are set as recipients of notifications. If the package is at station B, a delivery partner who can deliver the package from station B to another station on the route after station B, i.e., station D, is set as the delivery partner to be notified regarding the delivery partner recruitment settings. In this case, delivery partner Uf is set as the notification target.

[0036] The method by which the delivery management unit 101 detects the completion of package delivery along a partial route to which a deliverer has been assigned is not particularly limited, as long as it is possible. For example, the delivery management unit 101 may recognize the completion of package delivery based on a delivery completion notification from the target deliverer. The delivery management unit 101 may also recognize the completion of package delivery based on confirmation from the storage status management unit 104 (described later) of the usage status of the storage facility where the target package will be stored after delivery is completed, i.e., that the storage facility has become in use by storing the package. The delivery management unit 101 may also recognize the completion of package delivery based on a combination of the conditions exemplified above.

[0037] Then, when delivery of the parcel to be delivered is completed, that is, when the parcel is stored in a storage facility linked to the terminal station (destination), the delivery management unit 101 notifies the recipient of the completion of delivery. At this time, the notification may include information for the recipient to retrieve the parcel, such as information about the storage location of the parcel and information for unlocking the lock on the storage location. This allows the recipient to check the notification from the delivery management unit 101 via, for example, their own terminal device 270, and retrieve the parcel stored in the storage facility.

[0038] The route setting unit 102 receives from the delivery management unit 101 the specification of a departure point (the sender of the package) and a destination point (the delivery destination where the package will be received) and sets a route for delivering the package using public transportation. Specifically, the route setting unit 102 targets a series of boarding and alighting points of the target public transportation that are registered as targets for baggage storage or delivery, and sets a route for travel using the public transportation that connects the boarding and alighting points specified as the departure point and the destination, and one or more relay points according to the route specifications. When setting the route, conditions for setting at least one of the boarding and alighting points among the departure point, destination, and relay points may be specified. As a specific example, there are so-called terminal stations and local stations among railway stations, and while both the departure point and the destination can be specified, a setting condition may be set such that only terminal stations are specified as relay points.

[0039] Furthermore, when there are multiple candidates for route setting, the route setting unit 102 may determine a route for package delivery based on evaluation criteria for the route to be set. As a specific example, the route setting unit 102 may determine a route for package delivery so as to reduce relay points. As another example, the route setting unit 102 may determine a route for package delivery so as to shorten the travel time from the departure point to the destination.

[0040] Here, we will explain an example of a method for specifying a route that reduces (and ultimately minimizes) the evaluation score, which is the sum of the number of stations that serve as relay points (hereinafter also referred to as intermediate stations) and the travel time, when delivering luggage by rail.The constants, variables, and parameters that are applied when specifying a route for luggage delivery using this method are defined as follows. -constant S: The departure station (origin) from which the package will be delivered G: The final destination where the package will be delivered T: Terminal station gathering N: Local station collection -variable x ij : 1 if moving from station i to station j, 0 if not moving z i : 1 if station i is an intermediate station, 0 if not an intermediate station -parameters ·d ij : Travel time from station i to station j α: Weight of the number of intermediate stations (relay points) β: Weight of travel time The evaluation score is expressed by the relational expression shown below as (Equation 1). Evaluation score = α Number of intermediate stations + β Travel time (Formula 1) In light of the above, an example of a relational expression for determining a route for delivering a package based on the evaluation points and a constraint condition applied to the relational expression will be shown below.

[0041]

number

[0042] (Formula 2) is a relational expression for determining a route for delivering luggage so as to minimize the total number of intermediate stations and travel time. (Formula 3) is a constraint condition indicating departure from departure station S. (Formula 4) is a constraint condition indicating arrival at destination station G. (Formula 5) is a constraint condition that limits stations that can be designated as intermediate stations to terminal stations. (Formula 6) is a constraint condition that limits edges that can be designated as intermediate stations for station i to edges that leave station i. (Formula 7) is a constraint condition that limits the number of incoming edges to be the same as the number of outgoing edges at intermediate stations. (Formula 8) is a constraint condition that limits the number of incoming edges to be the same as the number of outgoing edges at intermediate stations, depending on the variable x ij and z i is a constraint that indicates the possible values ​​of

[0043] The above is merely an example and does not limit the method for determining a route for delivering a package, and the route determination method and applied constraints may be changed as appropriate depending on the use case to which the technology according to the present disclosure is applied and the situation at the time. Other examples of the route determination method will be described in detail later as modified examples.

[0044] The user management unit 103 manages various information related to users of the information processing system 1 according to this embodiment. Examples of the users include the above-mentioned delivery collaborators, senders, and recipients.

[0045] When delivering luggage using public transportation, the storage status management unit 104 manages storage facilities used for storing and delivering luggage at boarding and disembarking points of the public transportation by linking them to the boarding and disembarking points. In addition, the storage status management unit 104 may monitor the usage status of the storage facilities linked to each boarding and disembarking point and notify the delivery management unit 101 of the usage status of the storage facilities (for example, whether or not the luggage is being stored).

[0046] The storage unit 105 is a storage area that stores and holds programs and various data for realizing the functions of each component of the server 100. The storage unit 105 is realized, for example, by the auxiliary storage device 940 or RAM 930 shown in Fig. 2. The data stored in the storage unit 105 may include, for example, data related to the management of the delivery status of packages, data related to the management of delivery routes of packages, data related to the management of users registered in the system, and data related to the management of the usage status of each storage facility.

[0047] 3 is merely an example, and the functional configuration of the server 100 is not limited as long as the functions of the components of the server 100 are realized. For example, the functions of the components of the server 100 may be realized by cooperation between multiple devices. As a specific example, some of the components of the server 100 shown in FIG. 3 may be realized as functions of a device other than the server 100. As a specific example, at least one of the components of the route setting unit 102, the user management unit 103, the storage status management unit 104, and the memory unit 105 may be provided in a device other than the server 100.

[0048] An example of the functional configuration of the information processing system 1 according to this embodiment has been described above with reference to FIG. 3, focusing particularly on the configuration of the server 100.

[0049] <Processing> An example of the processing of the information processing system 1 according to this embodiment will be described with reference to Fig. 8, focusing particularly on the processing of the server 100. Note that in the example shown in Fig. 8, with regard to the recruitment of deliverers for each of a series of partial routes in a route related to package delivery, the processing flow will be described for the case where the recruitment of deliverers for the next partial route begins after the delivery of the package for the previous partial route is completed.

[0050] In S101, the delivery management unit 101 receives a package delivery request from a package sender via the terminal device 210. At this time, the delivery management unit 101 receives information related to the delivery of the package from the sender, such as the sender and destination of the package, the type of the package, and the weight of the package.

[0051] In S102, the delivery management unit 101 causes the route setting unit 102 to set a route for delivery of the package using public transportation in response to the package delivery request received in S101. At this time, the delivery management unit 101 specifies a departure point from which the package is sent and a destination point where the package will be received. In response to the instruction from the delivery management unit 101, the route setting unit 102 sets a route for travel using public transportation connecting the departure point and the designated destination, with the destination being a series of boarding and alighting points of the target public transportation registered as targets for package drop-off and delivery. In addition, the delivery management unit 101 divides the route set by the route setting unit 102 into multiple partial routes based on each of a series of relay points along the route. For example, as illustrated in FIG. 1, a route is set with Station P as the departure station, Station A and Station B as the intermediate stations, and Station D as the terminal station. In this case, a series of routes from station P to station D is divided into three partial routes: from station P to station A, from station A to station B, and from station B to station D.

[0052] In S103, the delivery management unit 101 sets the partial route closest to the departure point as the target for delivery agent recruitment from among the series of partial routes for which no delivery agent has yet been set, out of the multiple partial routes divided from the route for delivery of the package set in S102. In S104, the delivery management unit 101 starts recruiting deliverers to deliver the parcels for the partial routes set as the target for the recruitment of deliverers in S103, and accepts applications from delivery associates. Delivery associates access the server 10 via their own terminal devices 210 to confirm the details of the recruitment of deliverers (for example, the delivery origin, delivery destination, type of parcel, weight of parcel, etc.) and then apply for the recruitment. When the delivery management unit 101 receives an application from a delivery partner in response to the recruitment started in S104, the delivery management unit 101 sets the delivery partner as the deliverer of the target package on the target partial route in S105. Then, the delivery management unit 101 waits for the set deliverer to complete delivery of the package. Upon receiving the notification regarding the completion of delivery of the package, the delivery management unit 101 confirms in S106 that delivery of the package by the deliverer set in S105 has been completed. As described above, as long as the delivery management unit 101 can confirm the completion of delivery of the package assigned to the deliverer, there are no particular limitations on the method for confirming the completion of the delivery.

[0053] In S107, the delivery management unit 101 determines whether or not delivery of the target package to the destination (for example, the terminal station) that is the final destination of the delivery of the package has been completed. If the delivery management unit 101 determines in S107 that delivery of the package to the destination has not been completed, the process proceeds to S103. In this case, the process from S103 onward is executed again for the partial routes along which the package has not been delivered, among the series of partial routes along the package delivery route. Then, if the delivery management unit 101 determines in S107 that delivery of the package to the destination has been completed, the process proceeds to S108. In S108, the delivery management unit 101 notifies the recipient that delivery of the package has been completed. At this time, the notification may include information for the recipient to collect the package, such as information about the storage location of the package and information for unlocking the storage location. This allows the recipient to check the notification from the delivery management unit 101 via, for example, their own terminal device 270, and collect the package stored in the relevant storage facility. Then, when the delivery management unit 101 confirms that the recipient has collected the package, it ends the series of processes shown in FIG. 8.

[0054] In the example shown in FIG. 8, a case where a call for deliverers for the next partial route begins after the delivery of the package on the previous partial route is completed is described. However, as described above, once a delivery application for the target partial route has been accepted, the call for deliverers for the next partial route may begin even before the delivery of the package is completed. In other words, in this case, the call for deliverers for the next partial route may begin without waiting for confirmation that the delivery of the package on the previous partial route is completed. On the other hand, a situation may also be anticipated in which the package has not yet arrived at the warehouse that will be the sender of the next partial route when an application from a delivery partner is accepted in response to the call for deliverers for the next partial route. Therefore, in anticipation of such a situation, when the package is stored in the warehouse that will be the sender of the next partial route, a notification regarding the arrival of the package may be sent to the delivery partner who will deliver the next partial route.

[0055] <Variation 1: Example of setting delivery routes according to the number of registered delivery collaborators> As a first variation of this embodiment, an example of a method for setting a route for package delivery depending on the number of registered delivery associates will be described. The information processing system according to this embodiment is characterized in that package delivery is realized with the cooperation of delivery associates, and therefore package delivery may be delayed if applications for delivery associates are not accepted (there are no applicants). Due to this characteristic, the more likely it is that applications for delivery associates will be accepted, the smoother package delivery can be realized. In consideration of this characteristic, this variation describes an example of a method for setting a route for package delivery by prioritizing route candidates that can expect the cooperation of more delivery associates.

[0056] Specifically, in the information processing system 1 according to this embodiment, as described above with reference to Figure 5, a delivery partner can register in advance in the system the conditions of the section and date and time for which they can deliver a package, and when a package delivery request that meets those conditions is set, they can receive a notification regarding the setting of that request. The information processing system 1 according to this modification references the information indicating the conditions related to the delivery of the package that is the subject of information notification registered by the delivery partner, and sets, as the route for the delivery of the package, a route that can be notified to as many delivery partner as possible with higher priority.

[0057] For example, Fig. 9 is a diagram illustrating an example of a method for setting a route for package delivery in an information processing system according to this modified example. In the example shown in Fig. 9, a route that passes through Station C as an intermediate station and a route that passes through Station D as an intermediate station are set as route candidates for delivering package from Station A to Station B. In Fig. 9, partial routes connecting each station are schematically shown by arrows, information indicating the time required for travel on the partial routes is added, and the number of delivery collaborators registered as targets for information notification when the partial route is applied as part of a route for package delivery is shown in parentheses.

[0058] In the example shown in Figure 9, the total travel time for the route from Station A to Station B via Station C (route ACB) is 44 minutes, while the total travel time for the route from Station A to Station B via Station D (route ADB) is 50 minutes. Therefore, if shorter travel time is simply given priority, route ACB is more desirable as a route for delivering packages than route ADB. On the other hand, when looking at the number of registered delivery associates for each route, for route ACB, there are 20 registered delivery associates for the partial route from Station A to Station C (partial route AC), and 10 registered delivery associates for the partial route from Station C to Station B (partial route CB). In contrast, for route ADB, there are 30 registered delivery associates for the partial route from Station A to Station D (partial route AD), and 40 registered delivery associates for the partial route from Station D to Station B (partial route DB). In other words, because route ADB has a larger number of registered delivery associates for each partial route than route ACB, it is possible to further reduce the risk of situations occurring, such as when applications for delivery positions are not accepted and package deliveries are delayed. In consideration of the above characteristics, the server 100 according to this modification gives higher priority to the route ADB in the example shown in FIG. 9 and sets it as the route for delivering the package.

[0059] Furthermore, the information processing system according to this modification may set a route for delivery of a package by taking into account not only the number of registered delivery partners but also the number of divisions when the route for delivery of the package is divided into multiple partial routes by relay points. Specifically, the server 100 sets a route for delivery of a package by prioritizing routes with a larger number of registered delivery partners in terms of the number of divisions into partial routes, and by prioritizing routes with a smaller number of divisions in terms of the number of divisions into partial routes.

[0060] For example, Fig. 10 is a diagram for explaining another example of a method for setting a route for package delivery in the information processing system according to this modification, and illustrates an example of setting a route for package delivery taking into account not only the number of registered delivery associates but also the number of divisions into partial routes. The example illustrated in Fig. 10 illustrates an example of a case in which, for a route with Station A as the departure station, Stations B and C as intermediate stations, and Station D as the terminal station, multiple route candidates from Station A to Station D are set by switching which intermediate station determines whether to divide the route into partial routes. Specifically, in the example illustrated in Fig. 10, four route candidates are set: a route for directly delivering the package from Station A to Station D (route AD), a route for temporarily storing the package at Station B (route ABD), a route for temporarily storing the package at Station C (route ACD), and a route for temporarily storing the package at Stations B and C (route ABCD). In addition, in the example shown in Figure 10, the number of registered delivery partners is shown numerically for the route directly connecting Station A and Station D, and for each of a series of partial routes defined by dividing Station A and Station D by at least one of Station B and Station C.

[0061] In the example shown in Fig. 10, the number of divisions indicates the number of intermediate stations (stations where luggage is temporarily stored) between the departure station and the destination station. In the example shown in Fig. 10, the number of divisions for route AD is 0, the number of divisions for routes ABD and ACD is 1, and the number of divisions for route ABCD is 2. In other words, if the priority of the routes is evaluated only from the perspective of the number of divisions, route AD will have higher priority. On the other hand, the total number of registered delivery partners for each candidate route for package delivery is 5 for route AD, 15 for route ABD, 30 for route ACD, and 30 for route ABCD. In other words, if the priority of the routes were evaluated solely from the perspective of the number of registered delivery partners, route ABD, route ACD, and route ABCD would have higher priority.

[0062] Under the above assumptions, the server 100 according to this modified example sets priorities between candidates for the route related to package delivery based on the number of delivery associates registered for each candidate and the number of divisions of the route. As a specific example, although route ABD and route ACD have the same number of route divisions, route ACD has a larger number of registered delivery associates, so route ACD is given priority over route ABD. Also, although route ACD and route ABCD have the same number of registered delivery associates, route ACD has a smaller number of route divisions, so route ACD is given priority over route ABCD. Also, route AD has fewer divisions than the other candidates, but the number of registered delivery associates is extremely fewer than the other candidates, so it is set to a lower priority than the other candidates. As described above, in the example shown in FIG. 10, the candidates are prioritized so that route ACD has the highest priority, followed by route ABD, route ABCD, and route AD in decreasing order.

[0063] The above describes an example of a method for setting a route for package delivery depending on the number of registered delivery associates as a first variation of this embodiment. As illustrated above, by giving priority to route candidates with a greater number of registered delivery associates as the route for package delivery, it is expected that the risk of package delivery being delayed due to applications not being accepted in response to a recruitment of delivery associates will be reduced.

[0064] <Variation 2: Example of setting delivery routes according to the number of free spaces in storage> As a second variation of this embodiment, an example of a method for setting a route for package delivery based on the number of available spaces in a storage facility for temporarily storing packages during delivery will be described. As described above, the information processing system according to this embodiment temporarily stores packages in a storage facility such as a locker when receiving packages from a sender, delivering the packages to a deliverer, and delivering the packages to a recipient. Due to this characteristic, if a storage facility runs out of available space, it becomes difficult to temporarily store the package for delivery or delivery. Furthermore, because the availability of each storage facility can change from moment to moment depending on the order status of package delivery requests, even if a storage facility has available space at the beginning of package delivery, it is possible that the storage facility may later become unavailable. In consideration of this characteristic, this variation will describe an example of a method for setting a route for package delivery that prioritizes candidate routes with more available space in the storage facility.

[0065] For example, Fig. 11 is a diagram for explaining an example of a method for setting a route for delivering luggage in an information processing system according to this modification. In the example shown in Fig. 11, as route candidates for delivering luggage from station A to station B, a route that passes through station C as an intermediate station, a route that passes through station D as an intermediate station, and a route that passes through stations E and F as intermediate stations are set. In Fig. 11, partial routes connecting each station are schematically shown by arrows, and the number of available storage spaces at each intermediate station is indicated by a subscript.

[0066] In the example shown in FIG. 11, on a route (route ACB) that goes from station A to station B via station C, the number of vacant storage spaces at station C, which is an intermediate station, is 0. Also, on a route (route ADB) that goes from station A to station B via station D, the number of vacant storage spaces at station D, which is an intermediate station, is 3. Also, on a route (route AEFB) that goes from station A to station B via stations E and F, the number of vacant storage spaces at station E, which is an intermediate station, is 8, and the number of vacant storage spaces at station F, which is 12. That is, for route ACB, it is difficult to use a storage facility at station C to store the luggage, making it practically difficult to deliver the luggage. Furthermore, route AEFB has a larger number of route divisions than route ADB, resulting in a greater number of handovers between deliverers, which may result in a longer luggage delivery time than route ADB. On the other hand, route AEFB has more free storage facilities at intermediate stations than route ADB, making it possible to reduce the risk of running out of storage space during luggage delivery more than route ADB. In consideration of the above characteristics, the server 100 according to this modification gives higher priority to the route AEFB in the example shown in FIG. 11 and sets it as the route for delivering the package.

[0067] In addition, the information processing system of this modified example may set a route for delivering luggage by taking into account not only the number of available storage spaces at each intermediate station, but also the number of divisions when the route for delivering luggage is divided into multiple partial routes by relay points, as in the above-mentioned modified example 1.

[0068] For example, FIG. 12 is a diagram illustrating another example of a route setting method for package delivery in an information processing system according to this modification. The example illustrates a case in which a package delivery route is set by taking into account not only the number of available storage spaces at each intermediate station but also the number of divisions into partial routes. Similar to the example illustrated in FIG. 10, the example illustrated in FIG. 12 illustrates a case in which multiple route candidates are set for a route with Station A as the departure station, Stations B and C as intermediate stations, and Station D as the destination station, by switching which intermediate station determines which of the intermediate stations divides the route into partial routes. That is, in the example illustrated in FIG. 12, four route candidates are set: Route AD, Route ABD, Route ACD, and Route ABCD. Also, similar to the example illustrated in FIG. 10, the example illustrated in FIG. 12 indicates the number of registered delivery partners numerically, and associates the number of available storage spaces with each intermediate station. The method for evaluating route priority based on the number of registered delivery partners and the method for evaluating route priority based on the number of divisions in the example illustrated in FIG. 12 are the same as those in the example illustrated in FIG. 10.

[0069] Under the above assumptions, the server 100 according to this modification sets the priority among the candidates by taking into account the number of vacant storage spaces at intermediate stations of each candidate route for package delivery. Note that in this modification, when evaluating the priority of each candidate route according to the number of vacant storage spaces at intermediate stations, the smallest value among the number of vacant storage spaces at each of the series of intermediate stations when the candidate is applied is applied to the evaluation. As a specific example, routes ABD and ACD have the same total number of registered delivery partners and the same number of route divisions, but the number of available storage spaces at stations B and C, which are intermediate stations on each route, differ. Specifically, for route ABD, the number of available storage spaces at station B, which is an intermediate station, is 2, while for route ACD, the number of available storage spaces at station C, which is an intermediate station, is 10. Therefore, between routes ABD and ACD, route ACD, which has a greater number of available storage spaces at its intermediate stations, is given priority. Furthermore, route ABCD passes through intermediate stations B and C. Therefore, when evaluating the priority of route ABCD based on the number of vacant storage spaces at the intermediate stations, the smallest number of vacant storage spaces at stations B and C, i.e., 2, which is the number of vacant storage spaces at station B, is applied to the evaluation.

[0070] The above describes an example of a method for setting a route for delivering a package depending on the number of available spaces in a storage facility that temporarily stores the package when delivering the package, as Modification 2 of this embodiment. As illustrated above, by giving priority to a candidate with a larger number of available spaces in a storage facility as a route for delivering the package, it is expected that the risk of a situation occurring in which it becomes difficult to temporarily store the package for delivery due to a lack of available spaces in the storage facility can be reduced. This modified example can also be applied in combination with the above-mentioned modified example 1. Furthermore, when the priority of candidate routes for package delivery is evaluated based on a combination of multiple conditions such as the number of registered delivery partners, the number of route divisions, and the number of available storage spaces, which of the conditions is given higher priority (weighting between the conditions) may be changed as appropriate depending on the use case.

[0071] <Variation 3: Recruiting multiple candidates for delivery personnel> As a third variation of this embodiment, an example of a method for recruiting parcel deliverers by targeting multiple candidate routes for the parcel delivery will be described. As described above, in the information processing system 1 according to this embodiment, a route for the parcel delivery is set, and then deliverers are recruited for that route. However, depending on the setting of the parcel's delivery origin and destination, multiple candidate routes for the parcel delivery may be set. Also, as described above, the more delivery associates registered, the higher the likelihood that an application for a delivery associate will be accepted, and the total number of registered delivery associates increases as the number of candidate routes increases. In consideration of these characteristics, in the information processing system according to this variation, when multiple candidate routes for the parcel delivery can be set, the information processing system recruits deliverers for multiple candidate routes, thereby increasing the likelihood that an application for the delivery associate will be accepted.

[0072] Here, the features of the information processing system according to this modification will be described in more detail with reference to a specific example in Fig. 13. Fig. 13 shows an example of candidate routes when multiple candidates can be set as routes for delivering luggage. Specifically, in the example shown in Fig. 13, route 1 (route ACB) with station C as an intermediate station, route 2 (route ADB) with station D as an intermediate station, and route 3 (route AEFB) with station E and station F as intermediate stations are extracted as route candidates when delivering luggage from station A to station B. In this case, for example, the server 100 may start soliciting delivery personnel for each of Routes 1, 2, and 3 shown in Figure 13, and identify the candidate for which an application is accepted first as the route to actually use for delivering the package. By applying this type of control, the total number of registered delivery associates will be greater than when soliciting delivery personnel for only Routes 1, 2, and 3, which is expected to increase the likelihood that an application for a delivery personnel recruitment will be accepted. In other words, it is expected to have the effect of reducing the risk of a situation occurring in which a delivery personnel recruitment is not accepted and package delivery is delayed.

[0073] As another example, the server 100 may control, depending on the situation at the time, which of multiple candidate routes for package delivery is the target of the recruitment of deliverers. For example, the server 100 may initially prioritize recruitment of deliverers for a certain route (first route), and if no applications are accepted before a predetermined condition, such as the passage of a predetermined period of time, is met, the server 100 may then recruit deliverers for another route (second route) different from the certain route. As a specific example, in the example shown in FIG. 13 , the server 100 may first begin recruiting deliverers for route 1, and if no applications are accepted after the predetermined period of time has passed, begin recruiting deliverers for routes 2 and 3. In this case, the server 100 may maintain the recruitment for route 1 and additionally begin recruiting for routes 2 and 3. As another example, the server 100 may withdraw the recruitment for route 1 when the recruitment for routes 2 and 3 begins.

[0074] As described above, as a third variation of this embodiment, an example of a method for recruiting parcel deliverers by recruiting from multiple candidate routes for the parcel delivery has been described. As illustrated above, by recruiting from multiple candidate routes for the parcel delivery, the total number of registered delivery associates who are expected to accept applications increases. This increases the likelihood that applications for the delivery recruitment will be accepted, and ultimately reduces the risk of a situation occurring in which applications for the delivery recruitment are not accepted, resulting in delays in parcel delivery.

[0075] <Modification 4: Resetting of routes related to package delivery> As a fourth variation of this embodiment, an example of control related to the re-establishment of a route for package delivery will be described. As described above, the information processing system according to this embodiment solicits and accepts applications from cooperating delivery partners who have been registered in advance in the system, thereby achieving delivery of the target package with the cooperation of the cooperating delivery partners. Due to this characteristic, applications are not always accepted in response to the solicitation of deliverers. For example, a situation may arise in which a package left in a storage facility at the sender or relay point is not collected by the deliverer, resulting in a delay in delivery. On the other hand, depending on the situation at the time, it may be possible to imagine a situation in which it is difficult to obtain the cooperation of cooperating delivery partners for some routes, but cooperating delivery partners can be obtained for other routes. Therefore, in this variation, an example of control will be described in which, even after a route for package delivery has been set, the route for the package delivery is re-established in accordance with the application status for the solicitation of deliverers, thereby enabling continuation of package delivery.

[0076] Specifically, in this modified example, if a package is temporarily stored in a storage facility at the departure point or relay point and an application is not accepted before a specified condition, such as a specified period of time, is met, the server 100 may reset the route for delivering the package, using the current location as the new departure point. As a specific example, a situation may be imagined in which delivery of a package has begun, but the package is stored in a storage facility at an intermediate station, and applications for delivery personnel for subsequent partial routes are not accepted, resulting in a delay in delivery of the package. In such a case, server 100 may re-establish the route for delivery of the package to the terminal station, using the intermediate station as a new departure station, and then solicit delivery personnel for the newly established route. In addition, server 100 may prioritize routes that pass through large terminal stations (e.g., terminal stations with many types of railway service) with a larger number of registered delivery partners, even if this increases travel time. Furthermore, server 100 may establish multiple candidate routes for delivery of the package and solicit delivery personnel for the multiple candidate routes, as described in Variation 3.

[0077] The above describes an example of control related to the reconfiguration of a package delivery route as a fourth variation of the present embodiment. As described above, the information processing system according to this variation makes it possible to reconfigure the package delivery route according to the situation at the time, even after the package delivery route has been set and package delivery has begun. As a result, even if a situation occurs in which applications for a delivery person are not accepted for a certain route, causing a delay in package delivery, the reconfiguration of the package delivery route makes it possible to recruit other delivery partners. In other words, the information processing system according to this variation is expected to flexibly change the package delivery route according to ever-changing situations, thereby further reducing the risk of package delivery being delayed due to the absence of a delivery person.

[0078] <Conclusion> As described above, in the information processing system according to this embodiment, the server 100 recruits and accepts applications from deliverers who will deliver packages along a plurality of partial routes divided by one or more third on / off points from a route that is defined to connect a first on / off point, which is the starting point of a trip for delivering packages using the public transportation system, to a second on / off point, which is the destination, via at least one or more third on / off points. The server 100 then recruits and accepts applications from deliverers who will deliver packages along a second partial route on the route, which is the next partial route after the first partial route. With the above configuration, even in a situation where there are no delivery associates capable of delivering a package along a route, the route can be divided into multiple partial routes, and delivery of the package can be achieved with the cooperation of delivery associates for each partial route. Furthermore, the information processing system according to this embodiment can select a route for delivery of the package according to various conditions, reconfigure the route for delivery of the package, and more flexibly respond to the situation at hand. In this way, the information processing system according to this embodiment can deliver packages in a more optimal manner with the cooperation of delivery associates.

[0079] It should be noted that the above-described embodiment is merely an example and does not necessarily limit the configuration or processing of the present invention, and various modifications and changes may be made without departing from the technical concept of the present invention. Furthermore, the above-described embodiments and modifications may be applied in appropriate combinations as long as there are no inhibiting factors. The present invention also includes a program for realizing the functions of the above-described embodiments, and a computer-readable recording medium storing the program.

[0080] The following configurations also fall within the technical scope of the present disclosure. (1) An information processing device having a delivery management means that, from a route that is defined to connect a first boarding and disembarking point that is the starting point of a journey related to the delivery of a package using the transportation means, and a second boarding and disembarking point that is the destination, via at least one or more third boarding and disembarking points, recruits and accepts applications from deliverers to deliver the package along multiple partial routes that are divided by one or more third boarding and disembarking points, targeting each partial route on the route in order of proximity to the first boarding and disembarking point, and after the delivery management means accepts applications from deliverers for a first partial route of the multiple partial routes on the route, recruits deliverers to deliver the package along a second partial route on the route that is next to the first partial route. (2) An information processing device as described in (1), which has a route setting means that, upon receiving the designation of the first boarding and disembarking point and the second boarding and disembarking point, sets the route for delivery of the package and one or more third boarding and disembarking points related to the route regulations, and the delivery management means recruits the delivery person for each of the multiple partial routes divided from the route set by the route setting means. (3) The information processing device described in (2), wherein the route setting means sets multiple candidate routes connecting the first boarding / disembarking point and the second boarding / disembarking point, and the delivery management means applies at least one of the multiple candidates as the route for delivering the package. (4) An information processing device as described in (3), which has a user management means for linking and managing each partial route connecting each of a series of boarding and disembarking points of the transportation means with users who are candidates for delivery persons who will deliver the luggage along the partial route, and the delivery management means accepts applications from the users who are linked and managed to the partial route for the partial route related to the delivery of the target luggage, and the route setting means gives priority to the candidate that has a larger number of users who are linked and managed to each of the multiple partial routes included in the candidate among multiple candidates for the route connecting the first boarding and disembarking point and the second boarding and disembarking point, and sets it as the route related to the delivery of the luggage. (5) An information processing device as described in (3), which has a storage status management means for linking a series of boarding and disembarking points of the transportation means with storage facilities for temporarily storing luggage that arrives at the boarding and disembarking points, and for managing the storage status of luggage in the storage facilities, and the route setting means gives priority to a candidate among multiple candidates for a route connecting the first boarding and disembarking point and the second boarding and disembarking point that has a greater number of available storage facilities linked to the third boarding and disembarking point, and sets it as the route for delivering the luggage. (6) The information processing device described in (3), wherein the delivery management means recruits the delivery personnel for multiple routes set by the route setting means, and when an application for the delivery personnel is received for one of the multiple routes, the information processing device thereafter recruits the delivery personnel for that route. (7) The information processing device described in (3), wherein the delivery management means recruits the delivery person by giving priority to a first route among the multiple routes set by the route setting means, and if no application for the delivery person for the first route is accepted before a specified condition is met, recruits the delivery person for a second route among the multiple routes that is different from the first route. (8) An information processing device described in any one of (2) to (7), wherein the route setting means, when the delivery management means is unable to accept an application from the delivery person to deliver the package from any third boarding and disembarking point on the route for delivering the package, sets a new route for delivering the package, with the third boarding and disembarking point as a new first boarding and disembarking point that will be the starting point for the movement for delivering the package, when a specified condition is met. (9) An information processing device described in any one of (1) to (8), wherein the delivery management means recruits a delivery person to deliver the package along the second partial route when delivery of the package along the first partial route is completed. (10) An information processing device described in any one of (1) to (8), wherein the delivery management means recruits a delivery person to deliver the package on the second partial route when an application for the delivery person is accepted for the first partial route. (11) An information processing method executed by an information processing device, comprising: a delivery management step of recruiting and accepting applications from deliverers to deliver packages along a plurality of partial routes divided by one or more third boarding and disembarking points from a route that is defined to connect a first boarding and disembarking point that is the starting point of a journey related to delivery of a package using the transportation means, and a second boarding and disembarking point that is the destination, in order of proximity to the first boarding and disembarking point on the route, after accepting applications from deliverers for a first partial route of the plurality of partial routes on the route, and then recruiting deliverers to deliver the package along a second partial route that is next to the first partial route on the route, in the delivery management step. (12) A program that causes a computer to execute a delivery management step of recruiting and accepting applications from deliverers to deliver packages along a plurality of partial routes divided by one or more third boarding and disembarking points from a route that is defined to connect a first boarding and disembarking point that is the starting point of a journey related to delivery of a package using the transportation means, and a second boarding and disembarking point that is the destination, in order of proximity to the first boarding and disembarking point on the route, and the delivery management step of recruiting and accepting applications from deliverers to deliver packages along a second partial route that is next to the first partial route on the route after accepting applications from deliverers for a first partial route of the plurality of partial routes on the route. [Explanation of symbols]

[0081] 1. Information Processing Systems 100 servers 101 Delivery Management Department 102 Route setting section 103 User Management Department 104 Storage Status Management Department 105 Storage section 200 Terminal Device 300 Storage

Claims

1. a route setting means for receiving designation of a first boarding / alighting point, which is a starting point of a trip for delivery of a package using the transportation means, and a second boarding / alighting point, which is a destination point, from among a series of boarding / alighting points of the transportation means, and setting a route for delivery of the package that is defined to connect the first boarding / alighting point and the second boarding / alighting point via at least one or more third boarding / alighting points, and setting one or more third boarding / alighting points for the defined route; a delivery management means for soliciting and accepting applications from deliverers who will deliver the parcel along a plurality of partial routes divided by the one or more third boarding and disembarking points from the route set by the route setting means, in order of proximity to the first boarding and disembarking point on the route, until delivery of the parcel to the second boarding and disembarking point is completed; and After the delivery management means has accepted the application of the deliverer for a first partial route among the plurality of partial routes on the route, the delivery management means starts recruiting deliverers to deliver the package along a second partial route that is next to the first partial route on the route. Information processing device.

2. the route setting means sets a plurality of candidates for a route connecting the first boarding / alighting point and the second boarding / alighting point, The delivery management means applies at least one of the plurality of candidates as the route for delivering the package. The information processing device according to claim 1 .

3. a user management means for linking and managing each partial route connecting a series of boarding and disembarking points of the transportation facility with a user who is a candidate for a deliverer who delivers luggage along the partial route; The delivery management means receives an application from the user who is managed in association with a partial route related to the delivery of the target package, for a deliverer who will deliver the package, and the route setting means sets, as the route for delivery of the package, a candidate that has a larger number of users who are linked to and managed for each of a plurality of partial routes included in the candidate route among a plurality of candidates for the route connecting the first boarding / disembarking point and the second boarding / disembarking point, with higher priority; The information processing device according to claim 2 .

4. a storage status management means for linking each of a series of boarding and disembarking points of the transportation facility with a storage facility for temporarily storing luggage that has arrived at the boarding and disembarking point, and for managing the storage status of the luggage in the storage facility; the route setting means sets, as the route for delivery of the package, a candidate having a larger number of vacant storage facilities linked to the third boarding / disembarking point among a plurality of candidates for the route connecting the first boarding / disembarking point and the second boarding / disembarking point, with higher priority; The information processing device according to claim 2 .

5. The delivery management means Recruiting the deliverers for the plurality of routes set by the route setting means; When an application for the delivery person is received for one of the plurality of routes, the delivery person is subsequently recruited for that route. The information processing device according to claim 2 .

6. The delivery management means Recruiting the deliverers by giving priority to a first route among the plurality of routes set by the route setting means; If no application for the delivery person is accepted for the first route until a predetermined condition is met, the delivery person is recruited for a second route different from the first route among the plurality of routes. The information processing device according to claim 2 .

7. When the delivery management means is unable to accept an application from the deliverer to deliver the package from any of the third boarding and disembarking points on the route related to the delivery of the package and a predetermined condition is met, the route setting means sets a new route related to the delivery of the package, with the third boarding and disembarking point as a new first boarding and disembarking point that will be the starting point of the movement related to the delivery of the package. The information processing device according to claim 1 .

8. the delivery management means, when delivery of the package along the first partial route is completed, recruits a deliverer to deliver the package along the second partial route; The information processing device according to claim 1 .

9. the delivery management means, when an application for the delivery person for the first partial route is accepted, recruits a delivery person to deliver the package along the second partial route; The information processing device according to claim 1 .

10. An information processing method executed by an information processing device, a route setting step of receiving designation of a first boarding / alighting point, which is a starting point of a trip related to delivery of a package using the transportation facility, and a second boarding / alighting point, which is a destination, from among a series of boarding / alighting points of the transportation facility, and setting a route related to delivery of the package that is defined to connect the first boarding / alighting point and the second boarding / alighting point via at least one or more third boarding / alighting points, and setting one or more third boarding / alighting points related to the defined route; a delivery management step of recruiting and accepting applications from deliverers who will deliver the parcel along a plurality of partial routes divided by the one or more third boarding and disembarking points from the route set in the route setting step, in order of proximity to the first boarding and disembarking point on the route, until delivery of the parcel to the second boarding and disembarking point is completed; Including, In the delivery management step, after accepting the application of the deliverer for a first partial route among the plurality of partial routes on the route, a recruitment of a deliverer to deliver the package along a second partial route next to the first partial route on the route is started. Information processing methods.

11. On the computer, a route setting step of receiving designation of a first boarding / alighting point, which is a starting point of a trip related to delivery of a package using the transportation facility, and a second boarding / alighting point, which is a destination, from among a series of boarding / alighting points of the transportation facility, and setting a route related to delivery of the package that is defined to connect the first boarding / alighting point and the second boarding / alighting point via at least one or more third boarding / alighting points, and setting one or more third boarding / alighting points related to the defined route; a delivery management step of recruiting and accepting applications from deliverers who will deliver the parcel along a plurality of partial routes divided by the one or more third boarding and disembarking points from the route set in the route setting step, in order of proximity to the first boarding and disembarking point on the route, until delivery of the parcel to the second boarding and disembarking point is completed; Execute In the delivery management step, after accepting the application of the deliverer for a first partial route among the plurality of partial routes on the route, a recruitment of a deliverer to deliver the package along a second partial route next to the first partial route on the route is started. program.

Images