JP2012053904A - Information processing device, information processing method, and computer program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To create a vehicle dispatch plan, by relaxing constraint conditions with respect to a load which is not matched with constraint conditions relating to delivery, for assigning the load to a vehicle, and for identifying the relaxed constraint conditions.SOLUTION: In a client terminal, order information and delivery vehicle information, and constraint conditions and constraint condition relaxation information which are related to the order information and the delivery information are acquired from a server. A delivery vehicle, delivery time of an order and an unassigned order configuring the vehicle information for assigning the order are also automatically determined. The constraint conditions relating to the delivery vehicle and the order are relaxed according to the constraint condition relaxation information, and the assignment position of the unassigned order to the delivery vehicle is specified. The delivery vehicle and delivery time corresponding to the unassigned order are determined with respect to the assignment position, and a route result expressing the determined delivery vehicle and delivery time corresponding to the order is displayed on a display with the constraint condition relaxation information used for specifying the assignment position.

Description

  The present invention relates to an information processing apparatus, an information processing method, and a program for executing the information processing method, and in particular, information for determining an optimal combination of a vehicle and a load when performing land transportation and creating an efficient dispatch plan. The present invention relates to a processing apparatus, an information processing method, and a program for executing the information processing method.

In recent years, in the land transportation industry, for the purpose of reducing logistics costs and CO ₂ emissions, it has become an important issue to formulate a vehicle allocation plan with a smaller number of vehicles and mileage for land transportation. Therefore, the use of automatic vehicle allocation planning systems that create efficient vehicle routes is increasing.

On the other hand, in actual logistics operations, there are various constraints such as restrictions on vehicle loading weight and restrictions on collection / delivery time, and the automatic dispatch planning system simply provides solutions with small number of vehicles and mileage. Instead, obtaining a feasible solution (a vehicle allocation plan result) that satisfies the above constraints is an indispensable condition for realizing physical distribution costs and CO ₂ emission reduction. These constraints are not completely formulated by mathematical formulas, and often depend on the know-how and decision-making of vehicle dispatchers (users) at the site (for example, regarding store / delivery time constraints, It must be picked up at 9 o'clock, but it may be slightly delayed from 10 o'clock when delivered to store B). That is, the final vehicle allocation plan is often created based on the determination of the vehicle allocation person in charge. In particular, after an automatic dispatch plan, by violating one of a number of constraint conditions, (1) which constraint condition is violated and unallocated for an order (load) that has become unallocated. (2) It is extremely difficult for the person in charge of the vehicle allocation to determine which vehicle is optimally allocated when the allocation is performed with the constraints relaxed, and the labor load is large.

  In order to solve such problems, a technology has been proposed in which when an order violates a constraint, a plan with the least degree of violation of the constraint is automatically determined for the order and the determined plan is displayed. (For example, refer to Patent Document 1).

JP-A-9-244706

  However, in the technique of the above-mentioned Patent Document 1, information on whether or not the constraint condition is relaxed and whether or not the constraint condition is relaxed is stored in a table, and the constraint person to be relaxed is determined based on the information. It is difficult to flexibly change the constraint condition to be relaxed according to the situation at that time, or to change the allocation destination. In addition, the delivery plan is finally adjusted / confirmed by the person in charge, but with the technology of the above-mentioned Patent Document 1, it is not possible to identify what the relaxed constraints are, The labor load on the dispatcher is heavy.

  It is an object of the present invention to relax a constraint condition for a load that does not match a constraint condition for delivery, assign the load to a vehicle, and create a vehicle allocation plan that can identify the relaxed constraint condition A processing apparatus, an information processing method, and a program for executing the information processing method are provided.

In order to achieve the above object, the information processing apparatus according to claim 1 is communicably connected to a server that stores vehicle information and load information to be allocated to the vehicle information, and a vehicle allocation plan according to the vehicle information and the load information. In the information processing apparatus for creating the load information, the vehicle data constituting the vehicle information to which the load data constituting the load information is assigned, the delivery time of the load data, and the unassigned load data are determined. At least one of the determining means, the constraint condition related to the vehicle information and the constraint condition relaxation information that relaxes the constraint condition, and the constraint condition related to the cargo information and the constraint condition relaxation information that relaxes the constraint condition, And the constraint condition related to the vehicle information and the load according to the constraint condition relaxation information acquired by the acquisition means. Specifying means for relaxing the at least one of the restriction conditions regarding the information and specifying the allocation position of the unallocated load data with respect to the vehicle data by the first determining means; and the allocation position specified by the specifying means The second determination means for determining the vehicle data and the delivery time for the unassigned load data, and the vehicle data and the delivery time for the load data determined by the second determination means Display control means for displaying a delivery route together with the constraint condition relaxation information used for specifying the allocation position.

  The information processing method according to claim 10 is an information processing method for communicating with a server that stores vehicle information and load information to be assigned to the vehicle information, and creating a dispatch plan according to the vehicle information and the load information, A first determination step of determining vehicle data constituting the vehicle information to which the load data constituting the load information is assigned, data delivery time to the vehicle data, and determining unassigned load data; and the vehicle information An acquisition step of acquiring, from the server, at least one of a constraint condition relaxation information for relaxing the constraint condition and the constraint condition relaxing information for relaxing the constraint condition and a constraint condition relaxing information for relaxing the constraint condition In accordance with the constraint condition relaxation information acquired in the step, the constraint conditions related to the vehicle information and the constraint conditions related to the load information are reduced. Relieving at least one of the above, a specific step of specifying an allocation position for the vehicle data of unallocated load data in the first determination step, and an allocation position specified in the specific step, A second determination step for determining vehicle data and delivery time for the unallocated load data; and a delivery route representing the vehicle data and delivery time for the load data determined in the second determination step. And a display control step of displaying together with the constraint condition relaxation information used for specifying the allocation position.

  A program according to claim 11 communicates with a server that stores vehicle information and load information to be assigned to the vehicle information, and causes a computer to execute an information processing method for creating a dispatch plan according to the vehicle information and the load information. The information processing method determines the vehicle data constituting the vehicle information to which the load data constituting the load information is assigned, the delivery time of the load data, and the unassigned load data. At least one of a first determination step to determine, a constraint condition related to the vehicle information and a constraint condition relaxation information that relaxes the constraint condition, and a constraint condition related to the load information and a constraint condition relaxation information that relaxes the constraint condition According to the acquisition step acquired from the server and the constraint relaxation information acquired by the acquisition step. A specifying step of relieving at least one of a constraint condition related to vehicle information and a constraint condition related to the load information, and specifying an allocation position of the load data unallocated in the first determination step with respect to the vehicle data; A second determination step for determining vehicle data and delivery time for the unallocated load data for the allocation position specified in the specific step; and for the load data determined in the second determination step. And a display control step of displaying a delivery route representing vehicle data and delivery time together with constraint relaxation information used for specifying the assigned position.

According to the present invention, the vehicle data constituting the vehicle information to which the load data constituting the load information is allocated, the delivery time of the load data, and the unallocated load data are determined. Further, at least one of the constraint condition related to the vehicle information and the constraint condition relaxed information that relaxes the constraint condition, the constraint condition related to the load information, and the constraint condition relaxed information that relaxes the constraint condition is acquired from the server. In accordance with the acquired constraint condition relaxation information, at least one of the constraint condition related to vehicle information and the constraint condition related to load information is relaxed, and the allocation position of unallocated load data with respect to vehicle data is specified. Then, vehicle data and delivery time for unassigned load data are determined for the specified assigned position, and a delivery route representing the vehicle data and delivery time for the determined load data is assigned. It is displayed together with constraint relaxation information used for specifying the position. As a result, it is possible to relax the constraint condition for a load that does not match the constraint condition for delivery, assign the load to the vehicle, and identify the relaxed constraint condition.

