JP2007128242A - Vehicle dispatch planning apparatus and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To make an efficient vehicle dispatch plan that ensures a low vacancy rate (a high loading rate). <P>SOLUTION: A vehicle dispatch planning apparatus includes a reservation information acquisition means 10 for acquiring reservation information from users to specify points of visit; an information acquisition means 20 for acquiring information including the position of a vehicle base, the positions of the points of visit, and the loading capacity of each vehicle; a vehicle dispatch planning means 30 for making a vehicle dispatch plan based on the reservation information acquired by the reservation information acquisition means 10 and the information acquired by the information acquisition means 20; and an output means 40. The vehicle dispatch planning means 30 has a grouping part 31 for calculating the cost of saving the points of visit based on the vehicle base and dividing the points of visit into groups of visit according to the cost of saving, and a vehicle allocating part 32 for allocating the vehicle with the smallest loading capacity to the group of visit with the highest cost of saving. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a vehicle allocation plan planning apparatus and a vehicle allocation plan planning program, and more particularly, to an apparatus and a program for planning a highly efficient vehicle allocation plan by allocating vehicles according to a saving cost value.

 An operation scheduling system that creates an operation schedule on demand is known (refer to Patent Document 1) for a vehicle allocation planning device used in a shared vehicle operation service such as pick-up. The vehicle allocation method in this type of vehicle allocation planning method is generally a method in which a group of visiting points visited by an arbitrary vehicle is formed and vehicles that can be picked up are sequentially allocated.

However, there are variations in the number of visiting points of the formed group, and simply assigning vehicles that can be picked up assigns a microbus with a large number of passengers to a group with a small number of users to pick up, and the vacancy rate is There was a problem that a high-efficiency vehicle allocation plan was drawn up.
JP 2002-140788 A

  The present invention has been made in view of the above problems, and an object of the present invention is to devise a vehicle allocation plan that maximizes the loading capacity of a vehicle and has a high loading rate or high seating rate.

  According to the present invention, reservation information for specifying a visit point is acquired from the user side, information including the position of the vehicle base, the position of the visit point, and the loading capacity of the vehicle is acquired, and based on these information and the reservation information Calculating the saving cost of the visit point based on the vehicle base, and allocating the visit point to the visit group visiting with a predetermined vehicle based on the save cost of the visit point, and the saving cost is the highest among the assigned visit groups A vehicle allocation plan planning apparatus and a vehicle allocation plan planning program for planning a vehicle allocation plan in which a vehicle having the smallest load capacity is allocated to a large visiting group are provided.

  According to the vehicle allocation planning device and the vehicle allocation planning program of the present invention, a large vehicle is allocated to a visit group having a large number of visit points, and a small vehicle is allocated to a visit group having a small number of visit points. It is possible to make an efficient dispatch plan.

  Hereinafter, based on the drawings, a pickup support system 1000 including a vehicle allocation plan planning device 100 according to an embodiment of the present invention will be described as an example. Here, a transfer support system 1000 that performs a transfer service performed as part of a care service based on the long-term care insurance system will be described as an example. However, the present invention is not limited to this example. It can also be applied to a logistics system to be managed.

FIG. 1 shows an outline of the configuration of the pick-up support system 1000. Pick-up support system 1000
Information processing server 2, terminal 4 of a care provider that performs a pick-up service (hereinafter referred to as company terminal 4), and terminal 5 that is used by a user who receives the pick-up service (a care recipient or a guardian thereof) A vehicle terminal 6 mounted on a pick-up vehicle used for pick-up.

  This pick-up support system is constructed as an ASP (Application Service Provider) type system, and the information processing server 2, the operator terminal 4, the care receiver terminal 5, and the in-vehicle device terminal 6 are connected to a communication network. The communication function for connecting to the Internet 1 is provided, and information can be transmitted and received mutually.

  The information processing server 2 can access the various information databases 3a and the reservation information database 3b, and functions as the vehicle allocation planning device 100. The various information databases 3a include at least the position of the departure point of the vehicle, the vehicle base serving as a return point, the position of the visit point, and the loading capacity of the vehicle. The information may include personal information of the care recipient, facility information on the care facility side, and vehicle information to be dispatched (used for pick-up).

  FIG. 2 shows a block configuration of the vehicle allocation planning device 100. As illustrated in FIG. 2, the vehicle allocation plan planning device 100 includes a reservation information acquisition unit 10, an information acquisition unit 20, a vehicle allocation plan planning unit 30, an output unit 40, and a communication function 50. Specifically, at least a ROM (Read Only Memory) or the like that stores a program for planning a vehicle allocation plan, and a CPU (Central) that functions as the vehicle allocation plan planning means 30 by executing the program stored in the ROM or the like. And a RAM (Random Access Memory) functioning as accessible storage means.

