KR20200076653A - Method and Server for compulsive allocation of car - Google Patents

Abstract

According to a preferred embodiment of the present invention, a vehicle allocation optimization method in a forced vehicle allocation server comprises the following steps of: receiving information on business end time of each driver; and receiving at least one predicted driving route including departure and destination information from at least one passenger and considering remaining business hours and return time to a garage of each driver to forcibly allocate each of the received predicted driving routes to each of at least one waiting driver. Therefore, a problem caused by a driver refusing to take passengers can be prevented.

Description

{Method and Server for compulsive allocation of car}

The present invention relates to a method for forcibly distributing a vehicle to provide a transportation service. More specifically, when a vehicle is forcibly distributed, it relates to a method of optimizing the allocation.

In general, in order to use the transportation service, the user calls a taxi in the state of tolerance on the road, or rides a taxi, which is a tolerance, through the call center.

The call center, upon request of the user, checks the user's location or place of departure and arrival, and provides the user's information to terminals installed in a number of taxis through a communication network. The taxi driver refers to the information of the user output to the terminal, delivers the intention to provide the service to the call center, and then moves to the location or departure point of the user.

Recently, a method of calling a taxi by transmitting information about a user's location or origin and destination to a server through a mobile/portable terminal possessed by a user has been studied.

KR 2008-0078927

The present invention is characterized in that it is possible to prevent information about the closing time of the business, the garage notice, and forcibly distributing it in consideration of this, thereby preventing the article from being rejected

As a preferred embodiment of the present invention, the compulsory distribution server includes a first receiving unit for receiving information about the closing time of each article; A second receiving unit for receiving at least one dispatch request including departure and destination information from at least one passenger; and a return distance calculating unit for calculating a distance between the destination included in the dispatch request and the garage of each driver; A moving distance calculator that calculates a distance between a departure point included in the dispatch request and the current location of each article; a driving distance calculator that calculates a driving distance required to operate the dispatch request; Consider the operating time and the remaining business hours of each article based on at least one of the distance calculated by the return distance calculation unit, the distance calculated by the moving distance calculation unit, and the driving distance calculated by the driving distance calculation unit And a distribution unit forcibly distributing each of the distribution requests received from the second reception unit to each of at least one driver waiting therein, wherein the distribution unit includes the distance calculated by the return distance calculation unit and the moving distance calculation unit. Forcibly distributing the dispatch request to a waiting driver only when the time to move the total distance including both the calculated distance and the calculated driving distance from the driving distance calculation unit is less than the remaining business hours of each article. It is characterized by.

As a preferred embodiment of the present invention, the distribution unit is characterized in that forcibly distributing the distribution request to the waiting driver in the order of a short distance calculated by the return distance calculation unit.

As another preferred embodiment of the present invention, the method of optimizing the distribution in the forced distribution server includes receiving information about the closing time of each article; And at least one driver requesting at least one dispatch request including departure and destination information from at least one passenger, and waiting for each of the received dispatch requests in consideration of the remaining business hours and return time to the garage of each article. It is characterized in that it comprises a; forcibly assigned to each step.

In a preferred embodiment of the present invention, the step of forcibly distributing includes the remaining business hours t ₁ of each article and the estimated operating time t _{2 to} destinations in the dispatch request and the destinations within the dispatch request to the garages of each article. It is characterized in that the allocation is performed based on the threshold time, which is the difference value t ₁ -(t ₂ +t ₃ ) of the sum of the return times t ₃ of. In this case, the estimated travel time t ₂ is characterized in that it includes a travel time t _{2 travel} from the current location of each article to a departure point in the dispatch request and a travel time t _{2 travel} required to operate the dispatch request.

As a preferred embodiment of the present invention, the step of forcibly distributing is characterized in that the distributing is forcibly distributed to the driver only when the limit time is 0 or more.

As a preferred embodiment of the present invention, the step of forcibly distributing to an article waiting for a dispatch request having the limit time equal to or greater than 0 when the return time t ₃ is small when there are multiple allocation requests having the limit time equal to or greater than 0. It is characterized by being distributed.

As a preferred embodiment of the present invention, the step of forcibly distributing is characterized in that when there are a plurality of allocation requests having the limit time equal to or greater than 0, the limit time is close to 0, in order of allocation to the waiting articles.