It is a block diagram which shows roughly the structure of the information processing system provided with the information processing apparatus which concerns on this Embodiment. It is a block diagram which shows roughly the hardware constitutions of the client terminal in FIG. It is a block diagram which shows a part of function of the client terminal in FIG. 1, and the server 1 roughly. It is a flowchart which shows the allocation determination process performed with the client terminal of FIG. It is a figure which shows an example of the order information acquired by step S401 of FIG. 4, delivery vehicle information, and various master information. It is a flowchart which shows the automatic vehicle allocation plan process performed by step S402 of FIG. It is a figure which shows an example of the vehicle allocation plan result produced by the vehicle allocation plan process of FIG. 6, (a) is what order the order allocated to the vehicle by the vehicle allocation plan process of FIG. FIG. 6B shows the delivery route result for each vehicle, and FIG. 6B is an unassigned order list showing a list of unassigned orders determined by the dispatching plan process of FIG. It is a figure which shows an example of the display screen displayed on a display based on the dispatch plan table and unassigned order list which were produced in step S402. FIG. 5 is a flowchart showing an order selection evaluation value calculation process executed in step S406 of FIG. 4. FIG. It is a figure which shows an example of the execution result of the evaluation value calculation process at the time of order selection of FIG. 6 is a flowchart showing a vehicle selection evaluation value calculation process executed in step S410 of FIG. It is a figure which shows the execution result of the evaluation value calculation process at the time of vehicle selection of FIG. 11, (a) shows a route result, (b) is a figure which shows an example of the execution result of this process. 12 is a flowchart illustrating essential constraint condition determination processing executed in step S905 of FIG. 9 and step S1105 of FIG. It is a figure used in order to explain the essential constraint condition determination processing of FIG. It is a flowchart which shows the allocation evaluation value calculation process performed by step S406 and step S410 of FIG. It is a flowchart which shows the result display process performed by step S407 of FIG. It is a figure which shows an example of the display screen displayed by the process of step S1602 of FIG. It is a flowchart which shows the result display process performed by step S411 of FIG. It is a figure which shows an example of the display screen displayed by the process of step S1802 of FIG.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

  FIG. 1 is a block diagram schematically showing a configuration of an information processing system including the information processing apparatus according to the present embodiment.

  As shown in FIG. 1, the information processing system has a configuration in which a server 101, a client terminal 102, and a client terminal 103 are connected to be communicable with each other via a network 104 such as a LAN.

  The server 101, the client terminal 102, and the client terminal 103 are configured by an information processing apparatus such as a computer.

  The client terminals 102 and 103 are terminals used when a dispatcher (hereinafter referred to as “user”) makes a dispatch plan. The server 101 stores order (load) information, delivery vehicle information, and various master information for a vehicle allocation plan. The client terminals 102 and 103 acquire these pieces of information from the server 101, perform a vehicle allocation plan on each client terminal, and transmit the vehicle allocation plan result to the server. The server 101 stores the dispatch plan result transmitted from each client terminal in a database in the server 101. Note that the number of client terminals is not limited to two, and a plurality of client terminals may be provided.

  Next, the hardware configuration of the client terminals 102 and 103 and the server 101 configured by the information processing apparatus will be described with reference to FIG.

  FIG. 2 is a block diagram schematically showing a hardware configuration of the client terminal 102 in FIG. Note that the hardware configurations of the client terminal 102 and the server 101 are basically the same as the hardware configuration of the client terminal 102, and thus description thereof is omitted.

  In FIG. 2, reference numeral 201 denotes a CPU that comprehensively controls each device and controller connected to the system bus 204.

Further, the ROM 202 or the external memory 211 realizes the functions of the BIOS (Basic Input / Output System) and the operating system program (hereinafter referred to as “OS”), the server 101 or the client terminals 102 and 103 that are control programs of the CPU 201. Various programs to be described later are stored.

  The RAM 203 functions as a main memory, work area, and the like for the CPU 201.

The CPU 201 stores a program and the like necessary for executing various processes described later in the RAM 20.
3 is loaded and the program is executed.

  An input controller (input C) 205 controls input from a pointing device such as a keyboard 209 or a mouse (not shown).

  A video controller (VC) 206 controls display on the display 210. The display 210 is composed of, for example, a CRT display or a liquid crystal display.

The memory controller (MC) 207 is a hard disk (HD), floppy (registered trademark) disk (FD), or PCMCIA that stores a boot program, browser software, various applications, font data, user files, edit files, and other various data. Controls access to an external memory 211 such as a CompactFlash (registered trademark) memory connected to the card slot via an adapter.

  A communication I / F controller (communication I / FC) 208 is connected to and communicates with an external device via the network 104, and executes communication control processing in the network. For example, Internet communication using TCP / IP is possible.

  A program for realizing the functions of the present invention is stored in the external memory 211 and is executed by the CPU 201 by being loaded into the RAM 202 as necessary.

  Furthermore, various data and various tables used by the program for realizing the functions of the present invention are stored in the external memory 211, and detailed description thereof will be described later.

  FIG. 3 is a block diagram schematically showing a part of the functions of the client terminal 102 and the server 101 in FIG. Note that the function of the client terminal 103 is basically the same as the function of the client terminal 102, and thus the description thereof is omitted.

  As shown in FIG. 3, in the server 101, 311 is a data extraction unit that extracts various data from a data storage unit, which will be described later, and 312 stores various data acquired from an external memory (not shown), and a client terminal 102, which will be described later. The data storage unit stores allocation information transmitted from the data storage unit.

  In the client terminal 102, 301 is a data acquisition unit that acquires order information, delivery vehicle information, and various master information from the data extraction unit 311 of the server 101, and 302 is based on the information acquired by the data acquisition unit 301. This is a vehicle allocation plan determination unit that automatically determines order allocation, that is, a vehicle allocation plan (first determination means). Reference numeral 303 denotes an unassigned order selection unit that selects an order that is not assigned by the automatic dispatch determination unit 302 based on a user input instruction using a mouse (not shown), and 304 denotes a user input instruction using a mouse (not shown). This is an assignment destination vehicle selection unit that selects a vehicle to which an order should be assigned based on. 305 temporarily allocates the unallocated order selected by the unallocated order selection unit 303 to the delivery of each vehicle, or temporarily allocates each unallocated order to the vehicle selected by the allocation destination vehicle selection unit 304, An assignment evaluation value calculation unit 306 that calculates an evaluation value in the case of assignment is a calculation result display (display control) unit that displays the evaluation value calculated by the assignment evaluation value calculation unit 305. An allocation determination unit 307 determines allocation of unallocated orders based on a user input instruction using a mouse or the like (not shown). 308 stores order allocation information determined by the allocation determination unit 307, and The data storage unit 312 transmits the allocation information to the data storage unit 312.

  As described above, the client terminal 102 and the server 101 are connected to each other via the network 104. Then, the client terminal 102 creates a vehicle allocation plan using the order information acquired from the external memory of the server 101, delivery vehicle information, and various master information described later.

  Specifically, first, in the client terminal 102, order information, delivery vehicle information, and various master information are acquired from the data extraction unit 311 of the server 101 by the data acquisition unit 301. Next, the dispatching plan determination unit 302 assigns each order to the vehicle and automatically determines the order of delivery of each order, thereby creating a dispatching plan. The created vehicle allocation plan is displayed on the display 210. At this time, an unassigned order that cannot be assigned to any vehicle may occur due to various restrictions such as restrictions on the amount of loading on the vehicle and restrictions on the collection / delivery time.

  When there is an unassigned order, one order to be assigned is selected by the unassigned order selection unit 303 based on a user input instruction using a mouse or the like (not shown), or the assigned vehicle selection unit 3040 One vehicle to be assigned an order is selected. Note that it is possible to execute only one of the unassigned order assignment unit 303 and the assignment destination vehicle selection unit 304.

  When one order is selected by the unassigned order selection unit 303, the evaluation calculation unit 3050 temporarily assigns the order to each allocation candidate position in the route of each vehicle, and the evaluation value when the order is temporarily assigned is Calculated. When one vehicle is selected by the assignment destination vehicle selection unit 3040, the evaluation calculation unit 3050 temporarily assigns each unassigned order to each assignment candidate position in the route of the selected vehicle and evaluates when the assignment is temporarily made. The value is calculated.

  When one order is selected by the unassigned order selection unit 303, the result display (display control) unit 306 displays on the display 210 the delivery route before assigning the selected order and the delivery route after assignment for each vehicle. In addition, the delivery routes of all vehicles are displayed in descending order of evaluation values calculated by the evaluation calculation unit 305 (see FIG. 17). Further, at this time, the restriction condition violation part of each vehicle is displayed on the display 210 together with the violation contents.

  On the other hand, when one vehicle is selected by the assignment destination vehicle selection unit 3040, the result display (display control) unit 306 uses the delivery route before each unassigned order is assigned to the selected vehicle and the delivery after the assignment. Routes are displayed on the display 210, and all unassigned orders are displayed in descending order of evaluation values calculated by the evaluation calculation unit 305 (see FIG. 18). Further, at this time, the restriction condition violation part of each vehicle is displayed on the display 210 together with the violation contents.

  The user refers to the post-allocation delivery route, the constraint violation point, the violation content, etc. displayed on the display 210. Based on a user input instruction from a mouse (not shown) or the like, a combination of an unallocated order and an allocation destination vehicle that the dispatcher thinks best is selected, and an allocation determining unit 307 determines allocation of the unallocated order. .

  The order allocation information determined by the allocation determination unit 307 is stored in the data storage unit 308, and the allocation information is transmitted to the data storage unit 312 of the server 101. In the server 101, the assignment result transmitted from the data storage unit 308 is stored in the data storage unit 312.

