Joint transportation planning system

The joint transportation plan creation system addresses complex constraints in nursing care facilities by forming pick-up and drop-off groups and using optimization methods to efficiently plan multiple vehicle trips, considering wheelchair users and reducing processing time.

JP7588554B2Active Publication Date: 2024-11-22DAIHATSU MOTOR CO LTD
View PDF 8 Cites 0 Cited by

Patent Information

Application Number
JP2021086539
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2021-05-21
Publication Date
2024-11-22
Estimated Expiration
2041-05-21

AI Technical Summary

Technical Problem

Existing transportation planning systems, such as those described in Patent Document 1, fail to efficiently create joint transportation plans for nursing care facilities due to complex constraints, including considerations for wheelchair users and prolonged processing times, especially when multiple vehicles are involved.

Method used

A joint transportation plan creation system that utilizes a reservation information acquisition unit, user information acquisition unit, facility information acquisition unit, vehicle information acquisition unit, travel time information acquisition unit, and a joint transportation plan planning unit to create a plan by forming pick-up and drop-off groups, setting objective functions, and using optimization methods to minimize these functions under predetermined constraints.

Benefits of technology

The system efficiently creates joint transportation plans that consider user convenience and burden while optimizing travel time, vehicle capacity, and cost, thereby streamlining operations at nursing care facilities.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007588554000001
    Figure 0007588554000001
  • Figure 0007588554000002
    Figure 0007588554000002
  • Figure 0007588554000003
    Figure 0007588554000003
Patent Text Reader

Abstract

To provide a shared-transportation plan creation system which can improve efficiency of the shared-transportation work in a care facility and efficiently create a shared-transportation plan even under a complicated constraint condition.SOLUTION: A shared-transportation plan creation system 1 for creating a shared-transportation plan for transporting a plurality of users M to a plurality of facilities F by using a plurality of vehicles C comprises: a reservation information acquisition unit 10; a user information acquisition unit 20; a facility information acquisition unit 30; a vehicle information acquisition unit 40; and a shared-transportation planning unit 50. The shared-transportation planning unit 50 forms a plurality of transporting groups by grouping prescribed transporting units by using a getting-on / off position about a transporting position and a facility position and the getting-on time and getting-off time corresponding to each transporting position as a transporting unit. The shared-transportation planning unit 50 creates a shared-transportation plan based on the optimum solution obtained by executing the search processing that minimizes the total sum of the objective function applied with prescribed weighting.SELECTED DRAWING: Figure 1
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to a joint transportation plan creating system that creates transportation plans for transporting users to various facilities using vehicles. [Background technology]

[0002] Conventionally, in the logistics industry, mathematical search methods have been proposed that use logistics costs and the like as objective functions in order to realize optimal delivery plans under constraints such as logistics costs and delivery dates (for example, Patent Document 1).

[0003] On the other hand, in recent years, in the nursing care industry, due to the problem of labor shortages, nursing care providers themselves are increasingly taking on the task of transporting users to and from work, and it is becoming difficult for the nursing care providers to handle everything on their own. Furthermore, as the number of users is expected to increase in the future, there is a demand for the efficiency of transportation operations. [Prior art documents] [Patent documents]

[0004] [Patent Document 1] Patent Application No. 7-175504 Summary of the Invention [Problem to be solved by the invention]

[0005] Incidentally, it is considered that the above-mentioned transportation service in the nursing care facility is effective in terms of efficiency, particularly when multiple vehicles are used to transport multiple users from multiple nursing care facilities scattered in the neighborhood. Therefore, the transportation service in the nursing care facility has more complex constraints on the transportation plan compared to the collection and delivery plan in logistics. Specifically, the transportation service requires consideration, for example, to prepare a seat for a wheelchair and to prevent the user from riding in the vehicle for a long time. However, when the invention of Patent Document 1 is used to create a plan for the transportation service, there is a problem that an appropriate solution specialized for the transportation service, such as consideration for the user, cannot be obtained. In addition, when the invention of Patent Document 1 is used to create a plan for the transportation service, there is a problem that the processing time until the plan is created becomes too long because of the increased constraints.

[0006] Therefore, an object of the present invention is to provide a joint transportation plan creation system that can streamline joint transportation operations in nursing care facilities and efficiently create joint transportation plans even under complex constraints. [Means for solving the problem]

[0007] (1) A joint transportation plan creation system provided to solve the above-mentioned problems is a joint transportation plan creation system that creates a joint transportation plan for transporting a plurality of users to a plurality of facilities using a plurality of vehicles, and includes a reservation information acquisition unit that acquires reservation information including a pickup location and a desired pickup time of the user, a user information acquisition unit that acquires user information including attributes of the user, a facility information acquisition unit that acquires facility information including information related to facility locations of the plurality of facilities, a vehicle information acquisition unit that acquires vehicle information including the available number of vehicles and vehicle attributes, a travel time information acquisition unit that acquires travel time information of the vehicles, and a joint transportation plan creation unit that creates a joint transportation plan, The pick-up plan creation unit defines pick-up and drop-off locations related to the pick-up and drop-off locations and the facility location, and the boarding times and disembarking times corresponding to each of the pick-up and drop-off locations as pick-up and drop-off units, and forms multiple pick-up and drop-off groups by grouping certain of the pick-up and drop-off units. A plurality of objective functions including the total traveling times of the plurality of vehicles are set, subject to the condition that certain constraint conditions prepared in advance are satisfied, and a predetermined weighting is assigned to each of the plurality of objective functions in response to the deviation from a predetermined target value. An optimal solution is obtained by executing a search process using a mathematical optimization method that minimizes the sum of the objective functions, and a joint pick-up and drop-off plan is created based on the optimal solution.

[0008] In the above-mentioned joint transfer plan creation system, the joint transfer plan creation unit sets the pick-up and drop-off locations related to the pick-up and drop-off locations and the boarding and disembarking times corresponding to the pick-up and drop-off locations as transfer units. In addition, in the above-mentioned joint transfer plan creation system, the joint transfer plan creation unit configures a plurality of transfer groups by grouping the predetermined transfer units. Therefore, information (data) regarding the pick-up and drop-off locations and the boarding and disembarking locations, the boarding times and the disembarking times (also referred to as boarding and disembarking times) can be handled in units of transfer groups. In other words, information regarding "drop-off" and "pick-up" such as from the user's home to the facility and from the facility to the user's home can be generalized and handled as data. This allows information regarding "drop-off" and "pick-up" of each user in one vehicle to be handled centrally as the same logic.

