Transportation possibility determination device and transportation possibility determination method

Abstract

To determine whether a cargo can be transported or not in freight and passenger consolidated transportation using a railroad.SOLUTION: Cargo conditions related to a station and time of a transport source and a transport destination are set for each cargo, and a determination score is set for each cargo. Then, a transport plan for determination in which the cargo is individually allocated to any train, a train loading condition and a cargo condition relating to a transportable cargo amount determined for each train are satisfied, and a total sum of determination scores of the cargo for which the allocation is completed satisfies a predetermined optimization condition is created using a predetermined optimization calculation. Based on the result of the optimization calculation, it is determined whether or not the package is transportable. As a result, it is possible to determine whether or not the freight can be transported by the freight / passenger consolidated transport.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present invention relates to a transportation feasibility determination device and the like. [Background technology]

[0002] As a conventional method for creating a freight transportation plan for logistics, a method for creating an optimal transportation plan through optimization calculation is known (see, for example, Patent Documents 1 to 3). However, when creating a mixed freight and passenger transportation plan using rail, there are constraints such as cargo handling at each station, and it is not appropriate to apply the conventional transportation plan creation method that does not take these into consideration.

[0003] Specifically, mixed freight and passenger transport by rail involves loading luggage onto trains, which are typically used for passenger transport, and transporting both passengers and luggage at the same time. Because train operations are governed by train timetables, cargo handling, such as loading and unloading luggage at stations, must be completed within the designated station timeframe. The location and number of workers required for handling luggage at stations must also be considered. Furthermore, there is a limit to the space (volume) available within a train for carrying luggage, and each type of luggage has its own volume, delivery station, time, and pick-up station and time. Creating a transportation plan for mixed freight and passenger transport by rail is complex and not easy, as it requires consideration of numerous factors. [Prior art documents] [Patent documents]

[0004] [Patent Document 1] Japanese Patent Application Publication No. 2018-205806 [Patent Document 2] Japanese Patent Application Laid-Open No. 2024-58370 [Patent Document 3] Japanese Patent Application Laid-Open No. 2024-43258 Summary of the Invention [Problem to be solved by the invention]

[0005] Normally, requests for transporting luggage occur at any time, and it is desirable to be able to determine whether or not that luggage can be transported at that time (transport feasibility). In doing so, the transport feasibility determination must be made on the premise that luggage that has already been accepted as transportable will be transported without fail. As mentioned above, when transporting passengers and cargo together by rail, there are various constraints regarding trains, luggage, and handling at stations, and it is necessary to determine whether or not luggage can be transported taking these into consideration. Furthermore, as the amount of luggage handled increases, it is thought that determining whether or not luggage can be transported will become even more difficult.

[0006] The problem to be solved by the present invention is to make it possible to determine whether or not a package can be transported in mixed cargo and passenger transport using rail. [Means for solving the problem]

[0007] The first invention to solve the above problem is: A transportation feasibility determination device that determines whether or not a baggage can be transported by a train that has a fixed train schedule and is capable of transporting mixed cargo and passengers, a luggage condition setting unit (e.g., luggage condition setting unit 202 in FIG. 3) that sets luggage conditions related to the station and time of transportation origin and destination for each luggage; A score setting means (for example, the score setting unit 204 in FIG. 3) for setting a judgment score for each of the packages; a creation means (e.g., the creation unit 206 in FIG. 3 ) that creates, using a predetermined optimization calculation, a judgment transportation plan in which the luggage is individually assigned to one of the trains, the judgment transportation plan satisfies the train loading conditions and the luggage conditions related to the transportable luggage volume determined for each of the trains, and the sum of the judgment scores of the assigned luggage satisfies a predetermined optimization condition; a determination means (for example, the determination unit 208 in FIG. 3) that determines whether or not all of the packages can be transported based on the results of the optimization calculation by the creation means; The transportation feasibility determination device is provided with the above.