FIG. 4 is a flowchart showing an assignment determination process executed by the client terminal 102 of FIG. This process is executed by the CPU 201 of the client terminal 102. Further, the assignment determination process executed at the client terminal 103 is basically the same as the assignment determination process executed at the client terminal 102, and thus the description thereof is omitted.

  As shown in FIG. 4, first, order information, delivery vehicle information, and various types of master information used in the vehicle allocation plan are acquired from the data extraction unit 311 of the server 101 (step S401). An example of the order information, delivery vehicle information, and various master information is shown in FIG. In FIG. 5, FIG. 5 is an example of data necessary for a vehicle allocation plan (automatic vehicle allocation plan and allocation of unallocated orders). The order information 501 is information indicating from what (loading place) to where (destination), what (variety) and how much (weight) is to be carried. The model of the vehicle to be assigned is specified. Delivery vehicle information 502 is information on available delivery vehicles, and as conditions for delivery vehicle information 502, information such as vehicle type, maximum loading capacity, garage, possible delivery time, and return time are given. In addition, the leaving time indicates the time when the delivery vehicle can depart, and the return time indicates that it is necessary to return to the garage by this time. The delivery destination master 503 is master information for each delivery destination. As a condition of the delivery destination master 503, a delivery available time zone and the like are given. The cargo type master 504 is master information for each type, and as a condition of the cargo type master 504, a combination (stacking) of product types that can be simultaneously loaded on the delivery vehicle is given. The constraint condition master 505 is given, for each constraint condition of the order or the delivery vehicle, whether or not the constraint can be relaxed, an upper limit when the constraint can be relaxed, and a violation degree coefficient when counting as a penalty when the constraint condition is violated. Details of how to use these pieces of information will be described later with reference to FIG. The constraint condition master 505 is a condition associated with the delivery vehicle.

  Next, a vehicle allocation plan is automatically created by executing an automatic vehicle allocation plan process of FIG. 6 described later (step S402), and the created vehicle allocation plan is displayed on the display 210. Specifically, each order included in the order information is assigned to a vehicle included in the delivery vehicle information, and a dispatch plan for each order is determined. An example of the route result automatically created in step S402 is shown in FIG. Details of FIG. 7A will be described later.

  In step S402, when an unassigned order that is not assigned to any vehicle is generated due to various constraints, the unassigned order list is created together with the dispatch plan table. An example of the unallocated order list created is shown in FIG. Details of FIG. 7B will be described later. Even if the unallocated order is not generated as a result of the automatic dispatch plan creation process in step S402, the user can select any order from the allocated order displayed in the route result of FIG. It is also possible to select and make the order an unassigned order.

  Next, it is determined whether or not an unallocated order exists as a result of automatically creating a dispatching plan in step S402 (step S403). If there is no unassigned order, the dispatch plan automatically created is stored as route information in the database of the server 101 (step S413), and this process is terminated.

On the other hand, if there is an unallocated order (YES in step S403), it is determined whether or not an unallocated order or an allocation destination candidate delivery vehicle is selected in accordance with a user input instruction (step S404). FIG. 8 shows an example of a display screen displayed on the display 210 based on the vehicle allocation plan table and the unassigned order list created in step S402. When the user wants to select an unallocated order, one unallocated order (here, order E) displayed in the unallocated order list 803 is selected with a pointing device such as a mouse on the display screen 800 in FIG. (Step S405) (load data selection). In addition, when selecting an allocation destination vehicle, one delivery vehicle (for example, delivery vehicle 1009) displayed in the route result 802 is selected (step S409) (vehicle data selection). When the order to be assigned is selected, the line displaying the order is displayed in color (802a), and the mark “◯” is displayed in the selection column of the line displaying the order (802b). This allows the user to identify which unassigned orders are selected or which delivery vehicles are selected.

  When one unallocated order is selected in step S405 and the allocation evaluation calculation button 801 in FIG. 8 is pressed, the evaluation value calculation process at the time of order selection shown in FIG. 11 described later is executed for the selected unallocated order. (Step S406). In the order selection evaluation value calculation process, the selected order is temporarily allocated to all allocation candidate positions in the route of each vehicle, and an evaluation value in the case of allocation is calculated. When the evaluation value value calculation process at the time of order selection calculates the optimal allocation position and the evaluation value at that position in each delivery vehicle, the optimal allocation position and the calculation result are displayed on the display 210 by the calculation result display process of FIG. (Step S407) (see FIG. 17). The user refers to the optimal allocation position and calculation result displayed on the display 210. In step S408, the unallocated order selected in step S405 is formally allocated to the optimal allocation position in accordance with a user input instruction.

  When one delivery vehicle is selected in step S409 and the allocation evaluation calculation button 801 in FIG. 8 is pressed, an evaluation value calculation process at the time of vehicle selection shown in FIG. 12 to be described later is executed for the selected delivery vehicle ( Step S410). In this vehicle selection evaluation value calculation process, unassigned orders are provisionally assigned to all assignment candidate positions of the selected delivery vehicle, and evaluation values in the case of assignment are calculated. When the allocation position in each order and the evaluation value at that position are calculated by the evaluation value calculation process at the time of vehicle selection, the optimal allocation position and the evaluation value at that position are determined, and the optimal allocation position and calculation result will be described later. 18 is displayed on the display 210 by the calculation result display process of FIG. 18 (step S411) (see FIG. 19). The user refers to the optimal allocation position and calculation result displayed on the display 210. In step S412, an unallocated order is formally allocated to the optimal allocation position of the delivery vehicle selected in step S409 according to a user input instruction.

  FIG. 6 is a flowchart showing the automatic dispatching plan process executed in step S402 of FIG.

  As shown in FIG. 6, first, it is determined whether or not there is at least one unused delivery vehicle to which no order is assigned (step S601). If there is no unused delivery vehicle, this processing is terminated. If there is at least one unused delivery vehicle, one is selected from the unused delivery vehicles (step S602). As a method for selecting an unused delivery vehicle, for example, there is a method of selecting a vehicle having the largest load capacity. Next, it is determined whether there is an order that can be assigned to the delivery vehicle selected in step S602 among all unassigned orders (whether there is an order that satisfies all the constraints) (step S603). . Here, as an order selection method, for example, there is a method of selecting an order with strict constraints such as arrival time designation or vehicle type designation. Note that the “strictly restrictive order” is an order with few delivery vehicles that can be assigned because the conditions imposed on the order are specified. By assigning such an order at the earliest possible stage, It is possible to reduce the number of orders (unassigned orders) that could not be assigned in an automatic manner. If there is an assignable order (YES in step S603), the assignable order is assigned to the head position in the route of the selected delivery vehicle (step S604). The delivery vehicle is first delivered by the delivery vehicle selected in S602. If there is no order that can be assigned (NO in step S603), the vehicle is deleted from the vehicle list (step S605), and the process returns to step S601.

