JP2002342873A - Bus operation scheduling system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a bus operation scheduling system capable of automatically producing an operation schedule of a bus. SOLUTION: The system includes a use request accepting means for accepting a use request in which a desired boarding point and a desired alighting point of each customer are specified, a customer information holding means for holding customer information including the use request, an operation information holding means for holding operation information including vehicle information of the bus, a road network information acquiring means for acquiring and holding road network information, a bus operation schedule producing means for producing the bus operation schedule for specifying a cruising route and cruising time of the bus cruising the desired boarding point and the desired alighting point specified in the use request on the basis of the customer information, operation information and road network information, and a schedule outputting means for outputting the produced bus operation schedule.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an operation scheduling system for a shared vehicle suitable for a public transportation system that provides a shared vehicle operation service.

[0002]

2. Description of the Related Art Conventionally, in a shared vehicle operation service, use requests from a large number of customers are accepted and, on the other hand, information such as the number of vehicles that can be operated, the work status of crew members, and road traffic information is met in accordance with each use request. In consideration of operational circumstances, an operation schedule such as allocation of a shared vehicle and creation of a tour route was manually performed. In a shared vehicle operation service where multiple passengers share a boarding point, multiple vehicles may be connected while moving the passenger from the boarding point to the destination,
The preparation of a schedule for the operation in which this transit occurs has also been performed manually.

[0003]

SUMMARY OF THE INVENTION The present invention has been made in consideration of the above circumstances, and an object of the present invention is to automatically create an operation schedule of a shared vehicle which has been conventionally performed manually. An object of the present invention is to provide a shared vehicle operation scheduling system.

[0004]

According to a first aspect of the present invention, there is provided a combined vehicle operation scheduling system, comprising: a use request receiving means for receiving a use request in which at least a desired boarding point and a desired getting off point of each customer are designated; Customer information holding means for holding customer information including the use request, operation information holding means for holding operation information including vehicle information of the shared vehicle, road network information acquisition means for acquiring and holding road network information, At least customer information held by the customer information holding unit, operation information held by the operation information holding unit, and road network information held by the road network information acquisition unit are input to a predetermined evaluation function, and the evaluation function is optimized. The traveling route and the patrol route of the shared vehicle that patrols the desired boarding point and the desired getting-off point specified in the use request And vans vehicle operation schedule creating means for creating an omnibus vehicle operation schedule to identify,
And a schedule output means for outputting the created shared vehicle operation schedule.

It is to be noted that one use request includes a plurality of sets of customers, and the plurality of sets of customers are grouped into one customer group, and the shared vehicle operation schedule is created so that the customer group is allocated to the same shared vehicle. Is preferred.

The evaluation function includes a desired boarding time of each customer, a desired boarding time, a minimum travel time between desired boarding points, a boarding time in a vehicle schedule, a boarding time in a vehicle schedule, a boarding time in a vehicle schedule, And a function having at least one of the operation cost as an argument.

[0007] In addition, whether or not the ride is accepted, the allowable range of the deviation between the desired ride time from the customer and the ride time of the customer in the ride vehicle operation schedule, the desired drop-off time from the customer and the ride vehicle operation schedule are determined. The combined vehicle operation schedule may be created so as to satisfy a customer constraint including any of an allowable range of deviation from the getting-off time of the customer and an allowable range of boarding time.

[0008] Further, there may be provided a means for setting the customer constraint for each customer or customer group.

[0009] Further, the present invention further comprises means for registering the available time period of the shared vehicle as the operation information, and the combined vehicle operation schedule is prepared so that the available shared vehicle is allocated according to the time period. Good.

[0010] The vehicle may further include means for registering vehicle information of the shared vehicle that can be used for each of a plurality of businesses.

[0011] Further, if the passenger restrictions cannot be satisfied only with the shared vehicle, a transfer vehicle is dispatched to at least some of the customers, and the transfer from the transfer vehicle to the shared vehicle or the transfer from the shared vehicle to the transfer vehicle is performed. And the shared vehicle operation schedule may be created so as to satisfy the customer constraint.

Also, the number of vehicles that can be distributed, the number of vehicles that can be distributed, the number of vehicles that can be connected per vehicle, the available time of each vehicle, the capacity of vehicles, the number of loads that can be loaded, The shared vehicle operation schedule may be created so as to satisfy an operation constraint including any of a possible weight or a loadable volume.

[0013] Further, the shared vehicle operation schedule creating means executes means for executing a first scheduling algorithm for adding a new vehicle to unassigned customers based on the determination that there is no allocatable vehicle. The first scheduling algorithm includes a first scheduling algorithm for extracting information on an unassigned customer when the use request registered in the customer information holding unit includes an unassigned customer.
And if it is possible to assign the unassigned customers extracted in the first step to any of the vehicles, the most suitable vehicle among the allocatable vehicles is selected based on the schedule evaluation function. A second step of allocating the dispatching customer, creating an optimal traveling route of the vehicle and updating the traveling time on the route, and if it is possible to allocate by adding and connecting a transfer vehicle to the vehicle being assigned a customer, A third step of allocating an unassigned customer to the transfer vehicle of the additional connection, and creating a tour route and a tour time of the additional connection vehicle; If there is a vehicle available other than the above, the vehicle is added and the unallocated customer is allocated, the vehicle is set as a customer-allocating vehicle, and a fourth route for creating a traveling route and a traveling time of the additional vehicle is created. And flop may be configured to have a.

[0014] The shared vehicle operation schedule creating means may add a new vehicle to an unallocated customer group based on the determination that there is no allocatable vehicle, and add a new vehicle to the unassigned customer group. Means for executing a second scheduling algorithm for allocating all customers to the same shared vehicle, wherein the second scheduling algorithm includes an unallocated customer group in the use request registered in the customer information holding means. A first step for retrieving information about the unassigned customer group,
If all customers belonging to the unassigned customer group extracted in the first step can be assigned to any of the vehicles, an optimal vehicle among the assignable vehicles is selected based on a schedule evaluation function, A second step of allocating all customers of the customer group to the vehicle, creating an optimal tour route of the vehicle, and updating the tour time on the route, and adding a transfer vehicle to any of the vehicles assigned to the customer If all the customers belonging to the unassigned customer group can be allocated by connecting and connecting, all the customers are allocated to the transfer vehicle of the additional connection, the traveling route of all vehicles including the added transfer vehicle and A third step of creating a tour time, if there is a shared vehicle available, and if it is possible to add a transfer vehicle as needed, all customers belonging to a customer group of unallocated vehicles can be allocated; Multiplication assigned a slip vehicle or transit vehicle,
A fourth step of creating a tour route and a tour time of the vehicle.

