KR20050105220A - Course creation system - Google Patents

Abstract

A course creation system (100) selects stores to be contained in one course when creating a course for distributing articles in a area having a plurality of stores. An information acquisition section (170) acquires information on the stores from an external system. A store selection section (112) selects stores to be included in one course according to the information on the stores. A calculation processing section (116) adds the stores selected by the store selection section (112) to the course and calculates a statistical amount decided by the stores contained in the course. When the statistical amount calculated by the calculation processing section (116) has reached a predetermined range, the course creation system (100) terminates selection of stores and terminates the course creation processing.

Description

Course Creation System {COURSE CREATION SYSTEM}

The present invention relates to a course creation system and a program thereof.

DESCRIPTION OF RELATED ART The conventional route determination method which produces | generates route data suitable for route | route search from an image map, and uses the route data to determine the route which takes less distance or time (patent document 1) is disclosed. Here, the route is determined in consideration of the geography on the map such as the traffic volume of the road, the position of the intersection, the shape of the road, and the one-way passage. This allows the determination of an optimal path that takes less distance or time.

[Patent Document 1] Japanese Patent Laid-Open No. 6-273181

The foregoing and other objects, features, and advantages will become more apparent from the preferred embodiments described below and the accompanying drawings attached thereto.

1 is a diagram showing a course creation system in an embodiment of the present invention;

2 is a flowchart showing a procedure of a course creation process in the embodiment of the present invention;

3 is a block diagram showing the configuration of a course creation system in an embodiment of the present invention;

4 is a view showing a part of the data structure of the acquisition information storage unit in the embodiment of the present invention;

FIG. 5 is a block diagram showing details of the information acquisition unit shown in FIG. 3;

6 is a diagram showing an internal configuration of a store information storage unit held by second and fourth external systems, respectively;

7 is a diagram showing an internal configuration of a management information storage section;

8 is a diagram showing data for each transmission format;

9 is a diagram showing an input screen for allowing a user to select a setting of a condition to be considered when creating a course;

10 is a diagram showing a screen that accepts input of a condition for course preparation;

11 is a diagram showing a screen that accepts input of conditions for course preparation;

12 is a diagram showing a base in a region and a plurality of stores as points;

13 is a diagram showing an example of a part of the data structure of the condition storage unit;

FIG. 14 is a diagram showing a part of the data structure of the course information storage unit in the embodiment of the present invention; FIG.

FIG. 15 is a flowchart specifically showing a course creation process of step 6 shown in FIG. 2;

16 is a flowchart specifically showing an example of the store selection process in step 40 of FIG. 15;

17 is a view for explaining an example of a method for setting a search area;

18 is a diagram showing a search area set by the search area setting unit;

19 is a diagram showing a search area set by the search area setting unit;

20 is a flowchart specifically showing an example of the adjustment process of step 56 in FIG. 15;

21 is a diagram illustrating a procedure of course creation every two weeks;

FIG. 22 is a diagram for explaining a process of calculating a total quantity of stores in which the calculation unit delivers only once every two weeks;

23 is a flowchart showing a processing procedure when creating a course in consideration of the day of the week,

24 is a diagram showing an example of a procedure for calculating a theoretical value of course time required in a region;

Fig. 25 is a diagram showing a screen on which a course creation result by the course creation system in the embodiment of the present invention is displayed;

Fig. 26 is a diagram showing map information and a created course state in a certain area;

27 is an enlarged view of each icon shown in FIG. 26;

28 is a diagram showing the state of the icon shown in FIG. 27;

29 is a block diagram showing the structure of a course creation system in the embodiment of the present invention;

30 is a diagram showing a part of the data structure of the condition storage unit in the embodiment of the present invention;

FIG. 31 is a flowchart specifically showing a course creation process in step 6 shown in FIG. 2;

32 is a diagram showing an example of a method of dividing a search area;

33 is a diagram showing another example of a method of dividing a search area;

34 is a diagram showing an example of a method of adjustment processing at the time of course creation;

35 is a diagram showing another example of the method of adjustment processing at the time of course creation;

36 is a view schematically showing the shape of a course created in the embodiment of the present invention;

37 is a view for explaining a course creation method in the embodiment of the present invention;

38 is a view for explaining a course creation method in the embodiment of the present invention;

Fig. 39 is a diagram showing a network configuration including the course preparation system of the present invention.

However, in the process for determining the optimal path, it is necessary to repeat the operation in order to find the optimal solution. Therefore, from a systematic point of view, it is necessary to eliminate the repetition of the operation, that is, the loop processing, and the long processing time. It is important to be able to find the optimal solution without

In addition, as in the technique described in Patent Literature 1, when the optimal route is determined by reflecting the actual road situation, the information necessary for obtaining the optimal solution becomes large, and the processing time becomes long.

An object of the present invention is to provide a technique for easily creating a course that can reduce the number of required workers and the like to efficiently carry out a circulation work when creating a delivery course in an area. Another object of the present invention is to provide a technique for objectively preparing such a course. Another object of the present invention is to provide a system that can flexibly create such a course. Another object of the present invention is to provide a technique for simplifying the configuration of a system for creating such a course.

According to the present invention, when creating a course for delivering an article in an area including a plurality of traversal points, a course creation system for selecting a traversal point included in the same course, the information acquisition for obtaining information about a plurality of traversal points Based on the information about the section and the circulation point, the selection unit that selects the circulation points included in the same course and the circulation points selected by the selection unit are added to the course, and then determined by the circulation points included in the course. The calculation unit includes a calculation processing unit for calculating the statistics, and the selection unit determines whether or not the statistics calculated by the calculation processing unit is within a predetermined range, and terminates the selection of the traversal point when within the range, and traverses again when out of the range. A course creation system is provided which continues the selection of points.

Here, the course means, for example, a path from the base which is the starting point of the circuit to the circuit point, and then back to the base. The statistic may be a first statistic determined by the delivery time to the selected traversal point and / or a second statistic determined by the amount of goods delivered to the selected traversal point. In addition, the selection unit may perform a process of deselecting the already selected traversal point according to the value of the statistics calculated by the calculation processing unit.

In this way, the timing which complete | finishes a course creation process can be provided widely, and a course can be created quickly. As a result, when creating a delivery course in an area, it is possible to create a course that can reduce the number of required workers and efficiently carry out the tour work with easy processing.

In the present invention, the selection unit updates the traversal point included in the same course by adding a new traversal point until the statistic is smaller than the lower limit of the predetermined range until the statistic is within the predetermined range. When the statistic is larger than the upper limit value of the predetermined range, a part of the selected traversal point may be deleted and the operation of updating the traversal point included in the same course may be repeatedly performed. By doing so, it is possible to reliably create a reasonable course.

Various forms are possible about the increase and decrease of the circulation point. For example, the selector may be configured to repeatedly perform the above operation by setting an area including one or more traversal points and enlarging or reducing the area. In addition, enlargement or reduction of the said area can be set as the structure performed by the increase and decrease of the distance from a reference point. Moreover, the said area | region is an area | region enclosed by the 1st straight line which makes a reference point a viewpoint, and the 2nd straight line obtained by rotating a 1st straight line by a predetermined angle about the said viewpoint, and the enlargement or reduction of the said area | region is It can be set as the structure performed by the increase and decrease of an angle. According to the configuration as described above, it is possible to objectively and efficiently create a course that can reduce the number of workers required and efficiently perform the patrol work.

In the course preparation system of the present invention, the calculation processing unit calculates at least one of the first statistical amount determined by the delivery time to the selected traversal point and the second statistical amount determined by the amount of the article delivered to the selected traversal point. The selection unit may determine whether at least one of the first statistical amount and the second statistical amount is within a predetermined range.

In the course preparation system of the present invention, the system may further include an optimization processing unit that optimizes the traversal order of the traversal points included in the course, and the calculation processing unit delivers when the traversal points are traversed in the order in which the selection unit selects the traversal points. The time is calculated as a preliminary first statistic, and it is determined whether the preliminary first statistic exceeds a predetermined reference value, and when the preliminary first statistic exceeds a predetermined reference value, the optimization processing part is optimized. It is possible to calculate the delivery time when the traversal point is traversed in the optimized traversal order.

In this way, since the optimization only needs to be performed when the preliminary statistics exceed a predetermined reference value, the course creation process can be speeded up.

In the course preparation system of the present invention, the selection unit may further include a condition accepting unit that accepts setting of conditions to be considered when selecting the circulation point, and the selecting unit may select the circulation point according to the setting received by the condition accepting unit. have.

In this way, since the selection method of a circulating point can be made different according to the medium diameter of a condition, various courses can be created as needed by a user. Moreover, the course creation can be performed without considering the conditions which a user does not want, and the process can be quickened.

In the course preparation system of the present invention, a condition to be taken into consideration when selecting a circulation point may be whether or not to consider the delivery day of the tour point included in the course when creating the course.

In the course preparation system of the present invention, a condition to be taken into consideration when selecting a traversal point can be whether or not to designate a search area to be selected as a traversal point when preparing a course.

In the course preparation system of the present invention, the calculation processing unit may further include a condition accepting unit that accepts setting of conditions to be considered when calculating the statistics, and the calculating processing unit calculates the statistics according to the setting received by the condition accepting unit. can do.

In this case, since the calculation process of a statistics can be made different according to the medium diameter of a condition, a course creation can be performed without considering the condition which a user does not want, and a process can be made quick. In addition, various courses can be created according to the needs of the user.

In the course preparation system of the present invention, the condition to be considered when calculating the statistics can be whether or not to consider the first statistical amount determined by the delivery time to the selected circulation point.

In the course preparation system of the present invention, the condition to be considered when calculating the statistics can be whether or not to consider the second statistical amount determined by the amount of the article to be delivered to the selected circulation point.

In the course preparation system of the present invention, a course information storage unit for storing information about a course created by a circuit point finally selected by a selection unit in accordance with a condition received by a condition reception unit, and information about a course together with a condition. The display processing unit may further include a display.

In this way, you can easily compare information about courses created under different conditions. With reference to this, the user can make appropriate course preparation.

In the course preparation system of the present invention, a display processing unit for displaying information about a traveling point together with local map information, a circulation condition to each circulation point, and display information having a different appearance shape according to the difference between the circulation conditions. The display information storage unit may further include a display information storage unit for storing the information corresponding to the traversal point based on the information about the traversal point acquired by the information acquisition unit, and the display corresponding to the traversal point. Information can be displayed.

Thereby, the user can visually grasp the circulation conditions to each circulation point, and can conveniently recognize the result of course making.

In the course preparation system of the present invention, a flexibility parameter granting unit for assigning each of the tour points a flexibility parameter showing a degree of limitation when including a plurality of tour points in the course is further included on the basis of the information about the tour points. The selector may select the traversal point in consideration of the flexibility parameter.

Here, the flexibility parameter shows the degree of limitation when including each traversal point in the course. In addition, the flexibility parameter can be set according to whether or not to specify the day of the week for which each traversal point should be traversed, the number of times required for delivery per week, and the like. For example, the circulation point for which the day of the week is specified has a low flexibility parameter. In addition, the circulation point with a large number of times of delivery per week has a low flexibility parameter. Since the traversal point with high flexibility parameter can be easily adjusted in which course, the selection unit can flexibly create a course by preferentially selecting the traversal point with low flexibility parameter in the course.

In the course preparation system of the present invention, the selection unit selects a seed serving as a reference when creating a course in consideration of flexibility parameters from a plurality of circulation points, and includes a circulation point included in the same course in consideration of the information about the seed. Can be selected sequentially.

In the course preparation system of the present invention, the information acquisition unit can acquire information about the circulation point from an external system.

The external system can be, for example, a system of a company that manages each circulation point. In this way, the course preparation system of this invention can utilize the information which each company collects, updates, and accumulates every day. As a result, it is not necessary to collect information on the circulating points on purpose for the course preparation, which facilitates the course creation process. As a result, the configuration of the course creation system can be simplified. In addition, existing information accumulated by each company can be effectively utilized.

In the course preparation system of the present invention, the information acquisition unit determines whether all of the information necessary for the calculation processing unit to calculate the statistics is included in the information acquired from the external system, and all the necessary information is not included. Can be performed to prompt the input of the replacement information of the necessary information.

When information required for course preparation is obtained from various external systems, the format and type of data accumulated by the company running each system may be different. In this way, even when all the necessary information is not included in the information acquired from the external system, the replacement information can be obtained, and the course creation process can be appropriately performed.