In a succeeding step S606, it is determined whether there is a new order that can be assigned to the assigned delivery vehicle. If there is a new assignable order, a new order is assigned to the assigned delivery vehicle (step S607). Thereby, a plurality of loads are stacked on the selected delivery vehicle. The selection criteria for the assigned order and the allocation position (delivery order) are selected based on the criterion that the evaluation value is the smallest, for example. As long as there are new assignable orders (orders that can be stacked) (YES in step S606), steps S606 and S607 are repeated, and there are no new assignable orders (orders that can be stacked). (NO in step S606) completes the route construction of the selected delivery vehicle, returns to step S601, and constructs a route for another delivery vehicle. By performing the processing shown in this flowchart, an order is assigned to the vehicle, and an order that has not been assigned (unassigned order) can be determined (first determining means). The unallocated order determined in this dispatching plan and the order allocated to the vehicle will be described later with reference to FIG.

  The vehicle allocation plan process is not performed as shown in the flowchart, and the vehicle allocation plan may be created by any method.

  FIG. 7 is a diagram showing an example of a dispatch plan result created by the dispatch plan process of FIG. 6, and FIG. 7A shows the order in which the orders assigned to the vehicles by the dispatch plan process of FIG. It is the delivery route result for every vehicle which showed whether it is done. (B) is a list of unassigned orders showing a list of unassigned orders determined by the dispatch plan process of FIG. In this way, a screen in which the route result of FIG. 7A and the unassigned order list of FIG.

  In FIG. 7A, a route result 701 indicates a delivery order and a delivery order of each vehicle. In this route result, the horizontal axis indicates the time, the loading / wholesale work time zone is indicated by a square box, and the movement time zone is indicated by an arrow. For example, the delivery vehicle 1009 loads orders (loads) A, B, and C on the loading place a at 6:30, and orders A, B, and C in this order between 7:30 and 16:00. Indicates delivery. More specifically, a vehicle loaded with orders (loads) A, B, and C at loading site a lowers order (load) A at wholesale site c, lowers order (load) B at wholesale site d, and wholesales. The order (load) C is lowered at the ground g. The delivery vehicle 2501 loads the order (load) D on the vehicle at 8:30 and arrives at the wholesale location f at 10:30 and lowers the order (load) D. No order is assigned to the delivery vehicle 3322.

  On the other hand, in FIG. 7B, the unassigned order list 702 is an order that is not assigned to any vehicle in the dispatching plan process. For example, the order E cannot be assigned to the delivery vehicle 3322 of the vehicle type 4T by the vehicle type designation 2T (designation of the delivery vehicle type as a 2-ton vehicle), and the delivery can be made by the arrival time designation 9:00 to 12:00. Since the order of vehicles 1009 and 2501 cannot be stacked, it is an unassigned order.

  FIG. 9 is a flowchart showing the evaluation value calculation process at the time of order selection executed in step S406 of FIG. In this order selection evaluation value calculation process, the unallocated order selected in step S405 in FIG. 4 is temporarily allocated to all vehicles and all allocation candidate positions (hereinafter referred to as allocation positions) and allocated to each. The evaluation value is calculated.

In FIG. 9, first, it is determined whether or not there is an unevaluated delivery vehicle (step S901). If there is no unevaluated delivery vehicle, this processing is terminated. Is selected (step S902) (vehicle data acquisition). Next, it is determined whether or not there is an unevaluated allocation position among the delivery vehicles selected in step S902 (step S903). The evaluated allocation position is stored in the process of step S909 described later. If there is an unevaluated allocation position (YES in step S903), the unallocated order is
Temporary allocation is performed to the allocation position determined in step S903 (step S904), and the process proceeds to step S905. If there is no unevaluated allocation position, that is, if all allocation positions have been provisionally allocated (NO in step S903), the highest evaluated allocation position stored in step S909 described later and the evaluation value for that position Are stored as the assigned position and the maximum evaluation value in the delivery vehicle selected in step S902 (step S910), and the process returns to step S901.

  The allocation position stored in step S910 is information for specifying the order in which the selected unallocated order is delivered in the order already allocated to the vehicle, and is delivered according to the specified information (position). Time is determined. The evaluation value is an evaluation value (FIG. 15) determined according to the violation degree coefficient by assigning the unassigned order selected between the already assigned orders for each vehicle. Also, the position that is the maximum evaluation value among the evaluation values is the assigned position (second determining means).

  In the subsequent step S905, the essential constraint condition determination process of FIG. Here, the essential constraint condition is a constraint condition that must be satisfied among various constraint conditions, and a constraint condition that is marked with “x” in the “relaxation availability” column of the constraint condition master 505 in FIG. 5. It is. Even if the constraint condition is marked with “O” in the “relaxation availability” column, if the magnitude (degree) of violation exceeds the “relaxation upper limit”, it is determined that the constraint is violated. Details of the essential constraint condition determination processing will be described later.

  Next, based on the result of the mandatory constraint condition determination process in step S905, it is determined whether or not the temporary allocation is a violation of the essential constraint condition, that is, whether or not the temporary allocation satisfies the required constraint condition ( Step S906). If the temporary allocation is a violation of the essential constraint condition, the process returns to step S903, and a determination is made for another temporary allocation position. When the temporary allocation satisfies the essential constraint conditions, an allocation evaluation calculation process shown in FIG. 15 described later is executed to calculate the evaluation value of the allocation position where the temporary allocation has been performed (step S907) (first evaluation value calculation) ). Details of the allocation evaluation calculation process will be described later.

  Next, it is determined whether or not the evaluation value calculated in step S907 is the maximum value among the evaluation values for all allocation positions of the delivery vehicle (step S908). If the calculated evaluation value is the maximum value, the evaluation value is stored as the maximum evaluation value, and the allocation position that has reached the maximum evaluation value is stored (step S909). At this time, if there is an evaluation value already stored as the maximum evaluation value, the previous maximum evaluation value is updated to the current maximum evaluation value. If the calculated evaluation value is not the maximum value (NO in step S908), the maximum evaluation value is not updated and the process returns to step S903. When the determination process of step S908 is executed first, the calculated evaluation value is regarded as the maximum evaluation value, the evaluation value and its assigned position are always stored (step S909), and the process returns to step S903.

  FIG. 10 is a diagram illustrating an example of an execution result of the evaluation value calculation process at the time of order selection in FIG.