As another preferred embodiment of the present invention, the compulsory distribution server includes a first receiving unit for receiving information on the closing time of each article; A second receiving unit for receiving at least one dispatch request including departure and destination information from at least one passenger; and at least waiting for each of the received dispatch routes in consideration of the remaining business hours of each article and the return time to the garage. Characterized in that it comprises a; distribution unit forcibly distributed to each of the one article.

As a preferred embodiment of the present invention, the distribution unit forcibly performs distribution by selecting at least one criterion among a return time, a limit time, or a travel time according to a priority policy, and the return time reaches the destination of the driver. It is characterized in that the time required to return to the garage afterwards, the travel time is the time it takes for the driver to reach the departure point, and the limit time is the sum of the travel time and the time it takes to drive the dispatch request and the return time. do.

As a preferred embodiment of the present invention, the method of optimizing the distribution in the forced distribution server has an effect of solving the inconvenience that may occur because the articles cannot reject the expected operation route forcibly distributed. In addition, if the driver's opening hours are short, he considers the time to return to the garage, and has the effect of increasing the efficiency of the driver's operation by arranging the optimal estimated route.

1 is a preferred embodiment of the present invention, showing a forced distribution system diagram providing a distribution optimization method.
2 is a preferred embodiment of the present invention, showing a configuration diagram of the forced distribution server.
3 to 4 is an exemplary embodiment of the present invention, and shows an example of calculating the travel time, the running time, the return time and the limit time in order to determine the forcible dispatch according to the priority in the forced dispatch server.
5 to 7 is a preferred embodiment of the present invention, shows an example of performing a distribution optimization method in a forced distribution server.
8 is a preferred embodiment of the present invention, showing a flow chart for performing distribution optimization in the forced distribution server.
9 is a preferred embodiment of the present invention, showing a flow chart for performing a forced distribution in the distribution unit.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art to which the present invention pertains may easily practice. However, the present invention can be implemented in many different forms and is not limited to the embodiments described herein. In addition, in order to clearly describe the present invention in the drawings, parts irrelevant to the description are omitted, and like reference numerals are assigned to similar parts throughout the specification.

Throughout the specification, when a part is "connected" to another part, this includes not only "directly connected" but also "electrically connected" with other elements in between. . Also, when a part “includes” a certain component, this means that other components may be further included, rather than excluding other components, unless otherwise specified.

1 is a preferred embodiment of the present invention, showing a forced distribution system diagram providing a distribution optimization method.

The forced distribution system illustrated in FIG. 1 includes a forced distribution server 120, an article information management server 122, at least one terminal 100, 101, 102 used by at least one passenger, and an article of a vehicle providing a driving service. It includes at least one terminal (110, 111, 112) to use.

The article information management server 122 manages the identity information of the article contracted with the service company, the vehicle information used by the article, and at least one terminal 110, 111, 112 used by the article. The article information management server 122 also manages the driving service contract between the service company and the engineer who has an employment contract. The driving service contract includes the name of the driver, the driver's identification information, the driver's contact information, the vehicle information used by the driver, the time the driver rented the vehicle, and the time the driver returned the vehicle.

In a preferred embodiment of the present invention, when a vehicle rental is requested from the forced distribution server 120 to the driver information management server 122, the driver information driver server 122 automatically assigns a driver or driver list. The compulsory distribution server 120 and the driver information management server 122 set a vehicle rental contract period from the time when the rental vehicle is assigned to the time when the journey for transporting the user is completed and returned to the garage.

The compulsory dispatch server 120 requests a dispatch command from the article information management server 122 when there is a request for compulsory dispatch service from at least one terminal (100, 101, 102) used by at least one passenger, and the article information management server (122) transmits the article or article list to the forcible distribution server (120). Thereafter, communication may be performed between at least one terminal (100, 101, 102) used by at least one passenger and at least one terminal (110, 111, 112) used by a driver of the vehicle.

For example, when the first user terminal 100 requests dispatch, the forcible dispatch server 120 makes a dispatch request to the article information management server 122, and the article information management server 122 is a driver or driving The article list information is transmitted to the forcible distribution server 120. The compulsory dispatch server 120 allocates the optimized driver to the first user terminal 100 among the received driver or driver list information.