In the course preparation system of the present invention, the selection unit first selects a seed, which is a reference when creating a course, from a plurality of circulation points, and sequentially selects circulation points included in the same course in consideration of the information about the seed. Can be.

In the course preparation system of the present invention, the region may include a base, and the selection unit may select the seed in consideration of the distance from the base.

In the course preparation system of the present invention, the system may further include an optimization processing unit that optimizes the traversal order of the traversal points included in the course, and the calculation processing unit calculates the first statistical amount in consideration of the traversal order optimized by the optimization processing unit. can do.

In the course preparation system of the present invention, the circulation work is performed using a vehicle, and may further include an order determining unit that determines the order of traversing the traversal points included in the course for each created course, and the order determination unit is a vehicle. The order may be determined so as to traverse sequentially from the traversing point located on the side of the passage direction.

In the course preparation system of the present invention, the selection unit selects the traversal point corresponding to the day of the week so that the number of courses in each day is equal, and divides the course for each day of the week.

As a process for making the number of courses in each day even, for example, when selecting a circulation point without restriction on the day, the circulation point can be selected in correspondence with the day of the course with a small number of courses already created. By equalizing the number of courses in each day, the required number of vehicles can be provided for each day of the week, so that the work can be efficiently performed with the minimum number of vehicles required. As a result, the number of vehicles and the number of workers can be reduced.

In the course preparation system of the present invention, the information acquisition unit acquires information on the presence or absence of the day designation to which each circulation point should be traversed, and the selection unit each traversal point to include the same tour point in the same course. You can choose.

In the course preparation system of the present invention, a course information storage unit may further include a course information storage unit that stores information about a course that has already been created, and the information acquisition unit acquires information on whether or not to designate a day of the week to traverse each circulation point, If there is no designation of the day of the week for which one of the traversal points is to be traversed, the selection unit may determine the day of the week for which the traversal point is to be traversed with reference to the course information storage unit.

In the course preparation system of the present invention, when there is no designation of the day of the week to be traversed for any one of the traversal points, the selection unit performs the traversal to this traversal point on the day of the week with the lowest number of courses assigned, referring to the course information storage unit. You can decide to.

In the course preparation system of the present invention, a search area setting unit may further include a search area setting unit for setting a search area for selecting a traversal point included in the same course in the area, and the selection unit is configured to the same course for the search area. Each traversal point to include can be selected.

In the course preparation system of the present invention, the search area setting unit searches for an area that the axis passes through when the axis that rotates the axis that defines this reference point as a predetermined angle is centered about a predetermined reference point in the area. You can set the area.

In the course preparation system of the present invention, the search area setting unit may set the search area for an area where the axis line passes when the axis is rotated by a predetermined angle in the clockwise direction and the counterclockwise direction, respectively.

In the course preparation system of the present invention, when the axis is rotated in the search region, the selection unit can select sequentially from the circulating points that strike the axis.

In the course preparation system of the present invention, the selection unit can select sequentially from the traversal points that hit one of the axes when the axes are rotated simultaneously in the clockwise and counterclockwise directions within the search region.

In the course preparation system of the present invention, the search region setting unit may set the search region in consideration of the distance in the direction substantially perpendicular to the axis line.

In the course preparation system of the present invention, the search area setting unit may divide an area into a plurality of search areas by rotating an axis line having this reference point as one end at a predetermined angle around the predetermined reference point in the area. The unit can select each of the traversal points included in the same course for each search area.

In the course preparation system of the present invention, the search area setting unit may adjust the angle of rotating the axis line for each search area in consideration of the average value of the statistics in each course.

In the course preparation system of the present invention, the search area setting unit takes the average value of the statistics in each course into consideration and, when the statistics in the corresponding course is smaller than the average value, rotates the axis when setting the search area. When the angle spreading process is performed and the statistic in the corresponding course is larger than the average value, the process of narrowing the angle of rotating the axis when setting the search area can be performed.

In the course preparation system of the present invention, the search area setting unit considers the average value of the statistics in each course, and when the statistics in the corresponding course are larger than the average value, a part of the traversal points included in the search area. The process of creating another course for implementing this process can be performed.

In the course preparation system of the present invention, another course is created so that the statistics and the corresponding course differ.

In the course preparation system of the present invention, the theoretical number calculating unit for calculating the theoretical number n of courses to be created in the area may be further included, and the search area setting unit may rotate the axis to be an approximation of 360 / n. have.

In the course preparation system of the present invention, the search area setting unit may set a starting point for rotating the axis in consideration of road information marking a road included in this area.

In the course preparation system of the present invention, the region can include a base, the information acquisition unit can also acquire information about the base, and the search area setting unit can use the base as a reference point.

In the course preparation system of the present invention, the search region setting unit may first select a seed, which is a starting point when creating a course, within a plurality of traversal points, and set an axis to pass through the reference point and the seed.

In the course preparation system of the present invention, the search region setting unit may set the search region in consideration of the distance from the seed.

In the course preparation system of the present invention, the search region setting unit determines whether the distance between the reference point and the seed is within a predetermined length, and when the distance between the reference point and the seed is longer than the predetermined length, the length of the axis line is The axis can be set to be greater than the distance between the reference point and the seed.

In the course preparation system of the present invention, in consideration of the statistic, the delivery method selection unit may further include a delivery method selection unit for selecting which of the plurality of delivery methods to deliver to each circuit point, wherein the selection unit is provided for each delivery method. It is possible to choose the circuit point to include in the same course.

Here, the delivery method may be in the form of a delivery course. For example, after a delivery base is departed in the morning, the delivery method is delivered without returning to the base until evening (hereinafter, simply referred to as a single course). Alternatively, after leaving the delivery base, it may include a method of returning to the base after performing a delivery operation to tour several circuit points, and performing another delivery operation again during the day (hereinafter referred to simply as a piston course). This makes it possible to create an appropriate delivery course in consideration of the delivery time and the delivery amount of the article, for example, when delivering the article in a vehicle such as a track. Here, if the delivery time can be as long as possible, it can be included in a single course, and if it can be as much as the delivery amount, it can be included in the piston course. As a result, the number of workers and vehicles can be reduced.

In the course preparation system of the present invention, the plurality of delivery methods may have different upper limits of the first statistical amount determined by the delivery time to the selected circulation point. In this way, for example, an employee with different working hours can be assigned to an appropriate delivery course, thereby reducing the number of employees.

In the course preparation system of the present invention, in any of a plurality of delivery methods, the upper limit value of the second statistical amount determined by the amount of the article delivered to the selected circulation point can be made substantially the same. Here, making the upper limit of the second statistical amount approximately equal means, for example, making the loading amount of a vehicle such as a track uniform. By uniformly standardizing the loading amount of the vehicle in this way, the problems such as the arrangement of the delivery base, the parking space of the delivery destination, and the like also become easier than the case where the variation in the scale of the vehicle occurs. This makes it possible to easily and automatically create a delivery course.

In the course preparation system of the present invention, the region may include a base, and the delivery method selection unit may select a delivery method according to the distance from the base of the seed, which is a reference when creating a course selected from a plurality of circulation points. have.

According to the present invention, a program for allowing a computer to select a circuit point included in a same course when creating a course for delivering an article in an area including a plurality of circuit points, wherein the computer includes a circuit point included in the area. Information acquisition means for acquiring information on the information, selection means for selecting the circulation points included in the same course based on the information on the circulation points, and adding the circuit points selected by the selection means to the course and then including them in the course Function as calculation processing means for calculating a statistic determined by the circulating points to be determined, and the selection means determines whether the statistic calculated by the calculation processing means is within a predetermined range, and selects a circulation point when it is within the range. When it is out of range, it continues selection of a circuit point again. A program is provided.

In the program of the present invention, the calculation processing means can calculate at least one of the first statistical amount determined by the delivery time to the selected circulation point and the second statistical amount determined by the amount of the article delivered to the selected circulation point. The selection means can determine whether at least one of the first statistical amount and the second statistical amount is within a predetermined range.

In the program of the present invention, the computer functions as a condition accepting means for accepting the setting of conditions to be considered when the selection means selects a circulation point, and the selection means is a circulation point in accordance with the setting accepted by the condition accepting means. Can be selected.

In the program of the present invention, the computer functions as a condition accepting means for accepting the setting of conditions to be considered when the calculating processing means calculates the statistics, and the calculating processing means is subject to the settings received by the condition accepting means, Statistics can be calculated.

In the program of the present invention, the computer functions as an end condition accepting means for accepting setting of an end condition for terminating course creation, and the selecting means satisfies the end condition even when the statistics are out of range. The selection of the circulation point can be finished.

In the program of the present invention, the information acquisition means can acquire the information about the circulation point from an external system.

In the program of the present invention, the information acquisition means judges whether the information necessary for calculating the statistics by the calculation processing means is included in all of the information acquired from the external system, and when all the necessary information is not included. Can be performed to prompt the input of the replacement information of the necessary information.

In addition, any combination of the above components and the expression of the present invention converted between a method, an apparatus, a system, a recording medium, a program, and the like are also effective as aspects of the present invention.

As described above, according to the present invention, when creating a plurality of delivery courses in an area, it is possible to create a course that can reduce the number of required workers and efficiently carry out the circulation work by simple processing. According to the present invention, such a course can be created flexibly.

Hereinafter, the Example of this invention is described using a circulation point as a store.

In the embodiment of the present invention, an example of creating a plurality of delivery courses for delivering goods by track to each store in an area including a plurality of stores will be described. Each person in charge loads the goods on the track at the delivery base every day, delivers them to the stores included in the delivery course, and then performs the delivery work that returns to the delivery base.

In the embodiment of the present invention, various types of information, such as map information data, base information data, and store information data, required for course preparation, are used by existing commercial information and companies independently maintained. For example, as the base information data and the store information data, it is assumed that the master information collected, updated and accumulated is used every day in the system maintained by each company. This eliminates the need to deliberately accumulate information on bases and stores for the course preparation system of the present invention, facilitates processing, and effectively utilizes existing corporate assets and the like. In addition, the master information that the company's system builds is updated daily because it is used not only for course preparation but also for other purposes. Therefore, the consistency of data is also extremely high, and the course preparation can be made precise by using such master information. As a result, the configuration of the course creation system can be simplified.

1 is a diagram showing a course creation system and an external system according to an embodiment of the present invention.

The course creation system 100 includes an information acquisition unit 170. The information acquiring unit 17O is the first external system 10, the second external system 20a, and the third through the network 148, for example, using a fixed telephone line, a cellular telephone network, a dedicated line, or the like. It is connected to the external system 20b and the fourth external system 20c. In addition, these systems can also be directly connected using a cable or the like.

The first external system 10 includes a map information providing server 12 and a map information storage unit T1. The second external system 20a includes an information providing server 22a, a base information storage unit T2a, and a store information storage unit T3a. The third external system 20b includes an information providing server 22b, a base information storage unit T2b, and a store information storage unit T3b. The fourth external system 20c includes an information providing server 22c, a base information storage unit T2c, and a store information storage unit T3c. The second external system 20a, the third external system 20b, and the fourth external system 20c are each managed by different companies, and the course creation system 100 is one of these external systems. Various information can be read by either. The course creation system 100 can create a course by reading information from any external system suitably according to a user's request.

The map information storage unit T1 stores map information data for displaying bases and stores in the target area on the map. As the map information data, for example, commercial digital map information can be used. The map information providing server 12 provides map information data to the course preparation system 100 through the network 148. In this way, it is not necessary to deliberately prepare map information data for course preparation, and since the course preparation system 100 only needs to read and store only the data necessary for course preparation, the cost efficiency at the time of course preparation can be improved.

The base information storage unit T2a, the base information storage unit T2b, and the base information storage unit T2c respectively manage the second external system 20a, the third external system 20b, and the fourth external system 20c. Stores corporate base information data. The base information data includes an identification code of the base, the name of the base, the position of the base (latitude and longitude, or the X coordinate and the Y coordinate). Here, a base is a delivery base, such as a distribution center in the area, for example.