[0008] Other inventions include: A transportation feasibility determination method for determining whether or not a baggage can be transported by a train capable of transporting mixed cargo and passengers with a fixed train schedule, comprising: Setting baggage conditions regarding origin and destination stations and times for each baggage; setting a judgment score for each of the packages; creating, using a predetermined optimization calculation, a judgment transportation plan in which the luggage is individually assigned to one of the trains, the judgment transportation plan satisfying the train loading conditions and the luggage conditions related to the transportable luggage volume determined for each of the trains, and the sum of the judgment scores of the luggage for which assignment has been completed satisfies a predetermined optimization condition; determining whether all of the packages can be transported based on the results of the optimization calculation; The transportation possibility determination method may include the steps of:

[0009] According to the first invention, it is possible to determine whether or not a piece of luggage can be transported in mixed cargo and passenger transportation using railways. For example, depending on how the luggage's judgment score is set, it is possible to create a judgment transportation plan in which specific luggage is preferentially assigned to a train, and from the results, it is possible to determine whether or not each piece of luggage has been assigned to a train (whether or not it can be transported). Furthermore, depending on how the luggage's judgment score is set, it is also possible to set luggage that should be preferentially assigned to a train in the optimization calculation, i.e., luggage that should be preferentially transported.

[0010] The second invention is the above-mentioned invention, The cargo includes existing cargo and new cargo, The score setting means sets a judgment score to be set for the existing baggage and a judgment score to be set for the new baggage so as to satisfy a predetermined large difference condition, The determination means determines whether or not the new cargo can be transported based on the sum calculated by the optimization calculation by the creation means. This is a device for determining whether or not a shipment is possible.

[0011] According to the second invention, the judgment score for existing baggage and the judgment score for new baggage are set separately so as to satisfy the large difference condition, so it is possible to create a judgment transportation plan in which either the existing baggage or the new baggage is preferentially assigned to a train in the optimization calculation. For example, by setting the judgment score so as to preferentially assign the existing baggage and performing the optimization calculation, it is possible to reliably assign the existing baggage and then determine whether the new baggage can be additionally assigned, i.e., whether the new baggage can be transported.

[0012] The third invention is the above-mentioned invention, The score setting means sets the judgment score to be set for the new baggage to the same value, The determination means determines the number of the new cargoes that can be transported based on the total sum calculated by the optimization calculation by the creation means. This is a device for determining whether or not a shipment is possible.

[0013] According to the third aspect of the present invention, the judgment score of new baggage is set to the same value, so that new baggage is allocated to trains equally without discrimination. Also, it becomes possible to determine the number of new baggage allocated to a train, i.e., the number of new baggage that can be transported.

[0014] A fourth aspect of the present invention is the above-mentioned invention, the score setting means sets the judgment score to be set for the existing baggage to a value greater than the judgment score to be set for the new baggage so as to satisfy the large difference condition; the creation means creates the determination transportation plan using the optimization calculation with maximizing the sum as the optimization condition. This is a device for determining whether or not a shipment is possible.

[0015] According to the fourth invention, the judgment score of existing luggage is set to a large value that satisfies the large difference condition compared to the judgment score of new luggage, and an optimization calculation is used in which the optimization condition is to maximize the sum, so that a judgment transportation plan is created in which existing luggage is preferentially assigned to trains.

[0016] The fifth invention is the above-mentioned invention, the creation means creates the judgment transportation plan so as to satisfy a material handling condition related to a material handling capacity within a stopping time based on the train schedule determined for each of the transportation source station and the transportation destination station; This is a device for determining whether or not a shipment is possible.

[0017] According to the fifth invention, it is possible to create an appropriate transportation plan for judgment that takes into account constraints such as loading and unloading of luggage at stations and train stop times, thereby improving the feasibility and reliability of the judgment results on whether luggage can be transported.

[0018] The sixth invention is the above-mentioned invention, The train loading conditions further include a transportable load volume; The luggage condition setting means sets the luggage conditions by further including the volume of the luggage. This is a device for determining whether or not a shipment is possible.

