JP5382844B2 - Transportation schedule creation system - Google Patents

Description

  The present invention relates to a technique for creating transportation schedules for trucks and the like in the field of physical distribution using a computer, and more specifically to a transportation plan creation system using a computer.

  In order to create a truck transportation schedule in the logistics field with a computer, for example, based on mathematical calculations such as linear programming as described in Non-Patent Document 1, the sweep method or the NI method Stochastic methods called metaheuristics based on heuristics, such as tabu search, SA method (Simulated Annealing), GA (Genetic Algorithm) such as those described in Non-Patent Document 2 A number of methods are used, such as those that apply.

  As typical techniques that specifically apply these methods to the physical distribution field, for example, those described in Patent Document 1 and Patent Document 2 below are known.

  The one described in Patent Document 1 is a method for improving the efficiency of creating a schedule for package transportation to a plurality of delivery destinations. In this method, each package delivery destination is assigned to a plurality of chunks, and a delivery route that connects the delivery destinations in each chunk is created. This shortens the delivery time in the entire area.

The one described in Patent Document 2 applies mathematical techniques such as linear programming and integer programming to the creation of a distribution network between bases such as factories, distribution centers, and delivery destinations. In this method, as shown in the drawing of the document, transportation is expressed by a graph in which a load flows through an arc between nodes with a base such as a factory, a warehouse, and a delivery destination as nodes of the graph. Each arc is given a transportation cost per unit of baggage, an upper limit of the amount of luggage that can be transported on the arc, and an upper limit of the amount of luggage that can be relayed at the intermediate distribution center. The problem is solved by modeling, and the route from the departure point of the package to the final destination is determined to determine whether the transportation cost of the entire distribution network is minimized.
Kubo Mikio “Logistics Engineering” Asakura Shoten, June 2001 Yasuaki Yanagiura and Hidetoshi Ibaraki, “Combinatorial Optimization: Focusing on Meta-Strategy”, Asakura Shoten, January 2001 Japanese Patent Laid-Open No. 8-115495 JP 2000-182179 A

  In the technology described in Patent Document 1, a vehicle travels from a starting point such as a garage to a distribution center, loads a baggage at the distribution center, goes around a delivery destination, and returns to the starting distribution center. It is assumed. Here, the delivery from the distribution center to the delivery destination is described, but the same applies to the case where the collection from the collection destination to the distribution center is performed.

  However, in actual transportation, multiple packages with the same departure and arrival locations are put together in containers such as corrugated cardboard and pallet, and then transported in a lump, and then the contents of the containers are reconstructed as packages for each delivery site at the distribution center. May be transported. In the technique such as Patent Document 1, since the reconfiguration of the contents of the container at the distribution center cannot be considered, the reconfigured container is transported from the time when the unreconstructed luggage does not arrive at the distribution center. Such a schedule may be created and inconsistencies may occur. In addition, since containers before and after reconfiguration may be loaded on different vehicles, it is necessary to consider the baggage allocated to multiple vehicles in order to determine the schedule time. I can't do it.

  An object of the present invention is to avoid a contradiction between schedules before and after the reconstruction of the contents of a container at a distribution center and efficiently create a transportation schedule.

  In order to achieve the above object, the present invention provides a time frame in which the contents of a container in a distribution center are configured in advance before creating a schedule, and the contents of the container can be reconfigured so as not to cause a contradiction in the schedule. By calculating and adjusting the schedule, the schedule is created without being aware of the dependency of work time among a plurality of vehicles when creating the schedule.