[0009] In addition, in the above-mentioned joint transportation schedule creation system, a plurality of objective functions including the total travel time of the plurality of vehicles are set on the condition that a predetermined constraint condition prepared in advance is satisfied. In addition, a predetermined weight is assigned to each of the plurality of objective functions in response to a deviation from a predetermined target value.

[0010] Here, the constraints are conditions that are set for various matters that must necessarily be observed, such as completing transportation of all users, not traveling at a speed faster than the expected travel time between points (sections), taking into consideration the boarding and disembarking time at user homes, not using more than the number of vehicles available, not having the number of passengers exceed the number of standard seats or wheelchair seats in the vehicle, and using vehicles that can run near user homes (taking into consideration the size of the vehicle).

[0011] The objective function (also called a cost function) is a function that is set for various factors that affect efficiency, such as total travel time, each user's boarding time, user's desired pick-up / drop-off time, pick-up / drop-off arrival time at the facility, and seating arrangement, as well as costs, such as labor costs. Therefore, the above-mentioned joint transportation schedule creation system can create a joint transportation schedule that takes into account factors that affect efficiency and costs while satisfying constraint conditions.

[0012] In addition, a predetermined weight is assigned to each of the above-mentioned multiple objective functions with respect to the deviation amount from a predetermined target value. Here, the weight is assigned to the objective function so that, for example, a large weight is assigned to an item that has a large effect on efficiency or cost. That is, the larger the sum of the objective functions is, the lower the efficiency is and the higher the cost is. Therefore, the above-mentioned joint transportation plan creation system obtains an optimal solution by performing a search process using a mathematical optimization method that minimizes the sum of the objective functions, and creates a joint transportation plan based on the optimal solution. This makes it possible to create a joint transportation plan that is efficient and can reduce costs. Various mathematical optimization methods can be preferably used for the search process here. In addition, the search process may be performed by appropriately limiting the number of samples to a predetermined number. This is expected to have the effect of suppressing the processing time from becoming longer than necessary.

[0013] (2) The above-mentioned joint shuttle plan creation system of the present invention may include an initial solution acquisition process in which the search process acquires an initial solution by assigning available vehicles to all of the multiple shuttle groups based on the reservation information, the user information, the facility information, the vehicle information, and the constraints, and determining the order of movement within the shuttle groups, and a user replacement process randomly swapping one or more of the users in the shuttle group assigned to the vehicles by the initial solution from one vehicle to another vehicle, or from one vehicle to multiple other vehicles.

[0014] In the initial solution acquisition step, the above-mentioned joint transportation schedule creation system can acquire an initial solution by allocating available vehicles to all transportation groups and determining the order of movement within the transportation groups based on the above-mentioned various information and constraint conditions. This makes it possible to acquire a certain degree of solution (initial solution) that satisfies the constraint conditions, etc. Therefore, a search process can be performed to find an optimal solution based on the initial solution.

[0015] The above-mentioned joint transportation schedule creation system also includes a user replacement process for randomly replacing one or more users of the transportation group assigned to the vehicle based on the acquired initial solution from one vehicle to another vehicle, or from one vehicle to multiple other vehicles. This allows a search process to be performed to find an optimal solution while randomly replacing users for multiple vehicles, with the transportation group based on the initial solution as one unit. Therefore, the search process can be simplified without performing complex processes.

[0016] (3) In the joint transportation schedule creating system of the present invention described above, the objective function may be calculated by converting at least a part of the deviation amount to an exponential power and then aggregating the deviation amount.

[0017] According to this configuration, the deviation from the target value in the objective function can be exaggerated and tabulated by converting it to an exponential power, which allows factors that affect efficiency and costs to be exaggerated, making it possible to efficiently calculate an optimal solution.

[0018] (4) In the above-described joint transportation schedule creating system of the present invention, the search process may be performed by any one of a random search, a simulated annealing, and a genetic algorithm, or a combination of a plurality of these.

[0019] According to this configuration, since the search process can be performed efficiently, the optimal solution can be calculated efficiently. Therefore, the effect of shortening the search process time can be expected. Here, the random search is considered to be a method of randomly creating various solutions, performing cost estimation, and finding a solution with low cost. In addition, the simulated annealing is considered to be a method of overcoming small peaks of high cost by adopting solutions with a predetermined probability even if the solutions have poor costs in the early stages of optimization and reducing the range as the optimization progresses. In addition, the genetic algorithm creates various random solutions, performs cost estimation, and selects multiple solutions with low costs as elite (superior solutions). In addition, the genetic algorithm is considered to be an algorithm that searches for a solution close to the optimal solution by creating the next solution by imitating good solutions or creating a solution that has undergone mutation.

[0020] (5) The above-mentioned joint transportation plan creation system of the present invention preferably satisfies all of the constraints, that is, transportation of all of the users is required, the capacity of the vehicle is not exceeded, and the number of available vehicles is not exceeded.

[0021] According to this configuration, it is possible to prevent the creation of a joint transportation plan that is physically impossible or does not satisfy the needs of the users. The constraints can include the desired transportation time of the users and the arrival time at the facility.

[0022] (6) In the above-mentioned joint transportation plan creation system of the present invention, the objective function may be set based on the deviation amount for at least one of the desired transportation time of the user, the arrival time at the facility, the total travel time, and the riding time of each of the users.

[0023] According to this configuration, since it is possible to set an objective function that takes the user into consideration, the burden on the user can be reduced. In addition to being the above-mentioned constraint conditions, the user's desired pick-up / drop-off time and the arrival time at the facility can be set as an objective function, so that a solution that allows for a small deviation can be obtained. Here, for example, if the user's boarding time is long, it is considered that the burden on the user will be large. Therefore, if the boarding time of each user is set as the objective function, the burden on the user can be reduced. In addition, the above-mentioned desired pick-up / drop-off time, arrival time at the facility, and each boarding time of each user can be any one or a combination of multiple values ​​according to the usage situation.

[0024] (7) The above-mentioned joint transportation plan creation system of the present invention has a usage time acquisition unit capable of acquiring the usage time of using the facility, and the usage time may include the time spent at the facility.

[0025] With this configuration, even if the user stops by, for example, a hospital or shopping during the transfer, a joint transfer plan can be created that takes this into consideration. Also, by including the time spent at a care facility or the like, it is possible to create a joint transfer plan that takes into consideration both "drop-off" and "pick-up." Effect of the Invention