[0019] According to the sixth aspect of the present invention, it is possible to create an appropriate transportation plan for judgment that takes into consideration constraints such as the volume of the cargo and the load capacity that the train can transport, thereby improving the feasibility and reliability of the judgment result on whether or not the cargo can be transported. [Brief explanation of the drawings]

[0020] [Figure 1] An overview of how cargo can be transported. [Figure 2] FIG. 10 is an explanatory diagram of a judgment score set for luggage. [Figure 3] 10 shows an example of the functional configuration of a transport feasibility determination device. [Figure 4] An example of transportation schedule data. [Figure 5] 10 is a flowchart of a transportation possibility determination process. DETAILED DESCRIPTION OF THE INVENTION

[0021] Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings. Note that the forms to which the present invention can be applied are not limited to the following embodiments. In addition, in the description of the drawings, the same elements are given the same reference numerals.

[0022] [overview] This embodiment determines whether or not cargo can be transported by a train capable of transporting passengers and cargo together, with a fixed train schedule. In this embodiment, passenger and cargo together transport refers to transportation using rail, where passengers are also transported on the same train, transporting both passengers and cargo simultaneously. Therefore, a transportation plan for realizing passenger and cargo together transport must be created in a way that prioritizes passenger transport and does not affect the train schedule.

[0023] Specifically, for example, cargo handling, such as loading and unloading of luggage at stations, must be completed within the stop time specified in the train schedule. The location of work at stations and the number of workers must also be taken into consideration. Furthermore, when transporting luggage, the source station (loading station) and time, and the destination station (unloading station) and time are determined. Furthermore, luggage varies in volume (size), and trains have limits on the load capacity they can transport. Transportation plans must be created taking into account these various constraints related to luggage and trains.

[0024] Furthermore, requests for transporting luggage occur arbitrarily over time, and when a request for transporting luggage is received, it is necessary to determine whether or not the luggage (new luggage) can be transported. Figure 1 is a diagram showing an overview of luggage transport requests and the determination of whether or not the luggage can be transported. In Figure 1, the horizontal axis is the time axis, showing the number of days that have passed. New luggage transport requests are accepted at any time up until the day before the transportation date, and when a transportation request is received, it is determined whether or not the luggage can be transported. The determination of whether or not a new luggage can be transported is made on the premise that other existing luggage, which is other luggage that has already been accepted as transportable, will be transported. Then, if it is determined that the new luggage can be transported, the new luggage will be added to the existing luggage.

[0025] The determination of whether a new shipment can be transported is made by attempting to create a determination transportation plan and determining whether the new shipment can be transported based on the results of the plan. One of the features of this embodiment is that a determination score is set for each shipment, both existing and new, and a determination transportation plan is created using a predetermined optimization calculation.

[0026] If it is determined that a new item can be transported, the set of existing items is updated with the new item as an existing item. The updated set of existing items is used to determine whether or not a new item can be transported from the next time onwards.

[0027] FIG. 2 is a diagram explaining the setting of the judgment score. The judgment score is set separately for existing packages and new packages. The same judgment score is set for each new package, and the same judgment score is set for each existing package. The judgment score set for existing packages is set to a larger value that satisfies the large difference condition compared to the judgment score set for new packages. In the example of FIG. 2, it is assumed that there are multiple existing packages and multiple new packages, and the judgment score is set to a very large positive value of "M = 1 million" for existing packages, and the smallest positive value of "m = 1" for new packages.

[0028] Next, a determination transportation plan that assigns each of the existing and new baggage items to one of the trains specified in the train schedule is created by optimization calculations with the optimization condition being maximizing the sum of the judgment scores of the baggage items assigned to the trains. Then, the feasibility of transporting the new baggage can be determined based on the sum of the judgment scores of the baggage items assigned to one of the trains in the created determination transportation plan. In other words, because the optimization condition is maximizing the sum of the judgment scores of the baggage items assigned to the trains, a transportation plan is created in which existing baggage items with high judgment scores are preferentially assigned to trains. As described above, transport requests for new baggage items are generated arbitrarily over time, and when accepting new baggage items, it is determined whether the new baggage item can be assigned to a train in addition to the existing baggage items. The existing baggage items have already been determined to be assignable to trains in previous determinations. Therefore, by preferentially assigning existing baggage items with high judgment scores to trains and further determining whether the new baggage item can be assigned to a train, a determination transportation plan that can transport at least all of the existing baggage items is created.