In FIG. 10, in the route result 1000, the horizontal axis indicates the time, the loading work / wholesale work time zone is indicated by a square box, and the movement time zone is indicated by an arrow. For example, in the case of the delivery vehicle 1009, as a result of tentatively assigning unassigned orders to the six assigned positions indicated by “図” in FIG. 10, the largest value among the evaluation values of the six assigned positions is “−340. ”, Indicating that the position having the maximum evaluation value is the fifth assigned position from the left. Similarly, in the case of the delivery vehicle 2501, the largest value among the evaluation values of the three assigned positions is “−666”, and the position where the evaluation value is the maximum is the second assigned position from the left. Is shown. In the case of the delivery vehicle 3322, since the essential constraint condition is violated, the calculation is not performed, and the evaluation value is regarded as the minimum value (for example, −9999). In this way, it is possible to display in correspondence with which position the selected order is assigned to each vehicle and what the evaluation value is.

  FIG. 11 is a flowchart showing a vehicle selection evaluation value calculation process executed in step S410 of FIG. In this vehicle selection evaluation value calculation process, all unassigned orders are provisionally assigned to all allocation candidate positions (hereinafter referred to as allocation positions) of the delivery vehicle selected in step S409 in FIG. The evaluation value is calculated. This process differs from the process of FIG. 9 only in whether the object of evaluation is a vehicle (FIG. 9) or an unallocated order (FIG. 11), and the process flow is the same as that of FIG. It is.

  In FIG. 11, first, it is determined whether or not there is an unevaluated unassigned order (step 1101). If there is no unevaluated unassigned order, this process is terminated. If there is an unevaluated unassigned order, One of them is selected (step S1102) (load data acquisition). Next, it is determined whether there is an unevaluated allocation position among the delivery vehicles selected in step 409 (step S1103). If there is an unevaluated allocation position, the unallocated order is provisionally allocated to the allocation position determined in step S1103 (step 1104), and the process proceeds to step 1105. If there is no unevaluated allocation position, that is, if all allocation positions have been provisionally allocated, the allocation position with the highest evaluation stored in step S1109 and the evaluation value for that position are stored in step S1102. The assigned position and evaluation value of the selected unassigned order are set (step S1110), and the process returns to step S1101.

The allocation position stored in step S1110 is information for specifying what order is delivered in the already allocated order to the selected vehicle, and the delivery time according to the specified information (position). Is determined. The evaluation value is an evaluation value (FIG. 15) determined according to the violation degree coefficient by assigning all unassigned orders among the orders already assigned to the selected vehicle. In addition, the position of the maximum evaluation value among the evaluation values in the selected vehicle becomes the assigned position for each unassigned order. (Second determining means)
In the subsequent step S1105, an essential constraint condition determination process shown in FIG. 13 described later is executed in a temporarily allocated state. Then, based on the result of the essential constraint condition determination processing in step S905, it is determined whether or not the temporary allocation is a violation of the essential constraint condition, that is, whether or not the temporary allocation satisfies the essential constraint condition (step) S1106). When the temporary allocation is a violation of the essential constraint condition, the process returns to step S1103, and a determination is made for another allocation position. When the temporary allocation satisfies the essential constraint conditions, an allocation evaluation calculation process shown in FIG. 14 described later is executed to calculate the evaluation value of the allocation position where the temporary allocation has been performed (step S1107) (second evaluation value calculation) ).

  Next, it is determined whether or not the evaluation value calculated in step 1107 is the maximum value among the evaluation values for all allocation positions of the delivery vehicle (step S1108). When the calculated evaluation value is the maximum value, the evaluation value is stored as the maximum evaluation value, and the allocation position that has become the maximum evaluation value is stored (step S1109). If the calculated evaluation value is not the maximum value, the maximum evaluation value is not updated, and the process returns to step S1103. When the determination process of step S1108 is first executed, the calculated evaluation value is regarded as the maximum evaluation value, the evaluation value and its assigned position are always stored (step S1109), and the process returns to step S1103.

  FIG. 12 is a diagram illustrating the execution result of the vehicle selection evaluation value calculation process of FIG. 11, (a) is a route result, and (b) is a diagram illustrating an example of the execution result of this process.

12A and 12B, in the unassigned order list 1201 in FIG. 12B, the maximum evaluation value and the maximum of each unassigned order in the delivery vehicle selected in the route result 1200 in FIG. 12A. The allocation position that is the evaluation value is shown. For example, in the case of the unassigned order E, as a result of temporarily assigning the unassigned order E to the six assigned positions indicated by “▽” of the selected delivery vehicle 1009, the evaluation value of the six assigned positions is the largest. The value is “−666”, indicating that the position where the evaluation value is maximized is the fifth assigned position from the left. In the case of the unassigned order F, the maximum evaluation value of the unassigned order F is not calculated due to violation of the essential constraint condition (constraint condition), and the minimum value (for example, −9999) is set. In this manner, it is possible to display in correspondence with which position each order is assigned to the selected vehicle and what the evaluation value is.

  FIG. 13 is a flowchart showing the essential constraint condition determination processing executed in step S905 of FIG. 9 and step S1105 of FIG. FIG. 14 is a diagram used for explaining the essential constraint condition determination processing of FIG. 13, where 1401 is the order information of the unassigned order E, 1402 is the pre-assignment of the unassigned order E to the delivery vehicle 1009. Route result 1403 shows the route result after provisionally assigning the unassigned order E to the delivery vehicle 1009. Hereinafter, a case where the order E to be allocated is temporarily allocated to the allocation position (2) of the vehicle 1009 will be described.

  As shown in FIG. 13, first, the constraint condition master 505 in FIG. 5 is referred to and it is determined whether there is an undecided constraint condition (step S1301). If there is no undetermined constraint condition, all the constraint conditions have been determined, so the essential constraint condition is set to “satisfied” (step S1302), and this process ends. If there is an undetermined constraint condition, the constraint condition is determined for the constraint condition (step S1303). For example, the constraint condition to be determined is No. in the constraint condition master 505. In the case of “arrival time designation” of 2, the arrival time designation of the unallocated order E is 9-12 o'clock (1401 in FIG. 14)), and the unallocated order is assigned to the allocation position (2) in the route result 1402 before allocation. If E is temporarily assigned (1402 in FIG. 14), the arrival time of order E is set to 8:00, which is a constraint violation. Thereafter, it is determined whether or not the unassigned order E satisfies the constraint condition (step S1304). If the unassigned order E satisfies the constraint condition, the process returns to step S1301, and other constraint conditions that have not been determined. Make a decision. If the unassigned order E does not satisfy the constraint condition, that is, if it is a constraint violation, refer to “Relief availability” of the constraint condition master 505 in FIG. 5 and check whether “Relaxability” is “O”. Determination is made (step S1305). If the “relaxation is possible” is “x”, the constraint condition cannot be relaxed. Therefore, the essential constraint condition is set to “violate” (step S1309), and the process is terminated. When “Relaxability” is “O”, the constraint violation degree is calculated using the “violation factor coefficient” in the constraint condition master 505 in FIG. It is determined whether or not the value is equal to or less than the “relaxation upper limit” value in the condition master 505 (step S1306). If the constraint condition violation degree value is equal to or less than the “relaxation upper limit” value, the process returns to step S1301. If the constraint condition violation degree value is larger than the “relaxation upper limit” value, the essential constraint condition is set to “violate” (step S1307), and the process ends.

  For example, No. in the constraint condition master 505 in FIG. The condition 2 is a relaxation upper limit of 180 minutes (relief condition for load data). In other words, when processing the unallocated order E, temporary allocation is performed with a relaxation upper limit of 180 minutes that can be relaxed when the arrival time is specified at 9-12. More specifically, when the unassigned order E (FIG. 14 (1401)) is provisionally assigned to the assigned position (2) in FIG. 14 (1402), the arrival time is 9 o'clock, but the relaxation time is 180 minutes. Therefore, at 8 o'clock, the relaxation upper limit is within 180 minutes, and it is determined that allocation is possible. Further, if the unassigned order E (FIG. 14 (1401)) is provisionally assigned to the assignment position (6) in FIG. 14 (1402) (FIG. 141402), the arrival time of the order E is set to 16:00. At this time, the constraint condition violation degree value of the order E is (16-12) [h] × 60 [minutes / minutes] using “12:00” which is the latest time of arrival time designation 9-12 hours. h] = 240 [minutes]. Since the constraint condition violation degree value exceeds the relaxation upper limit of 180 minutes (order E arrival time exceeds the relaxation upper limit of 180 minutes), the mandatory constraint condition of order E is “violation” and the position where order E is assigned (6) in FIG. 14 (1402) is inappropriate.

  In this manner, the order E is temporarily allocated to the allocation positions (1) to (6), and the optimal allocation position is determined without violating the essential constraint conditions. The result of assigning order E to the determined position ((2) in FIG. 14 (1402)) is displayed as 1403 in FIG.

  Note that there is a case where an existing assigned order becomes a constraint violation by assigning an unassigned order. Therefore, after assigning an unassigned order, the determinations in steps S1305 and S1306 are performed for all existing orders assigned to the delivery vehicle.

  Furthermore, there may be a case where the vehicle violates the constraint by assigning an unassigned order. For example, the restriction condition master 505 No. Since the relaxation upper limit of the return time of 7 is 120 minutes, even if an unassigned order is assigned to a vehicle, even if the return time set in advance in the vehicle is exceeded, it must be within 120 minutes. If it exceeds 120 minutes, the order cannot be assigned (constraint of violation).

  FIG. 15 is a flowchart showing the allocation evaluation value calculation process executed in steps S406 and S410 of FIG.

  In FIG. 15, first, a route evaluation value is calculated using predetermined parameters (step 1501). The route evaluation value is calculated, for example, using parameters such as travel distance and required time from when the delivery vehicle leaves the garage to delivery of all orders to return to the garage.

  Next, a constraint condition violation degree is calculated for all constraint conditions of each order in the route (step S1502). At this time, when the essential constraint condition is “satisfied”, the value calculated when the constraint condition determination is performed in 1306 of FIG. 13 is used as the constraint condition violation degree. When the essential constraint condition is “violation”, the evaluation value is regarded as a minimum value (for example, −9999) without performing calculation.

  Thereafter, an evaluation value is calculated using the route evaluation value calculated in step S1501, the constraint condition violation degree calculated in step S1502 and the violation coefficient in the constraint condition master 505 in FIG. 5 (step S1503). This evaluation value is a value obtained by inverting the sign of the sum of the route evaluation value and the product of the constraint condition violation degree and the violation degree coefficient. Positive / negative inversion is a process for determining that the evaluation value is higher as the value is larger (as the value is closer to 0). The violation degree coefficient is a coefficient given for each constraint condition as shown in the constraint condition master 505 in FIG. In the evaluation value calculation formula, the first Σ on the right side represents the sum for all constraints, and the second Σ represents the sum for all orders in the route. In the constraint condition master 505, the violation degree coefficient is not given to the constraint condition whose “relaxation is possible” is “×”. When the mandatory constraint condition is violated, the constraint condition violation degree is maximum. This is because it is not necessary to use a violation degree coefficient because the value, that is, the evaluation degree is the lowest value.

  FIG. 16 is a flowchart showing the result display process executed in step S407 of FIG.

