JP2022121840A - Optimal route determination device and optimal route determination program - Google Patents

Abstract

To provide an optimal route determination device and an optimal route determination program capable of determining an optimal route obtained by taking even which entrance/exit to be used at a service execution point into consideration.SOLUTION: An optimal route determination device includes a service execution point information acquisition part for acquiring service execution point information about each of a plurality of services, an execution order determination part for determining an execution order about the plurality of services, an entrance/exist information acquisition part for acquiring position information of at least one or more entrances/exists in each service execution point and cost information determined by using which entrance/exit as entrance/exist information about each of the plurality of services, and an optimal route determination part for determining an optimal route including a combination of entrances/exists to be used at each service execution point by using the execution order and the entrance/exist information.SELECTED DRAWING: Figure 2

Description

The present invention relates to an optimum route determination device and an optimum route determination program capable of determining an optimum route taking into consideration which entrance/exit to use at a service execution point.

Conventionally, in the field of "combinatorial optimization", research has mainly focused on "modeling real-world problems into combinatorial optimization problems" and "devising solutions to certain combinatorial optimization problems". Among combinatorial optimization problems, there is a problem called "vehicle routing problem (VRP)". This is the length of the route in the vehicle's route (order of orders) such that every order is visited exactly once by any vehicle when multiple vehicles and multiple orders are entered. The problem is to find the one that minimizes the sum of Over the decades, many problems have been proposed that incorporate constraints that appear in reality for VRP, and approximate solution methods for them have also been studied at the same time. In addition, there is a problem called "PDP: pickup and delivery problem" as a generalized problem of VRP. When multiple sets of visiting destinations for loading and unloading are entered, the same vehicle visits each destination for each set, and after loading and unloading, the order is followed. The problem is to find the vehicle route that minimizes the sum of route lengths such that every destination is visited exactly once by any vehicle. Similar to VRP, a number of PDP problems that incorporate constraints that appear in reality have been proposed, and approximate solution methods for them have been studied at the same time.

For example, Patent Literature 1 describes a delivery plan determined by a grouping process that assigns delivery destinations to each vehicle and a route optimization process that determines the order in which vehicles travel through the delivery destination groups determined by the grouping. A technique is disclosed in which a plurality of delivery plans are generated using the grouping strategy of (1) and the optimum delivery plan is selected from among them.

JP-A-2001-188984

By the way, in the conventional VRP and PDP, it is common that only one place representing the destination is considered for the visited point information. When obtaining the shortest route for visiting a plurality of visited destinations, the overall shortest route is calculated on the premise that the shortest routes connecting points representing each visited destination are simply connected.

Here, among facilities that can be destinations, there are facilities that have multiple entrances and exits. In addition, since vehicles can pass through the site, it may be possible to use different entrances and exits. Conversely, there are cases where the entrance and exit locations are restricted, such as entrances only and exits only. When the destination is a facility with multiple entrances and exits, even if a route search is performed using only one representative location, the time required and the burden on the operator depend on which entrance is used. gives different results. However, in the conventional shortest route calculation, it was not possible to consider which entrance should be used.

SUMMARY OF THE INVENTION It is an object of the present invention to provide an optimum route determination device and an optimum route determination program capable of determining an optimum route taking into consideration which entrance/exit to use at a service execution point. aim.

An optimal route determination device according to the present invention is an optimal route determination device for determining an optimal route for movement when continuously processing a plurality of services each of which is executed at a different point, wherein the plurality of services a service execution point information acquisition unit that acquires service execution point information for each; an execution order determination unit that determines an execution order for the plurality of services; and at least one or more at each service execution point for each of the plurality of services. and an entrance/exit information acquiring unit for acquiring, as entrance/exit information, cost information determined by which entrance/exit is used, and an entrance/exit to be used at each service execution point using the execution order and the entrance/exit information. and an optimum route determination unit that determines an optimum route including a combination of

Further, in the optimum route determination device according to the present invention, the position information of the entrances in the entrance information is extracted based on the movement trajectory data of one or more vehicles equipped with a GPS function for each service execution point. is registered in advance in the

Further, the optimum route determining apparatus according to the present invention is characterized in that the cost information in the entrance/exit information uses pre-registered cost information for each combination of entrances and exits at the service execution point.

An optimum route determination program according to the present invention is an optimum route determination program for causing a computer to realize a process of determining an optimum route for movement when continuously processing a plurality of services each of which is executed at a different location. a service execution point information acquisition function for acquiring service execution point information for each of the plurality of services; an execution order determination function for determining an execution order for the plurality of services; , a doorway information acquisition function that acquires position information of at least one or more doorways at each service execution point and cost information determined by which doorway is used as doorway information, and the execution order and the doorway information are used. and an optimum route determining function for determining an optimum route including a combination of entrances and exits to be used at each service execution point.