[0029] Therefore, the difference between the sum of the judgment scores of the baggage items assigned to the train and the sum of the judgment scores of the existing baggage items (= M × number of existing baggage items) corresponds to the sum of the judgment scores of the new baggage items assigned to the train, i.e., the new baggage items that can be transported. Furthermore, since the judgment score set for the new baggage items is the same value ("1" in the example of Figure 2), the number of new baggage items assigned to the train (that can be transported) (= difference / m) can be determined from this difference. Furthermore, from the created transportation plan for judgment, it can be determined individually for each new baggage item whether it has been assigned to a train (whether it can be transported).

[0030] [Creating a transportation plan for assessment] There are various possible optimization calculations for creating a transportation plan for judgment, but as an example, in this embodiment, the calculation is formulated as a 0-1 integer programming problem in which the variables are integers 0-1, and is realized by solving this.

[0031] Specifically, the parameters are defined as follows:

number

[0032] Next, we formulate the constraints. First, we define the variables that represent the allocation of luggage to trains as follows:

number

[0033] The following equation (1) indicates that each piece of luggage is assigned to one train without being divided.

number

[0034] The following formula (2) represents the allocation of each bag to a train that satisfies the conditions for bringing and receiving the bag. The stations and times for bringing (origin) and receiving (destination) are specified for each bag. Therefore, the train that can allocate the bag must depart from the bringing station after the bringing time and arrive at the receiving station before the receiving time.

number

[0035] Furthermore, the following formula (3) is a train loading condition, which indicates that the sum of the volumes of the cargoes allocated to each train is equal to or less than the upper limit (loading volume) of the cargo volume that can be transported by the train.

number

[0036] Furthermore, the following equation (4) is a condition for handling goods at a station, and indicates that the sum of the time required to load and unload goods onto a train at a station is less than or equal to the time the train is stopped at that station. In equation (4), the first term on the left side is the time required to load goods, the second term is the time required to load and unload goods, and the right side is the time the train is stopped.

number

[0037] Furthermore, the judgment score set for each piece of luggage is formulated as in the following equation (5). As described above, the judgment score is set to a sufficiently large positive value M (for example, "1 million") for existing luggage, and a sufficiently small positive value m (for example, "1") for new luggage. The positive values ​​M and m can be numerical values ​​with a relatively sufficient difference. For example, the positive value m can be set to "1", and the positive value M can be set to a value greater than the expected upper limit number of luggage with the expected minimum volume (minimum volume) that can be allocated to a train schedule in one day. The positive value m may also be set to a sufficiently small number less than 1.

number

[0038] Based on the above constraints, the optimization problem for creating a transportation plan for evaluation can be formulated as shown in the following equation (6). Finding a solution to this equation results in creating a transportation plan for evaluation.

number

[0039] [Function Configuration] Fig. 3 shows an example of the functional configuration of the transportation feasibility determination device 1. According to Fig. 3, the transportation feasibility determination device 1 is configured to include an operation unit 102, a display unit 104, a communication unit 106, a processing unit 200, and a storage unit 300, and is realized as a type of computer system. Note that the transportation feasibility determination device 1 may be realized by a single computer, or may be configured by connecting multiple computers.

[0040] The operation unit 102 is realized by input devices such as a keyboard, mouse, touch panel, and various switches, and outputs operation signals corresponding to the operations performed to the processing unit 200. The display unit 104 is realized by a display device such as a liquid crystal display or touch panel, and performs various displays based on display signals from the processing unit 200. The communication unit 106 is a communication device realized by, for example, a wireless communication module, a router, a modem, a jack for a wired communication cable, a control circuit, etc., and connects to a given communication network to perform data communication with an external device.