That is, the present invention provides a transportation schedule for a vehicle that has at least an input / output device, a processing device, and a storage device, and that transports cargo from a shipping base to a delivery base in a logistics network including a plurality of logistics centers. A schedule creation system that registers location information including location information of distribution centers and shipment / delivery locations of packages, as well as the weight, volume, shipment / delivery locations, and shipment / delivery locations of each ordered package Order information registration means for inputting order information including delivery time constraints, relay base information registration means for setting a relay base on the physical distribution network for each combination of shipment and delivery base of the package, a distribution center, shipping site, delivery site, loading site, and / or unloading a transport vehicle number included in each site of the site, and including a loading weight limit and the load capacity limit of their transport vehicles Transport vehicle information registration means for inputting transport vehicle information, and container transport route information in which orders with the same loading and unloading bases for each order transport route divided by the relay base information are collected in a container are generated. Container transport route information generating means, transport work information generated by dividing each route of the container transport route information for each work of loading and unloading, and work start possible time and work start limit included in the transport work information Transportation work information generation means that sets the time based on the schedule that each ordered package is transported earliest and the schedule that is transported latest, and the loading operation in separate containers or routes that share the same ordered package and as unloading filter paper work viable time frame do not overlap, the time frame for adjusting the work start enabled time and work start limit time of the transport task information A constant section, the location information, order information, the relay base information, transportation vehicle information, container transport path information, and by using the transport work information, transport vehicle loading operations and unloading filter paper work the transport work information indicates It is characterized by comprising a transportation schedule creation means for creating a transportation schedule and a schedule output means for outputting the created transportation schedule.

  According to the present invention, it is possible to create a transportation schedule on a distribution network including a plurality of distribution centers. This is especially true when multiple packages with the same starting and arriving locations are packed in a container and shipped in bulk, and then the contents of the container are reconstructed and transported as a package to each delivery location at the distribution center. Therefore, it is possible to create a schedule in which no contradiction occurs without creating a schedule for transporting the reconstituted container even though the package has not arrived. Moreover, even when containers before and after reconfiguration are loaded on different vehicles, it is possible to efficiently create a schedule.

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

  FIG. 1 is an overall configuration diagram showing a system of this embodiment. The system includes an input device (101), an output device (102) such as a printer, a display device (103) such as a display, a processing device (104), and a storage device (109). The processing device (104) executes a series of programs (105) including an input processing unit (106), a transportation schedule creation unit (107), and a result output unit (108). The storage device (109) includes base information (110), inter-base relay information (111), order information (112), transport vehicle information (113), distance table (114), and container transport route information (115). , Transportation work information (116), road map (117), and transportation schedule information (118) created therefrom are stored.

  FIG. 2 shows an example of information stored in the storage device (109).

  The base information (110) includes a base ID (201) for uniquely identifying the base, a base name (202), and a base address (203) for each base such as a distribution center or an order shipment / delivery base. And the latitude (204) and longitude (205) of the base are stored. The inter-base relay information (111) stores information on a relay base, that is, a distribution center through which the parcel passes through when the parcel is transported from the shipping base to the delivery base. Specifically, the shipping base ID (206), the delivery base ID (207), the number N of relay bases (208) through which the package is transported from the shipping base to the delivery base, and the IDs of these relay bases Are stored (209 to 212). In this example, the shipping base is also stored as the relay base 0 (209), the delivery base is also stored as the relay base N-1 (212), and the number of bases N (208) includes the shipping base and the delivery base. It shall be stored as the total number of all sites that carry out loading and unloading work.

