JP2005316600A - Vehicle dispatch support program and vehicle dispatch support apparatus - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a technique that, in a physical distribution service, can effectively support delivery management such as decisions on delivery courses and vehicles necessary for the delivery courses and flexibly and shortly cope with orders for delivery. <P>SOLUTION: A program for vehicle dispatch support by a computer has a step S11 of accepting formal orders whose total delivery quantity accepted in a predetermined period are fixed, as delivery orders for article delivery to given destinations, a step of accepting total temporary orders that are tentatively decided at a first predetermined time point, as delivery orders whose total delivery quantity accepted in the predetermined period are variable, and a step S13 of setting delivery routes passing one or more destinations from a delivery start point for article delivery by reference to the time required between the start point and the destinations or between one article destination and the next article destination, or the delivery distance between them, and deciding the types and numbers of vehicles to be used for the delivery quantity of the delivery routes. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to a vehicle allocation support technique in a logistics service.

  In recent years, in the logistics industry, service competition has intensified, and it has been required to deliver other varieties and small quantities of goods to designated delivery destinations in a short time. For example, the following Patent Documents 1 and 2 are known as general techniques for supporting such an article delivery service.

  In order to support such delivery, a technique for supporting determination of a delivery course that passes through a plurality of delivery destinations and determination of the number of vehicles necessary for the delivery course is also being studied. For example, the problem of determining a course that goes around a predetermined delivery destination by the shortest route is conventionally known as a traveling serviceman problem.

  However, as a result of the need to deliver other varieties and small quantities of goods to specified destinations in a short period of time, in the delivery industry, the amount of orders for delivery (number, number of articles, weight, volume, etc.) in daily operations Is in a state where it cannot be determined early. For example, if an order to be delivered by the next day is cut off at an early stage of the day, orders after that stage will be delivered the next day, and the request for early delivery cannot be met.

On the other hand, when an order to be delivered by the next day is received until a later stage, the order quantity is not confirmed until that stage, and the delivery destination of the article and the delivery quantity of the article cannot be confirmed. Therefore, even if a technology is developed that supports the determination of a delivery course that goes through multiple delivery destinations and the number of vehicles required for the delivery course, as long as the order quantity cannot be determined, it is practically Such technology cannot be used.
JP 2001-307279 A JP 2003-128252 A

  The present invention has been made to solve the above problems in distribution support in the logistics industry. In other words, an object of the present invention is to provide a technology that can effectively support delivery management such as determination of a delivery course and a vehicle necessary for the delivery course in a logistics service, and can flexibly deal with an order for delivery in a short period of time. There is to do.

  In order to solve the above problems, the present invention employs the following means. In other words, the present invention is a program for causing a computer to assist in vehicle allocation, the step of receiving a regular order in which the cumulative amount of delivery received in a predetermined period is confirmed as a delivery order of articles to be delivered to a predetermined delivery destination, A step of accepting a cumulative provisional order that is provisionally determined at a first predetermined point in a delivery order in which the cumulative amount of delivery received in a period changes, and between the delivery start point for delivering the article and the delivery destination, or the article A delivery route passing through one or more delivery destinations from the start point is set with reference to the required time between the delivery destination of the next item and the delivery destination of the next article, or the delivery distance between the delivery destinations, and corresponds to the delivery amount of the delivery route. And determining the type and number of vehicles to be introduced.

According to this program, a required time between a delivery start point for delivering an article according to a provisional order tentatively determined at a first predetermined time point and a delivery destination or between the delivery destination of the article and the delivery destination of the next article, Alternatively, a delivery route that passes through one or more destinations from the start point is set with reference to the delivery distance therebetween, and the type and number of vehicles to be input are determined in accordance with the delivery amount of the delivery route. Before the total amount of delivery is determined, the delivery route and the type and number of vehicles to be introduced can be tentatively determined.

  The program includes a step of referring to a cumulative total of orders ordered at a second predetermined time point in a delivery order in which the cumulative total of delivery amounts received in the predetermined period changes, a delivery amount to a delivery destination in the temporary order, and the book The method may further include a step of extracting a delivery destination whose difference with the delivery amount for the delivery destination in the order is not within a predetermined range.

  According to this program, a destination whose difference between the delivery amount for the delivery destination in the temporary order and the delivery amount for the delivery destination in the main order is not within a predetermined range is extracted. Of the types and number of vehicles to be checked, it is possible to extract what should be reviewed.

  The program may further include a step of extracting a delivery destination included in the main order at a delivery destination not included in the temporary order. Therefore, according to this program, it is possible to extract a delivery destination that has been ordered later with a delivery destination that has not been dispatched by a provisionally determined delivery route.

  The program refers to the required time between the delivery start point for delivering the article corresponding to the regular order and the order and the delivery destination, or the delivery time between the delivery destination of the article and the delivery destination of the next article, or the delivery distance therebetween. Then, a delivery route that passes through one or more delivery destinations from the start point may be set, and a second decision step may be further included for deciding the type and number of vehicles to be input corresponding to the delivery amount of the delivery route.

  Further, the present invention may be a method in which a computer, other devices, machines, etc. execute any one of the processes described above. Further, the present invention may be a program in which such a program is recorded on a recording medium readable by a computer, other devices, machines, or the like. Further, the present invention may be a vehicle allocation support device having any one of the functions described above.

  According to the present invention, in a logistics service, it is possible to effectively support delivery management such as determination of a delivery course and a vehicle necessary for the delivery course, and it is possible to flexibly deal with orders for delivery in a short period of time.

  An information processing apparatus according to the best mode for carrying out the present invention (hereinafter referred to as an embodiment) will be described below with reference to the drawings. The configuration of the following embodiment is an exemplification, and the present invention is not limited to the configuration of the embodiment.