The first driver terminal 110 may be interpreted as directly receiving a vehicle dispatching instruction from the forcible dispatching server 120 from the bar shown in FIG. 1, but this is an operating subject and a driver of the forcible dispatching server 120. Does not mean to have a direct contract relationship. That is, the vehicle rental company, which is the operation subject of the forced distribution server 120, does not directly hire a driver, but enters into a service contract with a service provider, and forcibly distributes the delivery information to a driver hired by the service provider. The platform may be operated through the server 120 and communication with the article information management server 122 may be performed. That is, a driver hired by a service company may receive a dispatch instruction from the forcible distribution server 120 or the driver information management server 122 using the driver terminal 110 even if there is no direct employment relationship with the vehicle rental company. At this time, the driver hired by the service company may include not only a general employee, but also a personal service provider or a passenger service provider. On the other hand, in another embodiment of the present invention, it is possible that the car rental company and the driver have a direct employment relationship.

An example of at least one terminal (100, 101, 102) used by a passenger and at least one terminal (110, 111, 112) used by a driver of a vehicle includes a terminal capable of installing an application. Terminals 110, 111, and 112 are 3G, 4G, 5G terminals, smart phones, smart pads, tablet PCs, personal communication systems (PCSs), and global systems for GSM Mobile communications (PDC), Personal Digital Cellular (PDC), Personal Handyphone System (PHS), Personal Digital Assistant (PDA), International Mobile Telecommunication (IMT)-2000, Code Division Multiple Access (CDMA)-2000, W-CDMA (W- It may include all kinds of wireless communication devices, such as Code Division Multiple Access (Wireless Broadband Internet), Wibro (Wireless Broadband Internet), handheld devices, and wearable devices.

The terminal is a camera or video input unit for inputting a video signal, a microphone for inputting an audio signal, or an audio input unit, a user input unit for receiving information from a user, for example, a touch key, a push key ( mechanical key). The voice data or image data collected by the input unit can be analyzed and processed as a control command of the passenger. The terminal may also include a sensing unit. The sensing unit may include one or more sensors for sensing at least one of information in the mobile terminal, surrounding environment information surrounding the mobile terminal, and user information. For example, the sensing unit is a proximity sensor, an illumination sensor, a touch sensor, an acceleration sensor, a magnetic sensor, a G-sensor, a gyro Scope sensor (gyroscope sensor), motion sensor (motion sensor), RGB sensor, infrared sensor (IR sensor: infrared sensor), fingerprint sensor (finger scan sensor), ultrasonic sensor (ultrasonic sensor), optical sensor (optical sensor), eg For example, cameras, microphones, battery gauges, environmental sensors (e.g. barometers, hygrometers, thermometers, radioactivity sensors, heat sensors, gas sensors, etc.), chemical sensors (e.g. For example, an electronic nose, a health care sensor, a biometric sensor, and the like). In addition, the terminal further includes a GPS sensor. Meanwhile, the mobile terminal disclosed in the present specification may combine and use information sensed by at least two or more of these sensors.

As a preferred embodiment of the present invention, a vehicle that provides a driving service includes various types of vehicles, rental cars, taxis, and the like, and may further include a car rental form for which an article is arranged. As a preferred embodiment of the present invention, the operation service means a service for moving a passenger from a departure point to a destination. As another preferred embodiment of the present invention, the driver includes a driver driving a vehicle, a driver having an employment contract with a service company, and a driver providing a ride service by renting a car from the service company. As a preferred embodiment of the present invention, the forced delivery system checks the location or departure and destination of the passenger in the forced delivery server 120 when there is a request for delivery from at least one passenger, and provides a service through a communication network The vehicle is forcibly assigned to the terminal 110, 111, 112 of the driver of the vehicle.

When the dispatcher server 120 receives the dispatcher request including the origin and destination requested by the passenger, the dispatcher forcibly dispatches the dispatcher request to the driver waiting for the passenger regardless of the intention of the driver providing the service. Reliable service can be provided without harm. However, in the case of a driver, there is a problem that a service may be provided in excess of one's own business end time when operating a dispatch route corresponding to a dispatch request forcibly dispatched.

In one preferred embodiment of the present invention, in order to solve such a problem that may occur to an article, a description will be given of a method of optimizing allocation considering the closing time of each article.

Figure 2 is a preferred embodiment of the present invention, showing the internal configuration of the forced distribution server to perform the distribution optimization in consideration of the article's business end time.

The compulsory allocation server 200 includes a first receiving unit 210, a second receiving unit 220, a return distance calculating unit 230, a moving distance calculating unit 240, a driving distance calculating unit 250, and a dispatching unit 260. It includes. The distribution unit 260 further includes a time limit determination unit 270. For understanding, it will be described with reference to FIGS. 5 to 7 further.

The first reception unit 210 receives information about the closing time of each article from the article information management server 122 shown in FIG. 1. Each article can set the business hours section and business hours according to the contract point or terms. The first reception unit 210 may receive information on the closing time of each article and grasp the remaining business hours for each article. The first receiving unit 210 may also receive garage information of each article. 5 to 7, it can be seen that the garage of the first article is Suseo Station 540, the garage of the second article is Sadang Station 640, and the garage of the third article is Seoul National University Station 740.

Garage information of each article collected by the first receiving unit 210 may be used to calculate return times (S530, S630, S730) for each driver to get off at the destination and return to the garage.

The second reception unit 220 receives at least one dispatch request including departure and destination information from at least one passenger. Passengers can provide information about their origin and destination through their own terminal. The compulsory dispatch server 200 may also receive a dispatch request designated by the passenger from among various driving routes in the origin and the destination in addition to the origin and destination information from the passenger.

The return distance calculator 230 calculates the return distance between the destination included in the dispatch request received from the passenger and the garage of each driver (S530, S630, S730).

The moving distance calculator 240 calculates the distance between the starting point included in the dispatch request and the current location of each article (S510, S610, S710). The current location of each article can be identified using GPS information. In addition, it includes all of the general methods of grasping the current location of articles that are obvious to those of ordinary skill in the art.

The driving distance calculating unit 250 calculates the driving distance required to operate the dispatch request (S520, S620, S720).

The dispatcher 260 includes the return distances calculated by the return distance calculator 230 (S530, S630, S730), the travel distances calculated by the travel distance calculator 240 (S510, S610, S710) and the travel distance calculator Considering the estimated total travel time (560, 660, 760) and the remaining business hours of each article based on at least one of the calculated driving distances (250) in S520, S620, and S720, It is implemented to forcibly arrange the corresponding dispatch route.

As a preferred embodiment of the present invention, the dispatcher 260 further includes a time limit determining unit 270. The limit time determination unit 270 includes all of the return distance calculated by the return distance calculator 230, the travel distance calculated by the travel distance calculator 240, and the travel distance calculated by the travel distance calculator 250. It is determined whether the total estimated travel time (560, 660, 760) of moving the total distance is less than the remaining business hours of each article. The limit time determining unit 270 forcibly allocates a dispatch route corresponding to a dispatch request to a waiting driver only when the total estimated travel times 560, 660, and 760 are less than the remaining business hours of each article. In this case, the total estimated travel time (560, 660, 770) is calculated by reflecting traffic conditions such as work time, work time, or traffic accidents, and is calculated based on the total distance (550, 650, 750) as needed. Can.

As a preferred embodiment of the present invention, the distribution unit 260 may further include a priority policy unit 280. Priority policy unit 280, based on the remaining business hours of each article, the travel distance (S510, S610, S710), return distance (S530, S630, S730), operating distance (S520, S620, S720) or total distance ( 550, 650, 750) is generated to generate a priority policy to determine which of the highest priority is assigned to the distribution unit 260 to perform the distribution according to the priority policy.

As a preferred embodiment of the present invention, the priority policy unit 280 provides the highest priority to the moving distances (S510, S610, S710) when the remaining business hours of each article are sufficient to respond to the dispatch request to the article. It is possible to arrange the dispatch route. If the driver's remaining business hours are sufficient, the dispatch route corresponding to the dispatch request may be forcibly assigned to the driver located close to the passenger. Referring to FIG. 5, even if the return distance (S530) between the driver's garage 540 and the passenger's destination 530 is long, the driver has sufficient parking hours after getting off the passenger at the destination 530 and thus the garage is notified. This is because, instead of returning to (540), a dispatch route corresponding to a new dispatch request can be arranged in the state of an empty car.

As another preferred embodiment of the present invention, the priority policy unit 280 gives the highest priority to the driving distances (S520, S620, S720) when the remaining business hours of each article are sufficient, and requests the driver to dispatch requests. Corresponding dispatch routes can be arranged. If the article has sufficient remaining business hours, the highest priority is given to whether the distance to the dispatch request is a long-distance call or a short-distance call, so that the fatigue of the article can be referred to. In this case, the priority policy unit 280 gives the highest priority to the driving distance (S520, S620, S720) when the total distance (550, 650, 750) of the cumulatively managed articles exceeds a predetermined standard. By doing so, the dispatch route corresponding to the dispatch request can be arranged to the driver.

The priority policy unit 280 may also allocate the number of long-distance call allocations and the number of short-distance call allocations to the driver by analyzing the moving distance, driving distance, and preference of the driver for one day, one week, or a predetermined period of time. . If the driver prefers the long-distance call, if the short-distance call exceeds a certain number of times, the long-distance call can be preferentially assigned to the article.

As another preferred embodiment of the present invention, when the remaining business hours of each article are insufficient, the highest priority is given to the return distances (S530, S630, S730) to force the dispatch route corresponding to the dispatch request. Can be placed. For example, when the remaining business hours of the driver are 3 hours and the operation time of the dispatch request is 2 hours and 40 minutes, the dispatcher 260 communicates with the destination and the garage among the routes in which the distance between the destination and the garage in the dispatch request is within 20 minutes. The dispatch route corresponding to the dispatch request can be forcibly arranged to the driver in the order of the closest distance.

The total travel distance is 16.06km (650) in the case of the first dispatch request as shown in FIG. 6 and the total travel distance is 16.06km (750) in the case of the second dispatch request as shown in FIG. ), in the same case, the dispatcher 260 may perform forced allocation based on the return distance calculated by the return distance calculator 230 or the return time required to move the return distance. The placement unit 260, when placing the dispatch request forcibly by placing the highest priority on the return distance, among the dispatch requests shown in FIGS. 6 and 7, the return route corresponding to the dispatch request of FIG. 7 having a shorter return distance (S630) Can be posted to the article.