Hereinafter, each configuration of the vehicle allocation planning device 100 will be described.
The “reservation information acquisition unit 10” acquires reservation information regarding the use of the pick-up service input to the terminal 5 on the user side including the care receiver and the guardian of the care receiver via the communication function 50. The reservation information is information for making a reservation regarding the use of the pick-up service specifying the visit point. The reservation information of this embodiment includes the ID of the user who made the reservation (caregiver, etc.), and the location information (latitude and longitude and other map coordinate values) of the visit point associated in advance with this ID is stored in various information databases. 3a can be obtained. In this example, the visit point is specified through the user ID. In addition, although the reservation information of this embodiment is about the pick-up service of the cared person, it is not limited to this, and may be related to the collection or delivery of things.

  In the present embodiment, reservation information input from the user side is stored in the reservation information database 3b. The reservation information database 3b holds information (transfer service reservation information) indicating the reservation status of the transfer service by each care service provider in an updatable manner. The reservation information acquisition unit 10 includes a reservation processing unit 11. When reservation information of the pick-up service is input from the user side via the user side terminal 5 or the provider side terminal 4, the reservation processing unit 11 determines the care recipient and the care provider based on the input reservation information. Then, the reservation information is stored or updated in the reservation information database 3b. The reservation information acquisition means 10 can grasp which care recipient is making a reservation for the transfer service of each care provider by referring to the transfer service reservation information stored in the reservation information database 3b. it can.

  The “information acquisition means 20” is a variety of information databases 3a that indicate the position of the vehicle base (for example, the address of the facility), the position of the visit point (for example, the address of the care recipient), and the loading capacity of the vehicle (capable of loading, occupant constant, etc. Get from.

  The information acquisition means 20 acquires personal information on the care receiver side from various information databases 3a. Various information databases 3a hold personal information about each care recipient registered as a user of this system in an updatable manner. The personal information of the cared person includes the user ID of the cared person, the address of the cared person (the pickup position requested by the user), assistance request information indicating the content of assistance requested by the cared person, and the care recipient's need for care It includes physical information indicating the grade of the degree and the state of the physical function of the care recipient. The physical information includes a priority factor indicating that a priority response should be achieved in a transfer such as using a wheelchair. The care receiver's address and physical information are stored in the various information database 3a in association with the user ID. This care receiver information (personal information) is updated in accordance with the input from the care receiver terminal 5 or the operator terminal 4 owned by each care receiver or their guardian.

  The information acquisition means 20 acquires the caregiver side company information including facility information from the various information databases 3a. The various information database 3a holds information relating to a care provider that makes a dispatch plan and provides a care service including a pick-up service in an updatable manner. The carrier information includes the carrier ID of the care provider, the location of the facility of the provider (corresponding to the position of the vehicle base in this example), the number of pick-up staff including the driver and the attendance status of the cared person Includes transfer capability information for transfers by. These business operator information is stored in various information databases 3a in association with the business operator ID. The provider information stored in the various information databases 3a is appropriately updated according to the input from the provider terminal 4 of each service provider.

  The information acquisition means 20 acquires vehicle information of vehicles to be dispatched from various information databases 3a. The various information databases 3a hold information relating to vehicles used for pick-up in an updatable manner. The vehicle information includes a vehicle ID that identifies the vehicle, a vehicle loading capacity (capacity that can be loaded, occupant constant), a vehicle belonging facility, a type of vehicle, the number of vehicles, and seat facility information. Further, the vehicle information includes information in which a seat ID that specifies a seat of the vehicle is associated with an auxiliary function of the seat. Seat assist functions include wheelchair ride assist functions such as lifters and slopes. These pieces of vehicle information are stored in various information databases 3a in association with vehicle IDs. This vehicle information is appropriately updated according to the input from the service provider terminal 4 of each service service provider.

  For convenience of explanation, the database 3a and 3b have been physically separated. However, they may be configured integrally in hardware, or may be configured in reverse. The vehicle allocation planning device 100 (information processing server 2) may be incorporated in the vehicle allocation plan device 100 or may be provided in an accessible external device.

  “Vehicle allocation plan drafting means 30” starts from a predetermined vehicle base, visits one or more visiting points using a vehicle, and uses a saving method to return to the predetermined vehicle base. Make a plan. The saving method is based on the distance data, and the distance traveled to and from each of the two visit points for any two visit points and the vehicle points Compare the mileage when returning to the home, calculate the difference as a saving value, assign the visiting groups in descending order of the saving value, assemble a pick-up route (delivery route), and finally determine the shortest pick-up route is there.

  The vehicle allocation plan of the present embodiment is created using the saving method, but is not limited to this, and the group is based on the distance from the vehicle base to the visit point (for example, the average distance from the vehicle base to the visit point in the group). It is also possible to use a technique that is realized.

  The vehicle allocation plan planning means 30 of this embodiment includes a distribution unit 31, a vehicle allocation unit 32, a constraint condition confirmation unit 33, a pick-up route calculation unit 34, and a seat allocation unit 35, and reservation information and information Develop a vehicle allocation plan based on

  The vehicle allocation plan planning means 30 refers to the reference reservation information stored in the reservation information database 3b after the predetermined reservation deadline of the transfer service performed by each care provider has passed, and determines which service for the transfer service. Whether the caregiver is making a reservation is identified by the user ID, the number of care recipients who receive the pick-up service is calculated, and each care recipient who receives the pick-up service is referred to by referring to the personal information stored in the various information databases 3a. The address (the location of the visit point) is acquired, and the location of the care provider (the location of the vehicle base) is acquired with reference to the operator information stored in the various information databases 3a, and is also stored in the various information databases 3a. Referring to the vehicle information, the vehicle loading capacity, the vehicle type, and the vehicle auxiliary function are confirmed, and a vehicle allocation plan based on the reference reservation information is made. The “allocation plan” planned by the allocation plan planning unit 30 of this example is a plan for visiting a predetermined visit point from a predetermined vehicle base and returning to the predetermined vehicle base by a predetermined vehicle. The dispatch plan may further include a visit order, a visit route, and a seat designation of the visit points.

  Hereinafter, each configuration of the vehicle allocation plan drafting means 30 will be specifically described.

  The “sorting unit 31” calculates the saving cost of the visiting point included in the acquired reservation information, and sorts the visiting point to a visiting group visiting with a predetermined vehicle based on the calculated saving cost. The saving cost in the present embodiment is based on the distance data, the travel distance when individually returning to and from any two visit points from the vehicle base, and the time when visiting the two visit points sequentially and returning to the vehicle base It is a value that indicates the difference when compared with the driving distance. The sorting unit 31 assembles the visit routes in descending order of the calculated saving cost value, and forms a visit group so that the shortest visit route is formed (sorts the visit points into visit groups).

  The “vehicle allocation unit 32” allocates vehicles used for pick-up to the visit groups allocated by the distribution unit 31. The allocation of vehicles is performed based on the saving cost of the visiting group and the loading capacity of the vehicles acquired by the information acquisition means 20. The vehicle assignment unit 32 of this embodiment assigns a small vehicle having the smallest vehicle loading capacity to a visit group having the highest saving cost among the assigned visit groups. That is, the vehicle allocation unit 32 allocates a small vehicle such as a vehicle with a small occupant constant or a vehicle with a small loadable capacity to a visit to a visit point with a large saving cost and far from the vehicle base. Visit points of visit groups with large saving costs tend to be far from vehicle bases. In this embodiment, the visiting point of a visiting group with a large saving cost is far from the vehicle base, and the number of visiting points included in the visiting group is reduced, so that the number of care recipients who enter the vehicle and the volume of cargo loaded on the vehicle are reduced. Tend to be less. In particular, this tendency becomes prominent when an attempt is made to satisfy a time limit required in the transfer plan (for example, a limit to return by what time and what time). In this case, the number of visit points included in the visit group is reduced, and the number of care recipients entering the vehicle and the volume of cargo loaded on the vehicle tend to be reduced. In this embodiment, paying attention to this point, a vehicle having a low loading capacity is allocated to a visiting group having a large saving cost. As a result, compared to the method of allocating vehicles that can be dispatched sequentially, by preventing large-sized vehicles from being allocated even though there are few passengers, the loading rate that maximizes the loading capacity of the vehicle or the seating rate of seats is high. You can make a vehicle allocation plan.

  Although not particularly limited, the vehicle allocation unit 32 is a vehicle other than the previously allocated vehicle when the required constraint condition is not satisfied, for example, when the allocated vehicle is not appropriate, Of these, it is preferable to assign a vehicle (small vehicle) having as small a loading capacity as possible. Although the constraint condition is not particularly limited, a vehicle occupant constant, a loadable amount of the vehicle, the number of seats having an auxiliary function, and the like can be arbitrarily set. Thereby, a vehicle with a small loading capacity can be allocated in descending order of saving cost.

  On the other hand, the vehicle assignment unit 32 assigns a large vehicle having a relatively large vehicle loading capacity to a visit group having a relatively low saving cost among the assigned visit groups. That is, the vehicle allocation unit 32 allocates a large vehicle such as a vehicle with a large occupant constant or a vehicle with a large loadable capacity to a visit to a visit point with a low saving cost and close to the vehicle base. Visit points of visit groups with low saving costs tend to be close to vehicle locations. In this embodiment, the visiting point of a visiting group with a relatively low saving cost is close to the vehicle base, and the number of visiting points included in the visiting group increases, so that the number of cared persons getting into the vehicle and the cargo loaded on the vehicle Tend to increase in volume. In particular, this tendency becomes prominent when trying to satisfy the time limit required in the pick-up plan (for example, the limit of returning to what time and what time). In this embodiment, paying attention to this point, a vehicle having a large loading capacity is assigned to a visiting group having a low saving cost. This makes it possible to formulate a vehicle allocation plan with a high loading rate or a high seating rate by making the best use of the vehicle loading capacity as compared with a method of sequentially assigning vehicles that can be allocated.

  The “constraint condition confirmation unit 33” determines whether or not a predefined constraint condition is satisfied when the cared person is picked up using the vehicle (and the seat) allocated by the vehicle allocation unit 32. The “constraint condition” in the present embodiment is a condition for appropriately picking up and receiving the assigned cared person, and whether the number of seats (the number of boarding passengers) is insufficient for the assigned cared person, Can a seat with an auxiliary function according to the physical information of the cared person be assigned (can a seat with an auxiliary function for assisting wheelchair users be assigned to a cared person who uses a wheelchair) or loading? It is a condition such as whether it exceeds the possible amount. In addition, the constraint condition confirmation unit 33 can also confirm a constraint condition related to time, such as whether to return to the facility within a predetermined time or not to restrain the care recipient for a predetermined time.

  The constraint condition confirmation unit 33 according to the present embodiment determines whether or not the vehicle allocation plan using the vehicle (and the seat) allocated by the vehicle allocation unit 32 satisfies a predetermined constraint condition. The planned vehicle allocation plan is sent to the output means 40. On the other hand, if the constraint condition is not satisfied, the result is sent to the vehicle allocation unit 32. The vehicle allocation unit 32 allocates a vehicle other than the allocated vehicle (a vehicle that does not satisfy the constraint condition) and having the smallest loading capacity to the visit group including the visit point having the highest saving cost. That is, when the constraint condition is not satisfied, the vehicles are allocated in ascending order of the loading capacity, and it is verified whether or not the constraint condition is satisfied. Thereby, a vehicle as small as possible can be allocated to a visiting group having a high saving cost.

  The “pick-up route calculation unit 34” uses the route search technology such as the known Dijkstra method for each visit group distributed by the distribution unit 31 so that each vehicle can efficiently visit the vicinity of the visit point (home of the care recipient). Calculate the route to follow.

  The “seat allocating unit 35” is based on the assistance request information of the cared person to be picked up at the visit point and the auxiliary function information of the vehicle that assists the cared person, acquired through the information acquisition unit 20. Preferentially assign a car seat that satisfies the care request information to the care recipient.

  In addition, although not particularly limited, the seat assignment unit 35, when physical information that is a preset priority factor is included in the assistance request information of the cared person picked up at the visit point, It is preferable to preferentially assign a seat having an auxiliary function associated with physical information to be preliminarily associated. Specifically, the seat allocating unit 35 has a wheelchair riding assist function when physical information indicating that the wheelchair is used is included in the assistance request information of the cared person being picked up at the visit point. Preferentially assign seats.

  The seat assignment unit 35 of this embodiment assigns a seat to a care recipient based on the order of getting on and off of the care recipient according to the visit order of the visit points. Specifically, a cared person who rides at a previously visited visit point is assigned a seat at the back, and a cared person who rides at a later visited point is assigned a seat near the entrance. . Similarly, a seat close to the entrance is assigned to a cared person who gets off at a visit point to be visited first, and a back seat is assigned to the entrance to a cared person who gets on at a visit point to be visited later.

  Next, a control method of the vehicle allocation planning device 100 according to the present embodiment will be described based on the flowchart of FIG.

  First, the reservation information acquisition means 10 accesses the reservation information database 3b and acquires reservation information (S1). These reservation information includes an ID for specifying a pickup or delivery target such as a user ID or a cargo ID. The information acquisition means 20 accesses the various information databases 3a, and the position of the vehicle base (facility information) and the position of the visit point (corresponding to the care receiver ID in the reservation information) necessary for the planning of the dispatching plan ( Information including caregiver information) and vehicle loading capacity (vehicle information) is acquired (S2).

  The sorting unit 31 of the pick-up plan planning means 30 calculates the saving cost of the visited point corresponding to the reservation information (S3). The allocating unit 31 visits the visit group Gr. Indicating the maximum saving value Smax. X is extracted (S4). The allocating unit 31 groups combinations that are visiting point groups having the maximum saving cost (S7). Visit group Gr. The saving value S (Gr.X) of X is set to zero (S8). This is to prevent it from being processed again.

  The vehicle allocation unit 32 selects a vehicle that can be allocated and has the smallest occupant constant (loading capacity) (S9). If there is such a vehicle (S10), the process proceeds to S11. If not, the grouping is canceled (S18), and the processes after S4 are repeated.

  Next, the constraint condition confirmation unit 33 reads a predetermined constraint condition stored in advance in the database (S12). The constraint conditions of this example are constraint conditions, such as the boarding capacity of a vehicle. The constraint condition confirmation unit 33 determines whether or not the vehicle allocation plan for visiting the visit points grouped in S7 by the vehicle specified in S10 satisfies the constraint conditions (S12). If the constraint condition is not satisfied, the process returns to S9, and the vehicle having the smallest occupant constant (loading capacity) is selected from allocatable vehicles excluding the vehicle that does not satisfy the constraint condition (the vehicle specified in S10) (S9). , S9 and subsequent steps are repeated. On the other hand, if the constraint condition is satisfied, the vehicle allocation unit 32 determines the vehicle specified in S10 as a vehicle that visits the visit point grouped in S7 (S13). Along with the determination of the vehicle, it is determined to adopt the visit group grouped in S7 (S14).

  The pick-up route calculation unit 34 calculates a pick-up route for the determined visit group by a known Dijkstra method or the like (S15).

  The seat allocation unit 35 gives priority to a car seat that satisfies the assistance request information of the cared person based on the assistance request information of the cared person to be picked up at the visit point and the auxiliary function information of the car. The seats are assigned so as to be assigned to (S16). In addition, when physical information that is a preset priority factor is included in the assistance request information of the care recipient, the user is provided with a seat having an auxiliary function that is associated with the physical information that is the priority factor in advance. Assign with priority. Specifically, when the body information indicating that the wheelchair is used is included in the assistance request information of the care recipient, a seat having a wheelchair riding assistance function is preferentially assigned to the user. Furthermore, the seat specifying function assigns a seat to a cared person based on the order of getting on and off of the cared person according to the order of visiting the visit points. Thereby, a cared person using a wheelchair or the like can be assigned a seat having an auxiliary function for assisting getting in and out of the wheelchair, and the burden on the cared person can be reduced. All visit groups are processed after S4, and the completion of assignment is confirmed (S17). In this example, when the saving value of all the combinations becomes zero and Smax = 0, it is determined that the assignment is completed.

The process based on the saving cost of S4-8 and S17 mentioned above is demonstrated to the case where the three points A, B, and C are visited as an example. When there are three visiting points, there are three combinations, the saving value S _AB (corresponding to S (Gr.X), the same applies hereinafter) at point A and point B, and the points A and C. It calculates a savings value S _AC, three savings value of savings value S _BC point B and point C (the more visit points increases combinations between two points, calculates a savings value for each combination thereof). Next, the maximum saving value is calculated from the calculated three saving values. If S _AB <S _AC <S _BC , the saving value S _BC is the maximum value (maximum saving value Smax = S _BC ), and the visiting group Gr. X is a group of visit points B and C. Visit group Gr. Group B and C. Thereafter, the saving value S (Gr. _BC ) at points B and C is set to zero. After the allocation processing of the seat (S16), when calculating the maximum savings value returns to Step 4 again, because there is a S _BC = 0 in the previous process, the maximum savings value Smax = S _AC. That is, what is extracted as the visit group that shows the maximum saving value Smax in the second S4 is a combination of the point A and the point C where the second saving is large. When this process is repeated, finally, S _BC = S _AB = S _AC = 0, and as a result, the maximum saving value becomes Smax = 0. When the maximum saving value Smax becomes 0, it can be determined that the allocation process has been completed.

  As described above, since the visiting points with a large saving cost are generally far from the vehicle base, the number of visiting points tends to decrease. This tendency is particularly prominent when restrictions such as time restrictions are imposed. In the present embodiment, in a vehicle allocation plan using the saving cost method, a vehicle having a small load capacity or a small occupant constant and a low load capacity is assigned to a visit of a visit group having a large saving cost. Specifically, when the number of visit points per visit group varies, a small vehicle is assigned to a visit group with a small number of visit points, that is, a visit group with a small number of users to be picked up and picked up. Large vehicles can be assigned to groups with a large number of users. As a result, it is possible to devise a vehicle allocation plan that has a high loading rate or seating rate and that makes full use of the loading capacity of the vehicle.

  Although the vehicle allocation plan planning apparatus 100 has been described in the present embodiment, the same operation and effect can be obtained even when the vehicle allocation plan planning program of the present invention is executed by a computer installed in the vehicle allocation plan planning apparatus 100. Further, in the present embodiment, the dispatch process planning process has been described by taking as an example the pick-up of a care recipient who uses a care facility. However, the dispatch plan planning apparatus and the dispatch plan planning program of the present embodiment are used to collect cargo. It can also be used for planning a dispatching plan such as delivery.

  The embodiment described above is described in order to facilitate understanding of the present invention, and is not described in order to limit the present invention. Therefore, each element disclosed in the above embodiment is intended to include all design changes and equivalents belonging to the technical scope of the present invention.

It is a figure which shows the outline | summary of the vehicle allocation plan planning apparatus of this embodiment. It is a block block diagram of the vehicle allocation plan planning apparatus of this embodiment. It is a flowchart figure which shows the control procedure of the vehicle allocation plan planning apparatus which concerns on this embodiment.

Explanation of symbols

1000 ... Vehicle allocation support system 1 ... Internet 2,100 ... Vehicle allocation planning device (information processing server)
DESCRIPTION OF SYMBOLS 10 ... Reservation information acquisition means 11 ... Reservation processing part 20 ... Information acquisition means 30 ... Vehicle allocation plan drafting means 31 ... Distribution part 32 ... Vehicle allocation part 33 ... Confirmation of restrictions Unit 34 ... Pick-up route calculation unit 35 ... Seat allocation unit 40 ... Output means 50 ... Communication function 3 ... Database 3a ... Various information databases 3b ... Reservation information database
4 ... Care provider side terminal 5 ... Care receiver side terminal

Claims (7)

A vehicle allocation plan planning apparatus for planning a vehicle allocation plan for visiting one or more visiting points using a vehicle and returning to a predetermined vehicle base,
Reservation information acquisition means for acquiring reservation information for specifying the visit point from the user side;
Information acquisition means for acquiring information including the position of the vehicle base, the position of the visit point, and the loading capacity of the vehicle;
A vehicle allocation plan planning unit that formulates a vehicle allocation plan based on the reservation information acquired by the reservation information acquisition unit and the information acquired by the information acquisition unit;
Output means for outputting a vehicle allocation plan designed by the vehicle allocation plan planning means,
The vehicle allocation planning means calculates a saving cost of the visit point based on the vehicle base, and distributes the visit point to a visit group that visits a predetermined vehicle based on the saving cost, and the distribution A vehicle allocation plan planning apparatus comprising: a vehicle allocation unit that allocates a vehicle having the smallest vehicle loading capacity to a visit group having the highest saving cost among visit groups distributed by the unit. The vehicle allocation plan planning means includes a constraint condition confirmation unit that determines whether or not a predetermined vehicle allocation plan that satisfies a predetermined constraint condition is satisfied,
The vehicle allocation unit is a vehicle other than the allocated vehicle to the visiting group with the highest saving cost when the constraint condition confirmation unit determines that the dispatch plan does not satisfy a predetermined constraint condition. 2. The vehicle allocation planning device according to claim 1, wherein a vehicle having the smallest load capacity is allocated. The information acquisition means further acquires assistance request information of a cared person to be picked up at the visited point, and auxiliary function information of the vehicle that assists the cared person,
The vehicle allocation planning means preferentially gives the cared person a seat of the vehicle that satisfies the cared person's assistance request information based on the cared person's assistance request information and the vehicle's assistance function information. The vehicle allocation planning device according to claim 1, further comprising a seat allocation unit that allocates the vehicle.   When the seat assignment unit includes physical information that is a priority factor set in advance in the assistance request information of the cared person to be picked up at the visit point, the user is given the physical information that is the priority factor. 4. The vehicle allocation planning device according to claim 3, wherein seats having auxiliary functions associated in advance are preferentially assigned.   When the seat allocation unit includes physical information indicating that the wheelchair is used in the assistance request information of the cared person to be picked up and picked up at the visit point, the seat is provided with a function for assisting the user in getting on the wheelchair. 4. The vehicle allocation planning device according to claim 3, wherein the priority is assigned preferentially.   The vehicle allocation plan planning device according to any one of claims 3 to 5, wherein the seat allocation unit allocates the seat to a cared person based on an order of getting on and off of the cared person according to an order of visiting the visit point. . A vehicle allocation plan planning program that uses a vehicle to visit one or two or more visiting points and formulate a vehicle allocation plan for returning to a predetermined vehicle base,
On the computer,
Obtaining reservation information for identifying the visited point from the user side;
Obtaining information including the location of the vehicle base, the location of the visit point, and the loading capacity of the vehicle;
Based on the acquired reservation information and the information, calculating a saving cost of a visit point based on the vehicle base;
Allocating the visit point to a visit group visiting with a predetermined vehicle based on the saving cost of the visit point;
A vehicle allocation plan planning program that executes a vehicle allocation plan in which a vehicle having the smallest loading capacity is allocated to a visit group having the highest saving cost among the allocated visit groups.

Images