<Outline of processing and functional configuration in the information processing apparatus>
The information processing apparatus supports a distribution service that accepts an article delivery order and delivers the article to a specified delivery destination in accordance with the delivery order.

  FIG. 1 is a conceptual diagram of delivery order acceptance in a logistics service supported by the information processing apparatus. In the description of this embodiment, the delivery order is also referred to as an order. A delivery order is also simply referred to as an order.

FIG. 1 is a diagram in which the cumulative order quantity with respect to the passage of time (time) in a predetermined processing period (for example, one day) is plotted for different types of delivery orders. As shown in FIG. 1, in the description of the present embodiment, the delivery order is classified into three types: a normal order (solid line), a main order (one-dot chain line), and a temporary order (dashed line). In FIG. 1, two types of time are shown as times: primary tightening (corresponding to a first predetermined time point) and secondary tightening (corresponding to a second predetermined time point).

  The regular order is a delivery order in which the cumulative order quantity has been confirmed by the time of the primary closing. Therefore, in the order corresponding to the regular order, the delivery destination, the type of article to be delivered, and the cumulative quantity are designated at the time of the primary closing, and are not changed until the delivery is completed thereafter. If the delivery order is only the regular order as described above, it is possible to effectively use a computer program for executing a delivery course decision, a vehicle assignment decision, etc. in logistics service support.

  However, in an actual logistics service, as shown in FIG. 1, there is a delivery order in which the cumulative order quantity changes from moment to moment. Such a delivery order is called a main order. In this order as well as the regular order, the delivery destination of the article and the quantity of the article are determined in one order. However, since this order is accepted at any time with time, the number of orders to be accepted even after the first tightening time, and accordingly, the cumulative quantity to be ordered increases with time.

  In this information processing apparatus, in support of the logistics service, such an order is tentatively determined at the time of the primary closing, and then a delivery course is determined, a dispatched quantity is allocated, and the like. A delivery order that is tentatively determined at the time of primary tightening is referred to as a provisional order. The provisional order corresponds to the actual order for which orders are expected on the day. In the provisional order, the cumulative quantity is provisionally determined before the final order is confirmed, and the vehicle allocation process is executed in advance. The user inputs the quantity of the provisional order by predicting the cumulative quantity of the current order on that day.

  Further, the information processing apparatus compares the cumulative order quantity of the final order finally determined at the time of the secondary tightening and the quantity of the temporary order. Then, the delivery course and dispatched quantity determined for the provisional order are allocated to the delivery of the goods ordered in this order, and the difference between the cumulative order quantity of this final order and the quantity of the provisional order is adjusted. To help.

  That is, according to the information processing apparatus, a delivery order in which the cumulative order quantity of the final order finally confirmed and the quantity of the temporary order overlap (an article whose quantity matches the delivery destination in the temporary order and the actual order). With regard to (order), a dispatching system realized as a computer program determines a delivery course, a delivery order, the number of vehicles to be dispatched, a delivery time, and the like without human intervention. On the other hand, if a difference occurs between the cumulative order quantity of the final order and the quantity of the provisional order, the difference is extracted and manual adjustment is requested for the order corresponding to the difference. To do. Therefore, according to this information processing apparatus, the deadline of the delivery order can be delayed to the time of the secondary closing, and the manual dispatching operation can be kept to the minimum range as much as possible.

  FIG. 2 is an overall schematic diagram of the information processing apparatus. The information processing apparatus includes a program executed on a computer and a database constructed on the computer. Such an information processing apparatus is constructed for each delivery center that manages delivery in a predetermined area. Therefore, the dispatch process is executed for each delivery center. However, a single information processing apparatus may manage delivery orders for a plurality of delivery centers and execute a dispatch process for the plurality of delivery centers.