The store information storage unit T3a, the store information storage unit T3b, and the store information storage unit T3c respectively manage the second external system 20a, the third external system 20b, and the fourth external system 20c. Store company store information data. The store information data includes the identification code of the base, the identification code of the store, the name of the store, the location of the store (latitude, longitude and height or X coordinates, Y coordinates and Z coordinates), the amount of deliveries per month, the number of monthly deliveries, and the date and time of delivery. Each company manages self, such as working time (minute), movement speed (km / hour) from base, movement speed (km / hour) between stores, monthly sales (Japanese yen), monthly sales (product) per product We collect every day about store to do. Stores information that is updated and accumulated.

The information provision server 22a, the information provision server 22b, and the information provision server 22c provide base information data and store information data to the course preparation system 100 via the network 148. FIG. In this way, it is not necessary to collect, update, and accumulate base information data and store information data on purpose to create a course, and the course creation system 100 only reads and stores only the data necessary for course preparation. The processing can be facilitated. You can also simplify the system configuration.

2 is a flowchart showing the procedure of course creation processing in the embodiment of the present invention.

First, conditions necessary for course preparation are set (S2). Subsequently, information necessary for course preparation is acquired (S3). In addition, a part of setting of the condition of step 2 may be performed after the information of step 3 is acquired. Next, various kinds of information such as map information, base information and store information are displayed (S4). Subsequently, stores included in the same course are sequentially selected, and a course is created (S6). Thereafter, the course creation result is displayed (S8). At the same time, the course creation result is saved based on the user's instruction or automatically (S10). Subsequently, the course creation result is evaluated and rewritten (S12). When the evaluation and the rewriting are finished, the course creation process ends.

[First Embodiment]

3 is a block diagram showing the configuration of the course creation system 100 in the first embodiment.

In addition to the information acquisition unit 170 described above, the course creation system 100 includes a display processing unit 108, a condition setting reception unit 110, a store selection unit 112, a determination unit 114, and a calculation. The processing unit 116, the adjustment processing unit 122, the course state evaluation unit 124, the search area setting unit 160, the course shape selection unit 162, the conditional storage unit T4, and the course information storage unit T5, logic storage unit T6, search area storage unit T8, display information storage unit T11, acquisition information storage unit T12, and management information storage unit T13. The calculation processing unit 116 includes a calculation unit 118 and an optimization processing unit 120.

The condition setting accepting unit 110 accepts setting of various conditions for creating a course from a user. The condition storing unit T4 stores the condition accepted by the condition setting accepting unit 110.

The condition setting accepting unit 110 accepts, for example, designation of an area where a course should be created, designation of a base, and the like from the user.

In addition, the condition setting reception unit 110 may be, for example, the daily work time of each person in charge, the lower limit work time, the start time of work, the time of loading goods, the rest time, the work time after returning to the base, Accept conditions such as standard working hours, standard moving speeds between stores, standard moving speeds between bases and stores, and track loads.

In addition, the condition setting accepting unit 110 accepts setting of conditions to be considered when preparing a course. For example, whether you need to consider the time needed to traverse your course, whether you need to consider the volume of your tour, whether you need to consider the days of each traversal point, The setting of the conditions, such as whether or not to select a traveling point included in the same course, is performed for the search area of. In this way, by accepting setting of conditions to be taken into consideration during the course creation, various courses can be flexibly created according to the needs of the user. In addition, the course creation process can be facilitated, and the course can be created quickly.

In addition, the condition setting accepting unit 110 accepts the setting of the allowable loading rate of the loading amount such as the maximum loading amount and the minimum loading amount of the track. Here, the maximum loading amount is the amount in which no more articles can be loaded in each track, and the lower limit loading amount is a target value of the lower limit of the loading amount. Here, when using a 2t track, for example, the maximum load can be set to 2t, the allowable load ratio can be set to 80%, for example, and the lower limit can be set to 1.6t of 80% of the maximum load. In this way, by setting the allowable load ratio of the load amount, each track can be used efficiently, thereby reducing the number of vehicles such as the track and the number of workers. Moreover, by providing such a range of allowable loading rate, the range which satisfies the termination condition in the course creation process shown in step 6 of FIG. I can do it.

In addition, the condition setting acceptance unit 110 accepts the setting of the upper limit and the lower limit of the course time. Here, the course time is the time from the base to the shops in the course and back to the base. It includes the time to load the goods in the course time, the travel time of the track, the work time at each store, the work time after returning to the office, and the like. For example, the upper limit of the course time can be the daily work time of each person in charge, and the lower limit time can be set so that the difference from the upper limit time is within 1 hour. Thus, by providing the allowable range of course time, the range which satisfy | fills the termination condition in the course creation process shown in step 6 of FIG. 2 can be expanded, and the process for obtaining the optimal solution of delivery course preparation is quick. I can do it.

The condition setting accepting unit 110 can also accept the designation of a combination of stores included in the same course among a plurality of stores. The user can, for example, perform combination designation for a store in the same building or a store for which the same person in charge is to be delivered. As a result, each person in charge can efficiently perform the delivery work.

The condition setting accepting unit 110 also accepts setting of parameters necessary for setting a search area when selecting a store included in the same course. The parameters include, for example, selection conditions of the seed store, search angle, distance from the base, distance from the seed store, distance from the axis, and the like. Here, a seed store means the store used as a starting point when creating a course. In addition, an axis means the straight line which passes through a base and seed store by making a base into one end.

The condition setting accepting unit 110 can accept settings such as an upper limit of the distance between the stores included in one course, an upper limit of the distance between the base and the store, and an upper limit of the search angle. By accepting these settings, the range for satisfying the end condition in the course creation process can be widened, and the process for obtaining the optimal solution for delivery course creation can be quickly performed.

The information acquisition unit 170 refers to the conditional storage unit T4, and provides the first external system 10 and the second external system 20a with map information, base information, and store information related to the designated area or the designated base. ), The third external system 20b and the fourth external system 20c are appropriately read. The acquisition information storage unit T12 stores various kinds of information read by the information acquisition unit 170. In this way, the information acquisition unit 170 reads only necessary information from the first external system 10 and the second external system 20a to the fourth external system 20c, so that the course creation system 100 The configuration of can be simplified. In addition, for example, collection, update, and accumulation of information such as base information and store information are performed by other systems (the second external system 20a to the fourth external system 20c), which are necessary for course preparation. Since the processing is distributed, the processing of the course preparation system 100 can also be made simple and easy. The detailed structure of the information acquisition part 170 is mentioned later.

The display processing unit 108 performs a process of displaying various types of information and the created course state on the screen (not shown) together with the map information. The display information storage unit T11 stores information for the display processing unit 108 to conveniently display various types of information. The display processing unit 108 determines the display shape of each store or the like with reference to the store information of each store and the display information storage unit T11 stored in the acquisition information storage unit T12.

The search area setting unit 160 performs a process of setting a search area when selecting a store included in the same course with reference to the condition storage unit T4. The search area storage unit T8 stores at least temporarily the search area set by the search area setting unit 160.

The course type selection unit 162 can accept setting of course types, such as a plurality of course types. Here, the course form is, for example, a single course starting from the base in the morning, circulating each store in the course, taking a day break on the way, and then circulating each store in the afternoon and returning to the base in the evening. B) A piston course starting from the base in the morning, traveling to each store in the morning course, returning to the base, taking the day off, and then leaving the base again, traveling to each store in the course and returning to the base in the evening. . For example, when you go to a store that is far from the base, it takes longer to return to the base, so it is better to use a single course. On the other hand, when turning around a store located close to the base, the piston course is more efficient because the total amount per day that can be delivered by one track increases substantially. In order to reduce the number of tracks and to create a more flexible course, it is preferable to create a large number of piston courses. The course type selection unit 162 refers to the conditional storage unit T4 and selects whether to create a single course or a piston course.

The store selector 112. While referring to the conditions relating to the course selected by the course type selection unit 162, the search area storage unit T8 is referred to, and in the search area set by the search area setting unit 160, stores included in the same course are sequentially. Choose. The store selection unit 112 may end the selection of the store by referring to the condition storage unit T4 when the store that matches the condition accepted by the condition setting accepting unit 110 is not included in the search area. By doing in this way, the range which satisfy | fills the termination condition in course creation process can be widened, and the process for obtaining the optimal solution of delivery course preparation can be performed quickly.

In addition, in the present embodiment, the store selection unit 112 can create a new course by referring to the information about the course already created. The course creation process will be described later. The course information storage unit T5 stores information about the created course.

In the calculation processing unit 116, the calculation unit 118 gradually calculates the total amount and / or course time of the store selected by the store selection unit 112. The optimization processing part 120 calculates the circulation order which can traverse these stores in the shortest path | path based on the positional information of the stores contained in the same course. In an area including a plurality of traversal points, the shortest path for traversing these traversal points can be obtained by a so-called traversal salesman problem. The circuit salesman problem is a problem of searching for the shortest path when the salesman travels through n cities once. If the number of figures is n, there are combinations of (n-1)! / 2, and if the number of n becomes large, the number of all combinations increases exponentially, and therefore it is difficult to obtain the exact solution. Thus, various approximation algorithms are used to optimize the combination. Examples of such approximation algorithms include random search, mountain climbing, simulated annealing (SA), genetic algorithm (GA), and the like. In the present embodiment, the optimization processing unit 120 calculates a traversal order that can traverse the shops included in the course with the shortest path, using such an approximation algorithm as appropriate.

The determination unit 114 determines whether the total amount and / or course time calculated by the calculation unit 118 are within a predetermined range. When the total amount or course time is not within a predetermined range, the adjustment processing unit 122 corrects, for example, exchanging a shop included in the course with another unselected shop.

The course state evaluation unit 124 determines whether all the stores in the area are included in any one course and the created course is appropriate when the course creation process is completed. The course state evaluation unit 124 determines the appropriateness of course preparation by, for example, calculating a theoretical value of the number of courses required in the area and comparing it with the number of courses actually created. Moreover, according to the conditions accepted by the condition setting reception part 110, even if the store which is not included in a course remains in the area, a course preparation process can be complete | finished. This makes it possible to quickly create a course.

In addition, the logic storage unit T6 stores logic relating to various processing procedures. The management information storage unit T13 stores management information about an external system (the first external system 10 and the second external system 20a to the fourth external system 20c).

4 is a diagram showing a part of a data structure relating to store information stored in the acquisition information storage unit T12. Here, the acquisition information storage unit T12 includes a base code column, a store code column, a name column, a location column, a height column, a work time column, a delivery amount column, a collection column, a temporary condition column, a flexibility parameter column, and the like. Among these, contents such as a base code column, a store code column, a name column, a location column, a height column, a work time column, a delivery amount column, a collection column, a temporary condition column, and the like can be used that the system of each company holds as master information in advance. The flexibility parameter represents the degree of limitation when each shop is included in the course. For example, a store having a fixed delivery day or time has to be delivered on that day or time, so the degree of restriction is strong. Therefore, the flexibility parameter is set low. In addition, stores with a high number of monthly deliveries have low flexibility parameters. The flexibility parameter is set by the information acquisition unit 170, for example.

For example, the store of store code "a" belongs to the base of base code "1000", is named "super", the position is "(X ₁ , Y ₁ )", and the height is "ground". , The working time at this store is "25 minutes", the number of deliveries per week is 0.001t, the number of deliveries per week is twice, and the temporary condition for delivery is "-(no special)". In addition, this store has twice the number of deliveries per week, but there is no temporary condition, so the flexibility parameter is "3" of medium. For example, the store of store code "b" belongs to the base of base code "1000", is named "shopping mall 1", the position is "(X ₂ , Y ₂ )", the height is "ground", The working time at this store is "15 minutes", the amount of delivery per time is 0.002t, the number of times of delivery per week is three times, and the temporary conditions of delivery are "Mon, Wed and Fri." That is, it is necessary to deliver goods to the store of store code "b" every Monday, Wednesday, and Friday. In this store, since the temporary conditions are also determined three times per week, the flexibility parameter is the lowest "1".

FIG. 5 is a block diagram showing in detail the information acquisition unit 170 shown in FIG. In the present embodiment, the course creation system 100 receives various types of information from an external system (the first external system 10 and the second external system 20a to the fourth external 10 system 20c). Acquire. These external systems may be run by other companies. When various types of information are acquired from a plurality of different companies, there is a possibility that the configuration of the database is different or the transmission format is different for each company. For example, field names (items) and field processing of the database may be different.

The information acquisition unit 170 has a function of integrating these data. The management information storage unit T13 stores management information on the characteristics of those databases and transmission formats for each external system.

