JP3959245B2 - Shared vehicle operation scheduling system - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a shared vehicle operation scheduling system suitable for a public transportation system that provides a shared vehicle operation service.
[0002]
[Prior art]
Conventionally, in a shared vehicle operation service, a usage request from a large number of customers is accepted, and on the other hand, taking into account the operational circumstances such as the number of vehicles that can be operated, the work situation of crew members, or road traffic information. On the other hand, an operation schedule such as dispatching a shared vehicle and creating a patrol route was manually performed. In a shared vehicle operation service in which multiple passengers share a boarding / exiting point, there are cases where multiple passengers are connected while moving from the boarding point to the destination point. The creation of has also been done manually.
[0003]
[Problems to be solved by the invention]
The present invention has been made in view of the above circumstances, and an object thereof is to provide a shared vehicle operation scheduling system capable of automatically creating a shared vehicle operation schedule that has been performed manually. It is in.
[0004]
[Means for Solving the Problems]
The shared vehicle operation scheduling system according to the present invention (claim 1) holds at least a use request receiving means for receiving a use request in which a desired boarding point and a desired drop-off point of each customer are specified, and customer information including the use request. The customer information holding means for holding, the operation information holding means for holding operation information including the vehicle information of the shared vehicle, the road network information acquiring means for acquiring and holding the road network information, and at least held by the customer information holding means Customer information, operation information held by the operation information holding means, and road network information held by the road network information acquisition means are input to a predetermined evaluation function, and specified in the use request to optimize the evaluation function. The shared vehicle operation schedule that specifies the route and time of the shared vehicle that travels between the desired boarding point and the desired drop-off point Characterized by comprising the vans fleet schedule creating means for creating a Yuru, and schedule output means for outputting the created the vans vehicle operation schedule, the.
[0005]
The one use request includes a plurality of sets of customers, the plurality of sets of customers are set as one customer group, and the passenger vehicle operation schedule is created so that the customer groups are dispatched to the same passenger vehicle. preferable.
[0006]
In addition, the evaluation function includes a desired boarding time, a desired getting-off time, a minimum travel time between desired boarding points, a boarding time in the vehicle schedule, a boarding time in the vehicle schedule, a boarding time in the vehicle schedule, and an operating cost. It is also possible to include a function that takes at least one of the above as an argument.
[0007]
In addition, the acceptance / rejection of the passenger, the allowable range of deviation between the desired boarding time from the customer and the passenger's boarding time on the riding vehicle operation schedule, the desired departure time from the customer and the customer on the driving vehicle operation schedule The shared vehicle operation schedule may be created so as to satisfy customer constraints including either an allowable range of deviation from the departure time and an allowable range of boarding time.
[0008]
Moreover, you may comprise the means to set the said customer restriction for every said customer or customer group.
[0009]
In addition, a means for registering the available time zone of the shared vehicle as the operation information may be provided, and the shared vehicle operation schedule may be created so that available shared vehicles are allocated according to the time zone.
[0010]
Moreover, you may comprise a means to register the vehicle information of the said shared vehicle which can be utilized for every some provider.
[0011]
In addition, when the passenger restriction cannot be satisfied with only the shared vehicle, the transfer vehicle is dispatched to at least some of the passengers, and the customer is transferred from the transfer vehicle to the transfer vehicle or from the transfer vehicle to the transfer vehicle. You may create the said shared vehicle operation schedule so that restrictions may be satisfied.
[0012]
In addition, the number of transferable vehicles, the number of transferable vehicles, the number of transferable vehicles that can be connected per shared vehicle, the available time of each vehicle, the vehicle capacity, the number of loads that can be loaded, the loadable weight, Alternatively, the shared vehicle operation schedule may be created so as to satisfy the operation constraint including any of the loadable volumes.
[0013]
The shared vehicle operation schedule creation means includes means for executing a first scheduling algorithm for adding a new vehicle based on a determination that there is no assignable vehicle for a customer who has not been dispatched, The first scheduling algorithm includes: a first step of extracting information about a customer who has not been dispatched when the usage request registered in the customer information holding means includes a customer who has not yet dispatched; If it is possible to assign customers who have not been dispatched in one step, the most suitable vehicle among the allocatable vehicles is selected based on the schedule evaluation function, and the customers who have not yet been dispatched are allocated to the vehicle. Can be assigned by creating a new tour route and updating the tour time on that route, and adding and connecting a transfer vehicle to the vehicle being assigned to the customer If there is a customer who has not been dispatched to the transfer vehicle of the additional connection, the third step of creating the circuit route and the tour time of the additional connection vehicle, and the additional connection of the transfer vehicle, If there is a vehicle that can be used other than the currently assigned vehicle, this is added and the unassigned customer is assigned, the vehicle is set as a customer assigned vehicle, and a fourth route for creating a tour route and a tour time of the added vehicle It is good also as a structure which has these.
[0014]
The shared vehicle operation schedule creation means adds a new vehicle to the unassigned customer group based on the determination that there is no assignable vehicle, and all the customers in the same customer group. Means for executing a second scheduling algorithm for allocating to the same shared vehicle, and the second scheduling algorithm is configured such that when the usage request registered in the customer information holding means includes an unassigned customer group A first step of retrieving information relating to the unassigned customer group, and if any customer belonging to the unassigned customer group extracted in the first step can be assigned to any vehicle, The optimum vehicle is selected based on the schedule evaluation function, all the customers in the customer group are assigned to the vehicle, and the vehicle's A second step of creating an appropriate tour route and updating the tour time on that route, and adding all passengers to any of the customer-assigned vehicles and connecting them to all customers belonging to the unassigned customer group Can be assigned to all the additional connected transfer vehicles, and the third step of creating the tour routes and tour times of all the vehicles including the added transfer vehicles, If all the customers belonging to the unassigned customer group can be assigned if a transfer vehicle exists and if necessary, a transfer vehicle or transfer vehicle can be assigned, and the tour route and tour time of the vehicle are created. And a fourth step.
[0015]
The schedule output means may comprise means for outputting the created riding vehicle operation schedule in a tabular format.
[0016]
In addition, a row, a column, or a cell is extracted from the table-style shared vehicle operation schedule according to a specified condition, or a row, a column, or a cell belonging to a specified item is extracted, and each extraction result has a different display form. May be output.
[0017]
The schedule output means may include means for superimposing and outputting the created shared vehicle operation schedule on a map or road network.
[0018]
Further, only information belonging to the designated item may be displayed on the map or road network.
[0019]
The program of the present invention (Claim 16) is a program for causing a computer to execute a shared vehicle operation scheduling algorithm for adding a new vehicle based on a determination that there is no assignable vehicle for a customer who has not been dispatched. In the first step, when a customer who has not been dispatched is included in the given use request, the first step of retrieving information relating to the customer of the unallocated vehicle from the customer information storage means; If the customer can be assigned, the most suitable vehicle among the assignable vehicles is selected based on the schedule evaluation function, the customer who has not been dispatched is assigned to the vehicle, and the optimum patrol route for the vehicle is created. Second step to update the route time on the route, and additional connection if it can be assigned by adding and connecting a transfer vehicle to the customer-assigned vehicle 3rd step of assigning unassigned customers to the transfer vehicle and creating the route and time of the additional connected vehicle, and when the additional connection of the transfer vehicle is not assigned, it is used other than the customer assigned vehicle And adding a non-allocated customer if there is a possible vehicle, making the vehicle a customer-assigned vehicle, and creating a circuit route and a tour time of the additional vehicle, Features.
[0020]
The program of the present invention (Claim 17) adds a new vehicle to an unassigned customer group based on the determination that there is no assignable vehicle, and all the customers in the same customer group. In a program for causing a computer to execute a shared vehicle operation scheduling algorithm that assigns a shared vehicle to the same shared vehicle, if a given use request includes an unassigned customer group, information on the unassigned customer group is stored as customer information A first step to be taken out from the means, and if any of the customers belonging to the unassigned customer group taken out in the first step can be assigned to any vehicle, schedule an optimal vehicle among the assignable vehicles Select based on the evaluation function, assign all customers in the customer group to the vehicle, and create an optimal patrol route for the vehicle. If the second step of updating the traveling time on the route and all the customers belonging to the unassigned customer group can be assigned by adding and connecting a transfer vehicle to any of the passenger-assigned vehicles, For example, a third step of allocating all the passengers to additional transfer vehicles and creating a tour route and a tour time for all vehicles including the added transfer vehicles, and available shared vehicles exist and necessary. If all the customers belonging to the unassigned customer group can be allocated if a transfer vehicle is added accordingly, the fourth step of allocating the shared vehicle or the transfer vehicle and creating the tour route and the tour time of the vehicle; It is characterized by having.
[0021]
Furthermore, either one or both of the desired boarding time and the desired boarding time of each customer may be specified in the use request, and the shared vehicle operation schedule may be created so as to keep the designated boarding time.
[0022]
In addition, the use request may include information on the number of passengers, the number of luggage, the number of infants, passenger approval / rejection, transfer to other transportation facilities, or use of other facilities.
[0023]
Moreover, the structure which creates and preserve | saves a riding together vehicle operation schedule for every combination of the restrictions on the operation side or the restrictions of a customer or a customer group is preferable.
[0024]
In addition, a desired boarding point or a desired drop-off point of the customer described in the use request is searched on a map or a road network, and the point is displayed on the road network based on point information including the latitude, longitude, or point name of the point. It is preferable to provide means for associating with the designated node or automatically obtained node. In association with a node, the customer's personal information includes the point information about the customer's desired boarding point or the desired getting-off point, and the associated incidental information consisting of the moving route or the required travel time between the point and the node. It is preferable to store them together.
[0025]
Further, it is preferable that the personal information of the corresponding customer is called by designating partial information included in the customer personal information such as the customer's name or telephone number. The customer personal information includes service usage record information such as the boarding time and the deviation (customer satisfaction) when using the previous shared vehicle service.
[0026]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, embodiments of the present invention will be described 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 of the present embodiment is a system that accepts a usage request from a customer (user) and creates an optimal shared vehicle operation schedule that meets the usage request.
[0027]
As shown in FIG. 1, the shared vehicle operation scheduling system of this embodiment is a server device that receives a use request for a shared vehicle operation service sent via the Internet, for example, or a use request received from a normal telephone or facsimile (FAX). Use request reception unit 1 consisting of a device that records information based on the customer's name, phone number and address, and service usage such as pick-up / destination when using a shared vehicle operation service in the past and directions to that point Customer database 2 that holds record information, customer request information input by an operator, customer information holding unit 3 that appropriately processes and holds usage request information sent from the server or the like according to the request contents, and shared vehicle operation service Capacity, load capacity, vehicle base, company An operation information holding unit 4 that holds operation information such as vehicle information 5 and crew information (including information such as work status) 6 such as an available date, an available time zone, and an unavailable time zone, and in the road network A road network information acquisition unit 8 that obtains point information such as the location and name of a point, distance between two points, travel time, and road information that is updated according to changes in traffic conditions. ing.
[0028]
In addition, a shared vehicle operation automatic scheduler 7 that automatically creates a shared vehicle operation schedule from the content of information stored in at least the customer information holding unit 3 and the operation information holding unit 4 and the road network information related to the service providing area; The shared vehicle operation schedule created by the shared vehicle operation automatic scheduler 7 is displayed or printed out in a predetermined output form by a display, a printer, or the like, or appropriate information is transmitted to a terminal owned by the customer or a vehicle-mounted terminal. And a shared vehicle operation schedule output unit 9.
[0029]
[Create a shared vehicle operation schedule]
While accepting usage requests from each customer via the telephone, the Internet, etc., while considering the operational circumstances such as the number of vehicles that can be operated, the work status of crew, or road traffic information, in line with the usage requests of many customers, An example of a procedure for creating a shared vehicle operation schedule will be described.
[0030]
[Procedure for creating a shared vehicle operation schedule]
First, the usage request receiving unit 1 receives a usage request from a customer. If necessary, classify received usage requests as appropriate. For example, it is preferable to classify by use desired date, destination point, and boarding point. One usage request may include multiple sets of passengers (so-called passengers) who wish to dispatch to the same shared vehicle even when the boarding point or the departure point is different. Customer group ".
[0031]
Next, the use requests received by the receiving unit 1 and targeted for schedule creation are registered in the customer information holding unit 3 in, for example, a desired boarding time order, a desired getting-off time order, or a usage request acceptance order.
[0032]
Next, the acquisition unit 8 acquires road network information. Such road network information is updated as necessary. This includes, for example, temporary information update due to the occurrence of an accident or traffic jam. The vehicle information 5 and the crew information 6 set in advance and held by the operation information holding unit 4 are also updated as necessary. This includes, for example, information update corresponding to a change in operation status such as the number of shared vehicles available for each schedule creation target day. In some cases, road network information and operation information are the latest and do not need to be updated.
[0033]
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 riding vehicle operation automatic scheduler 7 Create a vehicle operation schedule.
[0034]
"Ride-on vehicle operation schedule"
Here, the shared vehicle operation schedule is information that identifies operation information of a plurality of shared vehicles, that is, a tour point sequence of each vehicle and a tour time to each tour point, which are identified by a schedule management unit on the operation side. For example, when the schedule management unit is set to one day, the shared vehicle operation schedule is information for identifying the traveling point sequence of each vehicle and the traveling time to each traveling point for all vehicles used on a certain operation day. . An example of the shared vehicle operation schedule in this case is shown in FIG. FIG. 2 shows a schedule of a shared vehicle operation for one day. The shared vehicles used on this day are B1 and B2, a transfer vehicle D1 connected to the shared vehicle B1, and a transfer vehicle connected to the shared vehicle B2. D2. For each vehicle, the point ID of the patrol point sequence is shown in the first row in the order of patrol, and the arrival time and departure time at each point and other accompanying information are shown in the following rows. In this schedule, B1 has a loop of point 1 → 5 → 3 (transfer connection with D1) → 10 → 11 (point 10 is the same point and customers 1, 2 and 3 get off at the same time), and at each point Arrival time and departure time are determined. Note that only one of the arrival time and the departure time may be determined.
[0035]
The IDs of passengers getting on and off at each point, the IDs of connected vehicles, the number of people getting on and off, etc. are determined. Here, the traveling train of each vehicle in the shared vehicle operation schedule includes only points where passengers get on and off and vehicles are connected, but in addition to these, passing points between these points, vehicle departure bases, return bases Information on all points where the vehicle circulates such as an interchange may be included. Moreover, the point incidental information of the other information regarding a point (point name, latitude / longitude, parking / non-parking possible, etc.) may be included. The point incidental information is obtained from, for example, the road network information acquisition unit 8 using the point ID as a key. In addition, other information related to passengers (number of luggage, number of infants, etc.) may be included. For example, information about passengers is obtained from the customer database 2 and the customer information holding unit 3 using the customer ID as a key.
[0036]
The shared vehicle operation schedule may have operation information as information for each customer as well as information for each vehicle as described above. That is, the shared vehicle operation schedule may include a data structure that holds customer-accompanying information 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 can also be stored as information for each crew member or vehicle. That is, for each crew member or vehicle, a data line structure for holding a tour train point sequence, a tour time, information on passengers getting on or off or changing, a driving vehicle, and a connected vehicle may be included in the shared vehicle operation schedule. In addition, the schedule management unit is a set of operation date and destination or departure place, or time zone, week, month, and these and destination or departure place, work contents, service area, vehicle type, etc. and so on.
[0037]
Then, the generated shared vehicle operation schedule is output from the output unit 9.
[0038]
The output schedule is notified to passengers and crew. If necessary, change the schedule contents.
[0039]
In creating the schedule, the shared vehicle operation automatic scheduler 7 uses, for example, the following scheduling algorithm (1) to determine the allocation of the shared vehicle and the determination of the circulation route, and further, the allocation and circulation of the transfer vehicle used as an auxiliary. Schedule creation such as route determination is performed automatically.
[0040]
[Scheduling algorithm (1) (steps 1 to 5)]
FIG. 3 is a flowchart showing each step of the scheduling algorithm (1).
[0041]
(Step 1) If a customer who has not been dispatched is included in the use request registered in the customer information holding unit 3, 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.
[0042]
(Step 2) If it is possible to assign an unassigned customer taken out in Step 1 to any vehicle (that is, a vehicle being assigned to a customer or a transfer vehicle connected thereto), the optimum vehicle among the assignable vehicles A vehicle is selected based on the schedule evaluation function, a customer who has not been dispatched is assigned to the vehicle, an optimal tour route for the vehicle is created, the tour time on the route is updated, and the process returns to step 1.
[0043]
(Step 3) Although it is not possible to assign to the vehicle being assigned to the customer or to the transfer vehicle connected thereto, if it is possible to assign by adding a transfer vehicle to the vehicle being assigned to the customer, the transfer vehicle can be added to the additional connection. A customer who has not been dispatched is assigned, a tour route and a tour time of the additional connected vehicle are created, and the process returns to Step 1.
[0044]
(Step 4) If it is not assigned even if it is an additional connection of a transfer vehicle, if there is a vehicle that can be used in addition to the vehicle being assigned to the customer, this is added and an unassigned customer is assigned, and the vehicle is being assigned to the customer The vehicle is set as a vehicle, its traveling route and traveling time are created, and the process returns to Step 1.
[0045]
(Step 5) Return the customer who has not been dispatched to Step 1 as a customer who has not been dispatched but has been dispatched.
[0046]
In this algorithm, a new vehicle is added to a non-allocated customer based on the determination that there is no assignable vehicle. In other words, scheduling is performed so that the number of dispatched vehicles is as small as possible by assigning as many customers as possible to each vehicle.
[0047]
A transfer vehicle is defined as an auxiliary vehicle that is used to prevent excessive dispatch to a high-cost shared vehicle while securing the time advantage of the shared service. The operation of a transfer vehicle involves connection for transfer to a shared vehicle.
[0048]
The vehicle type, dispatch priority, etc. 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, and the capacity, traveling area range, fee, and the like are set in the vehicle information 5. The scheduling of the transfer vehicle will be described later with a specific example.
[0049]
The schedule evaluation function is a function that takes as an argument the deviation between the boarding / alighting time on the schedule and the customer's desired boarding / alighting time, boarding time, or time quality of service, and is set as appropriate on the operation side. A specific example of this function will also be described later.
[0050]
A plurality of sets of customers are included in one usage request, these are handled as a customer group, and the scheduling algorithm (2) shown below is used when creating a schedule for each customer group.
[0051]
[Scheduling algorithm (2) (customer group unit, steps 1 to 5)]
FIG. 4 is a flowchart showing each step of the scheduling algorithm (2).
[0052]
(Step 1) When a customer group that has not been dispatched is included in the use request registered in the customer information holding unit 3, information relating to the customer who has not been dispatched is extracted and the process proceeds to Step 2. If there are no unassigned customer groups, the process ends.
[0053]
(Step 2) If any customer belonging to the unassigned customer group taken out in Step 1 can be assigned to any vehicle (that is, a vehicle being assigned to a customer or a transfer vehicle connected thereto), assignment is possible. The most appropriate vehicle is selected based on the schedule evaluation function, all the customers in the customer group are assigned to it, the optimal tour route for the vehicle is created, and the tour time on the route is updated. Return to Step 1.
[0054]
(Step 3) If all passengers belonging to the unassigned customer group can be assigned by adding and connecting a transfer vehicle to any one of the passenger-assigned vehicles, the unassigned transfer vehicles All the customers are allocated, and the traveling route and the traveling time of all the vehicles including the added riding vehicle are created, and the process returns to Step 1.
[0055]
(Step 4) If there are available shared vehicles and if it is possible to assign all the customers belonging to the unassigned customer group by adding transfer vehicles as necessary, assign these vehicles and assign customers. The middle vehicle is created, and the traveling route and the traveling time of all the vehicles are created, and the process returns to Step 1.
[0056]
(Step 5) A customer group that has not been dispatched is determined to be a customer group that has been dispatched but cannot be dispatched.
[0057]
In this algorithm, all customers in the same customer group are assigned to the same shared vehicle. If a certain usage request is received and includes multiple sets of customers, but it is not always necessary to assign them to the same vehicle from the request, these customers are not treated as customer groups in scheduling, or as customers of different customer groups. It will be handled. In addition, a usage request including only one set of customers is a customer group consisting of one set of customers. As a result, all customers belong to one of the customer groups, and a schedule for each customer group can be created with this algorithm.
[0058]
The algorithm applied is A ^* Known methods such as searching and saving methods can be used. In addition, based on the created shared vehicle operation schedule, this is gradually changed, and an improved method (λ-opt method, tabu search, simulated Annealing, genetic algorithm, etc.) can also be used for improvement. In the improvement method, an evaluation function having an argument or a function form different from the evaluation function used at the time of creating the original schedule can be used. As an improvement method, even if a known method such as that proposed in “Local Search Guidance Method for Delivery Route Problems with Time Frames” (Hiroyuki Okano, 1999 Operations Research Society Autumn Meeting) is applied. Although good, the invention is not limited to a particular improvement.
[0059]
[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 type shared pick-up service (hereinafter referred to as “this service”) for airports is used. explain.
[0060]
For example, the target area of this service is A city, and on the way (from A city to the airport; outbound route), the shared vehicle will pick you up at your designated destination, such as your home or hotel in the city, and other passengers will meet you. After going around and getting on, take the highway from the interchange to the airport. On the way back (from the airport to A city; return route), get on at the airport, get off the highway at the interchange, go around the destinations specified by each customer and drop each customer. In addition, in this service, a transfer vehicle is supplementarily used for the purpose of ensuring the quality of time service for customers and suppressing the cost increase due to the increased number of shared vehicles. For example, a taxi vehicle is used as the transfer vehicle.
[0061]
The flow from acceptance of usage requests in this service to preparation of a shared vehicle operation schedule is as follows.
[0062]
(1) Acceptance of usage requests
On the telephone or the Internet, the customer makes an application for a shared transfer service for the airport, that is, requests for use. An example of the use request content is shown in FIG. The use request shown in FIG. 5 shows one use request, that is, a use application made by one customer. This customer wants to go on the way (from the city to the airport), and is scheduled to use the 11:00 air flight on August 31st, and wants to arrive at the airport at 9:00. . The customers in this usage request form a customer group with three sets, each of which can specify a destination. The customer 1 wishes to pick up at home, and the number of passengers (the number of passengers at the destination) is 2, the number of infants is 0, and the number of luggage is 2. The number of customer groups in this usage request is 6 adults and 1 infant.
[0063]
When a plurality of sets of customers are combined into a customer group in this way, these customers are assigned to the same shared vehicle. If it is not always necessary to assign to the same vehicle, these customers may be customers of three customer groups each consisting of a single set of customers. It is also possible to designate a customer with a certain usage request as the same customer group as a customer with another usage request. This can be realized by assigning a customer group ID to all customers.
[0064]
In the case of a return use request, “Pick-up destination” is “Destination” and “Airport arrival time” is “Airport departure time” in the items of FIG. Further, the desired arrival time at the airport and the desired departure time from the airport may be automatically determined from the use flight time on the operation side. In this example, the number of users is described for each customer, but these may be total only. As the information about the package, the number, type, volume, size, weight, etc. of the package for each customer included in the use request can be described. These may be only the total for all customers in the usage request.
[0065]
In this example, the customer's home or the like is described as the pick-up destination (destination), but the address, latitude / longitude, point name, route from the point of interest such as a station or intersection, etc. are described, and the customer database 2 You may register with. In addition, when using existing road network information in creating a shared vehicle operation schedule, which will be described later, the most suitable node among the nodes that make up the road network is selected automatically or manually to mark the destination of the customer's destination or destination It is also preferable to register the route from this mark in the customer database 2.
[0066]
Although there are a plurality of sets of customers in the usage request, it may be configured to describe whether or not these customers need to be allocated to the same shared vehicle, that is, whether or not these customers need to be combined into a customer group. In addition, it may be possible to describe that a charter is desired without sharing with other customers requesting use.
[0067]
Such usage requests are accepted at any time by telephone, facsimile, or the Internet. In the case of telephone or facsimile, the operator may fill out the slip created based on Fig. 5, and in the case of the Internet, the customer directly selects the boarding point and the getting off point from the 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).
[0068]
Also, it is possible to search for customer information from the customer database 2 using a name, a telephone number, etc. as a search key, and load the destination (destination) and detailed directions to the point from the customer database 2, thereby making it easy to input known information. Can be omitted. Information on customers who have used this service once is added to the customer database 2 and loaded when the service is used next time.
[0069]
In this service, a large number of usage requests as shown in FIG. 5 are received, sorted by usage date, and closed on the day before the usage date, for example.
[0070]
(2) Registration of usage request
When the schedule is created on the day before the use date, for example, a use request whose use date is August 31 as shown in FIG. Register in order or use request acceptance order and create a schedule on August 30th.
[0071]
(3) Updating road network information
The road network information is updated when a certain road is closed during a certain time zone on the day of use (August 31 in this example) or when a traffic jam occurs due to rain.
[0072]
(4) Updating operation information
This is done when it is necessary to update the operation information about crew members who can engage in this service on the day of use and available passenger vehicles.
[0073]
[Vehicle information contents]
・ Individual vehicle information: vehicle type, capacity, number of loads, volume, weight, etc.
-Daily usage information for each vehicle: Service usage time zone, other business usage time zone, repair information, vehicle inspection information, fuel information, etc.
・ Monthly and weekly usage information for each vehicle and past usage results: mileage, travel time
・ All vehicle usage information: average value and variance of travel time and distance
・ Vehicle information when multiple companies can register available vehicles: In addition to the above items, affiliation, etc.
[Contents of crew information]
・ Crew's personal information: name, wage, etc.
・ Daily work information for each crew member: Working hours of this service, working hours of other duties, vacation, sales, etc.
・ Monthly and weekly work information for each crew member: Working hours, operating hours, sales, vacation, etc.
・ Work information for all crew members: average and variance of working hours and operating hours
・ Crew information when multiple companies can register available vehicles: In addition to the above items, affiliation, etc.
(5) Creating a shared vehicle operation schedule
Based on the usage request held in the customer information holding unit 3, the operation information held in the operation information holding unit 4, and the road network information held in the road network information acquisition unit 8, the shared vehicle operation automatic scheduler 7 For example, using the scheduling algorithm (2) described above, based on the evaluation function of the schedule, to meet the customer's wishes as much as possible and to reduce the operation cost, and to use restrictions and operational restrictions described later Automatically create a schedule to meet the conditions. For customers who have used this service before, past usage records such as service quality are registered in the customer database 2 and used when creating a schedule.
[0074]
As post-processing, operation information, customer information, and the like are updated in accordance with the contents of the created schedule.
[0075]
[Vehicle / customer allocation method]
In this example, there is a customer who goes to the airport (from the airport to the airport) and a customer who goes back (from the airport to the city), but in scheduling, the schedule is created while simultaneously allocating the customers who go and return to the vehicle. There is a way to create separate schedules for outbound and return customers and later assign them to vehicles.
[0076]
In the former case, for example, in the scheduling algorithm (2) described above, when the customer and the returning customer are registered in the customer information holding unit 3 and the customer taken out from the customer is the going customer, A schedule is created by optimally assigning to the schedule of the trip, and in the case of a return customer, by optimally assigning to the schedule of returning the vehicle. In the latter case, first, only the outgoing customers are taken out from the customer information holding unit 3 and scheduling is performed. Then, only the returning customers are scheduled, and each operation of going and returning is assigned to the vehicle.
[0077]
If a single vehicle is assigned to the outbound and return trips, it is appropriate for loading and unloading and crew rest between the arrival time at the airport and the departure time for the return trip. The allocation is made so as to keep the time constraint such as taking a long time interval. Furthermore, when assigning not only one round trip for the outbound / return trip but also two or more round trips, the assignment is automatically performed so as to keep the same time constraint.
[0078]
In addition, refer to the weekly and monthly vehicle travel distance and travel time obtained from the operation information holding unit 4 to average these items between vehicles, and if any restrictions are set for each item, observe them. Automatically assign vehicles so that.
[0079]
[Schedule evaluation function]
The shared vehicle operation automatic scheduler 7 schedules each passenger's desired boarding time, desired getting-off time, each customer's boarding time, getting-off time, operating cost in an automatically created schedule, or a function having these functions as arguments. As an evaluation function, 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 is the desired airport departure time for return (from the airport to the destination)
-Desired getting off time: DTDi
Here is the desired arrival time at the airport for going (from pick-up to the airport)
・ Boarding time in Schedule S: ATOi (S)
-Getting off time in Schedule S: ATDi (S)
・ Minimum travel time between boarding point and getting off point: MinTi
And 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, on the way home, the desired drop-off time, that is, the desired feed time DTDi is automatically set as DTDi = DTOi + MinTi.
[0080]
In the service for airports, scheduling is performed so that the departure time on the schedule, that is, the airport arrival time ATDi, is the same as the desired departure time, that is, the airport arrival time DTDi, in the case of going due to the relationship with the flight arrival and departure times. Is called. In the case of return, similarly, scheduling is performed so that ATOi becomes DTOi and subsequent. These are realized by setting customer constraints described later.
[0081]
If the service is provided to each customer i according to the desired boarding / alighting time, the best service equivalent to taxi pick-up will be provided in time, and the service time in that case will be the MinTi. However, there is a detour to another passenger's boarding / exiting point for riding, and there is a balance with the other passenger's desired boarding / exiting time. Deviation from the service. The ratio of the service time to the customer including the deviation from the desired time and the increase in boarding time due to detours to the maximum service time MinTi can be used as the argument of the evaluation function. The service time ratio quantifies the time inconvenience of each customer. In the case of airport service, the service time ratio SRi (S) of customer i in schedule S is
・ SRi (S) = (DTDi-ATOi (S)) / MinTi (if customer i is an outbound customer) or
SRi (S) = (ATDi (S) -DTOi) / MinTi (if customer i is a returning customer)
And the evaluation function F of the schedule S is, for example,
F = ΣSRi (S) ² (Σ is the sum related to customers)
And
[0082]
In addition to this, the evaluation function can also take as an argument the difference between the desired boarding time and the boarding time on the schedule, such as the difference between the desired boarding time and the boarding time DTOi-ATOi (S). Further, special customers such as customers, customers who suffered disadvantages at the time of previous use, etc. can be favored by setting a large weight as a function of customer information in the evaluation function. In addition, it is also possible to use the operating side cost such as the number of shared vehicles and transfer vehicles in the schedule, the travel distance, the fuel cost or the labor cost, etc. as an argument. You can also change the function form even with the same arguments.
[0083]
[Examples of customer constraint items]
It is possible to create a shared vehicle operation schedule in which the quality of service is guaranteed by providing customer restrictions for the following items and performing dispatching and routing so as to observe these restrictions.
[0084]
-Deviation time from desired time
The upper limit of the deviation from the desired time of the boarding time and the getting-off time in the schedule S can be set as a restriction. For example,
EO, DO: Upper limit of early deviation and backward deviation from the desired boarding time
ED, DD: Upper limit of early deviation and later deviation from desired departure time
, The boarding time ATOi (S) and the getting-off time ATDi (S) of each customer i in the schedule S
DTOi-EO <ATOi (S) <DTOi + DO
DTDi-ED <ATDi (S) <DTDi + DD
Scheduling can be performed to satisfy 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 have suffered inconvenience or disadvantage during the previous use of this service, customers who have applied for usage early, customers who paid special charges, etc. You can also. It is also possible to specify these upper limit values from the customer. Further, as a restriction, not only the upper limit of the deviation time but also the earliest or latest boarding / alighting time allowable by the customer can be set.
[0085]
·Ride time
The boarding time Ti (S) of each customer i in the schedule S = ATDi (S) −ATOi (S), or the ratio Ti (S) / MinTi (S) between the boarding time and the minimum travel time MinTi (S). On the other hand, an upper limit value can be set as a constraint. These upper limit values can be set for each customer or customer group. It is also possible to specify an upper limit from the customer.
[0086]
・ Service time ratio
An upper limit value can be set as a constraint on the service time ratio SRi (S). This upper limit can be set for each customer or customer group. It is also possible to specify an upper limit from the customer.
[0087]
・ Number of transfers
You can specify an upper limit for the number of transfers you can accept. If you do not wish to transfer, you can set it to 0.
[0088]
・ Passenger approval / disapproval
If the customer refuses to ride and wishes to occupy the shared vehicle, scheduling can be performed with restrictions so as not to ride with other customers.
[0089]
[Examples of operational constraint items]
For example, it is possible to create a shared vehicle operation schedule that can be operated within the range of resources owned by the operation side by setting the following items as operation constraints and performing allocation and routing so that these restrictions are observed in the scheduling It is.
[0090]
・ Ride-on vehicle restrictions
Maximum number of vehicles dispatched
Upper limit of capacity, number of luggage, luggage volume, luggage weight, number of connectable vehicles, etc.
Available hours: Vehicles cannot be dispatched to this service during usage hours for other services.
[0091]
・ Transfer vehicle restrictions
Maximum number of vehicles dispatched
Upper limit of each vehicle's capacity, number of luggage, luggage volume, luggage weight, (number of transferable vehicles), mileage, running time, number of transfers, etc.
Available hours: Vehicles cannot be dispatched to this service during usage hours for other services.
[0092]
・ Crew restrictions
Number of crew
Work schedule, vacation schedule: Cannot be assigned during work hours or on vacation days.
[0093]
Working hours, operating hours, break times, operating distances, upper and lower limits
[Connection of transfer vehicle]
Since there are restrictions on the number of vehicles that can be used, there are passengers who cannot be dispatched depending on the distribution of boarding points and time constraints. For example, if there are multiple passengers with the same desired arrival time at the airport and the boarding location of one of the passengers is isolated in location, a large detour will occur when visiting this customer's boarding location, resulting in time constraints. It becomes impossible to protect. Vehicle dispatch is possible if the time constraints are relaxed, but it is not desirable to reduce the quality of time service. Even if there is a surplus in the number of available shared vehicles, in this service, shared vehicles are expensive due to airport tolls and fuel costs, etc. Go down. In this case, using a regular taxi as a transfer vehicle, ensuring time service quality and cost by transferring from a transfer vehicle to a transfer vehicle at an appropriate point in the city, or changing from a transfer vehicle to a transfer vehicle. Can be suppressed. In this case, the transfer vehicle is only run in the city, and the cost is lower than when a shared vehicle is newly allocated. In the example of FIG. 6, there are customers 1 to 4, and among the boarding points (1) to (4), (4) is isolated. In this case, the customer 4 is picked up by a transfer vehicle, and is transferred to a shared vehicle at a transfer point D.
[0094]
The shared vehicle operation automatic scheduler 7 performs scheduling so that the transfer vehicle can be changed in position and time. For example, in this service, a node on a designated road network such as an intersection on a patrol route of a shared vehicle to be transferred or a highway interchange is set as a transfer point, and each point assigned to a transfer vehicle is set as a start point or an end point. A patrol route that patrols the passenger boarding / exiting points is created, and the patrol time is determined along this route. At this time, it is checked whether the traveling time to each point is within the customer restriction range. Also, if there is an upper limit on the travel distance or travel time of the transfer vehicle as an operational constraint, this is also checked. In addition, the transfer point is selected from a plurality of points that satisfy customer restrictions so that the travel distance of the transfer vehicle is shortened.
[0095]
Since frequent use of transfer vehicles to increase the quality of time service leads to an increase in cost, it is desirable from the viewpoint of operation costs that the number of dispatched vehicles is small even when transfer vehicles are used. For this reason, when the scheduling algorithm (1) or (2) of the shared vehicle described above is used, in the vehicle allocation in step 3 of both algorithms, by assigning the least number of transfer vehicles to be additionally connected, the number of transfer vehicles can be allocated. Try to minimize as much as possible. Moreover, you may provide an upper limit in the number of transfer vehicles connected per riding vehicle.
[0096]
The transfer may be performed a plurality of times for each customer, and scheduling may be performed so as to transfer from the transfer vehicle to the transfer vehicle. In this case, an upper limit of the number of transfers for each customer is set as a customer constraint or operational constraint, and scheduling is performed so as to protect this.
[0097]
[Crew assignment]
・ Working hours, operating hours, operating distances, sales, etc. of crew members on the day of use or the week or month included in the day of use
・ Work schedule of crew on the day of use, such as other work engagement, vacation schedule, etc.
・ Crew nomination from passengers
By obtaining information about the items such as the operation information holding unit 4 and the customer information holding unit 3, these items meet the operational purpose such as averaging between crew members and satisfy the operational constraints such as the longest working hours. So that the crew can be assigned automatically. After assignment is determined, the operation information such as crew working hours is automatically updated according to the contents.
[0098]
[Changes to customer constraints and operational constraints]
When there are customers who cannot be dispatched due to customer constraints or operational constraints, scheduling is performed with some of these constraints relaxed. For example, after negotiating with the passenger, increase the upper limit of the deviation from the desired boarding time, which is one of the customer restrictions, or change the crew's vacation schedule, which is one of the operational restrictions, after negotiating with the crew The rescheduling is performed by increasing the upper limit of the number of transferable vehicles that can be connected per shared vehicle for all or some shared vehicles.
[0099]
Further, scheduling is performed for each of a plurality of combinations of such change methods, and the created shared vehicle operation schedules are stored. Each stored vehicle operating schedule can be called at any time and displayed in a table format or a map format described below.
[0100]
[Examples of shared vehicle operation schedule output and display]
FIG. 7 shows an output / display example of the created shared 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, the vehicle's tour route is displayed, and the visit point on each trip route, the visit time to each point, and the number of passengers at that point are displayed in the order of the tour.
[0101]
In the example of FIG. 7, the vehicle 1 gets on both the way back and forth, the vehicle 2 only goes on the way, and the vehicle 3 gets on only the way back. The last section shows the total number of passengers and sales for each trip. In addition, the name and the number of luggage of passengers getting on and off at each point, the boarding rate of each vehicle, the departure / return time of the vehicle base, the operation time, etc. may be displayed.
[0102]
In addition, weekly or monthly sales or operating hours of each crew member held in the operation information may be displayed. In addition, the total number of passengers and sales, travel distance, travel time, etc., or the average boarding rate, average travel distance, average travel time, etc. of the corresponding day, week, or month of all vehicles may be displayed. In addition, when a passenger, crew member, or vehicle number is specified, only the row related to the vehicle on which the passenger or crew member is boarded or only the related cell is displayed, or the display format is changed such as changing the display color. Operation results, vehicle driving results, and the like may be displayed in a separate window in a table format.
[0103]
Further, only information related to the customer such as the boarding time and the getting-off time may be displayed on the terminal owned by the customer. Only information related to the vehicle, for example, only the row of the vehicle in FIG. 7 may be displayed on the terminal mounted on the vehicle.
[0104]
[Example of output / display on map]
FIG. 9 shows an output / display example of the shared vehicle operation schedule in a map format. The display schedule is the same as that in FIG. In this example, the destination of each customer is indicated by a circle and the destination is indicated by a square, and these destinations are connected by arrows to display the traveling route of each vehicle. Information about boarding and getting off at each point is displayed in the rectangular frame of the destination and destination. The display contents in the rectangular frame are a vehicle number (number in a circle), a tour time, and the number of people getting on and off. The point name, customer name, and number of packages may be displayed in this frame. In addition, in the oval frame indicating the airport point, the vehicle number (number in circle) of each vehicle, the airport arrival time or airport departure time, and the number of people getting on and off are displayed. The sales of each vehicle may be displayed in this frame. Furthermore, the departure / return time and operation time of the vehicle base of each vehicle may be displayed. In another window, the total number of passengers, sales, travel distance, travel time, etc. of all vehicles, or the average boarding rate, average travel distance, average travel time, etc. may be displayed. In addition, when a passenger, crew member, or vehicle number is specified, only the route and boarding point information related to the vehicle on which the passenger or crew member has boarded is displayed on the map, or the display color is changed and displayed in a separate window in a table format. It is also preferable to change the display format. Further, only the traveling route and information related to the vehicle may be displayed on the terminal mounted on the vehicle.
[0105]
According to the above-described embodiment, in the shared vehicle operation service, a large number of usage requests are received by telephone, facsimile (FAX), the Internet, a mobile phone, etc., and the operation information such as the usage request contents, the number of vehicles, the crew work status, etc. Based on the road network information including traffic conditions and traffic conditions, it is possible to automatically create a shared vehicle operation schedule that satisfies various constraints, meets the user's request as much as possible, and reduces operation costs as much as possible. The created shared vehicle operation schedule can be output and displayed in a preferable form such as a table form or a map form.
[0106]
The present invention is not limited to the above-described embodiment, and can be implemented with various modifications.
[0107]
【The invention's effect】
As described above, according to the present invention, it is possible to provide a shared vehicle operation scheduling system that automatically creates a shared vehicle operation schedule.
[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 data structure of a shared vehicle operation schedule to be created
FIG. 3 is a flowchart showing each step of the scheduling algorithm (1).
FIG. 4 is a flowchart showing each step of the scheduling algorithm (2).
FIG. 5 is a diagram showing an example of a usage request
FIG. 6 is a diagram for explaining connection of a transfer vehicle
FIG. 7 is a diagram showing an output / display example in a tabular format of a shared vehicle operation schedule
FIG. 8 is a diagram showing an example in which a crew member's operation results and vehicle driving results are displayed in a separate window in a table format.
FIG. 9 is a diagram showing an output / display example of a shared vehicle operation schedule in a map format;
[Explanation of symbols]
1 ... Usage request reception part
2 ... Customer database
3 ... Customer information holding part
4. Operation information holding unit
5 ... Vehicle information
6 ... Crew information
7 ... Automatic vehicle operation scheduler
8 ... Road network information acquisition part
9 ... Riding vehicle operation schedule output section

Claims (2)

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 passenger vehicle;
Road network information acquisition means for acquiring and holding road network information;
At least customer information held by the customer information holding means, operation information held by the operation information holding means, and road network information held by the road network information acquisition means are input to a predetermined evaluation function, and the evaluation function is optimized. A shared vehicle operation schedule creating means for creating a shared vehicle operation schedule that specifies a tour route and a tour time of the shared vehicle that circulates between the desired boarding point and the desired drop-off point specified in the usage request;
One use request includes a plurality of sets of customers, and the plurality of sets of customers is defined as one customer group. For each customer of the customer group, the approval / disapproval of the ride, the desired ride time from the customer and the ride vehicle operation schedule Any of the allowable range of deviation from the passenger's boarding time at the passenger, the allowable range of deviation between the desired getting-off time from the customer and the passenger's getting-off time on the shared vehicle operation schedule, and the allowable range of boarding time Means for setting customer constraints including
A schedule output means for outputting the created shared vehicle operation schedule , and
The shared vehicle operation schedule creation means creates the shared vehicle operation schedule so that the customer group satisfies the customer constraint and the customer group is dispatched to the same shared vehicle, and the passenger vehicle alone cannot satisfy the customer constraint. In this case, the transfer vehicle operation schedule is arranged so that a transfer vehicle is allocated to at least a part of the customers of the customer group, and the customer restriction is satisfied by transfer from the transfer vehicle to the transfer vehicle, or transfer from the transfer vehicle to the transfer vehicle. A shared vehicle operation scheduling system characterized by creating a vehicle. 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 passenger vehicle;
Road network information acquisition means for acquiring and holding road network information;
At least customer information held by the customer information holding means, operation information held by the operation information holding means, and road network information held by the road network information acquisition means are input to a predetermined evaluation function, and the evaluation function is optimized. A shared vehicle operation schedule creating means for creating a shared vehicle operation schedule that specifies a tour route and a tour time of the shared vehicle that circulates between the desired boarding point and the desired drop-off point specified in the usage request;
A schedule output means for outputting the created shared vehicle operation schedule , and
One usage request includes a plurality of sets of customers, and the plurality of sets of customers is defined as one customer group
The shared vehicle operation schedule creation means includes:
Execute a scheduling algorithm that adds new vehicles to unassigned customer groups based on the determination that there are no assignable vehicles, and assigns all customers in the same customer group to the same shared vehicle Means to do,
A first means for retrieving information on a customer group that has not been dispatched when a customer group that has not been dispatched is included in the use request registered in the customer information holding means;
If all the customers belonging to the unassigned customer group extracted by the first means can be assigned to any vehicle, the optimal vehicle among the assignable vehicles is selected based on the schedule evaluation function, A second means for allocating all customers of the customer group to the vehicle, creating an optimal tour route for the vehicle, and updating a tour time on the route;
If said possible assign all customers belonging to the customer Group of the non dispatch by adding a transfer vehicle to one of the customer-assigned vehicle connected, the all customers to transfer vehicles additional connection A third means for creating a tour route and tour time of all vehicles including the assigned and added transfer vehicles;
If there is an available shared vehicle and if it is possible to assign all the customers belonging to the unassigned customer group if a transfer vehicle is added as necessary, assign the shared vehicle or the transfer vehicle and And a fourth means for creating a route and a tour time .

Images