JP2007314335A - Physical distribution transport management device and physical distribution transport management system using geographical information - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To reduce processing burden when calculating the shortest distance of a transport path and reflect processing results in accounting information etc. in regard to physical distribution transport to deliver articles to an unspecified number of relay points. <P>SOLUTION: This physical distribution transport management device 1 using geographical information is provided with a control part 2. The control part 2 classifies the respective relay points into groups of the relay points adjacent to each other based on road distances obtained from the geographical information by using a route search function 21a of a control program 21; determines reference points of the respective groups by using longitude and latitude information; performs route research at the respective reference points to determine transport orders among the groups; performs route research including the relay points of the next group for next transport and determines the relay point of the next group at the shortest distance as a starting point of the next group; calculates a sum of the total distance within each of the groups calculated by route search in each of the groups and the total distance among the respective groups as a total traveling distance; and stores the total traveling distance as the shortest distance together with information on the optimal path in a management DB 6 as information related to the optimal route. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a logistics transportation management apparatus and a logistics transportation management system using map information.

  Conventionally, various techniques for improving the efficiency and optimization of logistics transportation have been developed.

For example, in Patent Document 1, even when there are a large number of delivery destinations and delivery destinations in the distribution network area to be planned, efficient frequent small-lot transportation sufficiently corresponding to a production method that does not require parts inventory Technology that supports the process of planning a transportation plan that can be implemented is disclosed.
JP 2003-312853 A

  However, in the technology according to Patent Document 1, since the shortest distance of the transportation route connecting the selected delivery destination and the delivery destination (relay point) is calculated individually using the data of each location information, When there are a plurality of shipping sources, the processing burden is large. Furthermore, it is not disclosed to reflect the distance information of the transportation route in accounting information such as billing.

  The purpose of the present invention is to reduce the processing load when calculating the shortest distance of the transportation route for logistics transportation such as delivering goods to an unspecified number of relay points, and to determine the transportation route as a processing result. The distance information is automatically reflected in the accounting information.

  In order to achieve the above object, according to a first aspect of the present invention, there is provided a logistics transportation management apparatus that operates based on a control program, and based on a management database and a route search function of the control program, based on map information. Based on the acquired road distances, those that are close to each other are grouped together, the reference point of each group is obtained using the latitude and longitude information, route search is performed at each reference point, and transportation between groups The order is determined and the route search is performed including the transit point of the next group whose transport order is the next, and the transit point of the next group that is the shortest distance is set as the start point of the next group, and each route obtained by the route search for each group The sum of the total distance in the group and the distance between each group is obtained as a total travel distance, and the above management data is used as information on the optimum route along with information on the optimum route as the shortest distance Over control means for controlling to store the scan, logistics transportation management device using the map information, characterized by comprising is provided.

  Then, in the second aspect of the present invention, in the first aspect, when grouping as the group, all combinations of waypoints are ranked in the order of short distance, and a predetermined number is grouped as a group from the top one. There is further provided a physical distribution management apparatus characterized by this.

  According to a third aspect of the present invention, in the first aspect, the control program further includes at least one of an order processing function, a dispatch processing function, and a daily report creation function, and the optimal route is applied. There is provided a physical distribution management device further characterized in that a predetermined process is performed based on information.

  According to a fourth aspect of the present invention, there is provided a logistics transportation management system comprising a logistics transportation management apparatus that can communicate with a terminal of a branch office or a branch group via a network, the upper logistics transportation management apparatus includes a management database, Based on the route search function of the above control program, based on the road distance acquired from the map information, those that are close to each other are grouped together, and the reference point of each group is obtained using the latitude and longitude information. Execute route search at each reference point to determine the transport order between groups, perform route search including the transit point of the next group with the next transport order, and set the transit point of the next group with the shortest distance to the next group The total distance within each group obtained by the route search for each group and the distance between each group is obtained as the total travel distance and the information on the optimum route as the shortest distance. Logistics transportation management system using the map information, characterized in that it comprises a control means for controlling to store to the management database is provided as information relating to the optimum route.

  According to the present invention, for logistics transportation such as delivering goods to an unspecified number of relay points, the processing load when calculating the shortest distance of the transportation route is reduced, and the distance information of the transportation route as a processing result is obtained. It is possible to provide a logistics transportation management apparatus and a logistics transportation management system using map information that can be automatically reflected in accounting information and the like.

  Embodiments of the present invention will be described below with reference to the drawings.

  FIG. 1 shows a configuration of a physical distribution management apparatus and a physical distribution management system using map information according to an embodiment of the present invention. As shown in FIG. 1, the physical distribution transportation management system includes a physical distribution transportation management apparatus 1 and at least one terminal 8a, 8b (hereinafter collectively referred to as reference numeral 8) disposed in a sales office, a branch office, etc. The network 9 is connected and configured. The physical distribution management device 1 further includes a control unit 2, a communication control unit 3, a display unit 4, an operation input unit 5, a management database (hereinafter referred to as DB) 6, and a map information DB 7.

  The control unit 2 performs physical distribution management based on the control program 21.

  Here, the control program 21 has a route search function 21a, an order processing function 21b, a dispatch processing function 21d, a daily report processing function 21d, and other management functions 21e. The control unit 2 performs each process based on these functions 21a to 21e included in the control program 21.

  The route search function 21a is a function for calculating the optimum route (shortest distance, optimum route) of the transportation route for physical distribution transportation that delivers articles to an unspecified number of relay points. Although details will be described later, map information stored in the map information DB 7 is used for route search based on the route search function 21a. Alternatively, although not shown, necessary map information is appropriately received and used by communicating with the map information system. Information on the calculated optimum route (shortest distance, optimum route) is reflected in various tables stored in the management DB 6.

  The order processing function 21b is a function for processing information such as a departure point, a waypoint (delivery destination), and the like when receiving an order. The vehicle allocation processing function 21c is a function that performs vehicle allocation processing on the order received by the order processing function 21b while using information on the optimal route (shortest distance, optimal route) obtained by the route search function 21a. The daily report processing function 21d refers to the information on the optimal route (shortest distance, optimal route) obtained by the control unit 2 based on the route search function 21a for the order received by the order processing function 21b, and the dispatch processing function 21c. This is a function for creating a daily report while taking into account the information related to vehicle allocation obtained based on this.

  In addition, the other management function 21e includes, for example, billing processing, deposit processing, deposit and withdrawal processing, attendance processing, maintenance processing, refueling processing, master management, employee management, supplier management, vehicle management, and the like. In the processing by the other management function 21e, the information on the optimum route (shortest distance, optimum route) calculated by the route search function 21a is used.

  Hereinafter, with reference to the flowchart of FIG. 2, a series of processes related to physical distribution management by the physical distribution management apparatus 1 according to the embodiment of the present invention will be described in detail.

  Here, it is intended for logistics transportation with an unspecified number of waypoints. The unspecified majority means that there are many waypoints and the like, since the departure point and waypoints are not determined in advance.

  When an order received from the terminal 8 of the branch office / branch group is received via the network 9 and at least information on the departure point, waypoint, and final point is sent to the control unit 2 via the communication control unit 3 (step S1), The control unit 2 determines whether the number of waypoints is a predetermined number or more (step S2). Although the predetermined number is 10 here, it is needless to say that the number is not limited to this.

  If it is determined in step S2 that the number of waypoints is less than the predetermined number, the control unit 2 obtains an optimum route by the all-route search method (step S4). Here, the distance between each waypoint is calculated based on the map information in the map information DB 7, and an optimum one of the combinations is obtained by a predetermined calculation. Since this is a known technique, details are omitted.

  On the other hand, if it is determined in step S2 that the number of waypoints is equal to or greater than the predetermined number, the control unit 2 optimizes the method based on the route search function 21a of the control program 21 by the method of the feature point of the present invention described later in detail. A route is obtained (step S3). Subsequently, the control unit 2 stores information related to the optimum route (shortest distance, optimum route) obtained in step S3 or S4 in the management DB 6, and performs overall management together with other management information (step S5).

  The control unit 2 then selects the optimum route (shortest distance, optimum route) of the management DB 6 based on the order processing function 21b, the dispatch process function 21c, the daily report processing function 21d, and the other management function 21e included in the control program 21. While using the information related to the above, various processes, for example, creation of an estimate, fare calculation, and the like are executed (step S6), and all operations are terminated.

  According to the above, information on the optimal route (shortest distance, optimal route) related to a plurality of waypoints can be used for sales results, driver salary calculation, vehicle profit / loss calculation, etc. It is possible to perform unified management of data leading to final accounting processing.

  Here, the route search executed in step S3 of FIG. 2 will be described in more detail with reference to the flowchart of FIG. Hereinafter, the conceptual diagram of FIG. 4 will be referred to as appropriate.

  This method is based on the original algorithm of the present embodiment. By incorporating the concept of clustering and grouping a predetermined number of multiple sites, the combination of search routes can be reduced within a practical timeframe. Is used to calculate the shortest path. Details will be described below.

  First, based on the route search function 21a of the control program 21, the control unit 2 forms a group of objects close to each other from the waypoints A to I based on the road distance acquired from the map information in the map information DB7. To summarize. For this purpose, all combinations between two points are ranked in ascending order of distance, and are grouped from the top. Such processing is repeated to group all waypoints. Since the distance between the groups is long, in this embodiment, one group is limited to three places (step S11).

  In the example of FIG. 4, via points A, B, and C are grouped as group G1, via points D, E, and F are grouped as group G2, and via points G, H, and I are grouped as group G3.

  Subsequently, the control unit 2 obtains a reference point for each group using the latitude / longitude information in order to execute a cyclic route search between the groups (step S12).