According to the present invention, when a plurality of entrances/exits exist at each service execution point when determining the optimum route, the combination of entrances/exits to be used is also taken into consideration to determine the optimum route with the lowest cost including the combination of entrances/exits. It becomes possible to

1 is a block diagram showing the configuration of an entire system for realizing an optimum route determination device according to the present invention; FIG. 1 is an explanatory diagram showing an example of a configuration of an optimum route determination device (server device) 10 according to the present invention; FIG. FIG. 2 is a flow chart showing the flow of optimum route determination processing in the optimum route determination device 10 according to the present invention;

[First embodiment]
An example of the optimum route determination device according to the first embodiment will be described below with reference to the drawings. FIG. 1 is a block diagram showing the configuration of the entire system for realizing the optimum route determination device according to the present invention. Although the optimum route determination device 10 may be a device designed as a dedicated machine, it can be realized by a general computer or server device. In this case, the optimum route determination device 10 includes a CPU (Central Processing Unit), a GPU (Graphics Processing Unit), a memory , a hard disk drive, etc. (not shown). Needless to say, various processes are executed by a program in order to make these general computers and server devices function as the optimum route determination device 10 of this example.

As shown in FIG. 1, the configuration of the entire system for realizing the optimum route determination device includes a server device 10 and service executor terminals 201 to 20n (hereinafter collectively referred to as service executor terminal 20). ) and headquarters terminal 30 are configured to be mutually connectable via communication network 40 . Of these, the headquarters terminal 30 is a terminal device that is assumed to be used at the headquarters of the service provider, but is not an essential component. A case where the server device 10 functions as the optimum route determination device 10 of this example will be described below as an example.

FIG. 2 is an explanatory diagram showing an example of the configuration of the optimum route determination device (server device) 10 according to the present invention. As shown in FIG. 2, the optimal route determination device 10 includes a service execution point information acquisition unit 11, an execution order determination unit 12, an entrance/exit information acquisition unit 13, an optimal route determination unit 14, and a storage unit 15. at least have.

The service execution point information acquisition unit 11 has a function of acquiring service execution point information for each of a plurality of services. Here, in this example, the term "service" refers to a segmented unit of work that needs to be performed by stopping (stopping) a mobile object such as a vehicle. As an example, in the case of a business that collects a package at a certain point and delivers it to another point, a collection service (pick-up service) and a delivery service (delivery service) are required services. Further, the service execution point information is information for specifying the position where the service is executed. For example, location information specified by latitude and longitude can be cited. Here, it is assumed that the position information acquired as the service execution point is position information regarding one point representing the place where the service is executed. The optimum route determination device 10 in this example is based on the premise that the optimum route of movement is determined when continuously processing a plurality of services each of which is executed at a different point. Therefore, the service execution point information acquisition unit 11 acquires information on each service execution point of a plurality of services that are continuously processed. At this time, the positional information of the departure point and the positional information of the return point are also acquired. The current position information of the vehicle may be acquired as the position information of the starting point. In that case, any means may be used as long as the vehicle position information can be acquired. You may make it acquire the positional information acquired based on a GPS function.

The execution order determination unit 12 has a function of determining the execution order of a plurality of services. Specifically, the execution order of a plurality of services is calculated as a combinatorial optimization problem to determine the execution order. The execution order is determined based on known combinatorial optimization problems such as VRP and PDP.

The entrance/exit information acquisition unit 13 has a function of acquiring position information of at least one entrance/exit at each service execution point and cost information determined by which entrance/exit is used as entrance/exit information for each of a plurality of services. Among the facilities indicated by the service execution point, there is a facility having multiple entrances/exits. In addition, since vehicles can pass through the premises of the facility, it may be possible to use different entrances and exits. Conversely, there are cases where the entrance and exit locations are restricted, such as entrances only and exits only. In such a facility having a plurality of entrances, location information of each entrance is registered as entrance information. Any method may be used to acquire the position information of each entrance. For example, the entry/exit location on the map data may be registered by the user specifying it. Further, location information of entrances extracted based on movement locus data of one or more vehicles equipped with a GPS function may be registered in advance for each service execution point.

Further, the cost information registered as the entrance/exit information is information preliminarily registered as cost information that the effort and required time of the vehicle differ depending on which entrance/exit is used. As the cost information in the entrance/exit information, cost information registered in advance for each combination of an entrance and an exit at the service execution point is used. For example, there is a possibility that the costs of two entrances and exits may differ depending on how the entrance and exit are used. In order to deal with such a case, cost information is registered for each combination. Although any method may be used for setting the cost information, for example, a method of determining in advance based on information provided by the user is conceivable.