The information processing apparatus includes an order database 1 that records delivery orders received through a system such as EDI (Electronic Data Interchange) / EOS (Electronic Ordering System), a vehicle master 2 that stores information on vehicles used for delivery, The distance between the delivery center and the delivery destination master 4 for storing information related to the delivery center of each place, the delivery destination master 4 for storing the information related to the delivery destination of the package, the distance between the delivery destination and the delivery destination, and the distance between the delivery center and the delivery destination A distance matrix 5 for storing information related to the route, a display device 6 for displaying information to the user of the information processing device, an input operation unit 7 for accepting an input operation from the user, an order database 1, various masters, The vehicle allocation process is executed based on the input information from the user, and the vehicle allocation schedule 9 and the order matching list 10 are generated. And a car system 8.

  The order database 1 is input with delivery orders accepted online or offline. Typically, the delivery order is input through a network device (not shown) via EDI / EOS. As described above, the data stored in the order database 1 includes the normal order and the main order. Further, the order database 1 includes information related to the temporary order predicted at the time of the primary closing.

  The display device 6 is a liquid crystal display, a CRT, or the like, and executes various screen displays under the control of a control unit including a CPU (not shown). The input operation unit 7 is a keyboard, a mouse, various pointing devices, or the like. The user instructs the vehicle allocation system 8 to execute through the display device 6 and the input operation unit 7, and executes a vehicle allocation operation (for example, correction of a delivery course, the number of vehicles allocated, etc.).

  The dispatch schedule 9 stores information relating to a delivery course including a plurality of delivery destinations and vehicles assigned to the delivery course. The order matching list 10 stores difference information between the quantity (delivery amount) of the temporary order input at the time of the primary closing and the cumulative quantity (delivery amount) of the actual order at the time of the secondary closing.

  FIG. 3 is a functional conceptual diagram of the information processing apparatus. As shown in FIG. 3, the information processing apparatus always receives a delivery order through EDI / EOS or the like (S1). However, the delivery order received offline is also input via the input operation unit 7. Then, at the time of the primary tightening, the cumulative quantity of temporary orders is input by the user via the input operation unit 7 for each main delivery destination (S1). Then, the information processing apparatus updates the order database 1 based on the received delivery order, the input delivery order, and the provisional order (S3). This process is called order management.

  Next, the information processing apparatus executes a vehicle allocation process based on the order database 1 and various master information (S4). The dispatch process includes a dispatch process in a provisional mode that is executed after the primary tightening and a dispatch process in the main mode that is performed after the secondary tightening. The information processing apparatus executes a vehicle allocation process by switching between the temporary mode and the main mode. As a result, a provisional mode dispatch schedule and this mode dispatch schedule are created.

  Then, the information processing apparatus extracts a delivery destination in which the difference in the delivery amount is not within a predetermined range (large and excessive) between the provisional mode dispatch schedule and the present mode dispatch schedule. In addition, the information processing apparatus extracts a delivery destination of an unallocated vehicle that is not set as a delivery destination in the provisional mode but is set as a delivery destination for the first time in this mode. When such a delivery destination with a large excess or deficiency of the delivery amount and a delivery destination of undelivered vehicles are extracted, the information processing apparatus prompts the user to correct the dispatch schedule. Then, the information processing apparatus displays or prints the dispatch result determined by the user correction (S5).

FIG. 4 is a diagram illustrating a daily operation flow of the information processing apparatus. In the example of FIG. 4, the primary tightening is set at 12:00. At the time of primary tightening, the regular order is closed. The information processing apparatus receives the current order generated on that day as needed after the primary tightening and records it in the order database 1. In addition, after the primary tightening, the information processing apparatus receives an input of a provisional order that is provisional prediction data from the user. And this information processing apparatus performs a vehicle allocation process in provisional mode. At this time, the information processing apparatus outputs a temporary dispatch schedule 9 and instructs the user to arrange a vehicle (also called a carriage). Thereafter, the information processing apparatus continues to receive this order until the secondary tightening.

  In the example of FIG. 4, secondary tightening is set at 15:00. At the time of secondary tightening, this order is closed. The information processing apparatus generates the order matching list 10 from the difference between the cumulative quantity of the main order that has been received at this time and the delivery quantity of the temporary order that has been input after the primary closing. The order matching list 10 is used as summary information for comparing the quantity of the provisional order and the cumulative quantity of this order.

  Then, the information processing apparatus executes dispatch in this mode. Here, the information processing apparatus creates a dispatch schedule in this mode. And the information processing apparatus was not set by the delivery destination in which the difference between the delivery amount in the provisional mode and the delivery amount in the present mode is not within a predetermined range or the provisional mode dispatch processing based on the difference between the two dispatch schedules The destinations that have been ordered in this order from the unordered destinations are extracted. The review of these delivery courses and the dispatch to undelivered destinations are performed by the user's manual operation. Then, the information processing apparatus outputs the determined dispatch schedule 9 after the review.