[0015] The schedule output means may include means for outputting the created shared vehicle operation schedule in a table format.

[0016] In addition, a row, a column, or a cell is extracted from the tabulated vehicle operating schedule in accordance with a designated condition, or a row, column, or cell belonging to a designated item is extracted, and each extracted result is displayed. The output may be made in a different form.

[0017] The schedule output means may include a means for superimposing and outputting the created shared vehicle operation schedule on a map or a road network.

Further, only the information belonging to the designated item may be displayed on the map or the road network.

A program according to the present invention (claim 16) causes a computer to execute a joint vehicle operation scheduling algorithm for adding a new vehicle to a customer who has not been assigned a vehicle based on the determination that there is no assignable vehicle. A step of extracting information on an unallocated customer from the customer information storage means when the given use request includes an unallocated customer, and extracting the information in any one of the vehicles in the first step. If it is possible to assign the unassigned customers, the optimal vehicle among the assignable vehicles is selected based on the schedule evaluation function, the unassigned customers are assigned to the vehicles, and the optimal patrol route of the vehicles is determined. A second step of creating and updating the tour time on the route, and assigning by adding and connecting a transfer vehicle to the vehicle being assigned to the customer. A third step of allocating an unallocated customer to a transfer vehicle of an additional connection, and creating a tour route and a tour time of the additional connection vehicle; and A fourth step of adding a non-vehicle available vehicle other than the vehicle and assigning the unallocated customer to the vehicle, assigning the vehicle to a customer-allocated vehicle, and creating a tour route and a tour time of the additional vehicle; It is characterized by having.

A program according to the present invention (claim 17) is to add a new vehicle to an unallocated customer group based on the determination that there is no allocatable vehicle, and to add a new vehicle to the customer group within the same customer group. In a program for causing a computer to execute a shared vehicle operation scheduling algorithm that allocates all customers to the same shared vehicle, if a given use request includes an unassigned customer group, information on the unassigned customer group is provided. A first step of taking out from the customer information storage means, and if all the customers belonging to the unassigned customer group taken out in the first step can be assigned to any of the vehicles, an optimum one of the assignable vehicles Selecting a vehicle based on the schedule evaluation function, assigning all customers of the customer group to the vehicle,
A second step of creating an optimal tour route of the vehicle and updating the tour time on the route; and adding and connecting a transfer vehicle to any of the vehicles assigned to the customer to belong to the customer group of unallocated vehicles. If all customers can be assigned, a third step of allocating all the customers to the transfer vehicle of the additional connection and creating a tour route and a tour time of all vehicles including the added transfer vehicle; If there is a shared vehicle and if it is possible to assign all customers belonging to the unallocated customer group by adding a transfer vehicle as necessary, assign the shared vehicle or transfer vehicle, and make a tour route and patrol of the vehicle. And a fourth step of creating a time.

Further, one or both of a desired boarding time and a desired getting-off time of each customer are specified in the use request, and the combined vehicle operation schedule is created so as to keep the specified desired boarding time. Good.

[0022] The use request may include information on the number of passengers, the number of luggage, the number of infants, whether or not sharing is permitted, transfer to another transportation system, or use of other facilities.

Further, it is preferable that a combined vehicle operation schedule is created and stored for each combination of constraints on the operation side or constraints on customers or customer groups.

Further, a desired boarding point or a desired getting-off point of the customer described in the use request is searched on a map or a road network, and the point is identified by the point information including the latitude, longitude or point name of the point. It is preferable to provide a means for associating with a designated node on the road network or a node automatically obtained. In association with the node, the point information on the desired boarding point or desired drop-off point of the customer and the associated information including the travel route or the required travel time between the point and the node are included in the customer personal information. It is preferable to store it together.

It is preferable that the personal information of the corresponding customer is called by designating partial information included in the customer's personal information such as the customer's name or telephone number. The customer personal information includes service use result information such as a ride time at the time of using the combined vehicle service and a deviation from a request (customer satisfaction).

[0026]

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram showing a configuration of a shared vehicle operation scheduling system according to an embodiment of the present invention. The shared vehicle operation scheduling system according to the present embodiment is a system that receives a use request from a customer (user) and creates an optimal combined vehicle operation schedule that meets the use request.

As shown in FIG. 1, the shared vehicle operation scheduling system according to the present embodiment receives, for example, a server device that receives a use request for a shared vehicle operation service sent via the Internet, or a normal telephone or facsimile (FAX). Request receiving unit 1 consisting of a device for recording information based on the usage request, and the name, telephone number and address of the customer, and the destination and destination of the past use of the shared vehicle operation service, and directions to that point A customer database 2 for storing service usage record information and the like; a customer information holding unit 3 for appropriately processing and holding usage request information input by an operator and usage request information sent from the server or the like according to the request content; Vehicle capacity, loadable luggage, and vehicle An operation information holding unit 4 for holding operation information such as vehicle information 5 such as affiliated company, available date, available time zone and unavailable time zone, and crew information (including information such as work status) 6. A road network information acquisition unit that obtains point information such as the position and name of a point in a road network, a distance between two points, a required travel time, and road information that is updated in response to a change in traffic conditions. 8 is provided.

Further, at least the contents of the information stored in the customer information storage unit 3 and the operation information storage unit 4 and the automatic vehicle operation schedule for automatically creating a shared vehicle operation schedule from the road network information relating to the service providing area. The scheduler 7 and the combined vehicle operation schedule created by the shared vehicle operation automatic scheduler 7 are displayed or printed out in a predetermined output form by a display, a printer, or the like, and appropriate information is provided to a terminal or a vehicle-mounted terminal owned by the customer. And a shared vehicle operation schedule output unit 9 for transmitting.

[Creation of Shared Vehicle Operation Schedule] Usage requests are received from each customer via telephone, the Internet, etc., and the number of vehicles that can be operated on the one hand, the work conditions of crew members, or An example of a procedure for creating a shared vehicle operation schedule while considering operation circumstances such as road traffic information will be described.

[Procedure for Creating Shared Vehicle Operation Schedule] First, the use request receiving unit 1 receives a use request from a customer. If necessary, the received usage requests are classified as appropriate. For example, it is preferable to classify by desired use date, destination point, and boarding point. One use request includes a plurality of sets of customers (so-called accompanying customers) who wish to dispatch to the same shared vehicle even if the boarding point or the disembarking point is different.
May be included, and this is treated as a “customer group”.