[0026] According to the present invention, it is possible to provide a joint transportation plan creation system that can streamline joint transportation operations in nursing care facilities and efficiently create joint transportation plans that take into account the convenience and burden of users, even under complex constraints. [Brief description of the drawings]

[0027] [Figure 1] 1 is an overall configuration diagram illustrating an embodiment of a joint transportation planning system according to the present invention. [Diagram 2] 4 is a data table showing one embodiment of acquired information in the joint transportation planning system according to the present invention. [Diagram 3]FIG. 2 is a flowchart showing an outline of the overall process in the joint transportation schedule creation system. [Figure 4] FIG. 1 is a schematic flow diagram of optimization in collaborative transportation planning. [Diagram 5] FIG. 13 is a flow diagram of creating an initial solution in joint transportation planning. [Figure 6] 13A is an explanatory diagram of the creation of a transportation group in the creation of an initial solution for joint transportation schedule creation, and FIG. 13B is an explanatory diagram of the case where a facility where a user gets off is added in the creation of the initial solution. [Figure 7] FIG. 13 is an explanatory diagram of schedule creation in creating an initial solution for joint transportation planning. [Figure 8] FIG. 13A is an explanatory diagram showing the movement of users in the optimization of a joint transportation plan, and FIG. 13B is an explanatory diagram showing the replacement of users in the optimization of a joint transportation plan. [Figure 9] FIG. 13A is an explanatory diagram showing a specific example of transportation items related to the creation of a joint transportation plan, and FIG. 13B is an explanatory diagram showing a matrix of travel times. [Figure 10] FIG. 13 is an explanatory diagram showing a specific example of optimization of a joint transportation plan. [Figure 11] FIG. 13 is an explanatory diagram showing a specific example of optimization of a joint transportation plan. [Figure 12] FIG. 12 is an explanatory diagram showing vehicle attributes in FIG. [Figure 13] FIG. 13 is an explanatory diagram showing point-to-point travel times in optimizing a joint transportation plan. [Figure 14] FIG. 13 is an explanatory diagram showing overlap times between locations in optimizing a joint transportation plan. [Figure 15] FIG. 11 is an explanatory diagram showing a state in which departure times and arrival times are set in the optimization of a joint transportation plan. [Figure 16] FIG. 11 is a flow diagram showing the flow of optimization processing in joint transportation plan creation. [Figure 17] FIG. 17 is a flow diagram showing details of step S50 in FIG. 16. [Figure 18] 1 is a schematic overall layout diagram showing an example of use of a joint transportation planning system according to the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0028] An embodiment of a joint transportation schedule creating system 1 according to the present invention will be described in detail with reference to FIGS.

[0029] The joint transfer plan creation system 1 creates a joint transfer plan for transporting multiple users M (e.g., people requiring care or elderly people) to and from multiple facilities F (e.g., nursing care facilities) using multiple vehicles C. As shown in FIG. 1, the joint transfer plan creation system 1 has a reservation information acquisition unit 10, a user information acquisition unit 20, a facility information acquisition unit 30, a vehicle information acquisition unit 40, a travel time information acquisition unit 55, and a joint transfer plan creation unit 60. In addition to the above, the joint transfer plan creation system 1 has a usage time acquisition unit 50, a memory unit 70, etc. The joint transfer plan creation system 1 can be provided as a program that can be used on, for example, a terminal device (not shown) or a server (not shown).

[0030] The reservation information acquisition unit 10 can acquire reservation information including the location of the facility F to which the user M wishes to be dropped off, the location of the user M's home or the like (also referred to as the pick-up / drop-off location), and the desired pick-up / drop-off time. Specifically, as the pick-up / drop-off location, information regarding the latitude and longitude of the pick-up / drop-off location is acquired. Also, as the desired pick-up / drop-off time, information (data) regarding the desired time to be dropped off at the facility F and the desired time to be picked up at the user's home is acquired. The acquired reservation information is stored, for example, in the storage unit 70, which will be described later.

[0031] The user information acquiring unit 20 can acquire user information including attributes of the user M. Specifically, the user information acquiring unit 20 can acquire various types of information about the user, such as the name, sex, age, address (pick-up and drop-off location), level of care (whether a wheelchair is required, etc.), name of facility to be used, desired size of car, etc., of the user M as attributes of the user M. The acquired user information is stored in the storage unit 70, for example.

[0032] Here, each user M is managed by a user ID assigned to each user. The user ID is associated with personal information such as the name, sex, age, and address described above. In this embodiment, as shown in FIG. 2, the user information acquisition unit 20 acquires the pick-up / drop-off location, boarding time and disembarking time (also referred to as boarding / drop-off time), whether or not a wheelchair is used, and the vehicle size of the user M in association with the user ID. In addition to the above information, the user information acquisition unit 20 can acquire pick-up / drop-off usage information such as whether or not the user uses the service for each day of the week and pick-up / drop-off category, the facility used, and the desired time for dropping off or picking up. The pick-up / drop-off usage information may be acquired by a separate pick-up / drop-off usage information acquisition unit (not shown) that is provided separately.

[0033] The facility information acquisition unit 30 can acquire facility information including information related to the facility locations of multiple facilities F. Specifically, the facility information acquisition unit 30 can acquire various information related to facilities F, such as the facility name and the latitude and longitude related to the facility location, as the facility information. The acquired facility information is stored in, for example, the storage unit 70. Here, the facilities F are managed by the facility IDs assigned to them. As a result, a pick-up and drop-off location is associated with each of the multiple users M and the multiple facilities F. In addition, a desired time is associated with each of the multiple users M.

[0034] The vehicle information acquisition unit 40 can acquire vehicle information including the number of available vehicles C and vehicle attributes. Specifically, the number of available vehicles is the number of vehicles owned by each facility that can be used for transportation on the corresponding day of the week. In addition, vehicle attributes such as vehicle size (e.g., large vehicles such as microbuses, ordinary vehicles such as wagons, light vehicles, etc.) and the number of seats in the vehicle (e.g., number of regular seats, number of wheelchair seats, etc.) are acquired. The acquired vehicle information is stored in the storage unit 70, for example.