In FIG. 16, first, a plurality of delivery vehicles are sorted in descending order of the evaluation values calculated in step S907 in FIG. 9 (step S1601). Next, the route results before and after the temporary allocation are displayed on the display 210 for each delivery vehicle (step S1602). At this time, an evaluation value is also displayed for the route result after provisional allocation. An example of the display screen displayed by the process of step S1602 is shown in FIG. In the display screen 1700 of FIG. 17, “previous” in the “status” column is the route before the temporary allocation of each delivery vehicle (first delivery route), and “after” is the route after the temporary allocation (second delivery route). ) Is shown as a pair. Next, the constraint violation part of each delivery vehicle is displayed in color (for example, red) (step 1603), and this process is terminated. For example, when the unassigned order E is temporarily assigned to the vehicle 1009, the route when the order E is assigned to the position immediately before “Wholesale (C)” indicating the time zone of the wholesale work of the order C is the highest evaluation. At that time, the evaluation value at the position is displayed as the evaluation value of the delivery vehicle 1009 (here, “−340”). In addition, since Order E is a violation of the time specification, the box “Wholesale (E)” indicating the time zone of the wholesale work of Order E is displayed in red, and the constraint violation is near the top of the box “Wholesale (E)”. “Time specification violation” indicating the content of the message is displayed (FIG. 17). When the unassigned order E is assigned to the delivery vehicle 3322, since the mandatory restriction condition “vehicle type designation (order)” is violated, the display of the route after the assignment is prohibited, and the entire line displaying the delivery vehicle 3322 Is displayed in red, and “Vehicle specification (order) violation” indicating the content of the constraint violation is displayed.

  FIG. 18 is a flowchart showing the result display process executed in step S411 of FIG.

  In FIG. 18, first, a plurality of unassigned orders are sorted in descending order of the evaluation values calculated in step S1107 of FIG. 11 (step S1801). Next, for each unassigned order, the route results before and after temporary assignment are displayed on the display 210 (step S1802). At this time, an evaluation value is also displayed for the route result after provisional allocation. An example of the display screen displayed by the process of step S1802 is shown in FIG. In the display screen 1900 of FIG. 19, “Previous” in the “Status” column indicates the route before provisional assignment of the delivery vehicle 1009, and “After” indicates the route after provisional assignment. Next, the constraint violation portion of each order is displayed in color (for example, red), and the content of the constraint violation is displayed (step 1803), and this processing is terminated. For example, when the unassigned order E is temporarily assigned to the delivery vehicle 1009, the route when the order E is assigned to a position before “Wholesale (C)” indicating the time zone of the wholesale work of the order C is the highest evaluation. When there is, the evaluation value at the position is displayed as the evaluation value of the delivery vehicle 1009 (-340). In addition, since Order E is a violation of the time specification, the box “Wholesale (E)” indicating the time zone of the wholesale work of Order E is displayed in red, and the constraint violation is near the top of the box “Wholesale (E)”. “Weight violation” is displayed (FIG. 19). When the unassigned order F is assigned to the delivery vehicle 1009, it is in violation of the “restricted vehicle type (order)” of the mandatory restriction condition, so that the display of the route after the assignment is prohibited and the entire line displaying the order F is In addition to being displayed in red, “Vehicle type designation (order) violation” indicating the content of the constraint violation is displayed. In the unassigned order list, the “time designation” cell “9-12” of the order E is displayed in red, and the “weight” cell “5500” of the order F is displayed in red.

  According to the present embodiment, the order information and the delivery vehicle information are acquired from the server 101, and the constraint condition and the constraint relaxation information regarding the delivery vehicle and the constraint and the constraint relaxation information regarding the order are acquired from the server 101. (Step S401). The delivery vehicle constituting the vehicle information to which the order constituting the order information is assigned and the delivery time of the order are automatically determined (step S402), and the unassigned order is determined (YES in step S403). ). Further, according to the obtained constraint condition relaxation information, the constraint condition related to the delivery vehicle and the constraint condition related to the order are relaxed, and the optimum allocation position for the delivery vehicle of the unallocated order is specified (steps S406 and S410). . A delivery vehicle and delivery time for an unassigned order are determined for the identified optimum assignment position, and a route result representing the delivery vehicle and delivery time for the determined order is an optimum assignment. It is displayed on the display 210 together with the constraint relaxation information used for specifying the position (steps S407 and S411). As a result, it is possible to relax the constraint condition for an order that does not match the constraint condition related to delivery, efficiently assign the order to the delivery vehicle, and identify the relaxed constraint condition.

  In the present embodiment, the constraint condition and constraint relaxation information regarding the delivery vehicle and the constraint condition and constraint relaxation information regarding the order are acquired from the server 101. However, the present invention is not limited to this, and the constraint condition and constraint regarding the delivery vehicle. At least one of the condition relaxation information, the constraint condition regarding the order, and the constraint condition relaxation information may be acquired from the server 101.

  Further, in the present embodiment, the constraint condition related to the delivery vehicle and the constraint condition related to the order are relaxed, and the allocation position of the unallocated order is specified. However, the present invention is not limited to this, and the constraint condition related to the delivery vehicle In addition, at least one of the constraints regarding the order may be relaxed, and the allocation position of the unallocated order may be specified.

  In the present embodiment, the route result representing the delivery vehicle and delivery time for the unallocated order is displayed on the display 210 together with the constraint relaxation information used for specifying the allocation position. However, the present invention is not limited to this. The route result indicating the delivery vehicle and delivery time for the unassigned order may be displayed on the display 210, and the restriction condition relaxation information used for specifying the assigned position may be notified to the user by voice.

  Another object of the present invention is to supply a storage medium storing a software program for realizing the functions of the above-described embodiments to an information processing apparatus or server, and the information processing apparatus or server computer (or CPU, MPU, or the like). Is also achieved by reading and executing the program code stored in the storage medium.

  In this case, the program code itself read from the storage medium realizes the functions of the above embodiments, and the program code and the storage medium storing the program code constitute the present invention.

  Examples of the storage medium for supplying the program code include a floppy (registered trademark) disk, a hard disk, a magneto-optical disk, a CD-ROM, a CD-R, a CD-RW, a DVD-ROM, a DVD-RAM, and a DVD. An optical disc such as RW or DVD + RW, a magnetic tape, a nonvolatile memory card, a ROM, or the like can be used. Alternatively, the program code may be downloaded via a network.

  By executing the program code read from the computer, not only the functions of the above-described embodiments are realized, but also an OS (operating system) operating on the computer based on an instruction of the program code performs the actual processing. It goes without saying that the case where the functions of the above-described embodiment are realized by performing part or all of the processing is included.

  Further, after the program code read from the storage medium is written to a memory provided in a function expansion board inserted into the computer or a function expansion unit connected to the computer, the function expansion is performed based on the instruction of the program code. This includes a case where the CPU or the like provided in the board or the function expansion unit performs part or all of the actual processing, and the functions of the above embodiments are realized by the processing.