The information acquisition unit 170 includes a reading unit 200, a field name conversion unit 202, a lack field detection unit 204, and a lack field input instruction unit 206. The reading unit 200 reads various kinds of information from the first external system 10 and the second external system 20a to the fourth external system 20c. The field name conversion unit 202 converts the field names of the read data with reference to the management information storage unit T13 after the reading unit 200 reads out various kinds of information. The lack field detection unit 204 detects the missing field for each data among the fields required for course preparation. The lack field input indicating unit 206 instructs the condition setting accepting unit 110 to accept the input of the replacement information from the user for the missing field. The condition setting accepting unit 110 receives an instruction from the lack field input indicating unit 206 and receives input of substitute information such as an average value of the field from the user. For example, some companies do not accumulate the delivery amount of goods for each store as master information. When the information acquisition unit 170 reads the store information in the system of such a company, the store managed by the company lacks information on the delivery amount of goods. In such a case, the condition setting accepting unit 110 stores the data necessary for the course creation in the acquisition information storage unit T12 by inputting an average value of the delivery amount of the article to the user.

FIG. 6 is a diagram showing the internal configuration of the store information storage units T3a to T3c held by the second external system 20a, the third external system 20b, and the fourth external system 20c, respectively. 6 (a) shows the internal structure of the store information storage unit T3a, FIG. 6 (b) shows the internal structure of the store information storage unit T3b, and FIG. 6 (c) shows the internal structure of the store information storage unit T3c. do. As shown in the figure, the store information storage unit T3a has field names of "Delivery destination" and "Address". The store information storage unit T3b has field names of "No." and "Store name". The store information storage unit T3c has field names of "subject to" and "shop". Here, the "delivery address" of FIG. 6A, the "store name" of FIG. 6B, and the "shop" of FIG. 6C, although field names differ, all correspond to the "name" of FIG. In addition, the "address" of FIG. 6 (a) is the "location" of FIG. 4, the "No." of FIG. 6 (b) is the "store code" of FIG. 4, and the "subject" of FIG. It corresponds to "base code" of FIG. 4, respectively.

7 is a diagram showing the internal structure of the management information storage unit T13. The management information storage unit T13 has a management table for each external system. FIG. 7A is a management table for the second external system 20a. Here, the fact that "delivery address" in store information storage section T3a corresponds to "name" and "address" corresponds to "location" is stored. FIG. 7B is a management table for the third external system 20b. Here, "No." in the store information storage unit T3b stores "store code", and "store name" corresponds to "name". 7C is a management table for the fourth external system 20c. Here, the meanings corresponding to "association destination" in the fourth external system 20c correspond to "base code" and "shop" correspond to "name". The field name conversion unit 202 converts the field names of the data obtained from each external system with reference to the management information storage unit T13.

8 is a diagram showing data for each transmission format. Fig. 8 (a) schematically shows data in which data is transmitted in an XML format. 8 (b) schematically shows data transmitted in CSV format. The management information storage unit T13 stores the transfer format and the transfer order of data for each external system.

Returning to FIG. 5, the information acquisition unit 170 further includes an information provision unit 208. The information providing unit 208 selects stores included in the same course for each store, or provides information necessary for calculating statistics such as total quantity and course time, and stores the information in the acquisition information storage unit T12 in correspondence with each store. do. For example, the information provision unit 208 assigns flexibility parameters to each store based on the store information acquired by the reading unit 200.

FIG. 9 is a diagram showing an input screen when the condition setting accepting unit 110 accepts, from the user, setting of conditions to be considered when creating a course. Here, "time consideration", "quantity consideration", "weekday consideration", and "search area setting" can be selected.

In the present embodiment, the course creation system 100 can create a course in consideration of the upper limit and the lower limit of the course time. The user checks "Time consideration" when he / she wants to create a course in consideration of the course time. In addition, in the present embodiment, the course preparation system 100 can create a course in consideration of the maximum load amount, the minimum load amount, and the like of the track. When the user wants to create a course in consideration of the loading amount, the user checks "Consider quantity."

In the present embodiment, the course creation system 100 can create a course in which the traversal points included in the course are fixed, for example, each traversal point is traversed every week. When the user wants to create a delivery course for each day of the week, the user checks "Consider day of week". When "consideration of the day of the week" is checked, the course making system 100 includes the store which should be delivered every Monday in the course, and the store where the delivery day is not fixed is in balance with other stores on each day We make course so that it is included in course of any day so that course time in the average is averaged.

In addition, in this embodiment, in order to objectively create a course, the course preparation system 100 can set a plurality of search areas in the area in advance, and can create a course for each search area. When the user wants to create a course after setting the search area, the user checks "Search area setting".

10 and 11 are diagrams illustrating screens through which the condition setting accepting unit 110 receives an input of a condition for creating a course. In Fig. 10 (a), a screen for inputting a load amount of a track, an allowable load rate, and a work start time of a worker at the delivery point is shown. Here, the load capacity of the track is set to 2t, the allowable loading rate is 80%, and the start time is 8 o'clock. In such a case, it is possible to set the range that satisfies the end condition of the course creation at the time of making the delivery course within the range of 1.6t or more and 2t or less of 80% of 2t, so that the processing for obtaining the optimal solution for the delivery course creation can be performed quickly. have. In addition, when a user does not check "consider quantity of quantity" with respect to the input screen shown in FIG. 9, input of a loading quantity etc. can also be abbreviate | omitted.

In addition, in Fig. 10B, a screen for inputting the reference work time, the lower limit work time, the loading time, the rest time, and the work time after the return to the company for each of the single course and the piston course is displayed. . Here, the standard working time for a single course is 405 minutes, the lower working time is 10 minutes, the loading time is 10 minutes, the rest time is 60 minutes, and the working time is 10 minutes after returning to work. In the case of the piston course, the reference work time of course A is 190 minutes, the minimum work time is 10 minutes, the reference work time of course B is 195 minutes, and the minimum work time is 10 minutes. Here, for example, the course A may be a course circulating in the morning, and the course B may be a course circulating in the afternoon. In addition, the loading time for both sides is set to 10 minutes, the break time is 60 minutes, and the working time after returning to the company is set to 10 minutes. In addition, when a user does not check "time consideration" with respect to the input screen shown in FIG. 9, input of a working time etc. can also be abbreviate | omitted.

In FIG. 11 (a), a screen for setting the procedure of course creation, the piston creation method, the seed selection method, and the like is displayed. Here, the purpose to create from a piston course and the preparation of a piston are set normally to select a seed from the inside.

11 (a) also shows a screen for inputting the distance from the seed, the search angle and the distance from the axis. In the present embodiment, when creating a delivery course, the search area is set by setting an angle limit and a distance limit based on an axis that has a base as a center around the delivery point, and the delivery course starts from within the search area. We make course by choosing store to include. Here, for example, as an initial value, the distance r from the seed is set to 5 km, the search angle α is 5 degrees, and the distance d from the axis is set to 1 km, and the areas within these ranges are set as the first search area. Further, even if a process of selecting a store included in the same course is performed in the first search area, the search area is enlarged when it is still necessary to select another store. Here, an incremental setting for that is also made. As an increment, for example, the distance r from the seed is 0.5 km, the search angle α is 520 degrees, the distance d from the axis is increased by 1 km, and the search area is enlarged as in the second search area and the third search area. Stores included in the same course are selected. For example, the upper limit of the distance d from an axis is set to 30 km. In addition, when a user does not check "search area setting" with respect to the input screen shown in FIG. 9, input such as a distance from a seed may be omitted.

In FIG.11 (b), the screen which inputs the conditions of the store for inclusion in a piston course is displayed. For example, as a condition for inclusion in the piston course, the upper limit of the travel time to the store is 60 minutes, the lower limit is 30 minutes, the pitch is 10 minutes, and the upper limit of the amount of the goods delivered to the store is 0.005t. , The lower limit is set to 0.001t and the pitch is set to 0.0002t. Here, the pitch means that if it is still necessary to select a store to be included in the course even after performing a process of selecting a store included in the target course for a store that satisfies the conditions set initially, It is a condition to relax the condition. In addition, in FIG. 9, input may be abbreviate | omitted about the condition which is not checked.

12 is a diagram showing a base and a plurality of stores in the area as points. Here, for example, stores such as points a, c, and e in a region surrounded by circle Cl within a predetermined range from the base can be included in the piston course because they are relatively close to the base. Further, for example, stores such as points b, d, and f in areas surrounded by circle C ₂ other than the area surrounded by circle C ₁ can be included in a single course because they are relatively far from the base. For example, it is also possible to include in a piston course about the store with a large quantity of articles | delivered per one time. As a result, even when the loading rate of the track is high, the delivery time can be shortened and the overall efficiency can be improved. Further, for example, stores such as points a, c, and e, which are relatively close to the base, have short travel times to these stores and are highly flexible, so that the delivery course is determined once to be included in a single course. Even if it is, it can also be made into the object of the adjustment process contained in a piston course at the time of an adjustment process.

FIG. 13 is a diagram showing an example of a part of the data structure of the conditional storage unit T4. As a selection condition of the seed store, the intention to select from the position (inner side) near a base is set here. The search angle is set at an initial value of 5 degrees and an increment of 5 degrees. As a distance from a base, the initial value is set to 10 km and an increment is set to 1 km. As a distance from a seed store, the initial value is set to 5 km and an increment is 0.5 km. As the distance from the axis, the initial value is set to 1 km and the increment is 1 km.

FIG. 14 is a diagram showing a part of the data structure of the course information storage unit T5 in the present embodiment. The course information storage unit T5 also stores schedule information about the already created course. Here, in this area, tracks of tracks No. 1 to 6 are included, and the delivery date is made from Monday to Friday.

The store selection unit 112 sets the day of the course to be created this time so that the total course time of each day is equalized with reference to the schedule information in FIG. 14 when a store without date designation is selected as the seed store. .

Here, since the course time on Tuesday and Wednesday is the lowest at "2", the store selection unit 112 sets that the course to be created this time is delivered on track No. 2 on Wednesday.

When the delivery date of this course is set to Wednesday, the store selection unit 112 refers to the store information of the acquisition information storage unit T12 when selecting a store to be included in this course, or We choose store without day designation. In addition, when the user does not check "Consider the day of the week" with respect to the input screen shown in FIG. 9, the store selection unit 112 selects a store without considering schedule information. As a result, the course creation process can be simplified, and the course can be created quickly.

FIG. 15 is a flowchart specifically showing a course creation process of step 6 shown in FIG. 2.

First, the course type selection unit 162 refers to the conditional storage unit T4 and selects the course form of the course to be created from now on (S14). Subsequently, the store selection unit 112 selects a seed store serving as a reference for course preparation (S16). The store selection unit 112 refers to the condition storage unit T4 and sets the seed in accordance with the perspective (from inside or from outside) of the position from the base. For example, the store selection unit 112 may set the seed as a seed in order from a store having a low flexibility parameter with reference to the acquisition information storage unit T12. A store with a low flexibility parameter is, for example, a store with a large number of monthly visits or a store with a designation for the date and time of visit. In this way, a flexible course creation can be performed by first setting the strongest delivery destination of the delivery condition restriction as a seed.

Next, the store selection unit 112 selects a store included in the same course as the selected seed store (S40). The store selection unit 112 refers to the base information and the store information stored in the acquisition information storage unit T12, the schedule information of the condition storage unit T4 and the course information storage unit T5, and the like, and the distance or positional relationship from the base or seed store. We choose store to include in course based on back. The detail of the selection method of a store is mentioned later.

When the store selection unit 112 selects a new store (S40), the calculation unit 118 calculates the total amount and / or course time of the stores included in the course (S42). At this time, the calculation unit 118 calculates the course time when the stores in the course are traversed in the selected order. Thereby, the time required for calculation can be shortened. The determination unit 114 determines whether the total quantity exceeds the maximum load of the track (S44). When the total amount does not exceed the maximum load (No in S44), the determination unit 114 determines whether the course time exceeds the upper limit time (S46). In addition, when the user does not check "consider quantity" with respect to the input screen shown in FIG. 9, step 44 may be skipped and it may advance to step 46. FIG. As a result, the course creation process can be made simple and easy, and the course can be created quickly.