[0035] The usage time acquisition unit 50 can acquire the usage time for using the facility F. The usage time can include, for example, the stay time at the facility F. Here, as the facility F for which the usage time is acquired, for example, a hospital or a shopping destination (store) that the user M stops by can be set. The acquired usage time is stored in, for example, the memory unit 70. Note that in this embodiment, the user information acquisition unit 20 acquires the boarding and alighting times of the user M, but the usage time acquisition unit 50 may acquire the boarding and alighting times.

[0036] As described above, by providing the usage time acquisition unit 50, even if the user M stops by, for example, a hospital or shopping during the transfer, a joint transfer plan can be created that takes this into consideration. Also, by including the time spent in a care facility or the like, it is possible to create a joint transfer plan that takes both "drop-off" and "pick-up" into consideration. The usage time acquisition unit 50 may be provided as needed, and the usage time acquisition unit 50 may also be omitted.

[0037] The travel time information acquisition unit 55 can acquire travel time information when the vehicle C travels between the home of the user M and the facility F. The travel time information is acquired based on, for example, the travel distance, the average speed of the vehicle C, or a time calculated based on traffic congestion information. The travel time information may be updated while providing feedback based on, for example, actual travel information such as travel frequency and time period.

[0038] The joint transfer schedule creating unit 60 can create and generate a joint transfer schedule using a calculation device such as a CPU. The joint transfer schedule creating unit 60 sets pick-up and drop-off locations related to pick-up and drop-off locations and facility locations, and pick-up and drop-off times corresponding to each of the pick-up and drop-off locations as transfer units. The joint transfer schedule creating unit 60 also groups predetermined pick-up and drop-off units to form a plurality of transfer groups. The composition of the transfer groups will be described in detail later.

[0039] Furthermore, the joint transportation scheduler 60 can set a plurality of objective functions including the total travel time of a plurality of vehicles C. The objective functions are set on the condition that a predetermined constraint condition prepared in advance is satisfied.

[0040] Here, the constraints are conditions that are set for various matters that must necessarily be observed, such as completing transportation of all users M, not traveling at a speed faster than the expected travel time between points (sections), taking into consideration the boarding and disembarking time at user M's home, not using more than the number of available vehicles C, not having the number of passengers exceed the number of general seats or wheelchair seats of vehicle C, and using a vehicle C that can run near user M's home (taking into consideration the size of vehicle C).

[0041] The above-mentioned constraint conditions can be, for example, to satisfy all of the following: all users M must be transported, the capacity of vehicle C must not be exceeded, and the number of available vehicles C must not be exceeded. This makes it possible to prevent the creation of a joint transportation plan that is physically impossible or does not satisfy the needs of user M.

[0042] Moreover, the objective function (also called a cost function) is a function that is set for various matters that affect efficiency and cost, such as the total travel time, the boarding time of each user M, the desired pick-up / drop-off time of user M, the pick-up / drop-off arrival time at facility F, and seat arrangement consideration. Therefore, the joint pick-up / drop-off plan making unit 60 can make a joint pick-up / drop-off plan that takes into consideration matters that affect efficiency and cost while satisfying the constraint conditions. Details of the objective function will be described later.

[0043] The joint transfer plan making unit 60 can execute a search process to minimize the sum of the objective functions using a mathematical optimization method. As a result, the joint transfer plan making unit 60 can obtain an optimal solution to minimize the sum of the objective functions. Therefore, the joint transfer plan making unit 60 can create a joint transfer plan based on the optimal solution. That is, a joint transfer plan that is efficient and can reduce costs can be created. Various mathematical optimization methods can be preferably used for the search process here. In addition, the search process may be performed by appropriately limiting the number of samples to a predetermined number. This is expected to have the effect of suppressing the processing time from becoming longer than necessary. The specific processing in the joint transfer plan making unit 60 will be described later.

[0044] The storage unit 70 can store the joint transfer plan created by the joint transfer plan creating unit 60. The storage unit 70 is configured with, for example, a hard disk, a memory, etc. The storage unit 70 is not limited to being provided in the joint transfer plan creating system 1, and may be stored in an appropriate external server, etc.

[0045] The above-mentioned joint transportation schedule creation system 1 can be provided in various terminal devices, servers, etc. In addition, the joint transportation schedule creation system 1 can be provided in various forms, such as a program or a device.

[0046] The configuration of the joint transportation schedule creating system 1 according to the present invention has been described above. Next, one embodiment of the processing in the joint transportation schedule creating system 1 will be described with reference to FIGS.

[0047] 3 is a flow diagram showing an outline of the overall process in the joint transfer plan creation system 1. First, when creating a joint transfer plan in the joint transfer plan creation unit 60, data related to information for creating the joint transfer plan is selected (step S10). In step S10, data such as reservation information, user information, facility information, and vehicle information required for creating the joint transfer plan is selected.

[0048] Next, the selected data is read from the storage unit 70 (step S11). Once the required data has been read, a process for creating a joint transfer plan is performed (step S12). Once the creation of the joint transfer plan is complete, the joint transfer plan is stored in the storage unit 70 (step S13). Once step S13 is complete, the series of processes is either terminated, or the processes from step S10 are repeated again. The above is an outline of the overall process flow in the joint transfer plan creation system 1 according to the present invention.

[0049] Next, the flow of creating a joint transportation plan in the joint transportation plan creating process (step S12) will be described below with reference to FIG.

[0050] When the process of creating a joint transportation plan is started, first, the joint transportation plan creation process (step S12) receives necessary information (data) (step S20). Then, an initial solution is created (step S21). The process of creating an initial solution in step S21 is also referred to as an initial solution creation step. Although the details will be described later, in creating the initial solution, a solution that satisfies the constraints is created to a certain extent (fairly good).

[0051] In step S21, when the creation of the initial solution is completed, a process of optimizing (reducing costs) the initial solution is performed (step S22). The optimization is repeated a predetermined number of times, as will be described in detail later. When step S22 is completed, the created joint transportation plan is returned to the process of step S12, and is stored in the storage unit 70 in step S13. As described above, the joint transportation plan creation system 1 plans and creates a joint transportation plan by executing the following three processing steps, which are roughly divided. First, in step S21, an initial solution is created on the condition that the constraint conditions are satisfied. Then, in step S22, the initial solution is optimized. Then, the optimization is repeated a specified number of times to obtain an optimal solution.

[0052] Next, an overview of the creation of an initial solution will be described with reference to Fig. 5. The creation of an initial solution is performed, for example, in three stages, levels A1 to A3.