101 Server 102, 103 Client terminal 201 CPU
210 Display 301 Data acquisition unit 302 Allocation plan determination unit 303 Unallocated order selection unit 304 Allocation destination vehicle selection unit 305 Allocation evaluation value calculation unit 306 Calculation result display unit 307 Allocation determination unit 308 Data storage unit 311 Data extraction unit 312 Data storage unit

To achieve the above object, the information processing apparatus according to claim 1 distributes the package for each of the vehicles by assigning order information about the package to vehicle information about the vehicle used for package distribution. An information processing apparatus for creating a route, the storage means storing the order information and the vehicle information, the constraint condition when creating the delivery route, and the relaxable constraint condition and the relaxable upper limit among the constraint conditions And a first creation unit that creates a delivery route for each vehicle indicated by the vehicle information by assigning the order information so as to satisfy the constraint condition with respect to the vehicle information, and the first creation unit. As a result of creating a delivery route at A second creation means for creating a modified delivery route for the delivery route by relaxing and assigning the upper limit to the vehicle information, and a display means for displaying the modified route created by the second creation means The display means displays the violated constraint condition so as to be recognizable with respect to the changed delivery route created by the second creation means .

9. The information processing method according to claim 8 , wherein vehicle information relating to a vehicle used for delivery of luggage and order information relating to the luggage, a restriction condition when creating a delivery route of the luggage, and a restriction condition that can be relaxed among the restriction conditions. And an information processing method performed by an information processing apparatus that creates a delivery route of the parcel for each of the vehicles by allocating the order information to the vehicle information. Then, a first creation step for creating a delivery route for each vehicle indicated by the vehicle information by assigning the order information to the vehicle information so as to satisfy the constraint condition, and the first creation step As a result of creating a delivery route at A second creation step for creating a modified delivery route for the delivery route, which is relaxed up to the mitigation possible upper limit and additionally assigned to the vehicle information, and a display for displaying the modified route created in the second creation step And the display step displays the violated constraint condition in a recognizable manner for the changed delivery route created in the second creation step.

The computer program according to claim 9 includes vehicle information relating to a vehicle used for delivery of luggage and order information relating to the luggage, a restriction condition when creating a delivery route of the luggage, and a restriction condition that can be relaxed among the restriction conditions, and An information processing device that includes a storage device that stores a mitigable upper limit, and that assigns the order information to the vehicle information to create a delivery route for the package for each of the vehicles. By assigning the order information so as to satisfy the constraint conditions, a first creation means for creating a delivery route for each vehicle indicated by the vehicle information, and a result of creating a delivery route by the first creation means, Relax unrestricted baggage that has not been allocated for vehicle information, up to the upper limit that can be relaxed. And the second creation means for creating the changed delivery route of the delivery route, and the display means for displaying the changed route created by the second creation means, The means is characterized in that the violated constraint condition is displayed in a recognizable manner for the changed delivery route created by the second creating means.

When there is an unassigned order, one order to be assigned is selected by the unassigned order selection unit 303 based on a user input instruction using a mouse (not shown) or the like, or the assigned vehicle selection unit 304 One vehicle to be assigned an order is selected. Note that it is possible to execute only one of the unassigned order assignment unit 303 and the assignment destination vehicle selection unit 304.

When one order is selected by the unassigned order selection unit 303, the evaluation calculation unit 305 temporarily assigns the order to each allocation candidate position in the route of each vehicle, and the evaluation value when the order is temporarily assigned is Calculated. When one vehicle is selected by the allocation destination vehicle selection unit 304 , the evaluation calculation unit 305 temporarily allocates each unallocated order to each allocation candidate position in the route of the selected vehicle and evaluates when the vehicle is temporarily allocated The value is calculated.

On the other hand, when one vehicle is selected by the assignment destination vehicle selection unit 304 , the result display (display control) unit 306 uses the delivery route before each unassigned order is assigned to the selected vehicle and the delivery after the assignment. Routes are displayed on the display 210, and all unassigned orders are displayed in descending order of evaluation values calculated by the evaluation calculation unit 305 (see FIG. 18). Further, at this time, the restriction condition violation part of each vehicle is displayed on the display 210 together with the violation contents.

When one unallocated order is selected in step S405 and the allocation evaluation calculation button 801 in FIG. 8 is pressed, the evaluation value calculation process at the time of order selection shown in FIG. 11 described later is executed for the selected unallocated order. (Step S406). In the order selection evaluation value calculation process, the selected order is temporarily allocated to all allocation candidate positions in the route of each vehicle, and an evaluation value in the case of allocation is calculated. When the evaluation value calculation process at the time of order selection calculates the optimal allocation position in each delivery vehicle and the evaluation value at that position, the optimal allocation position and the calculation result are displayed on the display 210 by the calculation result display process of FIG. It is displayed (step S407) (see FIG. 17). The user refers to the optimal allocation position and calculation result displayed on the display 210. In step S408, the unallocated order selected in step S405 is formally allocated to the optimal allocation position in accordance with a user input instruction.