3 to 4 is a preferred embodiment of the present invention, information about the closing time of each article received through the article information management server from the distribution unit of the compulsory distribution server, garage information, and for each article in a fixed period unit An example of a table generated based on the cumulative running distance information managed and the dispatch request received from at least one passenger is shown.

The table managed by the distribution department includes current time information 301, information including the name of the article, identity, etc. 302, garage information 303, cumulative running distance information 304, and real-time remaining business hours information 305. , Current location information 306, departure information requested by the passenger 307, destination information requested by the passenger 308, travel time information 310, driving time information 320, return time information 330 and time limit information 340.

The table managed by the distribution unit is, for example, when a passenger requests a distribution request as shown in FIG. 5, the table shown in FIG. 3 may be generated by adding the garage information of the article received through the article information management server.

4 is a preferred embodiment of the present invention, at least one allocation request (S410, S420, S430) to distribute the optimal allocation request to one article through the article information management server in the table managed by the distribution unit An example of input is shown.

When a dispatch request is received from a plurality of passengers, the distribution unit may generate a table such as the example shown in FIG. 4 for each article included in the article information list received through the article information management server.

The table includes travel times (411, 412, 413), travel times (421, 422, 423), return times (431, 432, 433) to limit times (441, 442) for each dispatch request (S410, S420, S430). , 443). The allocation unit primarily removes the allocation request (S420) exceeding the remaining business hours 405 of the article based on the time limits 441, 442, and 443.