[0041] The processing unit 200 is a processor realized by an arithmetic device or arithmetic circuit such as a CPU (Central Processing Unit) or FPGA (Field Programmable Gate Array), and performs overall control of the transportation feasibility determination device 1 based on programs and data stored in the memory unit 300, input data from the operation unit 102 and communication unit 106, etc.

[0042] Furthermore, the processing unit 200 executes a transportation feasibility determination program 302 to perform a transportation feasibility determination process (see FIG. 5) that determines whether or not a baggage can be transported by a train that is capable of transporting mixed cargo and passengers and has a fixed train schedule. Functional processing blocks for this purpose include a baggage condition setting unit 202, a score setting unit 204, a creation unit 206, and a determination unit 208. Each of these functional units in the processing unit 200 can be realized in software by the processing unit 200 executing a program, or can be realized by a dedicated arithmetic circuit. In this embodiment, the former software realization will be described.

[0043] The luggage condition setting unit 202 sets luggage conditions for each luggage, including the station and time of the transportation origin and destination, and also includes the volume of the luggage in the luggage conditions.

[0044] Specifically, when a transport request for new luggage is received, the station and time of the new luggage (transport source), the station and time of the new luggage (transport destination), and the volume (or volume) are set as luggage conditions. The set luggage conditions are stored as part of new luggage data 320 for the new luggage.

[0045] New package data 320 is generated for each new package, and includes the date and time of receipt, the date of transportation, and package condition data in association with the package ID of the new package. Note that when the determination unit 208 determines that a new package can be transported, the new package becomes an existing package, and the corresponding new package data 320 is deleted.

[0046] The score setting unit 204 sets a judgment score for each piece of luggage. There are existing luggage and new luggage, and the judgment score set for existing luggage and the judgment score set for new luggage are set separately so as to satisfy a predetermined large difference condition. For example, the judgment score set for existing luggage is set to a larger value that satisfies the large difference condition compared to the judgment score set for new luggage. In addition, the judgment score set for new luggage is set to the same value (see FIG. 2, formula (5)).

[0047] The creation unit 206 uses a predetermined optimization calculation to create a judgment transportation plan that assigns individual cargo to one of the trains, satisfies the train loading conditions and cargo conditions related to the transportable cargo volume defined for each train, and the sum of the judgment scores of the assigned cargo satisfies a predetermined optimization condition. For example, the creation unit 206 creates the judgment transportation plan using an optimization calculation whose optimization condition is to maximize the sum. The creation unit 206 also creates the judgment transportation plan so that it satisfies the cargo handling conditions related to the cargo handling capacity within the stop time based on the train schedule defined for each of the source and destination stations.

[0048] Specifically, the problem of creating a transportation plan for judgment is mathematically formulated as a 0-1 integer programming problem in which the variables are integers 0 and 1, and the plan is created by solving this. That is, as shown in equation (6), the problem is formulated as a mathematical problem in which equations (1) to (4) are constraints, the variables representing the allocation of luggage to trains are 0-1 integer conditions, and the objective function is to maximize the sum of the judgment scores of luggage assigned to trains.

[0049] When creating a transportation plan for judgment on a certain transportation date, the constraint conditions shown in equations (1) to (4), such as train conditions, handling conditions, and cargo conditions for existing cargo, are stored in the transportation schedule data 310 for the corresponding transportation date, and the cargo conditions for new cargo are stored in the new cargo data 320 for the corresponding transportation date.

[0050] The determination unit 208 determines whether all of the parcels can be transported based on the results of the optimization calculation by the creation unit 206. Furthermore, based on the sum of the determination scores of the parcels whose allocation has been completed, calculated by the optimization calculation by the creation unit 206, the determination unit 208 determines whether new parcels can be transported and the number of new parcels that can be transported.