If the course time does not exceed the upper limit time (No in S46), the determination unit 114 determines whether or not the end condition for setting the delivery course is satisfied (S48). The end condition may be, for example, a case where the total quantity is a lower limit loading amount or more and a maximum loading amount or less and the course time is a lower limit time or more and an upper limit time or less. In addition, in the adjustment process demonstrated below, even if it carries out the exchange process for all the stores within a predetermined range, it can be set as the case where the total amount or course time did not improve. If the end condition is not satisfied (No in S48), the process returns to step 40, and the store selection unit 112 selects the next store.

In step 46, when the course time exceeds the upper limit time (Yes in S46), the optimization processing unit 120 detects the optimum order that can traverse the stores included in the course in the shortest path order (S50). . The calculating part 118 calculates the real course time at the time of delivering in the optimum order (S52). Subsequently, the determination unit 114 determines whether the actual course time exceeds the upper limit time (S54). If the actual course time does not exceed the upper limit time (No in S54), the flow advances to step 48 to determine whether the end condition is satisfied, and the same process as described above is repeated. In step 48, when it is determined that the end condition of course creation is satisfied (Yes in S48), the course creation process ends. In addition, when the optimum order is detected in step 50 and the actual course time is calculated in step 52, the course information storage unit T5 stores the optimum order and the actual course time, and thereafter, the course time is stored in step 42. In calculating, the course time may be calculated by adding the time to tour the selected store after this actual course time.

On the other hand, when the total quantity exceeds the maximum load in step 44 (Yes in S44) or when the actual course time exceeds the upper limit time in step 54 (Yes in S54), the adjustment processing unit 122 The adjustment process (S56) is performed. In addition, when the user does not check "Time consideration" with respect to the input screen shown in FIG. 9, step 46 is skipped and it can progress to step 48. FIG. As a result, the course creation process can be made simple and easy, and the course can be created quickly.

FIG. 16 is a flowchart specifically showing an example of the store selection process of step 40 of FIG. First, the store selection unit 112 sets the axis passing through the base and the seed store (S18). The store selection unit 112 then sets a search area (S20).

An example of a method for setting a search area will be described with reference to FIG. 17. 17 is a diagram showing a base and a plurality of stores in the area as points. Here, the point a is described as a seed store. The store selector 112 sets, as the axis L, a straight line connecting the base and the point a with the base as one end. The store selection unit 112 refers to the condition storage unit T4 and sets a search area based on various preset conditions. Here, when the initial value of the distance from the base is 10 km and the initial value of the search angle α is set to 5 degrees, the search area becomes a fan-shaped area having an angle of 10 degrees at a radius of 10 km.

Returning to FIG. 16, the store selector 112 moves the search axis by rotating the search axis around the base in the search area set by the store selector 112 (S22). The store selection unit 112 selects the store when the search axis collides with the store (Yes in S24) (S26). As described above, in the present embodiment, since the stores colliding with the search axis are automatically taken into the course, a course with high objectivity can be created.

In addition, the store selection unit 112 may select a store to be accommodated in the course in consideration of the distance between the base and the store to be selected according to the type of the course selected by the course type selection unit 162, for example. . For example, when creation of a single course is selected by the course type selection unit 162, the store selection unit 112 can preferentially select a store at a position far from the base. In addition, the store selection unit 112 may select a store to be accommodated in the course in consideration of the quantity of goods to be delivered to each store, for example, according to the form of the course selected by the course type selection unit 162. For example, when creation of the piston course is selected by the course shape selection unit 162, the store selection unit 112 can preferentially select a store having a large amount of delivery. In addition, the store selection unit 112 may preferentially select a store having a low flexibility parameter. This is because stores with high flexibility parameters can be easily incorporated into other courses in subsequent processing.

Referring to FIG. 17 again, the store selector 112 simultaneously moves the search axis in the directions of the broken lines L ₁ and L ₂ forming the angle α with the axis L, respectively. When the search axis is moved in this manner, the store selection unit 112 selects the stores from the stores that collide with the search axis in order. Here, since the search axis moved in the direction of the broken line L ₂ collides with the point b, the store selection unit 112 selects the point b. Next, since the search axis moved in the direction of the broken line L1 collides with the point c, the store selector 112 selects the point c. Similarly, the store selection unit 112 selects the points d, the points e, and the points f in this order.

When the store selection unit 112 selects the stores sequentially, the total amount of water in step 42 and / or the course time calculation process shown in FIG. 15 are performed, and the adjustment process in step 56 is performed. In step 48 shown in FIG. 15, when it is determined that the end condition of course preparation is not satisfied (No in S48), the process returns to step 24 in FIG. 16 and it is determined whether there are other stores on the search axis.

In step 24, when there is no store (No in S24), the determination unit 114 determines whether or not the search in the search area has ended (S36). If the search in the search area has not ended (No in S36), the process returns to Step 22 and the search axis is moved. On the other hand, in step 36, when the search in a search area is complete | finished (Yes of S36), the store selection part 112 enlarges a search area with reference to the conditional | stored memory part T4 (S38).

The process of enlarging the search area is described below.

18 and 19 are diagrams showing a search area set by the store selection unit 112. 18 shows an example in the case where the seed store a is selected from a position relatively close to the base. When creation of the piston course is selected by the course type selection unit 162, the store selection unit 112 can select the seed store at a position relatively close to the base. First, as shown in Fig. 18A, the store selector 112 makes the first search area a first area having a distance from the seed shop within a predetermined range between the straight lines L ₁ and L ₂ . . In addition, the store selector 112, even if not included in the first region, is located between the dashed line D ₁ and the dashed line D ₂ at a predetermined distance d from the straight line L (axis line) connecting the base and the seed store a. Also included in the first search area. Here, the second region is a region located closer to the seed store a than the straight line H passing through the base substantially perpendicular to the axis L. FIG. Thus, even if the angle with the axis L is not included in the predetermined range, the first search area includes a second area whose distance with the axis L is within the predetermined range, thereby creating a course that can be efficiently traversed. Can be. In this embodiment, since each search area is set based on the axis L connecting the base and the seed store, the processing time required for setting the search area can be shortened, and a course with high objectivity can be efficiently created.

Subsequently, as shown in FIG. 18B, the store selection unit 112 sets the third area, which is a distance from the seed store, as the second search area. Thereafter, the store selection unit 112 opens the angle at the axis L as shown in FIG. 18 (c), and sequentially sets the fourth area between the straight line L ₁ ′ and the straight line L ₂ ′ as the third search area. We expand search area. At this time, the store selection unit 112 may include the fifth region between the broken line D ₁ ′ and the broken line D ₂ ′ at a predetermined distance from the axis L, even if not included in the fourth region. Can be.

In the search area as described above, the store selection unit 112 first selects a store in the first search area in the same manner as described with respect to step 26 in FIG. 16. At this time, for example, the store selection unit 112 selects the store in the first area even in the first search area, and then sequentially stores the stores in the order in which the distance to the axis L is close in the second area. Make a selection.

Even if the selection of the store in the first search area is completed, but the end condition for course creation is not satisfied, the store selection unit 112 selects the store for the second search area. Subsequently, even when the selection of the store in the second search area is finished, if the end condition of course creation is not satisfied, the store is selected for the third search area.

In this way, the store selection unit 112 refers to the condition storage unit T4 and sequentially expands the search area based on the condition set as the increment. At this time, the method of enlarging the search region may be preferably to enlarge the angle with the axis L first, or to increase the distance from the seed store or the base preferentially, and is appropriately set according to the purpose. The store selection unit 112 performs the store selection process until the predetermined end condition is satisfied.

19 shows an example in the case where the seed store a is selected from a position relatively far from the base. When creation of a single course is selected by the course type selection unit 162, the store selection unit 112 can select the seed store at a position relatively far from the base. In this case, first, as shown in Fig. 19A, the store selection unit 112 includes a first region and a first region in which the distance from the seed store a is within a predetermined range between the straight line L ₁ and the straight line L _2. Even if not in the area, the second area located closer to the base than the seed store a is used as the first search area. In addition, the store selector 112 may include the third area between the line D ₁ and the broken line D ₂ at a predetermined distance from the axis L, even if not included in the first area and the second area. Can be. Here, the third region is a region located on the seed store a side than the straight line H passing through the base substantially perpendicular to the axis.

Subsequently, as shown in FIG. 19B, the store selection unit 112 may set the fourth area, which is a distance from the seed store, as the second search area. In addition, the store selector 112 widens the angle from the axis L, and is located at a position closer to the base than the seed store a even if it is not included in the fifth region and the fifth region between the straight line L ₁ ′ and the straight line L ₂ ′. The sixth area is a third search area. In addition, the store selector 112 includes the seventh region between the broken line D ₁ ′ and the broken line D ₂ ′ at a predetermined distance from the axis L, even if not included in the fifth and sixth regions, in the third search region. You can.

In addition, when the user does not check "search area setting" with respect to the input screen shown in FIG. 9, the setting process and the enlargement process of the search area can be omitted.

20 is a flowchart specifically showing an example of the adjustment process in step 56 of FIG. 15.

If the total amount exceeds the maximum load (Yes in step 44 shown in Fig. 15), it is determined whether the actual course time exceeds the upper limit time in the same manner as in steps 50 to 54 of Fig. 15 (S60). .

If the actual course time exceeds the upper limit time (Yes in S60), the adjustment processing unit 122 temporarily cuts the selection of the store closest to the base from the store included in the course and makes a new course. The process is performed (S61). This is because the store closest to the base can be incorporated into other courses and has high flexibility.

In addition, the adjustment processing unit 122 may refer to the store information storage unit T3 so that the store having a high flexibility parameter can be taken out. Subsequently, the determination unit 114 determines whether the total amount of the new course is improved (S62). When the total amount of the new course is equal to or lower than the lower limit, the determination unit 114 determines that the total amount is improved (Yes in S62) and confirms the provisional processing in step 61 (S63). Subsequently, the determination unit 114 determines whether the actual course time is less than or equal to the upper limit time (S64). If the actual course time is equal to or less than the upper limit time (Yes in S64), the adjustment process is terminated and the process returns to step 48 in FIG.

On the other hand, in step 62, when the total amount is not more than the lower limit or more than the maximum load, the judging section 114 determines that the total amount has not improved (No in S62), and returns to step 61. The selection of the nearest store is removed, and the provisional process of making a new course is performed. In step 64, if the actual course time does not fall below the upper limit time (No in S64), the process returns to step 61 and the provisional processing of removing the store is repeated.

In step 60, when the actual course time does not exceed the upper limit time (No in S60), the adjustment processing unit 122 exchanges the store nearest to the base with another unselected store having a smaller amount of goods than the store. The interim process of making a new course is performed (S65). The determination unit 114 determines whether the total amount of the new course is improved (S66). If the total amount of the new course decreases and the total amount is more than the lower limit loading amount, the determination unit 114 determines that the total amount has improved (Yes in S66), and calculates the actual course time of the new course, It is determined whether it is improved (S67). The determination unit 114 judges that the actual course time is improved when the actual course time is equal to or less than the upper limit time and the actual course time is higher than the lower limit time or more than before the exchange. The provisional process of 65 is confirmed (S68). After that, it is judged whether or not the total amount exceeds the upper limit loading amount (S69). If the total amount does not exceed the upper limit loading amount (No in S69), the adjustment process is terminated and the process returns to step 48 of FIG. When the total quantity does not improve in step 66 (No in S66), or when the actual course time does not improve in step 67 (No in S67), or when the total quantity exceeds the upper limit load in step 69 (Yes of S69), the flow returns to step 65 to perform a provisional process of exchanging with another store.

If the total amount is less than or equal to the maximum load and the actual course time is less than or equal to the upper limit time (Yes in step 54 shown in FIG. 15), the adjustment processing unit 122 does not select two stores in order of being close to the base. In exchange for the store, a provisional process of making a new course is performed (S70). The determination unit 114 determines whether the total amount of the new course is improved (S72). The judging unit judges that the total amount of the course is improving when the conditions of (i) the sum of the total loads or less and (ii) the sum of the loads of the lower or more loads or the conditions of the increase are greater than before the exchange (Yes in S72). In step S74, the actual course time of the new course is calculated and the actual course time is improved. When the actual course time is reduced from before the exchange, the determination unit 114 determines that the actual course is improved (Yes in S74), and determines the provisional processing in step 70 (S76). Subsequently, the determination unit 114 determines whether the actual course time exceeds the upper limit time (S78), and when the actual course time does not exceed the upper limit time (No in S78), ends the adjustment process. The process then returns to step 48 in FIG.