For example, in the group G1, if the latitude of the via point A is A1, the longitude is A2, the latitude of the via point B is B1, the longitude is B2, the latitude of the via point C is C1, and the longitude is C2, the reference point X1 Latitude and longitude are
Latitude: (A1 + B1 + C1) / 3
Longitude: (A2 + B2 + C2) / 3
Can be obtained as

  The reference point X2 of the group G2 and the reference point X3 of the group G3 can be obtained by the same method.

  Next, the control unit 2 determines the order of the groups G1 to G3 by executing a cyclic route search at the reference points X1 to X3 (step S13), and groups according to the order obtained by the cyclic route search for each group. The distance is obtained by searching the inside of the route (step S14). At this time, a cyclic route search including the route point of the next group is performed, and the route point of the shortest distance is set as the starting point in the search of the next group. Such processing is sequentially executed for each group, and the sum of the distances obtained for each group is obtained as the total travel distance (step S15), and the processing is terminated. The total travel distance obtained by the above processing is stored in the management DB 6 as information on the optimum route together with information on the optimum route as the shortest distance.

  Next, various processes of the control unit 2 based on the functions 21a to 21e of the control program 21 will be described in detail with reference to FIGS.

  When the control unit 2 starts operation based on the control program 21, a screen 100 as shown in FIG. When the order processing button 100a, the dispatch processing button 100b, the daily report processing button 100c, etc. are selected on the screen 100 by operating the operation input unit 5, the control unit 2 performs the order processing function 21b of the control program 21 and the dispatch processing. Based on the function 21c, the daily report processing function 21e, and the like, the display of the display unit 4 is switched to the screens 101, 103, and 105. Although the detailed description is omitted here, the other management function 21e is a billing process, a deposit process, a deposit / withdrawal process, an attendance process, a maintenance process, a refueling process, a master management, an employee management, a supplier management, and a vehicle management. It is a function for executing daily output, monthly output, document output, diamond, maintenance, etc. However, it is needless to say that the present invention is not limited to these.

  FIG. 6 shows an example of the order processing screen 101. When the order processing button 100 a on the screen 100 of FIG. 5 is selected, this order processing screen 101 is displayed on the display unit 4. In this screen 101, when a waypoint (landing) is input to the area 101c and the route search button 101e is selected, the control unit 2 executes a route search based on the route search function 21a as described above. At this time, the origin information of the area 101b and the garage information of the area 101d are automatically input and displayed. The result of this route search can also be confirmed on a map display screen 102 as shown in FIG. In the travel distance column of the area 101a of the screen 101, information on the shortest distance calculated by the route search is automatically displayed. When the information on the charged weight is input to this area 101a, the control unit 2 automatically calculates and displays the basic fare based on the order processing function 21b of the control program 21. That is, since the basic fare for the set waypoint (landing) is calculated, an estimate can be created. When the new button 101f on the screen 101 is selected, these pieces of information are stored and managed in the management DB 6.

  FIG. 8 shows an example of the vehicle allocation processing screen 103. When the dispatch process button 100b in FIG. 5 is selected, the dispatch process screen 103 is displayed on the display unit 4. In this screen 103, an order code, a supplier abbreviation, loading date, arrival date, weight, departure point, waypoint (landing), basic fare, total charge, car number, crew, etc. are stored in association with each other. When one of these items is selected, a dispatch process detail screen 104 as shown in FIG. 9 is displayed. Also on this screen 104, the travel distance and basic fare previously obtained by the route search are displayed in the area 104a, and a waypoint (landing) is displayed in the area 104b.

  FIG. 10 shows an example of the daily report processing screen 105. When the daily report processing button 100 c in FIG. 5 is selected, this daily report processing screen 105 is displayed on the display unit 4. In this screen 105, an order code, a supplier abbreviation, loading date, arrival date, weight, departure point, waypoint (landing), basic fare, total charge, car number, crew, etc. are stored in association with each other. When one of these items is selected, a dispatch process detail screen 106 as shown in FIG. 11 is displayed. Also on this screen 106, the travel distance and basic fare previously obtained by the route search are automatically displayed in the area 106a, and a waypoint (landing) is displayed in the area 106b.

  In addition to the above, this embodiment is capable of managing the driver's work status, loading and unloading the baggage, responding to emergencies using a mobile phone, etc., and improving the efficiency of dispatch using the operation diagram. It is a typical logistics transportation management system.

  As described above, according to an embodiment of the present invention, the system searches for an accurate shortest route having a plurality of waypoints using map information and adopting a clustering technique. Can do. In other words, even if there are many waypoints, the shortest route is calculated by a unique algorithm, so the order of loading is automatically instructed based on the information of the searched optimum route (shortest distance, optimum route). be able to. The shortest distance can be used for paperwork such as quotations, sales, driver's salary, standard cost, etc. Furthermore, since the daily operation status can be confirmed from the terminals of each base, it is possible to centrally manage and standardize multiple branches based in the whole country, and to deal with emergencies.

  The embodiment of the present invention has been described above, but the present invention is not limited to this, and various improvements and modifications can be made without departing from the spirit of the present invention. For example, when a part or all of the order is specified by the customer, a route search suitable for the actual operation may be performed by specifying an arbitrary order.