Next, the use requests received by the receiving unit 1 and to be scheduled are registered in the customer information holding unit 3 in the order of the desired boarding time, the desired getting off time, or the order of receiving the use request, for example.

Next, the acquisition unit 8 acquires the road network information. Such road network information is updated as needed. This includes, for example, temporary information updating due to occurrence of an accident or traffic congestion. Pre-configured,
The vehicle information 5 and the crew information 6 held by the operation information holding unit 4 are also updated as needed. This includes
For example, information update corresponding to a change in operation status, such as a different number of available shared vehicles for each schedule creation target day, is included. In some cases, the road network information and the operation information are the latest and need not be updated.

Next, based on the usage request held by the customer information holding unit 3, the operation information held by the operation information holding unit 4, and the road network information held by the road network information acquisition unit 8, the automatic vehicle operation scheduler 7 creates a shared vehicle operation schedule.

"Combined vehicle operation schedule" Here, the combined vehicle operation schedule refers to the operation information of a plurality of shared vehicles, that is, the sequence of traveling points of each vehicle and each traveling point identified by the schedule management unit on the operation side. This is information for specifying the tour time. For example, when the schedule management unit is one day, the shared vehicle operation schedule is information that specifies a tour point sequence of each vehicle and a tour time to each tour point for all vehicles used on a certain operation day. .
FIG. 2 shows an example of the shared vehicle operation schedule in this case. FIG. 2 is a diagram of a combined vehicle operation schedule for a certain day. Two shared vehicles B1 and B2 are used on this day, and a transfer vehicle D1 is connected to the shared vehicle B1 and a transfer vehicle is connected to the shared vehicle B2. D2. For each vehicle, the line ID of the tour point column is shown in the first line in the order of the tour, and in the following lines,
The arrival time, departure time, and other accompanying information at each point are shown. In this schedule, B1 is point 1 → 5 →
3 (transfer connection with D1) → 10 → 11 (point 10 is the same point, customers 1, 2, and 3 get off at the same time), arrival time and departure time at each point are determined . Note that only one of the arrival time and the departure time may be determined.

The ID of the passenger getting on and off at each point, the ID of the connected vehicle, the number of people getting on and off, and the like are determined. Here, the traveling line of each vehicle in the shared vehicle operation schedule includes only points where passengers get on and off and vehicle connections occur, but in addition to these, passing points between these points, departure bases of vehicles, and return bases And information of all points where the vehicle patrols, such as interchanges. In addition, point-related information of other information on the point (point name, latitude / longitude, parking / unstoppable, etc.) may be included. The point associated information is obtained, for example, from the road network information acquisition unit 8 using the point ID as a key. Further, other information regarding the passenger (the number of luggage, the number of infants, etc.) may be included. For example,
Information on passengers is obtained from the customer database 2 and the customer information holding unit 3 using the customer ID as a key.

The combined vehicle operation schedule includes not only the operation information as the information for each vehicle as described above, but also
In some cases, it may also be stored as information for each customer. That is, the shared vehicle operation schedule may include a data structure that holds information associated with the customer, such as a boarding / alighting point, a transfer point, a boarding / alighting time, a transfer time, and other usage request contents for each customer. It may also be stored as information for each crew member or vehicle. In other words, the traveling vehicle operation schedule may include a traveling point sequence and traveling time assigned to each crew member or vehicle, information on passengers getting on and off or transferring, data structures for driving vehicles and connected vehicles. The schedule management unit is a set of operation day and destination or departure place, or a time zone, weekly or monthly, and a set of destination or departure place, business contents, operation area, vehicle type, etc. and so on.

Then, the created shared vehicle operation schedule is output from the output unit 9.

The output schedule is notified to the passenger and the crew. If there is a need to change the contents of the schedule, it will be done as appropriate.

In the creation of the above-mentioned schedule, the shared vehicle operation automatic scheduler 7 uses the following scheduling algorithm (1), for example, to determine the allocation and traveling route of the shared vehicle, and further to determine the auxiliary vehicle used for the transfer vehicle. Automatic creation of schedules such as allocation of vehicles and determination of tour routes.

[Scheduling Algorithm (1)
(Steps 1 to 5)] FIG. 3 is a flowchart showing each step of the scheduling algorithm (1).

(Step 1) If the use request registered in the customer information holding unit 3 includes a customer who has not been dispatched, information relating to the customer who has not been dispatched is extracted, and the process proceeds to step 2. If there are no undelivered customers, the process ends.

(Step 2) If it is possible to assign the unassigned passengers extracted in Step 1 to any vehicle (that is, the vehicle being assigned to a customer or the transfer vehicle connected thereto), the The most suitable vehicle is selected based on the schedule evaluation function, an unallocated customer is assigned to the optimum vehicle, an optimal patrol route of the vehicle is created, the patrol time on the route is updated, and the process returns to step 1.

(Step 3) It is not possible to assign to the vehicle being assigned to the customer or to the transfer vehicle connected thereto, but if the assignment is possible by adding and connecting the transfer vehicle to the vehicle being assigned to the customer, additional connection is established. An unallocated passenger is assigned to the transfer vehicle, a tour route and a tour time of the additional connected vehicle are created, and the process returns to step 1.

(Step 4) If the connection is not made even if the transfer vehicle is additionally connected, if there is an available vehicle other than the vehicle being assigned to the customer, the available vehicle is added to assign the unassigned customer, and the vehicle is assigned. The vehicle is assigned to the customer, the tour route and the tour time are created, and the process returns to step 1.

(Step 5) The process returns to step 1 as a customer who has not been dispatched, but cannot dispatch the dispatched vehicle, but has dispatched it.

In this algorithm, a new vehicle is added to an unallocated customer based on the determination that there is no vehicle that can be allocated. That is, scheduling is performed so that the number of dispatched vehicles is reduced as much as possible by allocating as many customers as possible to each vehicle.

A transfer vehicle is defined as an auxiliary vehicle that is used to suppress excessive allocation to a high-cost vehicle while securing the time advantage of the sharing service. The operation of a transfer vehicle involves connection for transfer to a shared vehicle.

The vehicle type and the dispatch priority of the vehicle operated as a shared vehicle or a transfer vehicle are determined on the operation side. For example, a microbus is used as a shared vehicle, and a taxi vehicle is used as a transfer vehicle. The scheduling of the transfer vehicle will be described later with a specific example.

The schedule evaluation function is a function which uses the difference between the boarding / disembarking time on the schedule and the desired boarding / leaving time of the customer, the boarding time, or the quality of the service as an argument, and is appropriately set on the operation side. . A specific example of this function will be described later.