On the other hand, when the total quantity does not improve in step 72 (No in S72), when the actual course time does not improve in step 74 (No in S74), or when the actual course time exceeds the upper limit time in step 78 ( Yes) in step S2578, the flow returns to step 70 to perform a provisional process of exchanging with another store.

21 is a diagram for explaining a procedure of course creation every two weeks, for example. Hereinafter, the case where a piston course is created as a course form is demonstrated as an example.

It is preferable that the store selection unit 112, which the user does not check "consider the day of the week," for the input screen shown in FIG. 9, create a course so as to satisfy the following conditions.

(a) the large balance is not broken by day;

(b) Weeks 1 and 2 become almost the same course;

(c) When making a course in a piston course, make a course A (eg morning course) and B course (eg afternoon course) in pairs.

For example, when a store that needs to be delivered five times a week is selected as the seed store, the store selection unit 112 needs to prepare a course from Monday to Friday. In this case, in order to satisfy the conditions as described above, the store selector 112 first creates the A course of the piston course on the first Monday, and then creates the A course of the piston course on the second Monday. Subsequently, we make B course of the piston course of the first Monday, and make B course of the piston course of the second Monday after that. In the same way, you write a course for Tuesday, Wednesday, Thursday, and Friday.

For example, when the shop which needs delivery three times a week is selected as a seed shop, the store selection part 112 needs to prepare the course of Monday, Wednesday, and Friday. In this case, the store selection unit 112 first creates a course on Monday, then on Wednesday, and then on Friday.

When the course is created every day in this way, the calculation unit 118 considers the effect when calculating the total quantity of the stores that are delivered only once every two weeks, for example. In such a case, the calculation unit 118 temporarily calculates the total amount of the goods at the store as 1/2 of the actual delivery amount.

FIG. 22 is a diagram for explaining a process of the calculation unit 118 calculating the total quantity of stores that are delivered only once every two weeks. Fig. 22A is a diagram showing a store and a base included in a course as points. Here, the point a will be described as a seed store, and the black and round points b to f are stores that have only been delivered once every two weeks. FIG.22 (b) is a table which shows the delivery amount per time of the store of each black round point. The store selection unit 112 divides the black and round points b to f so that the amount of the black and round points b to f included in the course is about half so that the amount of the goods at the time of delivery of each state is equalized. Here, the number of deliveries per store of the black round point b is 0.001t, the store of the black round point c is 0.002t, the store of the black round point d is 0.0016t, the store of the black round point e is 0.002t, the black round point The store of f is 0.002t. In this case, for example, when the stores b to f of the black and round points are divided by the dashed line M ₁ with the base as the starting point, the total quantity of the stores of the black and round points b and c is 0.003t and the stores of the black and round points d to f. The total amount of is 0.0056t. For example, when the stores b-f of the black and round points are divided by the dashed line M ₂ with the base as the starting point, the total quantity of the stores of the black and round points b to d is 0.0046t, and the sum of the stores of the black and round points e and f. The quantity is 0.004t.

Thus, the lesser the difference between the total quantity of what this one side is divided by a dotted line M ₂ division, selection section 112 stores, the store is divided by a broken line of black round b~f point M _2. In this case, for example, the black and round points b, c and d are accepted in the first week, and the black and round points e and f are received in the second week. After dividing the store of the black round point as mentioned above, the calculation part 118 calculates the total quantity of each week of each course in consideration of the quantity of the goods of the store of the black round point accepted in each state. As a result, these stores can be taken as long as total amount is below an upper limit. On the other hand, when the total amount exceeds the maximum stacking capacity of the track, these stores cannot be accepted, and the adjustment processing unit 122 performs the adjustment processing.

In this way, it is possible to efficiently and flexibly create a course having fixed circulation points included in the course.

Fig. 23 is a flowchart showing a processing procedure when creating a course in consideration of the day of the week. The processing here corresponds to the processing shown in steps 24 and 26 of FIG. 16.

First, the store selection unit 112 determines whether there is a day designation in the course to be created (S200). Here, the store selection unit 112 may determine whether there is a day designation in the course according to whether the selected seed store has a day designation. If there is no designation of the day of the week (No in S200), the store selection unit 112 determines the day of the course having the least course time as the day of the course with reference to the course information storage unit T5 (S202). For example, when a course is created as shown in Fig. 14, the store selector 112 performs a search operation in the order of days of the week with the lowest track No. among the days of the least course time or in the order of Monday to Friday. The day of the week is determined as the designated day of the course. In step 200, when there is a day of the week designation in the course (Yes in S200) and when a day of the week is determined in step 202, the store selection unit 112 firstly has the same day of the week designation in the set search area. It is determined whether the store is included (S204). Here, when there are stores designated by the same day (Yes in S204), the store selection unit 112 preferentially selects the stores (S206). In step 204, when there are no stores designated on the same day of the week (No in S204), the store selection unit 112 determines whether there is a store having no day of week designation in the set search area (S208). When there is a store without the day designation (Yes in S208), the store selection unit 112 selects a store without the day designation (S210). On the other hand, when there are no stores without specifying the day of the week in the set search area (No in S208), as shown in step 36 of FIG. 16, it is judged whether or not the search in the search area has ended.

In addition, when the user does not check "consider the day of the week" with respect to the input screen shown in FIG. 9, the store selection unit 112 can select a store without considering the presence or absence of day designation. As a result, the course creation process can be simplified, and the course can be created quickly.

Next, the process of evaluating the course state by the course state evaluator 124 will be described.

24 is a diagram illustrating an example of a procedure for calculating a theoretical value of the number of courses required in an area.

The course state evaluation unit 124 appropriately refers to the base information and the store information stored in the acquisition information storage unit T12, and various conditions stored in the condition storage unit T4, and calculates the theoretical value of the number of courses in the following procedure. .

The course state evaluation unit 124 calculates an average travel time M ₁ from the base to the store in the target area (S160). First, after calculating the total distance from the base to each store, the total travel time is obtained by dividing the total distance by the standard moving speed between the base and the store stored in the conditional storage unit T4. Next, M ₁ is obtained by dividing this total travel time by the total number of stores.

Subsequently, the course state evaluation unit 124 calculates an average moving time M ₂ between the stores (S162). First, the total distance from each store to n shops immediately adjacent is calculated, and the total travel time is obtained by dividing the total distance by the standard moving speed between the stores stored in the conditional storage unit T4. Next, by dividing this total moving time by n, the average moving time m _{1 to} m _n from each store to another store is obtained. Subsequently, the combined The average travel time ~m m _{1 n,} it is calculated by dividing the M ₂ to the previous number of branches.

Subsequently, the course state evaluation unit 124 calculates the number of stores N ₁ that can be worked per day in this area (S164). Total working time of one day

Tz = M ₁ X 2 + M ₂ (N ₁ -1) + TXN ₁

(T is the average working time per store)

, So you can modify this expression

N ₁ = (Tz-M ₁ Calculate X 2 + M ₂ ) / (M ₂ + T).

On the other hand, the course state evaluation unit 124 calculates the number of stores N ₂ which require processing per day (S166). First, the number of times of delivery W is calculated for each month by calculating and adding the number of times of delivery for each store every month. Next, N ₂ = W / 20 is calculated by setting the number of working days of each person in charge for one month to 4 weeks x 5 days = 20.

Thereafter, the course state evaluation unit 124 divides the number of stores N ₂ that need to be processed per day by the number of stores N ₁ that can work per day, thereby calculating the theoretical value of the required number of courses per day = N ₂ / N ₁ . (S168).

The course state evaluation unit 124 compares the number of courses created by the course creation system 100 in this embodiment with the number of courses calculated as described above, and the number of courses created is lower than the theoretical value, or predetermined. If it is in range, it is judged that course preparation was performed appropriately. On the other hand, if the number of courses created is higher than the theoretical value and is outside the predetermined range, the user is notified of the course, and the setting of new conditions is urged. In addition, such evaluation processing is not necessarily required, and the result of the course creation can be presented to the user so that the user can evaluate it.

25 is a diagram illustrating a screen on which a course creation result by the course creation system 100 is displayed. Here, the display processing unit 108 displays a map, a course creation result, statistical information, a display control item, a course information, a scale change box, and the like on the screen. In the map, a plurality of courses created by the course creation system 100 are displayed together with map information of the region to be created. When the user checks the selection box of the display control item, the checked course is displayed on the screen together with the map information. Here, courses of "20401", "20501", "20601", "20701", "21101" are selected and displayed on the screen on the whole Tuesday (single course). Moreover, as course information, the course of course name "21001" is selected, and the information of this course is displayed. As the statistical information, the number of days of operation, the mileage, the travel time, the store time, the delivery time, the quantity of goods, the number of delivery points, and the like of the vehicle having the number "1" are displayed. In addition, when the user changes the scale as appropriate, icons as shown in FIGS. 26 to 28 are displayed.

Fig. 26 is a diagram showing map information and a created course state in a certain area. Fig. 26 (a) shows map information with a small scale. Here, base information and store information are displayed together with map information. Fig. 26 (b) shows a portion surrounded by broken lines in the map information shown in Fig. 26 (a). In the large-scale map information shown in Fig. 26B, each store information is displayed as an icon that can be discriminated on the map.

FIG. 27 is an enlarged view of each icon shown in FIG. 26B. Each icon is set so that characteristics such as shape, shape, or color are different depending on the difference in the number of times of delivery per week, the presence or absence of day designation, and the like. Fig. 27A is a view showing the difference in shape for each day of the week. Here, the difference in designation of the day is indicated by the difference in shape. However, when the display processing unit 108 can display various types of information and the like in color, the difference in designation of the day may be indicated by the difference in color.

FIG. 27B is a diagram showing the shape of an icon representing a store having a number of times of delivery per week. In this case, since the stores need to be delivered on all business days of Monday through Friday, these stores are represented by an icon including a pattern representing Monday through Friday. Fig. 27 (c) is a diagram showing the shape of an icon representing a store having four times the number of deliveries per week. Here, for example, an icon including a shape representing a month to a tree is displayed, which means that it is necessary to deliver the store on a Monday to Thursday. FIG. 27D is a diagram showing the shape of an icon representing a store having three times the number of deliveries per week. Here, for example, an icon including a shape representing a Monday to Wednesday is displayed, which means that such a store needs to be delivered on Monday to Wednesday.

FIG. 27E is a diagram showing the shape of an icon representing a store having twice the number of deliveries per week. Here, this icon is displayed as a four-part diamond, and when there is a delivery day designation, the shape showing the designation day is displayed in the two divided parts at the bottom of the figure. Here, the states specified on Mondays and Tuesdays are displayed. Moreover, the pattern which shows the delivery day determined as a result of the course creation process is displayed on the two divided parts of the upper part in a figure. Here, the course creation process is not yet performed, and it is left blank.

Fig. 27 (f) is a diagram showing the shape of an icon representing a store having a single delivery count per week. Here, this icon is shown by a circle divided into two, and if there is a delivery day designation, the shape showing the designation day is displayed in the divided part of the lower part of the figure. Here, the state where Monday is specified is displayed. Moreover, in the division part of the upper part in the figure, the pattern which showed the determined delivery day is displayed as a result of the course creation process. Here, the course creation process is not yet performed, and it is left blank. The state of the icon when there are a plurality of delivery day designations is shown in Fig. 28A. In Fig. 28 (a), from the top of the figure, the states of the delivery designation on Monday, the delivery designation on Monday or Tuesday, the delivery designation at any time of Monday to Wednesday, the delivery designation at any time of Monday to Thursday, and the delivery designation are not shown. .

Returning to FIG. 27, FIG. 27G is a diagram showing an icon shape indicating a store having a one-time delivery count per two weeks. Here, this icon is displayed in a shape in which a part of the circle is insufficient, and when there is a delivery day designation, a shape showing the designation day is displayed in the divided portion at the bottom of the figure. Here, the state where Monday is specified is displayed. In addition, in the divided part of the upper part of a figure, the shape which showed the determined delivery day is displayed as a result of course creation process. Here, it shows the state that the course making is not yet performed, and it is blank. In addition, the lack of the upper part of the drawing on the right side is the first week of the two weeks delivery, the lack of the left part means that the second week of the two weeks is designated for delivery. The state of the icon when there are a large number of delivery day designations is shown in Fig. 28B. In FIG. 28 (b), the state of delivery designation on Monday or Tuesday, delivery designation on Monday or Tuesday, delivery designation at any time of Monday to Wednesday, delivery designation at any time of Monday to Thursday, and no delivery designation are shown from the top of the figure. .