<Data and screen configuration>
FIG. 5 shows the data structure of an order (regular order, regular order, and provisional order). (1) of FIG. 5 is a diagram showing a data configuration of order data stored in the order database 1. The order data of the order database 1 has a header part, a body part, and a tailor part.

  The header portion includes elements such as a center code, date, order classification, order NO, delivery destination code, delivery destination name, delivery destination address, delivery time, and vehicle size restriction. Of these, the center code is information for identifying the delivery center that has received the order. The order NO is information that uniquely identifies the regular order or the delivery order of this order. The delivery destination code is information for specifying the delivery destination of the delivery order.

  The delivery time is a delivery time to the delivery destination referenced from the delivery destination master 4 based on the delivery destination code. The vehicle size restriction is vehicle size restriction information at the delivery destination referenced from the delivery destination master based on the delivery destination code. This is because the vehicle size is limited for each delivery order depending on road conditions.

  In the body part, an article (also referred to as a product) to be delivered is described in the delivery order identified by the header part. As shown in FIG. 5, the body portion constitutes a table. Each row of the table of the body part has elements of POS, product code, product name, unit weight, unit volume, number, weight, and volume.

  Of these, POS is a so-called line number. The product code is information for identifying the product to be delivered. The unit weight is the weight per article. The unit volume is a volume per one item. The number is the number of deliveries of the product in the delivery order. The weight is a weight corresponding to the number (unit weight × number). The volume is a volume corresponding to the number (unit volume × number).

The total value of the articles in the body part is recorded in the tailor part. That is, the count meter is the total number of all articles to be delivered designated by the delivery order. The weigh scale is the total weight of all items to be delivered designated in the delivery order. The volume meter is the total volume of all items to be delivered designated in the delivery order. The loading / unloading time is an estimated time required for loading / unloading all articles, and is calculated from the total number and the time factor per number.

  FIG. 5 (2) shows the structure of data at the time of reception from the outside of the regular order and this order. When receiving the delivery order (regular order and main order) from the outside, the center code, date, delivery destination code, POS (Point of Sales), product code, unit weight, unit volume and number are specified. Among these, delivery orders having a common center code, date, and delivery destination code are collected and stored as data having a common header part of the order database 1.

  (3) of FIG. 5 shows the input format of the temporary order. As described above, the provisional order is set based on information input from the user based on the prediction at the first tightening time. The provisional order includes elements such as a center code, a date, a delivery destination code, a number meter, a weight meter, and a volume meter. Among these, the weight meter and the volume meter may be calculated from the total number by referring to a unit weight and a unit volume coefficient for each article from a predetermined database (for example, a product master (not shown)). The information processing apparatus internally has a standard weight and volume per article.

  FIG. 6 is a diagram showing a record configuration of the center master 3. The center master 3 is a database that manages information related to the distribution center. As shown in FIG. 6, the center master 3 has elements such as a center code, a center name, a base address, a latitude, a longitude, an operation start time, and an operation end time. Of these, the center code is information for uniquely identifying each center. The latitude and longitude are stored for specifying the center position.

  FIG. 7 is a diagram showing a record configuration of the delivery destination master 4. The delivery destination master 4 is a database that manages information related to the delivery destination of the package. As shown in FIG. 7, the delivery destination master 4 includes elements such as a delivery destination code, a delivery destination name, a delivery destination address, latitude, longitude, vehicle size restriction, delivery time, and a regular target flag.

  Among these, the delivery destination code is information for uniquely identifying the delivery destination. In addition, the latitude and longitude are stored for specifying the location of the delivery destination. The vehicle size limit is information indicating a limit value of the vehicle size that can enter the delivery destination. For example, the vehicle size may be limited by the vehicle weight, loading weight of the truck, or the width, height, total length, etc. of the vehicle. The delivery time is a delivery time that the delivery destination normally desires. The legitimate target flag is a flag indicating whether the customer places an order on a regular order, such as EOS, or the customer who places an order by other means (facsimile, telephone, etc.).

  FIG. 8 is a diagram illustrating a configuration of a record of the vehicle master 2. The vehicle master 2 is a database that manages information related to vehicles used for delivery. As shown in FIG. 8, the vehicle master 2 includes elements such as a vehicle NO, a belonging center, a loaded weight, and a loaded volume.

  FIG. 9 is a diagram illustrating a record configuration of the distance matrix 5. The distance matrix 5 is a database that manages a delivery destination and a delivery destination, or a required distance (distance) between the delivery destination and the center, a required time, and the like. As shown in FIG. 9, the distance matrix 5 includes information on a combination of a delivery destination code or a center code, and a required distance and a required time for the combination.

  The vehicle allocation system 8 executes a vehicle allocation process, and sets a delivery course with reference to the distance matrix 5 for a delivery destination designated in the delivery order. For this process, various algorithms have been proposed as computer programs for solving the traveling service problem.