A plurality of customers are included in one use request, and these groups are treated as a customer group. When a schedule is created for each customer group, the following scheduling algorithm (2) is used.

[Scheduling Algorithm (2)
FIG. 4 is a flowchart showing each step of the scheduling algorithm (2).

(Step 1) If the use request registered in the customer information holding unit 3 includes a customer group that has not been dispatched, information relating to the customer who has not been dispatched is extracted, and the process proceeds to step 2. If there is no unassigned customer group, the process ends.

(Step 2) If all the customers belonging to the customer group of the unallocated vehicle taken out in Step 1 can be assigned to any vehicle (that is, the vehicle being assigned a customer or the transfer vehicle connected thereto). Selecting the most suitable vehicle among the allocatable vehicles based on the schedule evaluation function, allocating all the customers of the customer group to this, creating an optimal traveling route of the vehicle, and setting the traveling time on the route. Update and return to step 1.

(Step 3) If all the customers belonging to the unassigned customer group can be assigned by adding and connecting a transfer vehicle to any of the above-assigned vehicles,
All unassigned customers are assigned to the transfer vehicles of the additional connection, the tour routes and the tour times of all the vehicles including the added shared vehicle are created, and the process returns to step 1.

(Step 4) If there are available shared vehicles, and if it is possible to assign all the customers belonging to the unallocated customer group by adding a transfer vehicle as needed, assign these vehicles. The vehicle is assigned to the customer, and the tour route and the tour time of all the vehicles are created, and the process returns to step 1.

(Step 5) The unassigned customer group is a dispatchable customer group for which dispatch is impossible, but the process returns to step 1.

In this algorithm, all customers in the same customer group are assigned to the same shared vehicle. In the case of receiving a use request, including multiple sets of customers, but it is not necessary to necessarily assign to the same vehicle from the content of the request,
In the scheduling, these customers are not treated as customer groups, or are treated as customers of different customer groups. In addition, a usage request including only one set of customers is also set as a customer group including one set of customers. As a result, all customers belong to any customer group, and a schedule can be created for each customer group by this algorithm.

Known algorithms such as A ^* search and saving method can be used as the applied algorithm. In addition, based on the created shared vehicle operation schedule, the schedule is gradually changed to improve the schedule evaluation function with a better value (λ-opt method, tabu search, simulated simulation). Annealing, a genetic algorithm, etc.).
In the improvement method, a function having different arguments and function forms from the evaluation function used at the time of creating the original schedule can be used. As an improvement method, it is possible to apply a known method such as that proposed in “Local search search method in delivery route problem with time frame” (Hiroyuki Okano, Autumn Meeting of the Operations Research Society of Japan, 1999). Good, but the invention is not limited to any particular improvement.