Returning to Fig. 27, Fig. 27 (h) is a view showing the shape of an icon showing a base.

As described above, in the present embodiment, since the base and each store are displayed as icons having different shapes and shapes along with the map information according to the delivery conditions and the like, the user sees the result displayed by the display processing unit 108. We only know delivery condition of each store.

According to the course creation system 100 of the present embodiment, even if there is an upper limit on the load amount of the goods, for example, when the goods are delivered by track, the delivery time, which is the working time of the delivery worker, is also taken into consideration. Since the course is prepared in consideration, effective course creation can be performed. In addition, even when the upper limit of the amount of tracks is fixed constantly, a course is created by selecting an appropriate form from among a plurality of course forms, thereby making it possible to flexibly create a course that can be efficiently delivered.

In addition, since a course is prepared by setting an allowable range in the amount of loading of the track and the course time, a process for obtaining an optimal solution for preparing a delivery course can be performed quickly. Moreover, since it is set as the structure which reads the various information, such as map information, base information, store information, etc. which are necessary for creating a delivery course from an external system, the process of the course preparation system 100 can be made simple and easy. In addition, since these various pieces of information are read only from the external system according to preset conditions, the configuration of the course preparation system 100 can be simplified. As a result, simulation processing of delivery course creation can be performed conveniently and simply.

In addition, as described above, the process for obtaining the optimal solution for the course creation can be performed quickly. Thus, the delivery course can be quickly created by setting several parameters in the state of storing various necessary information.

In addition, since the course can be created without considering the track load, the course time, the day of the week, and the like, the course creation process can be easily and easily performed according to the needs of the user. You can write Thus, according to the course preparation system 100 in a present Example, a simulation of course preparation on various conditions can be performed quickly by changing conditions and a parameter. In this way, since the course creation can be repeated, the simulation result can be displayed, and the simulation result can be displayed, and the evaluation of the course created under various conditions can be easily performed at the play.

In addition, a plurality of search areas are set based on a certain law, and stores are automatically taken into the course sequentially for each search area, thereby creating a highly objective course.

In addition, since the course is prepared so that the total course time of each day is equalized with reference to the course state already prepared, the required number of vehicles such as a track can be reduced, and the number of personnel can be reduced. . In addition, you can preferentially enter the course from stores with low flexibility parameters, which can improve the compatibility of simulation results with the actual business.

Second Embodiment

In this embodiment, the method for setting the search area is different from that in the first embodiment. In the course creation system according to the present embodiment, when creating a traversal course in an area including a plurality of traversal points, the target area is divided into a plurality of search areas by a dividing line that radially widens the target area around the base in the area. The traversal course is created by including the traversal points included in each search area in the same traversal course. In addition, in the first embodiment, when the user does not check "search area setting" with respect to the input screen shown in FIG. 9, setting of such a search area can be omitted.

Fig. 29 is a block diagram showing the construction of the course preparation system in the second embodiment of the present invention. In the present embodiment, the calculation processing unit 116 differs from the first embodiment in that the calculation processing unit 116 has the order determination unit 121 instead of the optimization processing unit 120. In the present embodiment, the same components as those shown in Fig. 3 are denoted by the same reference numerals in the first embodiment, and description thereof is omitted as appropriate.

In the present embodiment, the information acquisition unit 170 maps the map information data including the road information marking road information such as the trunk road included in the map information together with the map information of the region to be created in the course. The map information storage unit T1 of the first external system 10 is read.

In the calculation processing part 116, the calculation part 118 also calculates the average value of the course time of multiple courses. In addition, the order determination unit 121 determines the order of traversing the stores included in the course for each course created. The traversal sequence determined by the sequence determination unit 121 is also stored in the course information storage unit T5.

The condition setting accepting unit 110 accepts setting of parameters necessary for dividing the target area into a plurality of search areas. The target area is divided into a plurality of search areas by dividing the target area into division lines spread radially around the base. Here, the parameter includes a theoretical value of the number of courses to be created in the area, a setting condition of the initial dividing line, an angle formed by adjacent dividing lines, and the like. For example, the first dividing line may be set in consideration of the axis connecting the seed store and the base set in the base with the base as a starting point, or may be set in consideration of the position of the marked road in the area. In addition, the angle formed by adjacent dividing lines may be, for example, an angle obtained by dividing a circle (360 degrees) around a base by a theoretical value of the number of courses. The division method of a target area is mentioned later.

The conditional storage unit T4 stores the parameter set in this way. 30 is a diagram showing a part of the data structure of the condition storage unit T4. The condition storage unit T4 also stores data relating to selection conditions of the seed store, for example. The selection conditions of the seed store include a case of selecting from a position close to the base and a case of selecting from a position far from the base. Here, the purpose of selecting from a position far from the base is set. In addition, if the theoretical number of course hours is 12 and the allowable range is +2, that is, the course time is 14 or less, the intention is that the course creation process may be completed. In this case, it is set that the angle formed by the adjacent dividing lines is 30 degrees and the allowable range is -10 degrees to +30 degrees.

The search area setting unit 160 sets the search area with reference to the condition storage unit T4.

FIG. 31 is a flowchart specifically showing a course creation process (step 6 in FIG. 2) according to the present embodiment.

First, the search area setting unit 161 sets a dividing line as a reference when dividing an area into a plurality of search areas (S118). For example, the search area setting unit 161 selects a seed store from a store in the region, sets an axis passing through the seed store as a base, and sets the first dividing line in consideration of the axis. have. Here, the calculation processing unit 116 can refer to the acquisition information storage unit T12, and can select the seed store in order from a store having a low flexibility parameter. The search area setting unit 161 may also select the seed store according to the perspective of the position from the base with reference to the condition storage unit T4. The search area setting unit 161 may also set the first dividing line in consideration of the position of the marked road with reference to the map information in the acquisition information storage unit T12.

The search area setting unit 161 refers to the conditional storage unit T4 with reference to the first division line, and considers the angle formed by the adjacent division lines to form a plurality of division lines that are radially spread around the base. We set sequentially. The search region setting unit 161 divides the region into a plurality of search regions using the region surrounded by the dividing line as the search region (S120).

An example of a method of dividing the search area will be described with reference to FIG. 32. 32 is a diagram showing a base in a region and a plurality of stores as points. The search area setting unit 161 refers to the condition storage unit T4 and divides the area into a plurality of search areas based on various preset parameters. As shown in Fig. 32A, the point a will be described as a seed store. The search area setting unit 161 first sets, as the axis L, a straight line connecting the base and the point a with the base as one end. Subsequently, the search area setting unit 161 refers to the condition storage unit T4 and considers the angle formed by the adjacent dividing lines so that, for example, the search area is divided approximately equally into two by the axis line. Sets the dividing line. Here, the dividing line d ₁ is the first dividing line. At this time, it is preferable that the first dividing line is set in the counterclockwise rotation direction with respect to the axis line. In this way, when you make a tour of the course you make by car, you can sequentially traverse the stores on the left side of the road, and then return to the stores on the left side as well. Because you can write. Subsequently, the retrieval area setting unit 161 sets the next dividing line d ₂ with reference to the condition storing unit T4 in consideration of the angle formed by the adjacent dividing lines. As shown in FIG. 32B, the search region setting unit 161 sets a plurality of dividing lines d _{3 to} d ₁₂ in a similar manner. This area is thus divided into 12 search areas.

33 is a diagram illustrating another example of the method of dividing the search area. For example, roads shown by broken lines in FIG. 33A are marked in this area. The search area setting unit 161 selects the trunk road as a reference among the marked roads as shown in Fig. 33B. The search area setting unit 161 refers to the condition storage unit T4 in the same manner as described above, and considers the angle formed by the adjacent dividing lines, for example, divides the search area into approximately equal parts by a marked trunk road. The first dividing line can be set. Here, too, the dividing line d ₁ is the first dividing line. Here, like the above, it is preferable that the first dividing line is set in the direction of counterclockwise rotation with respect to the trunk road. In this way, when you make a tour of the course you have made by car, you can traverse the stores on the left side in sequence, and then you can make the course on the left side in the same way as well. Because. In addition, when the vehicle is targeted to an area in Japan where the vehicle is traveling on the right side, it is preferable to perform the reverse direction. Subsequently, the retrieval area setting unit 161 sets the next dividing line d ₂ with reference to the condition storage unit T4 in consideration of the angle formed by the adjacent dividing lines as shown in Fig. 33 (c). .

Returning to Fig. 31, the store selection unit 112 selects each of the search areas divided by the search area setting unit 161 to include the stores in the search area in the same course (S122). . When the course is created, the sequence determination unit 121 sequentially traverses the stores belonging to the region in the counterclockwise direction with respect to the axis L connecting the base and the seed store with the base as the starting point, and thereafter, within this region. The traversal order is determined to sequentially traverse stores belonging to the area in the clockwise direction with respect to the axis L, inverted at the store located farthest from. In this way, when traveling by vehicle in a country where the vehicle is on the left-hand side, it is possible to travel to the store on the left side of the road first in the roadway, and then to the store on the left side even after returning home. You can write a course that you can tour. The calculating part 118 calculates the statistics of the store included in the course (S1524). Here, the statistics are course time and / or quantity in the course. Hereinafter, the case where the statistics are the course time will be described as an example. Subsequently, the calculation unit 118 calculates an average value of the statistics of these courses.

The determination unit 114 determines whether or not the statistics in each course are within a predetermined allowable range (S126). When the statistics in all courses are within a predetermined allowable range (Yes in S126), the determination part 114 determines whether the difference of the statistics in each course is in a predetermined allowable range (S128). If the difference in statistics in each course is within a predetermined allowable range (Yes in S128), the course creation process ends. Here, the difference of the statistics in each course can also be calculated by comparison with the average value of the statistics of all the courses.

In step 126, when the statistics in one course are not within a predetermined allowable range (No in S126), the determination part 114 determines whether the statistics in the course are more than an allowable range (S130). ). If the statistic in the course is lower than the allowable range (No in S130), the process returns to step 120 to extend the course time to be created in the target area and to perform the process of creating the search area again. In step 130, when the statistic in the target course is larger than the allowable range (Yes in S130) or when the difference in the statistic in each course is not within the predetermined range (No in S128), the adjustment processing unit 122 performs the adjustment process. (S132), the course creation process ends.

As an adjustment process, the following two methods can be mainly taken.

The first method will be described with reference to FIG. 34. As described above, the calculation unit 118 calculates the course time and the average value thereof. As a result, for example, the statistics of the course created for the search area surrounded by the dividing lines d ₅ and d _{6 may} be higher than the average value of the statistics. case, the adjustment processing section 122 performs an adjustment for narrowing the dividing line d ₅ and d ₆ is the angle forming of forming a search zone (5). At this time, the adjustment processing unit 122, for example, the statistics of the course created for the search area 4 surrounded by the dividing lines d ₄ and d ₅ , and the search area 6 surrounded by the dividing lines d ₆ and d ₇ . The statistics of courses created for the course are compared, and the dividing line is moved between the search areas where the statistics are small. Here, for example, it is assumed that the statistic of the course created for the search area 6 is smaller than the statistic of the course created for the search area 4. In this case, the adjustment processor 122 moves the dividing line d ₆ in the direction of the search region 5 as shown in the drawing, and the angle formed by the dividing lines d ₅ and d ₆ forming the search region 5 is narrow. The process is performed so that the angle formed by the dividing lines d ₆ and d ₇ forming the search area 6 is widened. In addition, the adjustment processing unit 122 may move both of the dividing line d ₆ and the dividing line d ₅ to perform the process of narrowing the search area 5. The adjustment processing part 122 repeats the same process until the statistics in each search area become a predetermined tolerance range, respectively, and the difference of statistics between courses becomes a predetermined tolerance range.

In addition, the adjustment processing part 122 performs the process which spreads the angle of the dividing line which forms the search area with respect to the search area whose course statistics are lower than the average value of the statistics. By repeating this process several times, the optimal solution can be found so that the statistics in the course created for each search area become nearly equal. In this embodiment, by providing a predetermined range in the difference between the statistics and the statistics, a process for obtaining an optimal solution that satisfies the end condition of the course creation can be performed quickly, and the course creation can be performed quickly.