[0051] Specifically, since the judgment score set for new baggage is the same value ("1" in the example in Figure 2), the number of new baggage items assigned to the train (that can be transported) (= difference / m) can be determined from the difference between the sum of the judgment scores for baggage items assigned to the train and the sum of the judgment scores for existing baggage items (= M x number of existing baggage items). Furthermore, from the created transportation plan for judgment, it can be determined individually whether existing baggage and new baggage have been assigned to the train (whether they can be transported) (see Figure 2).

[0052] The memory unit 300 is realized by an IC (Integrated Circuit) memory such as a ROM (Read Only Memory) or a RAM (Random Access Memory), a storage device such as a hard disk, or an external storage device constructed in a cloud environment, and stores programs and data etc. that the processing unit 200 uses to comprehensively control the transportation feasibility determination device 1. It is also used as a working area for the processing unit 200, and temporarily stores the results of calculations performed by the processing unit 200 and input data from the operation unit 102 and communication unit 106.

[0053] In this embodiment, the storage unit 300 stores a transportation feasibility determination program 302, transportation schedule data 310, and new cargo data 320.

[0054] FIG. 4 is a diagram showing an example of transportation schedule data 310. As shown in FIG. 4, the transportation schedule data 310 is data related to the transportation of luggage and is created for each transportation day (daily). One piece of transportation schedule data 310 includes a transportation date, train schedule data for that transportation day, train condition data, cargo handling condition data, and existing luggage data. The train condition data is train conditions for each train operating according to the train schedule for that transportation day, and includes train loading conditions such as maximum loading volume associated with the train number. The cargo handling condition data is cargo handling conditions for each station, and includes cargo handling work efficiency associated with the station name. The existing luggage data is data on existing luggage accepted as transportable on that transportation day, and includes the date and time of receipt and luggage condition data associated with the luggage ID. The luggage condition data is luggage conditions for the luggage, and includes the station and time of delivery (origin), the station and time of receipt (destination), volume, etc.

[0055] [Processing flow] 5 is a flowchart illustrating the transportation feasibility determination process executed by the transportation feasibility determination device 1. This process is a process for determining whether or not a new shipment is transportable when a request for transportation of one or more new shipments with the same transportation date is received.

[0056] First, the baggage condition setting unit 202 sets baggage conditions for the requested new baggage, such as the drop-off (transportation origin) station and time, the pick-up (transportation destination) station and time, and volume (step S1). Next, existing baggage with the same transportation date as the new baggage is extracted (step S3), and the score setting unit 204 sets a judgment score for each of the new baggage and the extracted existing baggage (step S5). Next, the creation unit 206 creates a judgment transportation plan that assigns the new baggage and the extracted existing baggage to each train operating on the transportation date (step S7).

[0057] Then, the determination unit 208 determines whether the new baggage can be transported based on the sum of the determination scores of the baggage assigned to the train, based on the created determination transportation plan (step S9). That is, the number of new baggage items (that can be transported) assigned to the train (= difference / m) can be determined from the difference between the sum of the determination scores of the baggage assigned to the train and the sum of the determination scores of the existing baggage (= M × number of existing baggage items). Furthermore, based on the created determination transportation plan, it can be determined whether each new baggage item has been assigned to a train (whether it can be transported). Then, of the new baggage items, new baggage that is determined to be transportable is added to the existing baggage for the corresponding transportation date (step S11). When the above processing is performed, the transportation feasibility determination process ends.

[0058] [Action and effect] According to this embodiment, it is possible to determine whether or not a baggage can be transported in mixed freight and passenger transportation using railways. Specifically, because the judgment score of existing baggage is set to a large value that satisfies the large difference condition compared to the judgment score of new baggage, a judgment transportation plan is created in which existing baggage is preferentially assigned to a train. As a result, the difference between the sum of the judgment scores of existing baggage and the sum of the judgment scores of baggage assigned to a train corresponds to the sum of the judgment scores of new baggage assigned to a train, and therefore it is possible to determine whether or not new baggage has been assigned to a train and whether it can be transported from this difference. Furthermore, because the judgment score of new baggage is set to the same value, it is possible to determine the number of new baggage items assigned to a train (that can be transported) from the difference between the sum of the judgment scores of baggage assigned to a train and the sum of the judgment scores set for existing baggage.