In a succeeding step S606, it is determined whether there is a new order that can be assigned to the assigned delivery vehicle. If there is a new order that can be assigned, a new order is assigned to the assigned delivery vehicle (step S607). Thereby, a plurality of loads are stacked on the selected delivery vehicle. The selection criteria for the assigned order and the allocation position (delivery order) are selected based on the criterion that the evaluation value is the smallest, for example. As long as there are new assignable orders (orders that can be stacked) (YES in step S606), steps S606 and S607 are repeated, and there are no new assignable orders (orders that can be stacked). (NO in step S606) completes the route construction of the selected delivery vehicle, returns to step S601, and constructs a route for another delivery vehicle. By performing the processing shown in this flowchart, an order is assigned to the vehicle, and an order that has not been assigned (unassigned order) can be determined (first determining means). The unallocated order determined in this dispatching plan and the order allocated to the vehicle will be described later with reference to FIG.

In FIG. 18, first, a plurality of unassigned orders are sorted in descending order of the evaluation values calculated in step S1107 of FIG. 11 (step S1801). Next, for each unassigned order, the route results before and after temporary assignment are displayed on the display 210 (step S1802). At this time, an evaluation value is also displayed for the route result after provisional allocation. An example of the display screen displayed by the process of step S1802 is shown in FIG. In the display screen 1900 of FIG. 19, “Previous” in the “Status” column indicates the route before provisional assignment of the delivery vehicle 1009, and “After” indicates the route after provisional assignment. Next, the constraint violation portion of each order is displayed in color (for example, red), and the content of the constraint violation is displayed (step 1803), and this processing is terminated. For example, when the unassigned order E is temporarily assigned to the delivery vehicle 1009, the route when the order E is assigned to a position before “Wholesale (C)” indicating the time zone of the wholesale work of the order C is the highest evaluation. When there is, the evaluation value at the position is displayed as the evaluation value of the delivery vehicle 1009 (-340). In addition, since Order E is a violation of the time specification, the box “Wholesale (E)” indicating the time zone of the wholesale work of Order E is displayed in red, and the constraint violation is near the top of the box “Wholesale (E)”. “ Time specification violation ” indicating the content of the message is displayed (FIG. 19). When the unassigned order F is assigned to the delivery vehicle 1009, since the mandatory constraint “ weight ” is violated, the display of the route after the assignment is prohibited, and the entire line displaying the order F is displayed in red. In addition, “ weight violation ” indicating the content of the constraint violation is displayed. In the unassigned order list, the “time designation” cell “9-12” of the order E is displayed in red, and the “weight” cell “5500” of the order F is displayed in red.

Claims (11)

In an information processing apparatus that is communicably connected to a server that stores vehicle information and load information to be assigned to the vehicle information, and creates a vehicle allocation plan according to the vehicle information and load information.
First determination means for determining vehicle data constituting the vehicle information to which the load data constituting the load information is allocated, a delivery time of the load data, and determining unallocated load data;
An acquisition means for acquiring, from the server, at least one of the constraint condition related to the vehicle information and the constraint condition relaxed information that relaxes the constraint condition; and the constraint condition related to the load information and the constraint condition relaxed information that relaxes the constraint condition; ,
In accordance with the constraint condition relaxation information acquired by the acquisition means, at least one of the constraint condition related to the vehicle information and the constraint condition related to the load information is relaxed, and the load data that has not been allocated by the first determination means A specifying means for specifying an allocation position for the vehicle data;
Second deciding means for deciding vehicle data and delivery time for unallocated load data for the assigned position specified by the specifying means;
Display control means for displaying the vehicle data and the delivery route representing the delivery time for the load data determined by the second determination means together with the constraint relaxation information used for specifying the allocated position. An information processing apparatus characterized by the above.   The information processing apparatus according to claim 1, wherein the display control unit displays the load data determined by the second determination unit in association with the vehicle data.   The display control means includes a first delivery route representing vehicle data and delivery time for the load data determined by the first decision means, and vehicle data and delivery for the load data decided by the second decision means. 3. The information processing apparatus according to claim 1, wherein a pair of the second delivery route representing time is displayed.   The display control means displays the load data determined by the second determining means on the second delivery route, and also displays constraint condition relaxation information indicating the constraint conditions relaxed by the specifying means. The information processing apparatus according to claim 1, wherein the information processing apparatus displays the information on a delivery route. Load data selection means for selecting the unallocated load data in response to a user input instruction, and vehicle data acquisition means for acquiring vehicle data for allocating the selected unallocated load data,
The information according to any one of claims 1 to 4, wherein the specifying unit specifies an allocation position of the selected load data for each vehicle data acquired by the vehicle data acquisition unit. Processing equipment. The second determination means includes first evaluation value calculation means for calculating an evaluation value of a delivery route when the selected unallocated load data is assigned for each acquired vehicle data,
The information processing apparatus according to claim 5, wherein the display control unit displays the delivery routes in descending order of the evaluation values calculated by the evaluation value calculation unit. Vehicle data selection means for selecting the vehicle data in response to a user input instruction, and load data acquisition means for acquiring unassigned load data to be assigned to the selected vehicle data,
The said specific | specification part specifies the allocation position of the said unallocated load data with respect to the said selected vehicle data for every said unallocated load data, The any one of Claim 1 thru | or 4 characterized by the above-mentioned. Information processing device. The second determination means includes second evaluation value calculation means for calculating an evaluation value of a delivery route when the unassigned load data is assigned to the selected vehicle data,
The display control means calculates an evaluation value when the acquired load data is allocated to the selected vehicle data, and the delivery routes are arranged in descending order of the evaluation value calculated by the second evaluation value calculation means. The information processing apparatus according to claim 7, wherein the information processing apparatus is displayed.   9. The display control unit according to claim 1, wherein when there is a delivery route that violates a constraint that cannot be relaxed by the specifying unit, the display control unit prohibits display of the delivery route. The information processing apparatus according to item. An information processing method for communicating with a server storing vehicle information and load information to be allocated to the vehicle information, and creating a vehicle allocation plan according to the vehicle information and the load information,
A first determination step of determining vehicle data constituting the vehicle information to which the load data constituting the load information is assigned, and a delivery time of the data, and determining unallocated load data;
An acquisition step of acquiring at least one of the constraint condition related to the vehicle information and the constraint condition relaxed information that relaxes the constraint condition, and the constraint condition related to the cargo information and the constraint condition relaxed information that relaxes the constraint condition, from the server; ,
In accordance with the constraint condition relaxation information acquired in the acquisition step, at least one of the constraint condition related to the vehicle information and the constraint condition related to the load information is relaxed, and the load data that has not been allocated in the first determination step A specifying step of specifying an allocation position for the vehicle data;
A second determination step of determining vehicle data and delivery time for the unallocated load data for the allocation position identified in the identification step;
A display control step of displaying vehicle data for the load data determined in the second determination step and a delivery route representing delivery time together with the constraint relaxation information used for specifying the assigned position. An information processing method characterized by the above. A program for communicating with a server that stores vehicle information and load information to be assigned to the vehicle information, and causing a computer to execute an information processing method for creating a dispatch plan according to the vehicle information and the load information. The method is
A first determination step of determining vehicle data constituting the vehicle information to which the load data constituting the load information is allocated, a delivery time of the load data, and determining unallocated load data;
An acquisition step of acquiring at least one of the constraint condition related to the vehicle information and the constraint condition relaxed information that relaxes the constraint condition, and the constraint condition related to the cargo information and the constraint condition relaxed information that relaxes the constraint condition, from the server; ,
In accordance with the constraint condition relaxation information acquired in the acquisition step, at least one of the constraint condition related to the vehicle information and the constraint condition related to the load information is relaxed, and the load data that has not been allocated in the first determination step A specifying step of specifying an allocation position for the vehicle data;
A second determination step of determining vehicle data and delivery time for the unallocated load data for the allocation position identified in the identification step;
A display control step of displaying the vehicle data and the delivery route representing the delivery time for the load data determined in the second determination step together with the constraint condition relaxation information used for specifying the assigned position. A featured program.

Images