Next, a second method will be described with reference to FIG. As shown in Fig. 35 (a), the order determining unit 121 traverses the store on the left side of the main road in the traveling direction of the royal road, returns from the store located farthest from the base, and proceeds to the return home. The order of traversal is determined so that the shop on the left side of the main road is also traversed. As a result of calculating the statistics in each course when the calculation unit 118 traverses each store in the order determined in this way, the statistics of the course created for a certain search area are more than the allowable range of the statistics or When the difference with the average value of the statistics with another course was more than an allowable range, the adjustment process part 122 is located in the position near a base, for example among the stores contained in the course, as shown to FIG. 35 (b). The store can be removed, a first course including the remaining stores can be created, and a second course including a store excluded from the first course can be prepared.

Here, the 1st course and the 2nd course can be set so that the upper limit of course time may differ, for example. For example, the first course can be a single course. The second course can be a piston course. When you go to a store that is far from the base, it takes longer to return to the base, so it is more efficient to include it in the first course. In addition, in the present embodiment, the first course and the second course can be set so that the upper limit of the load amount is the same.

In addition, although the example which created the 1st course and the 2nd course for the same search area was demonstrated here, the 2nd course can also be created so that it may span several search areas. For example, the adjustment process part 122 performs the process which removes a store in order from the base when the course time in a course is more than an upper limit time. This process is repeated, and the same process is repeated until the course time in the course becomes below an upper limit, and the course time of the course falls within a predetermined range from the average value with other courses. As a result of performing such a process, the store selection unit 112 can appropriately select a course excluded from each course and create a second course.

When the course is prepared as described above, as shown in Fig. 36, a radial flower course having the same shape as the flower petal is created. Fig. 36 (a) is a diagram schematically showing the shape of the course when only the first course is created.

As a result, it is possible to create a course that can grasp the state of a plurality of courses at a glance. In addition, according to the course creation system 100 of the present embodiment, it is possible to create a course that can efficiently perform work such as visits and tours. In particular, when moving to a differential vehicle, the shops included in the same course are also selected hydraulically and objectively in consideration of the axis and the trunk road passing through the base and the seed shop, so that a course with high objectivity can be created. Thereby, the course which has a sense of fairness among a worker can be created. In this way, as the course is written objectively with little consideration of actual problems such as actual geography, the course preparation simulation can be performed in a very short time with only the minimum parameters required.

Also in this embodiment, the same effects as in the first embodiment are obtained.

[Example 3]

In this embodiment, the method for setting the search area is different from the first and second embodiments. Also in this embodiment, the course preparation system 100 has the same structure as that described with reference to FIG. 29 in the second embodiment.

37 and 38, the course creation method in the present embodiment will be described.

As shown in Fig. 37A, in this embodiment, the search area setting unit 161 is the same as that described with reference to Fig. 31 in the first embodiment, the first dividing line d ₁ and the next dividing line. Set d ₂ . Here, the order determination unit 121 determines the traversal order of these stores by targeting the stores included in the search area surrounded by the dividing line d ₁ and the dividing line d ₂ . The calculating part 118 calculates course time which is a statistics when it traversed these stores in this order. In the present embodiment, when the course time is not within the predetermined allowable range, the adjustment processing unit 122 performs a process of opening or narrowing the angle formed by the dividing line d ₁ and the dividing line d ₂ .

For example, in the state shown in Fig. 37A, when the course time of the course created in the search area surrounded by the dividing line d ₁ and the dividing line d ₂ is lower than the predetermined range, the adjustment processing unit 122, The angle formed by the dividing line d ₁ and the dividing line d ₂ is widened, for example, a process of creating a course again as a search area using the area surrounded by the dividing line d ₁ ′ and the dividing line d ₂ ′. Here, the adjustment processor 122 adjusts the angle so that the course time of the course created in the search area surrounded by the dividing line d ₁ ′ and the dividing line d ₂ ′ is within a predetermined range.

As a result of the adjustment process, when the course time of the course in the search area falls within the predetermined range, as shown in FIG. 38, the search area setting unit 161 sets the next dividing line d ₂ , and Create a search area. Next, the adjustment process is similarly performed, and the next course is created sequentially.

Also in this embodiment, the same effects as in the first and second embodiments are obtained.

Fourth Example

FIG. 39 is a diagram showing a network configuration including the course preparation system 100 described in the first to third embodiments. Processing from the user described in the first embodiment can be performed from the user terminal 150 via the network 148. In addition, the course creation system 100 is a structure in which both the external system (the first external system 10 and the second external system 20a to the fourth external system 20c) are connected via the network 148. You can also do

In the present embodiment, the user terminal 150 may be anything as long as the user terminal 150 can communicate with the course creation system 100 via the network 148. For example, the user terminal 150 can be a PC, a PDA, a mobile phone, or any other hardware.

In this way, the user can appropriately input conditions or view the course creation result from the user terminal 150 having a simple system configuration. This makes it easy to create a course.

In the present embodiment, since the information necessary for the course creation system 100 can be transmitted and received from the user terminal 150 through the network 148, the instruction or the like necessary for course creation is actually performed while circulating in the area. It can transmit to the creation system 100. For this reason, it is possible to appropriately create a more effective course that reflects the on-site situation while exhibiting the same effects as in the first to third embodiments.

In the above, this invention was demonstrated based on the Example. The embodiments are illustrative, and it will be understood by those skilled in the art that various modifications are possible to the combinations of their respective components and respective treatment processes, and that such modifications are also within the scope of the present invention.

In the above embodiment, only a single course and a piston course are shown, but for example, a course in which a work is carried out by returning to a base two or more times a day, and a course in which one course is traversed over several days, Various course types can be assumed.

In the above embodiment, an example in which the loading amount of a vehicle such as a track is uniformly described has been described, but the present invention can be suitably applied even when the loading amount of the vehicle is changed.

In addition, in the above Example, although the circulation work using vehicles, such as an automobile, was demonstrated, the circulation work can also be performed on foot.

Moreover, the course creation technique described in the above embodiments is highly versatile and can be appropriately applied to various logistics tasks.

Claims (25)

In creating a course for delivering goods in an area containing a plurality of traversal points, in a course creation system for selecting traversal points included in the same course, An information acquisition unit for acquiring information about the plurality of traversal points; A selection unit for selecting a circulation point included in the same course based on the information about the circulation point; A calculation processing unit that adds the traversal point selected by the selection unit to a course and then calculates a statistic determined by the traversal point included in the course, The selection unit determines whether the statistic calculated by the calculation processing unit is within a predetermined range, terminates the selection of the circulation point when in the range, and continues selecting the circulation point when out of the range. Course creation system. The method of claim 1, The selection unit until the statistic is within the predetermined range, When the said statistic is smaller than the lower limit of the said predetermined range, a traversal point is newly added and the said traversal point included in the same course is updated, And when the statistic is larger than the upper limit of the predetermined range, repeating an operation of deleting a portion of the selected traversal point and updating the traversal point included in the same course. The method of claim 2, And the selection unit repeats the operation by setting an area including one or more traversal points and enlarging or reducing the area. The method of claim 3, wherein The enlargement or reduction of the area is performed by increasing or decreasing the distance from the reference point. The method of claim 3, wherein The area is an area surrounded by a first straight line having a reference point as a viewpoint and a second straight line obtained by rotating the first straight line at a predetermined angle about the viewpoint. The enlargement or reduction of the area is performed by increasing or decreasing the predetermined angle. The method according to any one of claims 1 to 5, The calculation processing unit calculates at least one of the first statistical amount determined by the delivery time to the selected traversal point and the second statistical amount determined by the quantity of goods to be delivered to the selected traversal point, The selection unit determines whether at least one of the first statistical amount and the second statistical amount is within a predetermined range. The method according to any one of claims 1 to 6, Further comprising an optimization processing unit for optimizing the traversal order of the traversal points included in the course, The calculation processing unit calculates, as a preliminary first statistical amount, a delivery time when the selector has traversed the traversal point in the order of selecting the traversal point, and whether the preliminary first statistics exceed a predetermined reference value. If the preliminary first statistic exceeds a predetermined reference value, the preliminary determination is made so that the optimization processing unit performs the optimization, and calculates a delivery time when the traversal point is traversed in the optimized traversal order. Creation system. The method according to any one of claims 1 to 7, And a condition accepting unit for accepting setting of conditions to be considered when the selecting unit selects the traversal point, And the selection unit selects the traversal point according to a setting received by the condition acceptor. The method of claim 8, A condition to be considered when selecting the traversal point is whether or not to consider the delivery day of the traversal point included in the course when preparing the course. The method according to claim 8 or 9, The condition to be considered when selecting the traversal point is whether or not to designate a search area for selecting a traversal point when creating the course. The method according to any one of claims 1 to 10, A condition accepting unit which accepts setting of conditions to be considered when the calculating processing unit calculates the statistics, And the calculation processing unit calculates the statistics according to the settings received by the condition accepting unit.  The method of claim 10, The condition to be considered when calculating the statistics is whether or not to consider the first statistical amount determined by the delivery time to the selected traversal point.  The method according to claim 10 or 11, wherein The condition to be considered when calculating the statistics is whether or not to consider a second statistical amount determined by the quantity of the goods delivered to the selected point of circulation. The method according to any one of claims 8 to 13, A course information storage unit for storing information on the course created by the traversal point finally selected by the selection unit in correspondence with the conditions received by the condition reception unit; And a display processing unit which displays the information about the course together with the condition. The method according to any one of claims 1 to 14, A display processing unit which displays the information about the tour point together with the map information of the area; And a display information storage section for storing the circulation conditions to each said circulation point and the display information which has a different external shape according to the difference of this circulation condition, and storing them, And the display processing unit detects a circulation condition to the traversal point based on the information about the traversal point acquired by the information acquisition unit, and displays the display information corresponding to the traversal point. The method according to any one of claims 1 to 15, And a flexibility parameter granting unit for granting each of the traversal points a flexibility parameter indicating a degree of limitation when including a plurality of traversal points in the course, based on the information about the traversal points, And the selection unit selects a traversal point in consideration of the flexibility parameter. The method according to any one of claims 1 to 16, And the information acquisition unit acquires information on the traversal point from an external system. The method of claim 17, The information acquiring unit determines whether all of the information necessary for the calculation processing unit to calculate the statistics is included in the information acquired from the external system, and the necessary information when all the necessary information is not included. And a process for prompting input of substitute information. A program for allowing a computer to select a circuit point to be included in the same course when creating a course for delivering goods in an area containing a plurality of circuit points. Computer, Information acquisition means for acquiring information about a circuit point included in the area, Selection means for selecting the circulation point included in the same course based on the information about the circulation point, Add the traversal point selected by the selection means to the course, and function as calculation processing means for calculating a statistic determined by the traversal point included in the course, The selection means judges whether or not the statistic calculated by the calculation processing means is within a predetermined range, terminates the selection of the circulation point when in the range, and continues selecting the circulation point when out of the range. A program is provided, characterized in that the program is provided. The method of claim 19, The calculating processing means calculates at least one of a first statistical amount determined by a delivery time to the selected traversal point and a second statistical amount determined by an amount of an article to be delivered to the selected traversal point, And said selecting means determines whether at least one of the first statistical amount and the second statistical amount is within a predetermined range. The method of claim 19 or 20, Make a computer function as condition accepting means for accepting setting of conditions to be considered when said selecting means selects said traversal point, And said selecting means selects said circulating point in accordance with a setting received by said condition accepting means. The method according to any one of claims 19 to 21, Make a computer function as condition accepting means for accepting setting of conditions to be considered when said calculating processing means calculates said statistics, And said calculation processing means calculates statistics according to the settings received by the condition accepting means. The method according to any one of claims 19 to 22, The computer is to function as an end condition accepting means for accepting setting of an end condition for terminating the creation of the course, And said selecting means terminates the selection of the circulating point when the end condition is satisfied even when the statistic is out of range. The method according to any one of claims 19 to 23, And said information acquiring means acquires information on said traversal point from an external system. The method of claim 24, The information acquiring means determines whether the information necessary for calculating the statistics is included in all of the information acquired from the external system, and the information acquiring means is necessary when all the necessary information is not included. And a process for prompting input of substitute information of the information.