[0059] [Variations] It should be noted that the embodiments to which the present invention can be applied are not limited to the above-described embodiments, and can of course be modified as appropriate within the scope of the present invention.

[0060] (A) Setting the judgment score In the above-described embodiment, the same value was set as the judgment score for new baggage, but different values ​​may be set for each new baggage. Specifically, by setting a relatively large judgment score for a new baggage that is to be transported preferentially among multiple new baggage, a judgment transportation plan is created that assigns the new baggage to a train preferentially. This makes it possible to determine whether or not to transport each of multiple new baggage, taking into account the transportation priority of the new baggage. [Explanation of symbols]

[0061] 1...Transportability determination device 200...Processing section 202...Luggage condition setting section 204...Score setting section 206…Creation Department 208…Judgment section 300...Storage section 302...Transportation feasibility determination program 310...Transportation schedule data 320...New parcel data

Claims

1. A transportation feasibility determination device that determines whether or not a baggage can be transported by a train that has a fixed train schedule and is capable of transporting mixed cargo and passengers, a luggage condition setting means for setting luggage conditions relating to the station and time of transportation origin and destination for each luggage; a score setting means for setting a judgment score for each of the packages; a creation means for creating, using a predetermined optimization calculation, a judgment transportation plan in which the luggage is individually assigned to one of the trains, the judgment transportation plan satisfying the train loading conditions and the luggage conditions related to the transportable luggage volume determined for each of the trains, and the sum of the judgment scores of the luggage for which assignment has been completed satisfies a predetermined optimization condition; and a determination means for determining whether or not all of the packages can be transported based on the results of the optimization calculation by the creation means; A transportation feasibility determination device comprising:

2. The cargo includes existing cargo and new cargo, The score setting means sets a judgment score to be set for the existing baggage and a judgment score to be set for the new baggage so as to satisfy a predetermined large difference condition, The determination means determines whether or not the new cargo can be transported based on the sum calculated by the optimization calculation by the creation means. The transportation possibility determination device according to claim 1 .

3. The score setting means sets the judgment score to be set for the new baggage to the same value, The determination means determines the number of the new cargoes that can be transported based on the total sum calculated by the optimization calculation by the creation means. The transportation possibility determination device according to claim 2.

4. the score setting means sets the judgment score to be set for the existing baggage to a value greater than the judgment score to be set for the new baggage so as to satisfy the large difference condition; the creation means creates the determination transportation plan using the optimization calculation with maximizing the sum as the optimization condition. The transportation possibility determination device according to claim 2 or 3.

5. the creation means creates the judgment transportation plan so as to satisfy a material handling condition related to a material handling capacity within a stopping time based on the train schedule determined for each of the transportation source station and the transportation destination station; The transportation possibility determination device according to any one of claims 1 to 3.

6. The train loading conditions further include a transportable load volume; The luggage condition setting means sets the luggage conditions by further including the volume of the luggage. The transportation possibility determination device according to any one of claims 1 to 3.

7. A transportation feasibility determination method for determining whether or not a baggage can be transported by a train capable of transporting mixed cargo and passengers with a fixed train schedule, comprising: Setting baggage conditions regarding origin and destination stations and times for each baggage; setting a judgment score for each of the packages; creating, using a predetermined optimization calculation, a judgment transportation plan in which the luggage is individually assigned to one of the trains, the judgment transportation plan satisfying the train loading conditions and the luggage conditions related to the transportable luggage volume determined for each of the trains, and the sum of the judgment scores of the luggage for which assignment has been completed satisfies a predetermined optimization condition; determining whether all of the packages can be transported based on the results of the optimization calculation; A method for determining whether or not transportation is possible, including:

Images