[0053] First, at level A1 (step S30), grouping (formation of a group) is performed by transportation items (also called transportation units). At level A1, picking up user M and delivering him / her to facility F and delivering user M from facility F to his / her home are considered as separate transportation units, and it is determined how one item should be grouped with another item.

[0054] Here, the pick-up / drop-off group is formed as a pick-up / drop-off unit based on the pick-up / drop-off location and the boarding / drop-off location related to the facility location (both latitude and longitude information), and the boarding time and disembarking time corresponding to each of the boarding / drop-off locations. Pick-up / drop-off groups are formed for multiple users M and multiple facilities F respectively. Therefore, information (data) related to the pick-up / drop-off location and the boarding / drop-off location and the boarding / drop-off time can be handled on a pick-up / drop-off group basis. In other words, information related to "drop-off" and "pick-up" such as from the user M's home to the facility and from the facility to the user M's home can be generalized and handled as data. This allows information related to "drop-off" and "pick-up" of each user on board a vehicle C to be handled centrally as the same logic. Note that the location information such as the boarding / drop-off location may not only be based on latitude and longitude, but may also be handled as the address itself.

[0055] When grouping by transfer unit in step S30 is completed, vehicles C are allocated to each transfer group in level A2 (step S31). Level A2 is a level for optimizing the allocation of transfer groups and vehicles C. In level A2, the optimal vehicle C is determined based on the seat type designation, vehicle size designation, number of people, etc. of users M in the transfer group.

[0056] When step S31 is completed, in level A3 (step S32), the order of visiting each pick-up / drop-off location and each boarding / disembarking location (also called points) is calculated. In level A3, once the pick-up / drop-off group and vehicle C have been determined, the order in which to visit the points is determined to be most efficient. The above is the flow of the initial solution creation process, and next, the details of the creation of the initial solution will be explained.

[0057] 6(a) shows an example of creating a shuttle group in creating an initial solution. In the figure, users M are individually numbered M1 to Mn (n is arbitrary), facilities F are individually numbered F1 to Fn (n is arbitrary), and vehicles C are individually numbered C1 to Cn (n is arbitrary).

[0058] The initial solution is created in accordance with each step of levels A1 to A3 described above. Specifically, at level A1, vehicles that are close on six axes, namely the latitude and longitude of the pick-up / drop-off location of user M, the desired pick-up / drop-off time, the latitude and longitude of facility F, and the departure and arrival times at facility F, are roughly grouped. The number of pick-up / drop-off groups is limited to the number of available vehicles (three vehicles C1 to C3 in this embodiment). In addition, when grouping, vehicle C is assigned to the pick-up / drop-off group on the condition that constraints (for example, sending all passengers to facility F and the seat type of vehicle C) are satisfied. At this stage, the number of passengers in vehicle C is not taken into consideration.

[0059] FIG. 6(b) shows the state of the process for determining the order in which the points should be visited in the creation of the initial solution, and shows an example of a way of visiting the points. Here, if user M8 is closer to facility F2 than user M2, it may be possible to shorten the time by swapping the order of users M2 and M8. Also, due to the number of wheelchair seats, the vehicle goes to facility F1 after picking up users M3 and M5, but the constraint on the number of seats can also be satisfied by going to facility F1 after picking up one user M3, and then picking up users M5 and M10. This may also be possible to shorten the time. Therefore, calculations are performed for multiple combinations, and a schedule is created as described below, and then the way of visiting the points with the lowest cost is adopted.

[0060] FIG. 7(c) shows a list of the order in which the points should be visited in the creation of the initial solution, with the time to visit each point added to it. The arrival and departure times should be determined after considering the boarding and disembarking times and travel times according to the points with the desired arrival and departure times or the specified time range. When creating a schedule for "delivery" rather than a mixed pick-up and drop-off, the arrival time should be determined by calculating backwards from the last facility F, taking into consideration the boarding and disembarking times. In the case of "pick-up", the time should be determined from the back of the time axis. Also, if user M has a desired pick-up and drop-off time, the departure time or the entire arrival time should be shifted to match user M. In the schedule creation stage of creating the initial solution, the time should be adjusted to the extent possible (even if it is not within the desired pick-up and drop-off time range or if there is a waiting time on the way). In this way, the initial solution is created.

[0061] When the schedule creation is completed, a cost estimate is performed for the created initial solution. The cost estimate is performed for an objective function consisting of, for example, the following items. The items that make up the objective function include, for example, (1) total travel time (objective function), (2) deviation from the desired pick-up / drop-off time of user M, (3) the time 30 minutes or earlier when the arrival time at facility F is 30 minutes or earlier before the desired time, and (4) the riding time of each user M. The objective function is set based on these items, and the cost is calculated by the sum of the respective objective functions. Note that the riding time of each user M in (4) above may be, for example, the time 60 minutes or more when the riding time is 60 minutes or more.

[0062] In this embodiment, a predetermined weighting is applied to the deviation from the predetermined target value for each of the above-mentioned items (2) to (4). As a result, weighting is applied to the objective function so that, for example, a large weight is applied to an item that has a large impact on efficiency or cost. Furthermore, by raising the deviation to an exponential power (for example, squaring), it is possible to make it so that the larger the deviation, the larger the cost. Therefore, the larger the sum of the objective functions, the lower the efficiency and the higher the cost. Note that weighting is not limited to the square of the deviation, and weighting of the deviation or more than the cube of the deviation may be applied. Furthermore, weighting is not limited to the exponential power, and various coefficients may be used.

[0063] As described above, the objective function may be set based on the deviation from the target value for at least one of the desired pick-up / drop-off time of user M, the arrival time at facility F, and each boarding time of user M. This allows an objective function that takes user M into consideration to be set, thereby reducing the burden on user M. Furthermore, by setting the deviation for each boarding time of user M in the objective function, it is possible to prevent user M's boarding time from becoming longer, thereby reducing the burden on user M. Note that the desired pick-up / drop-off time, arrival time at facility, and each boarding time of user M may be any one or a combination of multiple values ​​according to the usage situation.

[0064] As described above, in the joint transportation schedule creation system 1 according to the present invention, in the initial solution acquisition step, an initial solution can be acquired by allocating available vehicles to all transportation groups based on the above-mentioned various information and constraint conditions. This makes it possible to acquire a certain degree of solution (initial solution) that satisfies the constraint conditions, etc. Therefore, it is possible to subject the initial solution to a search process for finding a more optimal solution based on the standard.