In this way, the location information of at least one or more entrances for each service execution point and the cost information determined depending on which entrance is used are registered in advance as entrance information, and the entrance information acquiring unit 13 performs service execution. The point information acquisition unit 11 acquires entrance/exit information for the acquired service execution point.

The optimum route determination unit 14 has a function of determining an optimum route including a combination of entrances and exits to be used at each service execution point using the execution order and entrance/exit information. Specifically, the problem of determining which entrance to enter at each service execution point and which exit to exit from is fixed, with the execution order determined by the execution order determining unit 12 being fixed. is treated as a combinatorial optimization problem of finding a combination of variables that minimizes the total cost of all paths. Solving such a combinatorial optimization problem by a known method such as a local search method or a greedy method makes it possible to determine the optimum combination of entrances and exits at each service execution point. The determined optimum route is transmitted to the service executor terminal 20 and/or the headquarters terminal 30 via the communication network 40 .

The storage unit 17 has a function of storing data necessary for various processes performed in the optimum route determination device 10 and data obtained as a result of the processes. As shown in FIG. 2, as an example, the storage unit 17 may store entrance/exit information.

Next, the flow of optimum route determination processing in the optimum route determination device 10 according to the present invention will be described. FIG. 3 is a flow chart showing the flow of optimum route determination processing in the optimum route determination device 10 according to the present invention. As shown in FIG. 3, the optimum route determination process is started by acquiring service execution point information in the optimum route determination device 10 (step S101). Next, the optimum route determination device 10 determines the order of execution of the multiple services (step S102). Next, the optimum route determination device 10 acquires entrance/exit information for each service execution point (step S103). Then, using the execution order and the entrance/exit information, the optimum route determination device 10 solves a combinatorial optimization problem to determine an optimum route including a combination of entrances/exits to be used at each service execution point (step S104). , terminate the process.

As described above, according to the optimum route determination device according to the present embodiment, the service execution point information acquisition unit that acquires the service execution point information for each of a plurality of services, and the execution order determination unit that determines the execution order for the plurality of services. an entrance/exit information acquisition unit that acquires, as entrance/exit information, position information of at least one entrance/exit at each service execution point and cost information determined by which entrance/exit is used for each of a plurality of services, and an execution order; and an optimum route determining unit for determining an optimum route including a combination of entrances and exits to be used at each service execution point using entrance/exit information. It is possible to determine the optimal route based on

In addition, when superimposing the optimal route including the combination of entrances and exits to be used on the map information, by specifying the positions of the entrance and exit at each service execution point on the map, the map information can be displayed on the service executor terminal 20. The user can easily see where the entrance and exit are to be used, eliminating the need to search for an intrusion point, and as a result, it is possible to shorten the required time.

In addition, the services in the present invention include delivery service, wholesale business to stores, maintenance of vending machines, home-visit medical care/home-visit nursing care, shared taxis, etc. applicable if available.

It should be noted that the present invention is not limited to the embodiments described above, and various configurations or embodiments can be adopted without departing from the gist of the present invention.

10 Optimal route determination device 11 Service execution point information acquisition unit 12 Execution order determination unit 13 Entrance/exit information acquisition unit 14 Optimal route determination unit 15 Storage unit 20 Service executor terminal 30 Headquarters terminal 40 Communication network

Claims (4)

An optimal route determination device for determining an optimal route of movement when successively processing a plurality of services each running at a different point,
a service execution point information acquisition unit that acquires service execution point information for each of the plurality of services;
an execution order determination unit that determines an execution order for the plurality of services;
an entrance/exit information acquiring unit for acquiring, as entrance/exit information, location information of at least one entrance/exit at each service execution point and cost information determined by which entrance/exit is used for each of the plurality of services;
An optimal route determination device, comprising: an optimal route determination unit that determines an optimal route including a combination of entrances and exits to be used at each service execution point, using the execution order and the entrance/exit information. 2. The optimum route according to claim 1, wherein the location information of the entrance in the entrance information is extracted based on movement trajectory data of one or more vehicles equipped with a GPS function, and is registered in advance for each service execution point. decision device. 3. The optimal route determining apparatus according to claim 1, wherein the cost information in the entrance/exit information uses pre-registered cost information for each combination of an entrance and an exit at a service execution point. An optimum route determination program for causing a computer to realize a process of determining an optimum route for movement when continuously processing a plurality of services each of which is executed at a different point,
to the computer;
a service execution point information acquisition function for acquiring service execution point information for each of the plurality of services;
an execution order determination function for determining the execution order of the plurality of services;
an entrance/exit information acquisition function for acquiring, as entrance/exit information, location information of at least one entrance/exit at each service execution point and cost information determined by which entrance/exit is used for each of the plurality of services;
An optimum route determination program for realizing an optimum route determination function for determining an optimum route including a combination of entrances and exits to be used at each service execution point, using the execution order and the entrance/exit information.

Images