[Service Example] Here, as an example of a specific service using the shared vehicle operation scheduling system according to the present embodiment, a door-to-door (D
A description will be given of a free-to-door (pick-up and drop-off) service (hereinafter referred to as “the service”).

The target area of this service is, for example, city A,
For the outbound (from A city to the airport; outbound), a shared vehicle arrives at a customer-specified pickup location such as a home or hotel in the city, travels around the pickup destination of other passengers, and then rides. Enter the road and head to the airport. Return (from airport A
For the city (return), ride at the airport, get off the expressway at the interchange, patrol each customer's designated destination, and drop off each customer. In this service, a transfer vehicle is used as an auxiliary purpose for the purpose of ensuring the quality of time service for the customer and suppressing an increase in cost due to an increase in the number of shared vehicles. As the transfer vehicle, for example, a taxi vehicle is used.

The flow from the reception of a use request to the creation of a shared vehicle operation schedule in this service is as follows.

(1) Acceptance of use request A customer makes an application for a pick-up and drop-off service for an airport, that is, makes a use request by telephone or the Internet. FIG. 5 shows an example of the content of the use request. The use request shown in FIG. 5 indicates one use request, that is, a use application made by one customer. This customer goes (from the city to the airport)
I want to use the service on August 31st at 11:
I am planning to use an airline at 9:00 and want to arrive at the airport at 9:00. The customers in this use request constitute a customer group of three sets, and each can specify a destination. The customer 1 wants to be picked up at home. The number of passengers (number of passengers at the pick-up site) is two, no infants, and two luggage.
The number of customer groups in this use request is six adults and one infant.

When a plurality of groups of customers are grouped together to form a customer group, these customers are assigned to the same shared vehicle. When it is not always necessary to assign the customers to the same vehicle, these customers may be set as customers of three customer groups each including a single set of customers. In addition, the customer of a use request,
It can also be specified to the same customer group as a customer of another usage request. This can be realized by assigning a customer group ID to all customers.

In the case of a return use request, in the items of FIG. 5, "pick-up destination" is "destination", and "desired airport arrival time" is "desired airport departure time". Also, airport arrival time,
The desired airport departure time may be automatically determined on the operation side from the used flight time. In this example, the number of users and the like are described for each customer, but these may be only the total. As the information on the package, the number, type, volume, size, weight, and the like of the package for each customer included in the use request can be described. These may be only the sum of all customers in the usage request.

In this example, the customer's home or the like is described as the pick-up (destination). However, the address, latitude / longitude, point name, and directions from a landmark, such as a station or an intersection, are described. It may be registered in the customer database 2. In addition, in the case of using the existing road network information in creating a combined vehicle operation schedule to be described later, the most suitable node is automatically or manually selected from the nodes constituting the road network, and a mark for the pick-up destination or destination of the customer. And the directions from this landmark to the customer database 2
It is also preferable to register in.

There are a plurality of sets of customers in the use request, and it is configured to indicate whether or not these sets need to be allocated to the same shared vehicle, that is, whether or not these customers need to be grouped together as a customer group. Is also good. Alternatively, it may be possible to state that a request for charter is desired without sharing with another customer who has requested use.

Such a use request is accepted at any time by telephone, facsimile, or the Internet. In the case of telephone or facsimile, the operator may fill out a slip created based on FIG. 5, or in the case of the Internet, the customer directly selects a boarding point or alighting point from a map or point list and uses it together Other information such as the number of people may be entered in a form created based on FIG. 5 (online use request).

The customer information is searched from the customer database 2 using the name, telephone number, etc. as a search key, and the destination (destination) and the detailed route to the point are loaded from the customer database 2 to obtain known information. It is also possible to save the trouble of inputting. Information of a customer who has once used the service is added to the customer database 2 and is loaded the next time the service is used.

In this service, a large number of use requests as shown in FIG. 5 are received, sorted by use day, and closed, for example, the day before the use day.

(2) Registration of use request When the schedule is created on the day before the use, for example, FIG.
Is registered in the customer information holding unit 3 in the order of desired airport arrival time, desired airport departure time, use request reception order, etc. Create a schedule on the 30th.

(3) Update of Road Network Information During a certain time zone on the day of use (August 31 in this example),
When a certain road is closed or traffic congestion occurs due to rain, the road network information is updated.

(4) Update of Operation Information When the operation information on the crew members who can engage in the service and the available shared vehicles needs to be updated on the day of use, this is performed.

[Contents of vehicle information]-Individual vehicle information: vehicle type, capacity, number of loadable luggage, volume, weight, etc.-Daily use information of each vehicle: service use time zone, other business use time zone, repair information , Vehicle inspection information, fuel information, etc.-Monthly and weekly usage information of each vehicle and past usage results: mileage, travel time-Usage information of all vehicles: average and dispersion of travel time and mileage-Multiple vendors Vehicle information that can register available vehicles: In addition to the above items, affiliation, etc. [Contents of crew information] ・ Personal crew information: Name, wages, etc. ・ Daily work information of each crew: Working hours of this service,
Other work hours, vacations, sales, etc.-Monthly and weekly work information of each crew: working hours, operating hours, sales, vacations, etc.-Working information of all crews: average and dispersion of working hours and operating hours, etc. Crew information when multiple companies can register available vehicles: In addition to the above items, affiliation, etc. (5) Creation of shared vehicle operation schedule Use request held in customer information holding unit 3 and held in operation information holding unit 4 Based on the operation information and the road network information held in the road network information acquisition unit 8, the shared vehicle operation automatic scheduler 7 uses, for example, the above-described scheduling algorithm (2) to generate a schedule evaluation function. In order to meet the customer's wishes as much as possible, to reduce the operating cost, Perform the automatic creation of schedule so as to satisfy the about conditions. For customers who have used this service before, the past usage results such as the quality of the service are registered in the customer database 2,
Used when creating a schedule.

As post-processing, operation information, customer information, and the like are updated according to the contents of the created schedule.

[Vehicle / Customer Assignment Method] In this example, there are a customer who goes (from the destination in the city to the airport) and a customer who returns (from the airport to the destination in the city). , While simultaneously creating a schedule, a method for separately creating a schedule for outbound customers and a schedule for return customers, and later assigning them to vehicles.

In the former case, for example, in the scheduling algorithm (2) described above, the customer information holding unit 3
In the meantime, register the outgoing customer and the returning customer, and if the extracted customer is the outgoing customer, make the optimal assignment to the vehicle's outgoing schedule, and if the returning customer is the returning customer, Create a schedule by making optimal assignments to schedules. In the latter case, only the outgoing customer is first taken out of the customer information holding unit 3 to perform scheduling, and then only the returning customer is scheduled, and each outgoing / returning operation is assigned to the vehicle.

In the case where one vehicle is assigned to the outbound operation and the outbound operation, between the arrival time at the airport during the outbound operation and the departure time at the airport during the return operation, loading and unloading of luggage and rest of crew members are performed. Assignment is made so as to comply with the time constraint such as taking an appropriate time interval. Furthermore, in the case of allocating an operation so as to perform not only one round trip of the outbound operation and the return operation but also two or more round trips, the allocation is automatically performed so as to observe the same time constraint.

Further, referring to the weekly and monthly vehicle mileage and travel time obtained from the operation information holding unit 4, averaging these items among vehicles, and setting restrictions on each item, Automatically assign vehicles to protect them.

[Schedule Evaluation Function] The shared vehicle operation automatic scheduler 7 calculates the desired boarding time and desired getting-off time of each customer, the boarding time of each customer in the automatically created schedule, the getting-off time, the operating cost, or a function of these functions. Is a schedule evaluation function, and an optimal schedule is automatically created for this evaluation function. Examples of the above arguments and functions are shown below. For each customer i:-Desired boarding time: DTOi Here, desired airport departure time when returning (from airport to destination)-Desired departure time: DTDi Here, desired airport arrival time when going (from pick-up destination to airport)- Boarding time in schedule S: ATOi (S) ・ Disembarking time in schedule S: ATDi (S) ・ Minimum travel time between boarding point and getting off point: MinT
i. However, in the case of going, the desired boarding time, that is, the desired pick-up time DTOi is automatically set as DTOi = DTDi-MinTi. Similarly, when returning, the desired getting-off time, that is, the desired feed time DTDi is DTDi = DTOi + Min
Automatically set to Ti.

In the service for airports, in the case of going, the departure time on the schedule, that is, the airport arrival time ATDi is set to be earlier than the desired departure time, that is, the airport arrival desired time DTDi, in relation to the flight departure and arrival times. Scheduling is performed. When returning, AT
Scheduling is performed so that Oi is after DTOi. These are realized by the setting of a customer constraint described later.

If the service is provided to each customer i at the desired boarding time, the best service equivalent to a taxi transfer is provided in terms of time, and the service time in this case is MinTi. . However, detours to other passengers 'getting on and off points occur due to sharing, and there is a balance with other passengers' desired getting on and off times. Deviation from the service of the customer. The ratio of the service time to the customer including the deviation from the desired time and the increase in the boarding time due to the detour to the highest service time MinTi can be defined as the service time ratio and used as an argument of the evaluation function. The service time ratio quantifies the time inconvenience of each customer.
In the case of an airport service, the customer i in schedule S
SRi (S) = (DTDi-ATOi (S)) / MinTi (when customer i is a passenger) or SRi (S) = (ATDi (S)- DTOi) / MinTi (when the customer i is a return customer), and the evaluation function F of the schedule S is set to, for example, F = ｉSRi (S) ² (Σ is the sum relating to the customer).

In addition to the above, the evaluation function can also use, as an argument, the difference between the desired getting on and off time of the customer, such as the difference between the desired getting on time and the getting on time, such as DTOi-ATOi (S), and the getting on and off time on the schedule. In addition, special customers such as customers, customers who have suffered disadvantages during the previous use, and the like can be favored by setting a large weight as a function of customer information in the evaluation function. In addition, the number of dispatched vehicles and transfer vehicles in the schedule, the mileage, operating costs such as fuel costs or personnel costs, and the like can be used as arguments. The function form can be changed even with the same argument.

[Exemplary Items for Customer Restrictions] Customer restrictions are set for the following items, and in scheduling, vehicle allocation and routing are performed so as to comply with these restrictions, thereby creating a shared vehicle operation schedule with guaranteed service quality. It is possible to

Time difference from desired time The upper limit of the difference between the boarding time and the getting-off time from the desired time in the schedule S can be set as a constraint.
For example, EO, DO: the upper limit of the early shift from the desired boarding time, and the upper limit of the rear shift ED, DD: the upper limit of the early shift from the desired getting off time, the upper limit of the rear shift, thereby setting the riding time of each customer i in the schedule S. ATOi (S) and getting off time AT
Scheduling can be performed so that Di (S) satisfies DTOi-EO <ATOi (S) <DTOi + DO DTDi-ED <ATDi (S) <DTDi + DD.
For example, in the service for airports, DO = 0 and ED = 0 are set in relation to the flight departure / arrival time. These upper limits should be set for each customer or customer group for customers who suffered inconvenience or disadvantage during the previous use of this service, customers who applied for use early, customers who paid special fees, etc. Can also. It is also possible for the customer to specify these upper limits. As a constraint, not only the upper limit of the deviation time, but also the earliest or the latest getting on / off time that the customer can accept can be set.

Ride time Ride time Ti (S) of each customer i in schedule S =
ATDi (S) -ATOi (S) or the ratio Ti between the boarding time and the minimum travel time MinTi (S)
An upper limit may be set for (S) / MinTi (S) to be a constraint. These upper limits can be set for each customer or customer group. It is also possible for the customer to specify the upper limit.

Service time ratio The service time ratio SRi (S) can be restricted by setting an upper limit. The upper limit can be set for each customer or customer group. It is also possible for the customer to specify the upper limit.

The number of times of transfer can be specified. If no transfer is desired, the value may be set to 0.

If the customer refuses to share the vehicle and wishes to occupy the shared vehicle,
Scheduling can be performed by setting a constraint so as not to share with other customers.

[Examples of Operation Constraint Items] For example, the following items are set as operation constraints, and in scheduling, vehicle allocation and routing are performed so as to comply with these constraints, thereby enabling operation within the range of resources owned by the operation side. It is possible to create a shared vehicle operation schedule.

Limitation of the number of vehicles to be shared Upper limit of the number of vehicles to be dispatched The upper limit of the number of passengers, luggage, luggage volume, luggage weight, number of vehicles that can be connected, etc. Vehicles cannot be dispatched.

Transfer vehicle restrictions Upper limit of the number of vehicles to be dispatched Upper limit of the number of passengers, luggage, luggage volume, luggage weight, (number of vehicles that can be connected), mileage, travel time, number of transfers, etc. Vehicles cannot be dispatched to this service during business hours.

Crew restrictions Number of crew members Work schedule and vacation schedule: Assignment is not possible during hours of work on other jobs or on holiday days.

Working hours, operating hours, resting times, operating distances, and upper and lower limits of the number of times of operation [Connection of transfer vehicles] Since the number of available vehicles is limited, depending on the distribution of getting on and off points and the setting of time restrictions, Some customers cannot be dispatched. For example, if there are a plurality of customers with the same desired airport arrival time, and a certain customer's boarding point is isolated in position, a large detour occurs when patroling this customer's boarding point and time constraints are imposed. You will not be able to protect it. Although the dispatch is possible if the time constraint is relaxed, it is not desirable to lower the temporal service quality. In addition, even if there is room in the number of available shared vehicles, this service is expensive due to airport expressway tolls and fuel costs, etc. Goes down. In this case, by using a regular taxi as a transfer vehicle, switching from a transfer vehicle to a transfer vehicle or a transfer from a transfer vehicle to a transfer vehicle at an appropriate point in the city, ensuring time service quality and cost Can be suppressed. In this case, the transfer vehicle only travels in the city, which is lower in cost than distributing a shared vehicle newly. In the example of FIG. 6, customers 1 to 4 are present, and each of the boarding points is isolated. In this case, the customer 4 is picked up by a transfer vehicle, and is transferred to a transfer vehicle at a transfer point D.

The automatic vehicle operation scheduler 7 performs scheduling so that the transfer of the transfer vehicle is possible in terms of position and time. For example, in this service, a node on a designated road network such as an intersection on a circuit route of a transit vehicle to be transited or an expressway interchange is set as a transit point, and this point is set as a start point or an end point, and each A patrol route for patroling the passenger getting on and off points is created, and the patrol time is determined along the route. At this time, it is checked whether the traveling time to each point is within the customer restriction range. If there is an upper limit on the traveling distance or traveling time of the transfer vehicle as an operation constraint, this is also checked. The transfer point is selected from a plurality of points that satisfy the customer restrictions so that the traveling distance of the transfer vehicle is reduced.

[0095] The frequent use of transfer vehicles in order to improve the temporal service quality leads to an increase in cost. Therefore, when using transfer vehicles, it is desirable to reduce the number of vehicles to be dispatched from the viewpoint of operation costs. For this reason, when the above-described scheduling algorithm (1) or (2) for a shared vehicle is used, in the vehicle allocation in step 3 of both algorithms, the number of additional connected vehicles is assigned by assigning the least number of the connected vehicles, thereby distributing the number of transferred vehicles. As little as possible. In addition, an upper limit may be set for the number of transfer vehicles connected to one shared vehicle.

The transfer may be performed a plurality of times for each customer, and scheduling may be performed so that the transfer from the transfer vehicle to the transfer vehicle is performed. In this case, an upper limit of the number of transfers for each customer is set as a customer constraint or an operation constraint, and scheduling is performed so as to comply with the upper limit.

[Assignment of crew members] ・ Working hours, operating hours, operating distances, sales, etc. of the crew members on the day of use or the week or month including the use day.
Scheduled vacations, etc.-By obtaining information on items such as crew nominations from customers from the operation information holding unit 4 and the customer information holding unit 3, in line with the operation side purpose such as averaging these items among crew members, In addition, crew members can be automatically assigned to satisfy operational constraints such as maximum working hours. After the assignment is determined, the operation information such as the crew working hours is automatically updated according to the contents.

[Changing of Customer and Operational Constraints] When there are customers who cannot be dispatched due to customer and operational constraints, these constraints are partially relaxed for scheduling. For example, after negotiating with the customer, increasing the upper limit of the deviation from the desired boarding time, which is one of the passenger restrictions, or changing the crew's vacation schedule, which is one of the operation restrictions, after negotiating with the crew, The rescheduling is performed by increasing the upper limit of the number of transfer vehicles that can be connected to one or all of the shared vehicles.

Further, scheduling is performed for each of a plurality of combinations of these changing methods, and the created combined vehicle operation schedule is stored.
Each of the stored combined vehicle operation schedules can be recalled at any time and displayed in a table format or a map format described below.

[Example of Output / Display of Shared Vehicle Operation Schedule] FIG. 7 shows an example of output / display of the created combined vehicle operation schedule in the form of a table. In this example, the driver name is displayed for each vehicle in the first section.
In the next section, a display is made on the traveling route of the vehicle, the visiting points on the traveling route for each return trip, the traveling time to each point, and the number of passengers at that point are displayed in the traveling order.

In the example of FIG. 7, the vehicle 1 has a ride on both directions, the vehicle 2 has a ride only, and the vehicle 3 has a return only ride. The last section shows the total number of passengers and sales per trip. In addition, the names of passengers getting on and off at each point, the number of luggage, the occupancy rate of each vehicle, the departure / return time of the depot, or the operation time may be displayed.

In addition, weekly or monthly sales and operating hours of each crew member held in the operation information may be displayed. In addition, the total number of passengers, sales, travel distance, travel time, and the like, or the average occupancy rate, average travel distance, average travel time, and the like may be displayed for all vehicles on the applicable day, week, or month. When a passenger, crew, or vehicle number is specified, only the row or cell related to the vehicle on which the customer or crew is boarded is displayed, or the display format is changed by changing the display color, as shown in FIG. The operation results and the driving results of the vehicle may be displayed in a separate window in a table format.

[0103] Further, only information about the customer, such as boarding time and getting off time, may be displayed on the terminal carried by the customer. A terminal mounted on a vehicle may display only information on the vehicle, for example, only the row of the vehicle in FIG.

[Exemplary Output / Display on Map] FIG. 9 shows an exemplary output / display of a combined vehicle operation schedule in a map format. The display schedule is the same as that of FIG. In this example, the destination of each customer is indicated by a circle, the destination is indicated by a square, and the destinations are connected by arrows, and the traveling route of each vehicle is displayed.
Information on boarding and getting off at each point is displayed in the rectangular frame of the destination and the destination. The display contents in the rectangular frame are a vehicle number (a number in a circle), a patrol time, and the number of passengers getting on and off. A spot name, a guest name, and the number of packages may be displayed in this frame. Also, in the oval frame indicating the airport point,
The vehicle number (the number in a circle) of each vehicle, the airport arrival time or airport departure time, and the number of passengers getting on and off are displayed.
The sales of each vehicle may be displayed in this frame. Further, the departure / return time and operation time of the depot of each vehicle may be displayed. Further, in a separate window, the total number of passengers, sales, running distance, running time, and the like of all vehicles, or an average riding rate, average running distance, average running time, and the like may be displayed. Also, when a customer, crew, or vehicle number is specified, only the tour route and getting on / off point information related to the vehicle on which the customer or crew is boarded are displayed on the map, or the display color is changed, or displayed in a separate window in a table format. It is also preferable to change the display format. Alternatively, only the traveling route and information regarding the vehicle may be displayed on the terminal mounted on the vehicle.

According to the present embodiment described above, in the shared vehicle operation service, telephone or facsimile (FA)
X), accepting a large number of usage requests via the Internet, mobile phones, etc., while satisfying various restrictions based on the usage request contents and road network information including traffic information such as operation information such as the number of vehicles and crew working conditions, In addition, it is possible to automatically create a joint vehicle operation schedule that minimizes the operation cost as much as desired by the user. The created shared vehicle operation schedule can be output and displayed in a preferable form such as a table form or a map form.

The present invention is not limited to the above-described embodiment, but can be implemented with various modifications.

[0107]

As described above, according to the present invention,
A shared vehicle operation scheduling system that automatically creates an operation schedule for a shared vehicle can be provided.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a shared vehicle operation scheduling system according to an embodiment of the present invention.

FIG. 2 is a diagram showing an example of a data structure of a combined vehicle operation schedule to be created;

FIG. 3 is a flowchart showing each step of a scheduling algorithm (1).

FIG. 4 is a flowchart showing each step of a scheduling algorithm (2).

FIG. 5 shows an example of a use request.

FIG. 6 is a diagram for explaining connection of a transfer vehicle.

FIG. 7 is a diagram showing an example of output and display of a combined vehicle operation schedule in a table format.

FIG. 8 is a diagram showing an example in which a crew member's operation record, a vehicle record record, and the like are displayed in a separate window in a table format.

FIG. 9 is a diagram showing an example of output and display of a combined vehicle operation schedule in a map format.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 ... Usage request reception part 2 ... Customer database 3 ... Customer information storage part 4 ... Operation information storage part 5 ... Vehicle information 6 ... Crew information 7 ... Shared vehicle operation automatic scheduler 8 ... Road network information acquisition part 9 ... Shared vehicle operation schedule Output section

 ────────────────────────────────────────────────── ─── Continuing from the front page (72) Inventor Toshiaki Tanaka 1-Front Term, Toshiba R & D Center, Komukai Toshiba-cho, Kawasaki-shi, Kanagawa 5H180 AA06 AA14 BB02 BB04 BB05 BB15 EE05 EE06 EE10 FF01 FF12 FF17 FF23 FF32

Claims (17)

[Claims] 1. A use request receiving means for receiving a use request in which at least a desired boarding point and a desired getting-off point of each customer are designated; customer information holding means for holding customer information including the use request; Operation information holding means for holding operation information including information; road network information obtaining means for obtaining and holding road network information; at least customer information held by the customer information holding means; held by the operation information holding means The operation information and the road network information held by the road network information acquisition means are input to a predetermined evaluation function, and the desired traveling point and the desired getting off point specified in the use request are circulated so as to optimize the evaluation function. A shared vehicle operation schedule for creating a shared vehicle operation schedule that specifies a tour route and a tour time of the shared vehicle Vans vehicle operation scheduling system, characterized by comprising: a forming unit, and a schedule output means for outputting the created the vans vehicle operation schedule, the. 2. The use request includes a plurality of sets of customers, the plurality of sets of customers are grouped into one customer group, and the shared vehicle operation schedule is created such that the customer group is allocated to the same shared vehicle. The system of claim 1, wherein 3. The evaluation function includes a desired boarding time of each customer, a desired boarding time, a minimum travel time between desired boarding points, a boarding time in a vehicle schedule, a boarding time in a vehicle schedule, a boarding time in a vehicle schedule, The system according to claim 1, further comprising a function having at least one of an operation cost and an operation cost as an argument. 4. Approval or rejection of sharing, an allowable range of a difference between the desired boarding time from the customer and the boarding time of the customer on the shared vehicle operation schedule, and a desired drop-off time from the customer and the combined vehicle operating schedule. 4. The combined vehicle operation schedule is created so as to satisfy a customer constraint including any of an allowable range of deviation from the getting-off time of the customer and an allowable range of boarding time. The system described in Crab. 5. The system according to claim 4, further comprising means for setting the customer constraint for each customer or customer group. 6. A means for registering an available time period of the shared vehicle as the operation information, and creating the combined vehicle operation schedule so as to allocate available shared vehicles according to the time period. A system according to any of the preceding claims, characterized in that: 7. The system according to claim 1, further comprising means for registering vehicle information of the shared vehicle available for each of a plurality of businesses. 8. When a passenger vehicle alone cannot satisfy the customer constraint, a transfer vehicle is dispatched to at least some of the passengers,
The method according to any one of claims 4 to 7, wherein the shared vehicle operation schedule is created so as to satisfy the customer constraint by changing from a transfer vehicle to a transfer vehicle or by switching from a transfer vehicle to a transfer vehicle. system. 9. The number of vehicles that can be distributed, the number of vehicles that can be distributed, the number of vehicles that can be connected per vehicle, the available time of each vehicle, the capacity of vehicles, the number of loads that can be loaded, and the loading The system according to any one of claims 1 to 8, wherein the shared vehicle operation schedule is created so as to satisfy an operation constraint including either a possible weight or a loadable volume. 10. The shared vehicle operation schedule creating means executes a first scheduling algorithm for adding a new vehicle to an unallocated customer based on a determination that there is no allocatable vehicle. The first scheduling algorithm comprises: a first step of extracting information on an unassigned customer when a use request registered in the customer information holding unit includes an unassigned customer; If it is possible to assign the unassigned customers extracted in the first step to the above, the most suitable vehicle among the assignable vehicles is selected based on the schedule evaluation function, and the unassigned customers are assigned to the vehicles. The second is to create an optimal patrol route for the vehicle and update the patrol time on that route.
Step: If assignable by adding and connecting a transfer vehicle to the vehicle being assigned a customer, assigning an unassigned customer to the additional connection transfer vehicle and creating a tour route and a tour time of the additional connect vehicle Step 3 and if the transfer vehicle is not connected even if it is an additional connection, if there is a vehicle available other than the vehicle being allocated to the customer, this is added and the unallocated vehicle is allocated, and the vehicle is allocated to the customer. The system according to any one of claims 1 to 9, further comprising a fourth step of creating a traveling route and a traveling time of the additional vehicle as a vehicle being allocated. 11. The combined vehicle operation schedule creating means adds a new vehicle to an unallocated customer group based on a determination that there is no allocatable vehicle, and
Means for executing a second scheduling algorithm for allocating all customers in the same customer group to the same shared vehicle, wherein the second scheduling algorithm does not respond to the use request registered in the customer information holding means. A first step of extracting information on the unassigned customer group when a dispatched customer group is included; and assigning all customers belonging to the unassigned customer group extracted in the first step to any vehicle. If there is, the optimal vehicle among the allocatable vehicles is selected based on the schedule evaluation function, all the customers of the customer group are allocated to the vehicle, and an optimal circuit route for the vehicle is created, and A second step of updating the patrol time of the vehicle, and adding and connecting a transfer vehicle to any of the vehicles assigned to the customer, thereby connecting the customer group of the unallocated vehicle. If all customers belonging to the loop can be assigned, a third step of assigning all the customers to the transfer vehicles of the additional connection and creating a tour route and a tour time of all vehicles including the added transfer vehicles; If there is an available shared vehicle and if it is possible to assign all customers belonging to the unassigned customer group by adding a transfer vehicle as necessary, assign the shared vehicle or transfer vehicle and patrol the vehicle. The system according to any one of claims 1 to 10, further comprising a fourth step of creating a route and a traveling time. 12. The system according to claim 1, wherein said schedule output means includes means for outputting the created shared vehicle operation schedule in a tabular format. 13. A row, column, or cell is extracted from the table-sharing vehicle operation schedule according to a designated condition, or a row, column, or cell belonging to a designated item is extracted, and each extracted result is displayed. The system according to claim 12, wherein the output is performed in a different form. 14. The schedule output means according to claim 1, further comprising means for superimposing and outputting the created shared vehicle operation schedule on a map or a road network. The described system. 15. The system according to claim 14, wherein only information belonging to a designated item is displayed on the map or the road network. 16. A program for causing a computer to execute a shared vehicle operation scheduling algorithm for adding a new vehicle to an unallocated customer based on a determination that there is no vehicle that can be allocated, the program comprising: If the request includes a customer who has not been dispatched, a first step of extracting information about the customer who has not been dispatched from the customer information storage means; and the customer of the undelivered car retrieved in the first step can be assigned to any vehicle. If there is, select an optimal vehicle among allocatable vehicles based on the schedule evaluation function, allocate unallocated customers to the vehicle, create an optimal circuit route for the vehicle, and set a patrol time on the route. Second to update
Step: If assignable by adding and connecting a transfer vehicle to the vehicle being assigned a customer, assigning an unassigned customer to the additional connection transfer vehicle and creating a tour route and a tour time of the additional connect vehicle Step 3 and, if the transfer vehicle is not connected even if it is added, if there is a vehicle available other than the vehicle being allocated to the customer, the available vehicle is added and the unallocated vehicle is allocated, and the vehicle is allocated to the customer. A fourth step of creating a traveling route and a traveling time of the additional vehicle as a vehicle being allocated. 17. A new vehicle is added to an unallocated vehicle group based on a determination that there is no vehicle that can be allocated, and all customers in the same customer group are assigned to the same shared vehicle. In a program for causing a computer to execute a shared vehicle operation scheduling algorithm to be assigned, a first step of extracting information on a customer group of an unallocated vehicle from the customer information storage means when a given use request includes a customer group of an unallocated vehicle. If all customers belonging to the unassigned customer group extracted in the first step can be assigned to any of the vehicles, an optimal vehicle among the assignable vehicles is selected based on a schedule evaluation function. Assigns all customers of the customer group to the vehicle, creates an optimal circuit route for the vehicle, and A second step of updating the time, if all of the customers belonging to the unassigned customer group can be assigned by adding and connecting a transfer vehicle to any of the customer-assigned vehicles, a transfer of the additional connection A third step of allocating all the customers to the vehicle and creating a tour route and a tour time of all vehicles including the added transfer vehicle, and a transfer vehicle available and adding a transfer vehicle as necessary If all customers belonging to the unallocated vehicle customer group can be allocated, the fourth step of allocating the shared vehicle or the transfer vehicle and creating a traveling route and a traveling time of the vehicle is provided. Program to do.