Next, the allocation unit may set the allocation request to be placed to the article among the first allocation request (S410) and the third allocation request (S430) according to the priority policy established by the priority policy unit. In this case, priority is set based on at least one of the cumulative travel distance, remaining business hours, travel time, travel time, return time, and limit time. For example, if the priority policy unit gives the highest priority to the return time, the allocation unit distributes the third allocation request (S430) to the driver. As another example, when the priority policy unit gives the highest priority to the path having the minimum time limit, the first dispatch request (S410) with the time limit of 0 minutes (441) is distributed. The priority set by the priority policy department can be set through machine learning or by setting preferences for each article or through a driving service contract between each article and a service company. When setting the priority according to the preference of each article, each article can change the setting of the priority in the application they use.

As a preferred embodiment of the present invention, the operating time refers to the time required to move from the starting point to the destination, and the estimated operating time is the sum of the moving time and operating time from the current location of each article to the departure point in the dispatch request. Was used.

8 is a preferred embodiment of the present invention, showing a flow chart for performing distribution optimization in the forced distribution server. The receiving unit of the forcible distribution server receives information about the closing time of each article from the article information management server (S810). The receiving unit also receives at least one dispatch request including departure and destination information from at least one passenger (S820).

At least one driver waiting for each dispatch request received from at least one passenger considering the remaining business hours of each driver and return time to the garage in real time based on the closing time received from the receiver in the dispatcher. It is forcibly distributed to each (S830). Referring to FIG. 9 in more detail with reference to FIG. 9, the distribution unit performs a forced distribution, and the distribution unit includes each remaining time of each article and at least one allocation request list that can be assigned to each article. Each time limit is calculated for the dispatch request (S910). Then, only the dispatch request list having a limit time of 0 or more is classified in the dispatch request list (S920).