FIG. 10 is a diagram showing a configuration of the dispatch schedule 9. The dispatch schedule 9 is created based on dispatch information (FIG. 12), which is a table that defines a destination to be visited for a combination of a delivery course created as a result of the dispatch process and a vehicle assigned to the delivery course. It is a form that is represented. As shown in FIG. 9, the dispatch schedule 9 includes a header part and a body part. The header section of the dispatch schedule 9 has information such as date, course number, center code, vehicle number, vehicle size, center departure time, center arrival time, execution mode, execution date and time, number of cases, travel distance, loading rate, etc. ing.

  The date is the date when the dispatch process is executed. The course number is information for identifying a delivery course set by the dispatch process. A delivery course is a route that goes around one or more destinations. In the dispatch schedule 9 of the present embodiment, the course number = 0 means a list of delivery destinations that have not been delivered, that is, that are not scheduled for delivery.

  The center code indicates the center that manages the delivery of the article by the dispatch schedule 9. The vehicle NO is information indicating a vehicle assigned to the delivery course. The vehicle size is a dimension of the vehicle. The center departure time and the center arrival time are the arrival and departure times of the center when the delivery course is visited according to the dispatch schedule 9. The execution mode is an execution mode of the vehicle allocation process when the vehicle allocation schedule 9 is created, and the provisional mode or the main mode is recorded.

  The number of cases is the number of recipients, that is, the number of lines in the body part. The execution date / time is the execution date / time of the dispatch process. The travel distance is a travel distance when the course is visited by the dispatch process. The loading rate is the ratio of the loading rate (the actual loading weight (or capacity) to the loading weight (or capacity) of the vehicle) in the initial state (when leaving the delivery center) when delivered according to the dispatch schedule 9. .

  In the body part of the dispatch schedule 9, information related to the delivery destination is defined in the order of delivery. In the body part of FIG. 10, a delivery destination code, delivery destination name, address, number of orders, number, weight, volume, arrival time, departure time, and loading / unloading time are set.

  FIG. 11 is a diagram showing the configuration of the order matching list 10. The order matching list 10 is a table that records the difference between the provisional order quantity and the cumulative quantity of the actual order that is actually accepted.

  As shown in FIG. 11, the order matching list 10 includes a header part and a body part. The header part of the order matching list 10 includes a date, a course number, and a center code. This information is the same as in the dispatch schedule.

  Also in the body portion of the order matching list 10, information related to the delivery destination is set in the order of delivery. However, as shown in FIG. 11, in the order matching list 10, unlike the dispatch schedule (see FIG. 10), the number of orders, the number, and the weight for the temporary order, the actual order, and the difference (difference between the temporary order and the actual order). , Each volume is recorded. That is, the order matching list 10 is provided for calculating the difference between the temporary order and the main order, the difference in the total load weight, and the difference in the layer load capacity for each delivery destination.

FIG. 12 is a diagram illustrating a configuration of vehicle allocation information. The vehicle allocation information is obtained by mounting the vehicle allocation schedule 9 as a file, and has the same contents as the vehicle allocation schedule 9.
FIG. 13 is a diagram illustrating a configuration of the name identification management table. The name identification management table is a table used for aggregation of various data in the name identification process. The name identification management table includes information on name identification number, delivery destination code, regular target flag, delivery time, course number, delivery order, arrival time, departure time, provisional mode, and main mode.

Among these, the name identification number is information for uniquely identifying a plurality of name identification management tables. The delivery destination code is information for identifying the delivery destination at the time of delivery. The delivery time is a delivery time desired by the delivery destination referred from the delivery destination master 4. The course number is a delivery course number in which the delivery destination is incorporated in the delivery process. The delivery order is the delivery order of the delivery destination in the delivery course specified by the course number. The arrival time is a scheduled arrival time at the delivery destination, and the departure time is a scheduled departure time from the delivery destination.

  Each information in the provisional mode and the main mode has elements of an order meter, a number meter, a weight meter, a volume meter, and a loading / unloading time meter. First, after the primary tightening, in the delivery process in the provisional mode, the name identification process is executed using the provisional order, and for each destination, course assignment, delivery order determination, delivery time, number of orders, number, Weight, volume and loading / unloading time are set. Next, after the secondary tightening, the name identification process is executed using the actual order received in the delivery process in this mode, and the course allocation, delivery order determination, delivery time, number of orders, Number, weight, volume and loading / unloading time are set.

  FIG. 14 is a diagram illustrating a screen example of a temporary order screen for inputting a temporary order. The temporary order is input by the user's manual operation after the primary tightening. In the present embodiment, the vehicle allocation system allows the user to input the number of provisional orders of main delivery destinations and the amount of packages. The process of accepting the input of the number of provisional orders and the quantity of packages corresponds to the step of accepting the cumulative total of provisional orders.

  As shown in FIG. 14, the provisional order screen has a table including columns for a delivery destination code, a delivery destination name, the number of provisional orders, the number, the weight, and the volume. The user sets the information shown in FIG. 14 for main delivery destinations. When OK is pressed, a temporary order is accepted, and when cancel is pressed, the input content is cleared.

  FIG. 15 is a flowchart showing the delivery process in the provisional mode. The delivery process in the provisional mode is executed after the primary tightening. In this process, the delivery system 8 first collects regular orders in units of delivery destinations and totals them (S11).

  Next, the delivery system 8 names the temporary orders in units of delivery destinations and tabulates them (S12). Thereby, the information on the temporary order in the name identification management table of FIG. 13 is set. The tabulation results in the provisional mode (regular order and provisional order) are stored in the provisional mode element of the name identification management table (see FIG. 13).

  Next, the delivery system 8 executes a vehicle allocation process based on the data of the regular order and the temporary order, and creates a vehicle allocation schedule (S13). The process of creating the dispatch schedule in this provisional mode corresponds to the first determination step.

  FIG. 16 is a flowchart showing a vehicle allocation process in this mode. This process is executed with reference to the order database 1, and a final dispatch schedule 9 is created. In this process, the vehicle allocation system 8 first collects regular orders in units of delivery destinations and tabulates them (S21). This process is the same as in the provisional mode (S11 in FIG. 15), and the result also matches the case of the provisional mode.

  Next, the vehicle allocation system 8 gathers the names of the orders in units of delivery destinations and tabulates them. This process corresponds to a step of referring to the cumulative total of this order. Then, the name identification in the provisional mode and the difference from the total result are output to the matching list 10 (S22). Note that the totaling results (regular order and regular order) in this mode are stored in the elements of this mode of the name identification management table (see FIG. 13).