[0065] Next, details of the optimization process in step S22 in Fig. 4 will be described below. The optimization process of the initial solution is performed based on a search process using a mathematical optimization method. The mathematical optimization method used will be described later. The optimization process is performed in three stages, levels B1 to B3.

[0066] First, at level B1, the best combination is searched for while changing the groups of the transportation items little by little. Specifically, one transportation item is deleted from one transportation group and incorporated into another transportation group, or one transportation item of one transportation group is exchanged with one transportation item of another transportation group.

[0067] 8(a) and 8(b) show specific examples of level B1. FIG. 8(a) shows an example of randomly selecting a user M and moving the selected user M from one shuttle group (group 1) to another shuttle group (group 2). FIG. 8(b) shows an example of exchanging a user M5 in group 1 with a user M7 in group 2. In the figure, a case is shown in which a user M24 in vehicle C1 is replaced with a user M7 in vehicle C2. In this way, in level B1, a solution that is a slight change from the initial solution is created. In addition, in level B1, one or more users M in the shuttle group assigned to vehicle C by the initial solution are randomly exchanged from one vehicle to another vehicle C, or from one vehicle C to other multiple vehicles C (also referred to as a user exchange process).

[0068] The created solution is then subjected to optimization processing from level B2 onwards, which will be described later, and if the cost has decreased, the new solution is adopted, and if the cost has not decreased, the original solution is adopted. Note that when using simulated annealing for the search process, the new solution may be adopted even if the cost has increased in the early stages of optimization.

[0069] Level B2 allocates an appropriate vehicle C to each shuttle group. Specifically, the vehicle C is allocated taking into consideration the seat type and vehicle size of users M in the shuttle group, and cost estimation is performed by calling optimization in level B3, which will be described later. In addition, in level B2, all possible vehicle C allocations are tried, and the combination with the lowest sum of optimization costs in level B3 is determined as the optimal solution for level B2.

[0070] Level B3 optimizes the order and time of visiting locations. Specifically, for multiple designated transportation items, when a designated vehicle C is used to transport a person, it calculates the cost of which locations and the time is most efficient.

[0071] As described above, the joint transportation schedule creation system 1 according to the present invention can perform a search process to find an optimal solution by randomly replacing users M with a transportation group based on an initial solution as one unit. Therefore, the search process can be simplified without performing complex processing.

[0072] Next, a specific example of level B3 will be described below with reference to Fig. 9 to Fig. 15. For example, a case will be described in which three transportation items, namely, user M, transportation location, and transportation time, as shown in Fig. 9(a) are optimized.

[0073] In the case shown in Figure 9(a), there are six points to visit, including overlaps, from points a1 to a6, so it is a good idea to investigate the best order (movement order) and time to visit these points. If efficiency is not a consideration, an example would be to visit points a1, a2, a3, a4, a5, and a6 in that order, as shown in Figure 10.

[0074] Next, as shown in FIG. 11, consider swapping points a2 and a3 and visiting points a1, a3, a2, a4, a5, and a6 in that order. By visiting the points in this order, it is possible to reach points a2, a4, and a5 at the same time. However, as shown in FIG. 12, if vehicle C has only one wheelchair seat and two users M1 and M2 use wheelchairs, it is not possible to visit the points in the order described above. Therefore, the optimal way to visit the points is searched for, taking into account the attributes of vehicle C.

[0075] Here, if the order of visiting the above-mentioned points is determined, it is basically possible to determine which point is the shortest to go to at what time. Therefore, for example, by calculating the cost of all combinations of the ways of visiting, the optimal solution can be derived. The combinations of the ways of visiting in the above-mentioned case are permutations of 6 (factorial ways of 6), but combinations in which the points a1 and a2 are reversed, and combinations in which the time is back and forth, such as from point a5 to point a3, are impossible combinations, so by eliminating these combinations, the time required for the cost estimation can be reduced. It is possible to estimate the cost for all combinations, but if the number of combinations is large, it is also possible to estimate only a predetermined number of combinations. In this way, by performing the cost estimation after restricting the number of predetermined combinations, the time required for the cost estimation can be reduced.

[0076] As described above, when the order of visiting the points is determined, the time to visit each point is basically determined in a single way. Therefore, in the above three pick-up and drop-off items, the travel time between each point when visiting the points a1, a3, a2, a4, a5, and a6 in the order shown in Figure 11 is taken into consideration.

[0077] Fig. 13 shows the travel time (minutes) between each point, and Fig. 9(b) shows a matrix of the travel time (minutes) between each point. Note that in reality, the travel time may differ between the outbound and return journeys, but here, to simplify the explanation, the travel time is set to be the same for the outbound and return journeys.

[0078] As shown in FIG. 13, points a2, a4, and a5 are the same point and have overlapping time periods, so they can be aggregated into one. The aggregated point information is also referred to as point b2. Therefore, the order of visiting the points after aggregation can be expressed as points a1, a3, b2, and a6. As a result, the time period of point b2 becomes the overlapping time of 12:40 to 13:00, as shown in FIG. 14.

[0079] Here, the time is specified for the points a3 and b2. The travel time between the point a3 (the home of the user M2) and the point b2 (the facility F1) is 10 minutes. Therefore, when determining the time to stop at the points a3 and b2, these are taken into consideration, and the point a3 is determined to be 12:30, which is the end of the time slot, and the point b2 is determined to be 12:40, which is the beginning of the time slot. Since the time is not specified for the points a1 and a6, the travel time from the previous and next points is taken into consideration and the shortest time can be set. In this way, as shown in FIG. 15, the point a1 is determined to be 12:20, the point a3 is determined to be 12:30, the point b2 (points a2, a4, a5) is determined to be 12:40, and the point a6 is determined to be 12:45. In reality, the user M has a boarding and alighting time, but for the sake of convenience, the boarding and alighting time is not taken into consideration (in the actual cost estimation, the boarding and alighting time is also included in the calculation).

[0080] Here, a search process using a mathematical optimization technique used in carrying out the above-mentioned optimization will be described below.

[0081] In the joint transportation schedule creation system 1 according to the present invention, the search process can be performed by, for example, random search, simulated annealing, or a genetic algorithm, or a combination of a plurality of these. Note that the above search process is merely an example, and it is also possible to use a mathematical optimization method other than these, or to use a combination of these mathematical optimization methods with other mathematical optimization methods.