It is a conceptual diagram which shows the structure of the physical distribution management apparatus 1 and physical distribution management system which concern on one embodiment of this invention. It is a flow chart explaining in detail a series of processings concerning distribution transportation management by distribution transportation management device 1 concerning one embodiment of the present invention. 3 is a flowchart for explaining in more detail the route search executed in step S3 of FIG. It is a conceptual diagram for demonstrating route search. It is a figure which shows an example of the screen 100 displayed at the time of control program starting. 6 is a diagram illustrating an example of an order processing screen 101. FIG. It is a figure which shows an example of the map display screen. It is a figure which shows an example of the dispatch process screen. It is a figure which shows an example of a dispatch process detail screen. It is a figure which shows an example of the daily report process screen. It is a figure which shows an example of the daily report process detail screen.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 1 ... Logistics transport management apparatus, 2 ... Control part, 3 ... Communication control part, 4 ... Display part, 5 ... Operation input part, 6 ... Management database, 7 ... Network 8 ... Terminal 21 ... Logistics transportation management program 21a ... Route search function 21b ... Order processing function 21c ... Vehicle dispatch processing function 21d ... Daily report processing function 21e: Other management functions.

Claims (4)

A logistics transportation management device that operates based on a control program,
A management database;
Based on the route search function of the above control program, based on the road distance acquired from the map information, those that are close to each other are grouped together, and the reference point of each group is obtained using the latitude and longitude information, Route search is performed at each reference point to determine the transport order between groups, route search is performed including the transit point of the next group with the next transport order, and the transit point of the next group that has the shortest distance is the next group. As the starting point of the above, the sum of the total distance in each group obtained by route search for each group and the distance between each group is obtained as the total travel distance, and the information for the optimum route as the shortest distance is used for the above management route information. Control means for controlling storage in the database;
A logistics transportation management apparatus using map information.   2. The logistics transport management apparatus according to claim 1, wherein when grouping as a group, all combinations of waypoints are ranked in ascending order of distance, and a predetermined number is grouped as a group from the top one.   The control program further includes at least one of an order processing function, a dispatch processing function, and a daily report creation function, and further performs predetermined processing based on information on the optimum route. Described in logistics transportation management equipment. A logistics transportation management system comprising a logistics transportation management apparatus that can communicate with a terminal of a branch office or branch office via a network,
The upper air logistics transport management device
A management database;
Based on the route search function of the above control program, based on the road distance acquired from the map information, those that are close to each other are grouped together, and the reference point of each group is obtained using the latitude and longitude information, Route search is performed at each reference point to determine the transport order between groups, route search is performed including the transit point of the next group with the next transport order, and the transit point of the next group that has the shortest distance is the next group. As the starting point of the above, the sum of the total distance in each group obtained by route search for each group and the distance between each group is obtained as the total travel distance, and the information for the optimum route as the shortest distance is used for the above management route information. Control means for controlling storage in the database;
A logistics transportation management system using map information.

Images