The matching list 10 is used as a summary of the total results. Then, the dispatch system 8 refers to the order database 1 and repeats the following processing for each order (regular order and regular order) of the delivery destination. However, regarding the regular order, the execution result of the provisional mode is simply applied to the execution result of this mode as it is.

  That is, the vehicle allocation system 8 determines whether or not the delivery destination is a delivery destination based on a regular order (S23). This determination is made based on the order classification shown in FIG. When the delivery destination is a delivery destination based on the regular order, the dispatch system applies the execution result in the provisional mode as it is as the execution result in the present mode (S24).

  On the other hand, when the delivery destination is not a delivery destination based on the regular order, the vehicle allocation system 8 determines whether or not the delivery destination is included as a delivery destination in the temporary order (S25). When the delivery destination is included in the delivery destination in the temporary order, the dispatch system 8 determines whether or not the delivery destination exists in the delivery course created as the dispatch processing result in the provisional mode (see FIG. 15) ( S26). If the delivery destination exists in the delivery course of the provisional order dispatching process result, the order is directly associated with the course of the dispatching process result in the provisional mode (S27). As a result, the delivery destination provisionally set in the provisional order is supported by the main order (the number, weight, and volume specified in the main order). This process corresponds to a second determination step.

  If it is determined in S26 that the delivery destination of the main order does not exist in the course of the temporary order dispatch processing result, the dispatch system 8 classifies the present order as a course that has not been dispatched (course number 0) (S28). Record in Schedule 9.

  Then, the vehicle allocation system 8 determines whether all the delivery destinations specified in the regular order and the main order have been classified (S29). If there is an unclassified delivery destination, the vehicle allocation system 8 returns the control to S23. On the other hand, when the classification of all the delivery destinations is completed, the vehicle allocation system 8 executes the following processing (S30) and waits for a user operation.

  That is, the vehicle allocation system 8 lists and displays the delivery destinations of this order that have not been dispatched (delivery destinations without provisional orders). The user manually dispatches the delivery of the order that has not been dispatched.

  In addition, a search is made for a delivery destination having a significant difference in load weight, load capacity, etc. between execution in the provisional mode and execution in this mode. The user manually corrects the dispatch schedule for delivery destinations having a difference of more than a predetermined value. After receiving the above correction, the vehicle allocation system 8 ends the process.

  As described above, according to the information processing apparatus of the present embodiment, at the time of the primary tightening, a temporary order input from a user (for example, a delivery management administrator) is accepted and the cumulative delivery quantity is confirmed. The dispatch process is executed in the temporary mode according to the delivery quantity of the temporary order. Therefore, the vehicle allocation process is executed before the secondary closing that is the deadline of the delivery order (main order) in which the cumulative order changes with time, and the vehicle type (loading amount) required for delivering the article corresponding to the delivery order. Or the loading capacity etc.) and the number of units can be estimated.

  Further, according to the information processing apparatus of the present embodiment, after the deadline of the delivery order (main order), the dispatching process is executed again (in this mode) with the regular order and the confirmed delivery order (main order), Compare with the dispatch result in the temporary mode. The information processing apparatus extracts a delivery destination that has not been dispatched in the provisional mode. In addition, the information processing apparatus extracts a delivery destination in which the difference in delivery amount is not within a predetermined range (a large excess or shortage) in the comparison between the dispatch result in the provisional mode and the dispatch result in the present mode. By extracting such a delivery destination, it is possible to prompt the user to take an appropriate action in response to a delivery order that cannot be handled by execution in the provisional mode.

  In addition, after the deadline of the delivery order (main order) is delayed to the secondary closing time by the procedure as described above, the dispatch is executed by the information processing apparatus process of the dispatch process in the temporary mode as much as possible. The user can be prompted to perform a manual operation only in cases where the provisional mode cannot be completely solved.

<Modification>
In the above embodiment, after the dispatch process in this mode, in the comparison between the dispatch result in the temporary mode and the dispatch result in the present mode, a delivery destination in which the difference in delivery amount is not within a predetermined range (excessive or insufficient) is extracted. did. However, instead of such processing, in the comparison between the dispatch result in the provisional mode and the dispatch result in the present mode, a delivery course in which the difference in the delivery amount is not within a predetermined range (a large excess or shortage) is extracted. May be. For example, it is assumed that there are a first delivery destination and a second delivery destination included in one delivery course. In this case, the first delivery destination has a case where the delivery amount in this mode is significantly increased with respect to the provisional mode, and the second delivery destination is a case in which the delivery amount is significantly reduced in this mode with respect to the provisional mode. Think. For the first delivery destination and the second delivery destination included in such a delivery course, it is determined that the difference in delivery amount is within a predetermined range (the excess or shortage is small) so that manual operation by the user is not prompted. Good.