The order information (112) includes an order ID (213) for uniquely identifying the ordered package, a shipment site ID (214) for the package, a delivery site ID (215) for the package, and a weight (216) for the package. And a volume (217), a shipping time (218) indicating a time at which shipping can be performed from the shipping base, and a delivery time (219) indicating a deadline for arrival at the delivery base are stored. In the transport vehicle information (113), information on vehicles owned by each base is stored. Specifically, the site ID of the site carrying the vehicles (220) holding the number of vehicles that bases (221), the load weight limit fleet and (222) loading volume limit (223) is stored. The distance table (114) stores information related to the travel distance on a transportation flight such as a vehicle between bases, which is necessary for schedule creation. Specifically, the base ID (224) of the departure base, the base ID (225) of the arrival base, the distance (226) between the bases, and the time required for traveling between the bases (227) Is stored.

  The container transport route information (115) stores information in which the same loading base and unloading base are collected in containers such as cardboard and pallets for each transport route of the order information (112). Specifically, an ID (228) for identifying a container, a route number (229) indicating the order of the transportation route of the container, a total number of routes (230), a total weight (231) of an ordered package packed in the container, The current empty volume (232), the order ID (233) packed in the container, and the relay base number (234) for loading the package with the order ID are stored. A plurality of order IDs and their relay base numbers are associated with one container ID. For example, for a package with order ID = T001, the shipping base and delivery base can be known from the order information (112), and the relay from the shipping base to the delivery base can be made by referring to the inter-base relay information (111). The base is known as base 0 → base 1 → ... → base N-1 (note that base 0, base 1,..., Base N-1 in the inter-base relay information (111) are areas for storing base IDs, respectively. The actual relay base is specified by the base ID stored in each of these areas). The package of the order ID = T001 is packed in a predetermined container on the route from the base 0 to the base 1 and transported in a different container on the route from the next base 1 to the base 2, and so on. For example, if the package with the order ID = T001 is packed in the container with the container ID = Y001 on the route from the base 0 to the base 1, and transported to the base N-1 (delivery base), the container ID and One record of container transport route information of the order ID (in this case, since the base indicated by the base 0 is a loading base, 0 is stored in the relay base number (234)) is created, If the package of the order ID = T001 is packed in the container of container ID = Y002 and transported by the route of the next base 1 → base 2, the container ID and the record of the container transport route information of the order ID (in this case, Shown at base 1 Since that site is base for loading, the relay site number in (234) 1 are stored) are made one, ... record of container transport path information is made and so on.

  Furthermore, after one container is transported from one base to the next base, the package is refilled and transported from the base to the next base, so that it is transported with the same container ID (228). A plurality of container transport route information records with route numbers (229) in the order of 1, 2, 3,. Further, when one container is transported through one route, since the package is packed with packages corresponding to several order IDs, the package with the same container ID (228) and the same route number (229). Several minutes of container transport route information records are created. Container transport route information records for the number of packages of the same container ID (228) and the same route number (229) are created for each order ID of the package packed and transported in the container, and the route of each of these records The total number (230), weight (231) and free volume (232) are the same. Further, the actual route indicated by the order ID (233) and the relay base number (234) of each record having the same container ID (228) and the same route number (229), that is, the loading base and the unloading base are all the same. Become. For example, there are three container transport route information records with the same container ID = Y001 and the same route number, the first record is order ID = T001 and the relay base number = 0, and the second record is order ID = T002 and Assuming that the relay base number = 2 and the third record have the order ID = T003 and the relay base number = 5, the actual route from the base 0 to the base 1 in the package route of the order ID = T001 and the order ID = The actual route from base 2 to base 3 in the route of T002 and the actual route from base 5 to base 6 in the route of order ID = T003 are the same.

  The transportation work information (116) is divided for each container ID of the container transportation route information (115) and its transportation route for each loading operation at the departure point and unloading operation at the arrival point, which are the end points of the route. , Information representing a time frame in which each of these operations can be performed is stored. Specifically, an ID (235) for specifying the work, a container ID (236), a route number (237) of the container, an ID of the base where the work is performed (238), and a work content (239) representing the loading or unloading work. ), Work time for loading / unloading work according to container weight and volume (240), work start possible time (241) indicating the time when the work can be started, and work start indicating the limit time at which the work must be started The limit time (242) is stored. If the container ID (236) and the container route number (237) are given, the container transport route information (115) is referred to, and the order ID of all orders to be transported by the container and the route and the starting point of the route I understand. In addition, by referring to one order information in the order, a shipping delivery base is obtained, and further, by referring to the inter-base relay information (111) corresponding to the shipping delivery base, the departure base of the route is obtained. The corresponding arrival base is also known. At the departure point of the route, the load work of those orders is carried out, and at the arrival point, the work of unloading those orders is carried out. Therefore, the transportation work information (116) includes one record, One record is created by the unloading work. The time frame from the work start possible time (241) to the work start limit time (242) for each of these works is, in short, the time for starting the work (loading or unloading) is included in the time frame. Since the necessary time zone is represented, it is only necessary to assign these operations to each vehicle, and to create a transportation schedule so that the time frame restrictions are satisfied when assigned.

  Although not shown, the road map (117) indicates road information of a transportation area to be used for calculating the distance between bases necessary for creating the distance table (114) and outputting the result.

  FIG. 3 shows an example of the transportation schedule information (118) created by the transportation schedule creation unit (107). The transportation schedule information (118) is obtained by arranging the work at the base where the transportation vehicle circulates in the transportation plan created by the method according to the present invention according to the order of the work. Specifically, it consists of the vehicle number (301), the departure base ID (302), the number of tasks assigned to the vehicle (303), and the assigned task IDs (304, 305,...). The work here refers to a transport work information record given in the transport work information (116). In this example, one work is performed for loading or unloading work at the base.

  FIG. 4 is a flowchart showing an outline of the program (105) executed by the processing apparatus (104) in FIG. First, in the input process (step 401), the user obtains information necessary for creating a transportation schedule such as base information (110), inter-base relay information (111), order information (112), transport vehicle information (114), and the like. Input (register), and generate container transport route information (115) and transport work information (116) according to the information. Details of this processing will be described later with reference to FIG. In the next transportation schedule creation process (step 402), a transportation schedule that matches the conditions given in the input processing step is created. Here, the creation of a transportation schedule refers to determining a schedule to be followed by a vehicle that delivers all input package orders from each shipping base to a delivery base. Details of this processing will be described later with reference to FIG. Next, in the result output process (step 403), the created transportation schedule is output. Details of this processing will be described later with reference to FIG.

  FIG. 5 is a flowchart showing details of the input process (step 401) in FIG. First, the base information (110) is registered in the base information registration process (step 501). Next, in the order information registration process (step 502), the order information (112) is registered. Next, in the transportation vehicle information registration process (step 503), the transportation vehicle information (113) is registered. Next, in the distance table generation process (step 504), the distance between the bases and the required travel time by the vehicle are generated with reference to the road map (117) to generate the distance table (114). The road map (117) is prepared in advance. Next, in the inter-base relay information registration process (step 505), inter-base relay information (111) is registered.

  Next, in the container transportation route information generation process (step 506), the container transportation route information (115) is created using the order information (112) registered in steps 502 and 505 and the relay information between bases (111). Do. Details of this processing will be described later with reference to FIG. In the transport work information generation process (step 507), based on the container transport route information (115) generated in step 506, a process of generating transport work information (116) representing the transport work assigned to the vehicle is performed. Details of this processing will be described later with reference to FIG. In the time frame setting process (step 508), a process for setting the work time frame (work start possible time (241) and work start limit time (242)) of the transport work information (116) generated in step 507 is performed. Details of this processing will be described later with reference to FIG.

  FIG. 6 is a flowchart showing details of the container transport route information generation process (step 506) in FIG. First, the container transport route information table case is emptied (step 601). The container transport route information table “case” is a table for setting each record of the created container transport route information (115). Next, the records of the order information (112) registered in the order information table order are sorted in descending order of volume (step 602). The order information table order is a table that stores all records of the order information (112) registered in step 502 of FIG. Next, 0 is substituted into the index variable i of order (step 603). Next, i is compared with the number of orders (step 604). If i is equal to or greater than the number of orders, it means that the container transport route information (115) has been created for all orders, and the process is terminated. If i is less than the number of orders, the process proceeds to step 605.

  Next, the record of the inter-base relay information (111) having the shipping delivery base ID (206, 207) that matches the shipping delivery base ID (214, 215) of the order information record of order [i] is substituted for the variable P. (Step 605). The variable P has the format of the inter-base relay information (111) in FIG. 2, and the inter-base relay information corresponding to the order of the order information order [i] is substituted in step 605. Next, 0 is substituted into an index variable r indicating the position of the relay base (step 606). Next, the number of bases of r and P-1 is compared (step 607). If r is smaller, the process proceeds to step 608; otherwise, the process proceeds to step 616.

  Next, P's r-th relay base ID (base ID of P's relay base r) is substituted for variable bf, and P's r + 1-th relay base ID (base ID of P's relay base r + 1) is substituted for bt. Then, a new container transport route information record N (work area) is prepared, and the order ID of the order [i] and the relay base number r are substituted for N (step 608). Next, among the container transport route information records in the case, all records that have an empty volume equal to or larger than the order [i] volume and transport from the base bf to the base bt are stored in the work array K (step S1). 609). Next, the number of records of K is checked (step 610). If the number of records is 1 or more, the process proceeds to step 611, and if it is 0, the process proceeds to step 613. In other words, the process proceeds to step 611 when a container that can be packed with an order [order] is found. As can be seen from FIG. 2B, the index for identifying each relay site in the inter-base relay information (111) starts from 0. However, for convenience of explanation, the relay site r is designated as the r-th relay site, The relay base r + 1 may be referred to as the (r + 1) th relay base (the same applies to the index starting from 0 below).

  When there are one or more records in the array K, the container ID, path number, and path of K [0] (use the first one when a plurality of containers are found) in the container transport path information record N The total number, weight, and free volume are copied (step 611). Next, for all the records of N and K, the order weight (order [i] weight) is added to the weight, and the order volume (order [i] volume) is subtracted from the free volume (step 612). If there is no record in K in step 610, it means that no container that can be packed with the order [i] is found, so a new container ID is substituted for N container ID, 1 is assigned to the route number, 1 is assigned to the total number of routes, the order weight is assigned to the weight, and the empty volume minus the order volume is substituted (step 613).

  Next, N is added to the table case of the container transport route information (115) (step 614). Next, 1 is added to r (step 615), and the process returns to step 607. If r is greater than or equal to the number of sites P-1 in step 607, 1 is added to i (step 616), and the process returns to step 604. Since the array K directly accesses the record in the container transportation route information table case using the pointer variable, the modification to the array K in step 612 is directly applied to the record in the container transportation route information table case. It shall be reflected.

  FIG. 7 is a flowchart showing details of the transportation work information generation process (step 507) in FIG. First, for each container ID and each route number in the container transport route information (115), two operations, loading work at the departure base and unloading work at the arrival base, are stored in the transport work information work. (Step 701). In this process, all the records of the container transport route information (115) are grouped with the same container ID (228) and route number (229), and the loading at the starting point of the route is performed for the one group. A transport work information record of work and a transport work information record of unloading work at the arrival site are created, and all the created transport work information records are stored in the work. At this time, the work ID (235) of the transport work information record stores an ID for identifying each work, and the container ID (236), the route number (237), the work base ID (238), the work content (239), and As for the work time (240), a value obtained from the container transportation route information and information searched from the container transportation route information is stored.

  Next, 0 is assigned to the work start possible time (241) and MaxValue is assigned to the work start limit time (242) of the all transport work information record created in step 701 (step 702). Here, MaxValue is the maximum value of an integer that can be handled by a computer. Next, 0 is substituted into the order information index variable i (step 703). Next, i is compared with the number of orders (step 704). If i is greater than the number of orders, the process is terminated. If i is less than the number of orders, the following processing is executed.

  First, the schedule that can transport the order “order [i]” earliest is stored in oFast, and the latest schedule that cannot further delay the transport of “order [i]” is stored in oLate (step 705). These schedules are calculated from the shipping time and delivery time of the order, the relay information between bases, and the distance table. The format of oFast and oLate may be the same as the transport schedule information in FIG. 3, but in particular, the order order [i] is transported from the shipping base to the delivery base as relay base 0 → 1 →... → N−1. The work ID and the work start time of the loading work and the unloading work at each relay base may be stored.

  Next, 0 is substituted into an index variable r for specifying each relay base that relays the package of the order order [i] (step 706). Next, the number of relay bases of r and order [i] is compared (step 707). If r is greater than or equal to the number of relay stations −1, the process proceeds to step 715, 1 is added to i (step 715), and the process returns to step 704. If r is less than the number of bases-1 in step 707, the following processing is executed. In the following, “relay base r” refers to relay information between bases having the same shipment delivery base (206, 207) as the shipment delivery base (213, 214) of the order information of order order [i]. 111) of the relay bases 0, 1,..., N-1 (209 to 212), the relay base r specified by the index r is shown.

  First, a load work record at a container relay base r including a route of the order order [i] of the order “order [i]” in the variable Wu (the package of order [i] among the transport work information records developed in the work) (Transportation work information record indicating the loading operation at the relay site r created from the container transport route information record having the container ID and the route number of the container that transports the route of the relay site r → r + 1 by substituting 708). Next, the work start possible time (241) of Wu is updated by taking the max between the current value of the work start possible time (241) and the work start time of the work stored in oFast (step 709). ). Similarly, the work start limit time (242) of Wu is updated by taking the min between the current value of the work start limit time (242) and the work start time of the work stored in oLate (step 710). ). Next, the unloading work record at the transit point r + 1 of the container including the route of the order “order [i] r → r + 1 in the variable Wd (of the order [i] of the transport work information records developed in the work) (Transportation work information record indicating unloading work at the relay site r + 1 created from the container transport route information record having the container ID and route number of the container packed with the package and transporting the route of the relay site r → r + 1) is substituted ( Step 711). Next, the work start possible time (241) of Wd is updated by taking the max between the current value of the work start possible time (241) and the work start time of the work stored in oFast (step 712). ). Similarly, the work start limit time (242) of Wd is updated by taking the min between the current value of the work start limit time (242) and the work start time of the work stored in oLate (step 713). ). Next, 1 is added to r (step 714), and the process returns to step 707. In steps 708 to 713, the work record in the work is directly accessed by Wu or Wd. Therefore, the data update in steps 709, 710, 712, and 713 is the update of the work record in the work.

  By the above processing, steps 708 to 710 are executed for all routes (routes between relay bases) of all orders. Therefore, in the transportation work information record regarding the loading work at the departure base of each inter-base route, Then, taking the max of the work start time of the earliest transport schedule of all orders to be loaded there to make the work start possible time (241), and taking the min of the work start time of the latest transport schedule of all orders to be loaded there The work start limit time (242) is set. Since the set work start possible time (241) is the latest time in the schedule in which the packages of the orders are transported earliest, the time at which the loading operation of the packages can be started in short. Show. In addition, since the set work start limit time (242) is the earliest time in the schedule in which those ordered packages are transported latest, in short, the loading operation of these packages is not later than this time. Indicates the limit time that must be started. The same applies to the unloading side of steps 711 to 713.

  FIG. 8 is a flowchart showing details of the time frame setting process (step 508) in FIG. First, the work start possible time update list utimearray and the work start limit time update list dtimearray are initialized (step 801). These two lists are lists that store the work IDs and the work start possible times and work start limit times corresponding to the work IDs, respectively, and set the data of the current transport work information work in the initialization process. .

  Next, 0 is substituted into the index i for specifying the container ID (step 802). Next, i is compared with the number of containers (step 803). If i is equal to or greater than the number of containers, it means that the processing has been completed for all containers, so the contents of the timearray and dtimearray are stored in the transport work information work (116) (step 814), and the processing ends. In step 803, if i is less than the number of containers, the following is executed.

  First, 0 is substituted into a variable r representing the container path number (step 804). Next, r and the total number of paths of the container are compared (step 805). If r is equal to or greater than the total number of routes, it means that processing of all routes has been completed for the container, so 1 is added to i (step 813) and the processing returns to step 803. When r is less than the total number of paths, the following is executed.

  First, for each order included in the route r of the i-th container ID, an array of transport work records of container route loading work transported by the next transport route is stored in Nwork (step 806). Now, if all orders included in the route r of the i-th container ID are referred to as “order group A”, the first order of the order group A is loaded on the next transportation route of the order. The transportation work record corresponding to the work is stored in the Nwork, and similarly, for the second, third,... Orders of the order group A, the loading transportation work record in the next transportation route is stored in the Nwork. It is. The loading and transporting work records stored in these Nworks are the arrival bases of the route r (this base is referred to as “base B”), and the cargo unloaded from the container of the i-th container ID is transferred to the next transport route. Each loading work for getting on board is shown. Next, the minimum value of the loading work start possible time (241) of the loading transportation work record stored in Nwork is substituted for variable q (step 807). This value indicates the earliest time among the times when loading at the time of transferring each package of the order group A to the next transportation route at the base B is possible.

  Next, for all the containers pointed to by Nwork, the container unloading work arrangement including the front path of each package packed in the container is stored in Pwork (step 808). Next, the unloading work start limit time of the unloading work record stored in Pwork + the maximum value of the work time is substituted into the variable p (step 809). Next, p + (q−p) / 2 is substituted for the variable d (step 810). Next, the utimearray is updated with d for all work of Nwork, and the dtimearray is updated with d-work time for all work of Pwork (step 811). Next, 1 is added to r (step 812), and the process returns to step 805. In short, the above processing is performed by unloading at a certain relay base and dividing the time of unloading work and loading work when loading to the next route. As a result, it is not necessary to create a schedule for starting loading even when unloading is not finished.

  FIG. 9 is a process flow showing details of the transportation schedule creation process (step 402) in FIG.

  Since the time frame for each work is set by the time frame setting process (step 508), the creation of the schedule is not aware of the contradiction of the work time for each order, and is a combination optimization problem. Techniques using heuristics, such as those described in 1 and Non-Patent Document 2, and techniques classified into metaheuristics such as GA, tabu search, and SA method can be used. In this embodiment, the random restart method in metaheuristics is applied. That is, an initial solution (schedule) is created under random conditions, and is improved to a better schedule by an improvement process. This initial solution creation and improvement is repeated several times, and the best schedule is selected.

  First, 1 is set to the variable I, and Max_Value is set to Best_Value (step 901). Here, MaxValue represents the maximum numerical value that can be expressed by the computer used. Next, when I is smaller than N (step 902), the next process is repeated. Here, N is the number of times an initial solution is created and improved by random restart, and is a predetermined constant.

  First, an initial solution is created (step 903). Details of this processing will be described with reference to FIG. Next, the created initial solution is improved (step 904). Details of this processing will be described with reference to FIG. Next, the schedule result is evaluated (step 905). This evaluation is a process for obtaining an approximate cost required for transportation from the number of vehicles to be used and the distance traveled from the schedule result improved in step 904. This calculation method includes a method for evaluating only by the number of vehicles, a method for evaluating by the total travel distance of transport vehicles, a product of the number of vehicles and a predetermined fixed cost per transport vehicle, a total travel distance, For example, a method for evaluating the product by the sum of products of variable costs per unit distance that has been determined. The evaluation result (evaluation value) calculated in step 905 is substituted into the variable E. A smaller evaluation value means higher evaluation.

  Next, the variable E in which the evaluation result is stored is compared with the value of Best_Value (step 906). If E is smaller than Best_Value, the current schedule result (transport schedule information (118)) is Since it is the best result, the value of E is substituted for Best_Value (step 907), and the created schedule result is recorded in Best_Schedule (step 908). In short, when the evaluation is improved by the schedule improvement process, the schedule at that time is saved. Next, 1 is added to variable I, and the process returns to step 902. If I becomes N or more at step 902, the process is terminated.

  FIG. 10 is a process flow showing details of the initial solution creation process (step 903) in FIG. In this process, an initial solution for assigning each work of the transport work information (116) to any vehicle is created.

  First, all the records on the loading side of the transportation work information (116) are stored in the array L (step 1001). Next, the transport work records stored in the array L are rearranged in a random order (step 1002). The number of operations stored in the array L is set in the variable P, and 0 is set in the variable I representing the work information index (step 1003). The values of I and P are compared (step 1004). If I is equal to or greater than P, the process ends. While I is less than P, the following processing is performed.

  First, the number of vehicles to which work has already been assigned is stored in the variable T (step 1005). Next, Max_Value is stored in the variable V that stores the minimum value of the distance increment when work is assigned to the vehicle, and the work assignment is checked to be -1 in the variable X that represents the vehicle index when the distance increment is minimum. 0 is substituted for each variable J representing the vehicle index (step 1006). J and T are compared (step 1007). If J is less than T, the loading operation stored in L [I] and the corresponding load are stored in the Jth vehicle to which the operation has already been assigned. It is checked whether it is possible to load the unloading work (loading, transporting, and unloading the load related to the work) (step 1008). That is, when these tasks are assigned to the vehicle, it is checked whether the upper limit of the weight or volume of the vehicle is exceeded and whether the time frame of the task start time when the task is assigned can be observed. If it is determined in step 1008 that loading is possible, the increment of travel distance of the Jth vehicle by assigning the loading and unloading work to the Jth vehicle is set to the variable D (step 1009). The values of D and V are compared (step 1010). If D is not smaller than V, 1 is added to J (step 1012), the process returns to step 1007, and the next vehicle is checked. If the value of D is small at step 1009, X is set to J and V is set to D (step 1011), 1 is added to J (step 1012), and the process returns to step 1007.

  If J is greater than or equal to T in step 1007, it is first checked whether the value of variable X is -1 (step 1013). If it is not −1, a vehicle capable of loading the loading operation L [I] and the corresponding unloading operation has been found, so these operations are loaded on the Xth vehicle (step 1017), and the variable I 1 is added to (step 1016), and the process returns to step 1004 to proceed to the next loading operation. If the value of the variable X is −1 in step 1013, there is no vehicle that has already been assigned work and that can be loaded, so one vehicle at the work base of the load work L [I] is assigned. A new allocation is made for truck transportation, and an unloading operation corresponding to the loading operation L [I] is allocated to the vehicle (step 1014), and the process proceeds to step 1016.

  FIG. 11 is a process flow showing details of the improvement process (step 904) in FIG. First, 1 is assigned to variable I (step 1101). Next, when I is less than 10 (step 1102), the following processing is performed. Note that this value “10” is a value determined in advance as the number of times the reallocation of work in the improvement process is executed. If I becomes 10 or more in step 1102, the process is terminated.

  First, the loading rate of all vehicles to which work is assigned is calculated (step 1103). One integer from 1 to 5 is randomly selected and set in the variable R (step 1104). Next, the work loaded on the vehicle with the Rth worst loading rate is deleted, and the deleted loading work is added to the array L (step 1105). Next, all the other vehicles traveling around the loading and unloading bases of the work registered in the array L are deleted, and the loading side of the work assigned to these vehicles is stored in the array M. (Step 1106). Next, the contents of the array M are added to the array L (step 1107). Next, the loading operation stored in the array L is rescheduled (step 1108). That is, a vehicle to be loaded is assigned to the work stored in the array L by the method shown in the detailed flow of FIG. Next, 1 is added to the variable I (step 1109), and the process returns to step 1102.

  FIG. 12 is a flowchart showing details of the result output process (step 403) in FIG. First, the passage base and route of each vehicle are displayed on a map (step 1201), and evaluation values such as the required number of vehicles and total travel distance are calculated and displayed for the created schedule (step 1202). ). Next, if there is a print instruction, the above information is printed on the printing apparatus (step 1203).