[0082] The random search is said to randomly create various solutions, perform cost calculations, and find a solution with low cost. Simulated annealing is said to adopt solutions with poor cost at a predetermined probability in the early stages of optimization, and reduce the range as optimization progresses, so that small high-cost peaks can be overcome. Genetic algorithms create various random solutions, perform cost calculations, and select multiple low-cost solutions as elite (superior) solutions. Genetic algorithms are said to be algorithms that search for solutions close to the optimal solution by imitating good solutions to create the next solution or by creating a mutated solution. Therefore, by using these mathematical optimization methods, even if there is a high-cost peak, optimization can be advanced while overcoming it. Therefore, it is possible to prevent the high-cost peak from becoming an obstacle and terminating the optimization midway.

[0083] As described above, the joint transportation schedule creating system 1 according to the present invention uses the above-mentioned mathematical optimization method when optimizing the joint transportation schedule, so that the search process can be performed efficiently and the optimal solution can be calculated efficiently. Therefore, the search process time can be shortened.

[0084] The above has been the details of the optimization in the creation of a joint transportation plan. Next, the flow of the process in the optimization will be explained with reference to the flow charts of FIG. 16 and FIG.

[0085] 16, when the optimization process is started, in step S40, a predetermined number of repetitive processes (loop 1, corresponding to level B1) are executed between steps S40 to S43. In loop 1, first, the items in the pickup / drop-off group of the pickup items are changed (step S50).

[0086] When the process in step S50 is started, as step S51, the process between steps S51 to S60 is repeated a predetermined number of times (loop 2, corresponding to level B2) as shown in Fig. 17. In loop 2, first, the allocation of vehicle C to the shuttle group is changed (step S52).

[0087] When step S52 is completed, step S53 is where steps S53 to S57 are repeated a predetermined number of times (loop 3, corresponding to level B3). In loop 3, first, the order of visiting the points is changed (step S54). When step S54 is completed, cost calculation (trial calculation) is performed (step S55). In step S55, once the cost has been calculated, a comparison is made between the solution before the change and the solution after the change, and the optimal solution is selected (step S56). When step S56 is completed, the process from step S53 to step S56 is repeated a predetermined number of times (loop 3, corresponding to level B3).

[0088] When the process in loop 3 is performed a predetermined number of times, cost calculation is performed again in loop 2 (step S58). When the cost is calculated in step S58, a comparison is made between the solution before the change and the solution after the change, and an optimal solution is selected (step S59). When step S59 is completed, the process in loop 2 is repeated a predetermined number of times. When the process in loop 2 is performed a predetermined number of times, cost calculation is performed in loop 1 (step S41). When the cost is calculated in step S41, a comparison is made between the solution before the change and the solution after the change, and an optimal solution is selected (step S42). When step S42 is completed, the process in loop 1 is repeated a predetermined number of times (step S43). When the process in loop 1 is completed, optimization is terminated. As a result, a joint transportation plan is created, and transportation plan storage processing is executed in step S13 of FIG. 3.

[0089] In this embodiment, each of the above-mentioned loops 1 to 3 is repeated a predetermined number of times, but the number of times each of the processes can be changed as appropriate depending on the number of combinations in the search process, the accuracy of creating the joint transportation plan, and the creation time, etc. It is also possible to repeat the process for all the combinations in the search process.

[0090] The above is the flow of optimization processing in the joint transportation schedule creating system 1 according to the present invention. Next, one mode of use of the joint transportation schedule creating system 1 will be described below with reference to FIG.

[0091] As shown in the figure, the joint transportation schedule creation system 1 can be connected to various networks. In this embodiment, the joint transportation schedule creation system 1 is connected to a user web 100, a transportation group web 101, application APIs 103 and 106, an inquiry API 104, and a facility web 105. In addition, the joint transportation schedule creation system 1 has a storage unit 70, and data such as the created joint transportation schedule is stored in the storage unit 70.

[0092] The user web 100 can be accessed from the terminal of user M. Incidentally, the joint transportation schedule creation system 1, including the user web 100, is subject to access restrictions using an appropriate password or the like. The application API 103 is an API (Application Programming Interface) provided to enable access to the joint transportation schedule creation system 1 through a user application 109 provided for a terminal such as the smartphone of user M.

[0093] The transportation group Web 101 is connected to the vehicle dispatch algorithm 102 and can be accessed by the transportation group 108. The vehicle dispatch algorithm 102 provides the transportation group Web 101 with optimal dispatch information for the vehicle C based on the joint transportation plan. This allows the transportation group to obtain the optimal dispatch information based on the transportation group Web 101.

[0094] The application API 106 is an API provided to enable access to the joint transportation plan creation system 1 through the driver's application 107. The driver's application 107 is an application provided to a terminal of a driver who drives a vehicle C. This allows the driver to view the joint transportation plan.

[0095] The inquiry API 104 is an API provided so that the user M can access the joint transfer plan creation system 1 via the SNS 110 or the like (also referred to as Twilio (registered trademark)). In this manner, the joint transfer plan creation system 1 provides various network connection means for the user M to view the joint transfer plan and create the joint transfer plan.

[0096] The facility Web 105 is accessible from a facility F such as a care facility. This makes it possible to view the joint transportation plan from the facility F and to create the joint transportation plan.

[0097] The joint transportation schedule creation system 1 is also connected to an external system 111 such as a server. For example, when the external system 111 is a server, calculations can be performed using the external system 111 for part or all of the joint transportation schedule creation. This can reduce the load on the joint transportation schedule creation system 1 and speed up the calculations. The above-mentioned usage form can be modified in various ways. For example, the joint transportation schedule creation system 1 can be placed on the external system 111.

[0098] The above is one embodiment of the joint transportation schedule creating system 1 according to the present invention, but the present invention is not limited to the above embodiment and various modifications can be made.

[0099] In this embodiment, a joint transportation plan is created for transporting multiple users M to multiple facilities F using multiple vehicles C, but it can also be used when there is only one user M, vehicle C, or facility F. Furthermore, the information acquired by the reservation information acquisition unit 10, user information acquisition unit 20, facility information acquisition unit 30, and vehicle information acquisition unit 40 is not limited to that in the embodiment, and can be changed as appropriate.