<Computer-readable recording medium>
A program for causing a computer or other machine or device (hereinafter, a computer or the like) to realize any of the above functions can be recorded on a recording medium that can be read by the computer or the like. The function can be provided by causing a computer or the like to read and execute the program of the recording medium.

  Here, a computer-readable recording medium is a recording medium that stores information such as data and programs by electrical, magnetic, optical, mechanical, or chemical action and can be read from a computer or the like. Say. Examples of such a recording medium that can be removed from a computer or the like include a flexible disk, a magneto-optical disk, a CD-ROM, a CD-R / W, a DVD, a DAT, an 8 mm tape, and a memory card.

In addition, as a recording medium fixed to a computer or the like, there are a hard disk, a ROM (read only memory) and the like.
<Others>
Furthermore, this embodiment discloses the following invention. In addition, the constituent elements included in any of the following inventions (hereinafter referred to as supplementary notes) may be combined with the constituent elements of other supplementary notes.
(Supplementary Note 1) A step of accepting a regular order in which a cumulative total of delivery amounts accepted in a predetermined period is confirmed in a delivery order of articles to be delivered to a predetermined delivery destination to a computer;
A step of accepting a cumulative total of provisional orders tentatively determined at a first predetermined time point in a delivery order in which the cumulative total of delivery amounts received in the predetermined period changes;
One or more destinations from the start point with reference to the required time between the delivery start point for delivering the article and the delivery destination or between the delivery destination of the article and the delivery destination of the next article, or the delivery distance between them A vehicle allocation support program for setting a delivery route to be passed and executing a first determination step for determining the type and number of vehicles to be input in correspondence with the delivery amount of the delivery route. (1)
(Supplementary Note 2) A step of referring to the order in which the cumulative amount of delivery accepted at a second predetermined time point in the delivery order in which the cumulative amount of delivery received in a predetermined period changes,
The vehicle dispatching support program according to supplementary note 1, further comprising a step of extracting a delivery destination in which a difference between a delivery amount to the delivery destination in the temporary order and a delivery amount to the delivery destination in the main order is not within a predetermined range. (2)
(Supplementary note 3) The vehicle allocation support program according to supplementary note 2, further comprising a step of extracting a delivery destination included in the main order from a delivery destination not included in the temporary order. (3)
(Supplementary Note 4) A required time between a delivery start point for delivering an article corresponding to the regular order and the present order and a delivery destination, or between a delivery destination of the article and a delivery destination of the next article, or a delivery distance between the delivery destinations. And a second determination step for setting a delivery route that passes through one or more destinations from the start point and for determining the type and number of vehicles to be input corresponding to the delivery amount of the delivery route. Or the vehicle allocation support program described in 3. (4)
(Supplementary Note 5) Means for accepting a regular order in which the cumulative amount of delivery accepted in a predetermined period is confirmed as a delivery order of an article to be delivered to a predetermined delivery destination;
Means for accepting the cumulative total of provisional orders tentatively determined at a first predetermined time point in a delivery order in which the cumulative total of delivery quantities received in the predetermined period changes;
One or more destinations from the start point with reference to the required time between the delivery start point for delivering the article and the delivery destination or between the delivery destination of the article and the delivery destination of the next article, or the delivery distance between them A vehicle dispatching support apparatus comprising: a first determination unit that sets a delivery route to pass through and determines a type and the number of vehicles to be input in accordance with a delivery amount of the delivery route. (5)
(Supplementary Note 6) Means for referring to the delivery order in which the cumulative delivery amount received during a predetermined period changes and the cumulative delivery amount confirmed at the second predetermined time point,
The vehicle dispatching support device according to appendix 5, further comprising means for extracting a delivery destination whose difference between the delivery amount to the delivery destination in the temporary order and the delivery amount to the delivery destination in the main order is not within a predetermined range.
(Supplementary note 7) The vehicle allocation support device according to supplementary note 6, further comprising means for extracting a delivery destination included in the main order from a delivery destination not included in the temporary order.
(Supplementary Note 8) A required time between a delivery start point for delivering an article corresponding to the regular order and the present order and a delivery destination, or a delivery distance between the delivery destination of the article and the delivery destination of the next article, or a delivery distance between the delivery destinations. Appendix 6 further comprising: a second determination means for setting a delivery route that passes through one or more destinations from the start point and for determining the type and number of vehicles to be input in accordance with the delivery amount of the delivery route. Or the vehicle allocation support device according to 7.
(Supplementary Note 9) A step of accepting a regular order in which a cumulative total of delivery amounts accepted in a predetermined period is confirmed by a computer in a delivery order of articles to be delivered to a predetermined delivery destination;
A step of accepting a cumulative total of provisional orders tentatively determined at a first predetermined time point in a delivery order in which the cumulative total of delivery amounts received in the predetermined period changes;
One or more destinations from the start point with reference to the required time between the delivery start point for delivering the article and the delivery destination or between the delivery destination of the article and the delivery destination of the next article, or the delivery distance between them A vehicle allocation support method for setting a delivery route to be passed and executing a first determination step for determining a type and the number of vehicles to be input in correspondence with a delivery amount of the delivery route.
(Supplementary Note 10) A step of referring to the order in which the cumulative amount of delivery accepted at a second predetermined time point is confirmed in the delivery order in which the cumulative amount of delivery received in a predetermined period changes.
The vehicle dispatching support method according to appendix 9, further comprising a step of extracting a delivery destination whose difference between the delivery amount to the delivery destination in the temporary order and the delivery amount to the delivery destination in the main order is not within a predetermined range.
(Supplementary note 11) The vehicle allocation support method according to supplementary note 10, further comprising: extracting a delivery destination included in the main order from a delivery destination not included in the temporary order.
(Supplementary Note 12) A required time between a delivery start point for delivering an article corresponding to the regular order and this order and a delivery destination, or between a delivery destination of the article and a delivery destination of the next article, or a delivery distance between the delivery destinations. And a second determination step of setting a delivery route that passes through one or more delivery destinations from the start point and that determines the type and number of vehicles to be input corresponding to the delivery amount of the delivery route. Or the vehicle allocation support method according to 11.