It is a whole lineblock diagram showing the system of this embodiment. It is a figure which shows the structure of the data used by this embodiment. It is a figure which shows the data structure of the schedule information used by this embodiment. It is a flowchart figure which shows the whole process of this embodiment. It is a flowchart figure which shows the detail of the input process of this embodiment. It is a flowchart figure which shows the detail of the container transport route information generation process of this embodiment. It is a flowchart figure which shows the detail of the transport work information generation process of this embodiment. It is a flowchart figure which shows the detail of the work time frame setting process of this embodiment. It is a flowchart figure which shows the detail of the transportation schedule preparation process of this embodiment. It is a flowchart figure which shows the detail of the initial solution preparation process of this embodiment. It is a flowchart figure which shows the detail of the improvement process of this embodiment. It is a flowchart figure which shows the detail of the result output process of this embodiment.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 101 ... Input device 102 ... Output device 103 ... Display device 104 ... Processing device 109 ... Storage device 106 ... Input processing unit 107 ... Transport schedule creation unit 108 ... Result output unit 105 ... Program 110 Base information, 111 ... Inter-base relay information, 112 ... Order information, 113 ... Transport vehicle information, 114 ... Distance table, 115 ... Container transport route information, 116 ... Transport work information, 117 ... Road map, 118 ... Transport schedule information.