[0100] Furthermore, the transfer unit set by the joint transfer schedule planning unit 60 is not limited to the pick-up and drop-off locations related to the pick-up and drop-off locations and the boarding times and disembarking times corresponding to the pick-up and drop-off locations, respectively, and can be changed as appropriate according to the plan to be created. Also, in the transfer group, the transfer unit to be grouped can be changed as appropriate. Also, the objective function can be one that does not include the total travel time of vehicle C. In such a case, an objective function that includes other transfer items that should be prioritized can be set.

[0101] In this embodiment, the search process includes an initial solution acquisition step for acquiring an initial solution by assigning available vehicles C to all of a plurality of shuttle groups based on reservation information, user information, facility information, vehicle information, and constraint conditions, but the constraint conditions in the initial solution acquisition step can be changed as appropriate. Also, the creation of shuttle groups and the assignment of vehicles C in the initial solution acquisition step do not have to be performed for all shuttle groups or all vehicles C. In such a case, it is sufficient to select the necessary shuttle groups and vehicles C.

[0102] In this embodiment, the deviation from the target value is converted to an exponential power in the objective function and then counted, but the deviation from the target value may be counted by a method other than converting to an exponential power. Also, preference may be given to a value with a small deviation from the target value. In such a case, the deviation may be counted as a dominant value. Also, in this embodiment, weighting is given to the deviation to the square, but weighting may be given to the deviation to the cube or more of the deviation, not just the square. Also, weighting may be given using various coefficients other than the exponential power.

[0103] In this embodiment, the search process is performed by any one of random search, simulated annealing, and genetic algorithm, or a combination of these, but the search process is not limited to the above and can be performed using various mathematical optimization methods. In addition, mathematical optimization methods other than these can be used, or these mathematical optimization methods can be used in combination with other mathematical optimization methods.

[0104] In this embodiment, the constraint conditions are set to satisfy all of the following: transporting all users M, not exceeding the capacity of vehicle C, and not exceeding the number of available vehicles C; however, the constraint conditions are not limited to the above conditions and can be set for various items.

[0105] In this embodiment, the objective function is set based on the deviation from the target value for at least one of the desired pick-up / drop-off time of user M, the arrival time at facility F, and each boarding time of user M, but the objective function is not limited to the above and can be set for various pick-up / drop-off items. In addition, the target value and the deviation from the target value can be changed appropriately according to the pick-up / drop-off item.

[0106] In this embodiment, a usage time acquisition unit 50 capable of acquiring the usage time for using facility F is provided, but the configuration may also be such that the usage time acquisition unit 50 is not provided. Also, instead of the usage time acquisition unit 50, the facility information acquisition unit 30 may acquire the usage time (stay time, etc.) for facility F, etc. In this embodiment, the created joint transportation plan is stored in the storage unit 70, but the storage unit 70 may also be omitted. In such a case, a storage means such as the external system 111 may be used.

[0107] The above are various embodiments and modifications of the joint transportation planning system 1 according to the present invention. However, the present invention is not limited to those exemplified in the above-mentioned embodiments and modifications, and it will be easily understood by those skilled in the art that other embodiments are possible based on the teachings and spirit of the present invention without departing from the scope of the claims. [Industrial Applicability]

[0108] The joint transportation plan creation system of the present invention can be used for joint transportation of users in various facilities such as nursing homes and hospitals. [Explanation of symbols]

[0109] 1: Joint transportation planning system 10: Reservation information acquisition section 20:User information acquisition department 30: Facility information acquisition section 40: Vehicle information acquisition unit 50: Usage time acquisition part 55: Travel time information acquisition unit 60: Joint Transportation Planning Department 70: Storage section

Claims

1. A joint transportation plan creation system for creating a joint transportation plan for transporting a plurality of users to a plurality of facilities using a plurality of vehicles, A reservation information acquisition unit that acquires reservation information including a pick-up / drop-off location and a desired pick-up / drop-off time period of the user; a user information acquiring unit that acquires user information including attributes of the user, a boarding time required for the user to board the vehicle, and an alighting time required for the user to alight the vehicle; a facility information acquisition unit that acquires facility information including information related to facility locations of the plurality of facilities; a vehicle information acquisition unit that acquires vehicle information including the number of available vehicles and vehicle attributes; A travel time information acquisition unit that acquires travel time information of the vehicle; A joint transportation plan creation unit that creates a joint transportation plan, The joint transportation planning unit The pick-up and drop-off locations, which are the pick-up and drop-off locations and the boarding times and the disembarking times of the user information corresponding to the pick-up and drop-off locations, are set as pick-up and drop-off units, and a plurality of pick-up and drop-off groups are formed by grouping predetermined pick-up and drop-off units; A plurality of objective functions are set, the objective functions including a total driving time of the plurality of vehicles, the desired pick-up / drop-off time zone, and a riding time of each of the users calculated based on the travel time information, on the condition that a predetermined constraint condition prepared in advance is satisfied, the condition including not using more than the available number of vehicles of the vehicle information is satisfied, and a predetermined weight is assigned to each of the plurality of objective functions in accordance with an amount of deviation from a predetermined target value; A joint transportation plan creation system characterized by obtaining an optimal solution by executing a search process using a mathematical optimization method that minimizes the sum of the objective functions, and creating a joint transportation plan based on the optimal solution.

2. The search process includes: an initial solution acquisition step of acquiring an initial solution by allocating available vehicles to all of the plurality of shuttle groups based on the reservation information, the user information, the facility information, the vehicle information, and the constraint conditions and determining a movement order within the shuttle groups; The joint shuttle plan creation system of claim 1, further comprising a user replacement process for randomly replacing one or more of the users of the shuttle group assigned to the vehicle by the initial solution from one vehicle to another vehicle, or from one vehicle to multiple other vehicles.

3. 3. The joint transportation schedule creating system according to claim 1, wherein the objective function is calculated by converting at least a part of the deviation amount to an exponential power and aggregating the converted deviation amount.

4. 4. The joint transportation plan creation system according to claim 1, wherein the search process is performed by any one of a random search, a simulated annealing, and a genetic algorithm, or a combination of these.

Citation Information

Patent Citations

  • Device and method for search for optimum vehicle allocation and distribution order in distribution problem

    JP1995175504A

  • Method for scheduling allocation of vehicle, setting program therefor, and storage medium storing the same

    JP2003026335A

  • Course creation system and course creation method

    JP2004212054A

  • Vehicle dispatch planning apparatus and program

    JP2007128242A

  • Pick-up and drop-off support system

    JP2017068504A