FIG. 3 is a conceptual view of accepting an order (an order is also referred to as an order) in a logistics service processed by the information processing apparatus according to the first embodiment of the present invention. It is a whole schematic diagram of this information processor. It is a functional conceptual diagram of this information processing apparatus. It is a figure which shows the flow of operation of this information processing apparatus. It is a figure which shows the data structure of an order. It is a figure which shows the record structure of a center master. It is a figure which shows the record structure of a delivery destination master. It is a figure which shows a structure of the record of a vehicle master. It is a figure which shows the record structure of a distance matrix. It is a figure which shows the structure of a dispatch schedule. It is a figure which shows the structure of an order matching list | wrist. It is a figure which shows the structure of vehicle information. It is a figure which shows the structure of a name identification management table. It is a figure which shows the example of a screen which inputs a temporary order. It is a flowchart which shows the process at the time of temporary mode execution. It is a flowchart which shows the process at the time of this mode execution.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Order database 2 Vehicle master 3 Center master 4 Delivery destination master 5 Distance matrix 6 Display apparatus 7 Operation input part 8 Vehicle dispatch system 9 Vehicle dispatch schedule 10 Order matching list

Claims (5)

A step of accepting a regular order in which a cumulative total of delivery amounts accepted in a predetermined period is confirmed in a delivery order of an article to be delivered to a predetermined delivery destination on a computer;
A step of accepting a cumulative total of provisional orders tentatively determined at a first predetermined time point in a delivery order in which the cumulative total of delivery amounts received in the predetermined period changes;
One or more destinations from the start point with reference to the required time between the delivery start point for delivering the article and the delivery destination or between the delivery destination of the article and the delivery destination of the next article, or the delivery distance between them A vehicle allocation support program for setting a delivery route to be passed and executing a first determination step for determining the type and number of vehicles to be input in correspondence with the delivery amount of the delivery route. Referring to the order in which the cumulative amount of delivery accepted at a second predetermined time point in the delivery order in which the cumulative amount of delivery received during a predetermined period changes;
The vehicle allocation support program according to claim 1, further comprising a step of extracting a delivery destination in which a difference between a delivery amount to the delivery destination in the temporary order and a delivery amount to the delivery destination in the main order is not within a predetermined range.   The vehicle allocation support program according to claim 2, further comprising a step of extracting a delivery destination included in the main order from a delivery destination not included in the temporary order.   Referring to the required time between the delivery start point for delivering the article corresponding to the regular order and this order and the delivery destination, or between the delivery destination of the article and the delivery destination of the next article, or the delivery distance therebetween 4. The method according to claim 2, further comprising: a second determination step of setting a delivery route that passes through one or more destinations from the start point and determining the type and number of vehicles to be input in accordance with the delivery amount of the delivery route. The vehicle allocation assistance program described. Means for accepting a regular order in which a cumulative total of delivery amounts to be accepted in a predetermined period is confirmed in a delivery order of an article to be delivered to a predetermined delivery destination;
Means for accepting the cumulative total of provisional orders tentatively determined at a first predetermined time point in a delivery order in which the cumulative total of delivery quantities received in the predetermined period changes;
One or more destinations from the start point with reference to the required time between the delivery start point for delivering the article and the delivery destination or between the delivery destination of the article and the delivery destination of the next article, or the delivery distance between them A vehicle dispatching support apparatus comprising: a first determination unit that sets a delivery route to pass through and determines a type and the number of vehicles to be input in accordance with a delivery amount of the delivery route.

Images