Claims (1)

A transportation schedule creation system for creating a transportation schedule for a vehicle having at least an input / output device, a processing device, and a storage device, and transporting a package from a shipping base to a delivery base in a logistics network including a plurality of logistics centers. ,
Location information registration means for registering location information including location information of distribution centers and shipment / delivery locations of packages;
Order information registration means for entering order information including the weight, volume, shipping / delivery base of each ordered package, and shipping / delivery time constraints;
Relay base information registration means for setting a relay base on the physical distribution network for each combination of shipment and delivery base of the package,
Transportation that inputs transportation vehicle information including the number of transportation vehicles that each of the distribution center, shipping base, delivery base, loading base, and / or unloading base has, and the upper and lower loading weights of those transportation vehicles Vehicle information registration means;
A container transportation route information generating means for generating container transportation route information in which the same loading order and unloading base in the transportation route of each order divided by the relay base information are aggregated in a container;
In addition to generating transport work information obtained by dividing each route of the container transport route information for each work of loading and unloading, the work start possible time and the work start limit time included in the transport work information are indicated by the package of each order. A transport work information generating means set based on the earliest transport schedule and the latest transport schedule;
In separate containers or routes that share the same orders luggage, so its loading work and unloading filter paper work viable time frame do not overlap, the work start enabled time and work start limit time of the transport task information Time frame setting means to be adjusted;
The base information, order information, the relay base information, transportation vehicle information, container transport path information, and by using the transport task information, by assigning the loading work and unloading filter paper work the transport work information indicates the transport vehicle A transportation schedule creation means for creating a transportation schedule;
A transportation schedule creation system comprising: a schedule output means for outputting the created transportation schedule.

Images