The allocation unit selects at least one criterion of a return time, a limit time, or a travel time according to a priority policy in the classified allocation request list, and selects the allocation request according to the selected criteria to force distribution (S930). In this case, as illustrated in FIG. 4, the priority policy may be set by further considering cumulative travel distance and operation time (S930 ).

As a preferred embodiment of the present invention, when the priority policy is a policy of distributing distribution requests in the order of the smallest return time, forcing is performed based on the calculated return time (S932, S933). As another preferred embodiment of the present invention, when the priority policy is a policy for distributing distribution requests in the order of the smallest time limit, forcing is performed based on the calculated time limit (S934, S935). As another preferred embodiment of the present invention, when the priority policy is a policy of distributing the distribution requests in the order of the smallest moving time, the forced distribution is performed based on the calculated moving time (S936, S937).

One embodiment of the invention may also be implemented in the form of a recording medium comprising instructions executable by a computer, such as program modules, being executed by a computer. Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. In addition, computer readable media may include both computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Communication media typically include computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave, or other transport mechanism, and includes any information delivery media.

Although the methods and systems of the present invention have been described in connection with specific embodiments, some or all of their components or operations may be implemented using a computer system having a general purpose hardware architecture.

The above description of the present invention is for illustration only, and a person having ordinary knowledge in the technical field to which the present invention pertains can understand that it can be easily modified into other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, it should be understood that the embodiments described above are illustrative in all respects and not restrictive. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as distributed may be implemented in a combined form.

The scope of the present invention is indicated by the following claims rather than the above detailed description, and it should be interpreted that all changes or modified forms derived from the meaning and scope of the claims and equivalent concepts thereof are included in the scope of the present invention. do.

Claims (1)

A first receiving unit for receiving information on the closing time of each article from the article information management server of the service company that has a driving service contract with each article;
A second receiver configured to receive at least one dispatch request including departure and destination information from at least one passenger; and
A return distance calculator that calculates a distance between the destination included in the dispatch request and the garage of each article;
A moving distance calculator that calculates a distance between the starting point included in the dispatch request and the current location of each article;
A driving distance calculating unit for calculating a driving distance required to operate the dispatch request;
Consider the operating time and remaining business hours of each article based on at least one of the distance calculated by the return distance calculation unit, the distance calculated by the moving distance calculation unit, and the driving distance calculated by the driving distance calculation unit The distribution unit for forcibly distributing each of the distribution requests received from the second reception unit to each of at least one article through the article information management server.
The total distance including the distance calculated by the return distance calculator, the distance calculated by the travel distance calculator, and the distance calculated by the travel distance calculator is less than the remaining business hours of each article. Forced distribution server, characterized in that it further comprises a; limit time determination unit for determining whether.

Images