Manufacturing task allocation method and device for multimodal transport under multi-factor constraints
By acquiring and decomposing order requirements, calculating task costs, and optimizing resource allocation using genetic algorithms, the problems of low resource allocation efficiency and unreasonable allocation in the existing technology are solved, and the rational allocation of resources and the improvement of manufacturing process efficiency are achieved.
Patent Information
- Application Number
- CN202111346102.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-11-12
- Publication Date
- 2025-02-07
- Estimated Expiration
- 2041-11-12
AI Technical Summary
Under the constraints of multiple factors, it is difficult for the existing technology to consider the optimization of manufacturing task resource allocation from a coordinated and global perspective, resulting in low resource allocation efficiency and unreasonable allocation of service resources.
By obtaining order requirements, decomposing them into multiple task requirements, calculating the time and economic costs of each task, optimizing the total time and economic costs, and using genetic algorithms to optimize resource allocation.
The comprehensive and coordinated optimization of resource allocation has been achieved, which reduces the idleness or shortage of resources, and reasonably allocates service resources, and improves the efficiency of the overall process of manufacturing resource allocation.
Smart Images

Figure CN114254861B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of resource allocation, and in particular to a method and device for allocating manufacturing tasks for multimodal transport under multi-factor constraints. Background Art
[0002] Some domestic manufacturing companies need to purchase domestic semi-finished products (also known as loose parts) for processing when setting up factories overseas. After connecting with overseas sales demand, they convert it into domestic purchase orders, purchase raw materials and carry out production and processing, and transport all orders to foreign countries through the logistics network through ports and shipping companies. Finally, they complete the payment through a specific settlement center to achieve a closed business loop. This process includes procurement, production and processing, warehousing, transshipment, financial settlement and other links. Selecting appropriate manufacturing service resources for manufacturing tasks in different links is a resource allocation issue.
[0003] At present, resource allocation is mainly completed through manual calculation in the market. Although it can be optimized to a certain extent, from the perspective of the overall manufacturing environment, the problem of manufacturing task resource allocation has the characteristics of heterogeneity of manufacturing service resources and complexity of manufacturing service resource networks. It only relies on manual experience and it is difficult to consider the optimization of resource allocation from a comprehensive perspective. Therefore, there are problems such as low efficiency in resource allocation and unreasonable allocation of service resources. Summary of the invention
[0004] In view of this, the present invention provides a method and device for multimodal transport manufacturing task allocation under multi-factor constraints, which solves the problem that it is difficult to consider the optimization of resource allocation from a comprehensive perspective, and thus there are problems such as low efficiency in task allocation and unreasonable allocation of service resources.
[0005] An embodiment of the present invention provides a method for allocating manufacturing tasks for multimodal transport under multi-factor constraints, including: obtaining order requirements, decomposing the order requirements into multiple task requirements; obtaining the time cost and economic cost of completing each task based on the task requirements; obtaining the total time cost and total economic cost of completing the order based on the time cost and the economic cost of all tasks; optimizing the time cost and the economic cost of each task and the total time cost and the total economic cost of the order to perform resource allocation.
[0006] In one embodiment, the task requirements include: at least one of a procurement task, a production and processing task, a warehousing task, a transshipment task and a settlement task.
[0007] In one embodiment, the time cost includes at least one of: procurement time, production time, warehousing time, transit time, and financial service time.
[0008] In one embodiment, the economic cost includes at least one of: procurement cost, production cost, warehousing cost, transportation cost, and financial service cost.
[0009] In one embodiment, the step of obtaining the total time cost and total economic cost of completing an order based on the time cost and the economic cost of all tasks includes: based on the time cost and the economic cost of all tasks, obtaining the total time cost and total economic cost of completing an order under the constraints of a collaborative relationship.
[0010] In one embodiment, the collaborative relationship includes at least one of a geographical collaborative relationship and a temporal collaborative relationship.
[0011] In one embodiment, the step of optimizing the time cost and the economic cost of each task and the total time cost and the total economic cost of an order includes: optimizing the time cost and the economic cost of each task and the total time cost and the total economic cost of an order using a genetic algorithm.
[0012] A manufacturing task allocation device for multimodal transport under multi-factor constraints, comprising: an acquisition module, used to acquire order requirements and decompose the order requirements into multiple task requirements; a calculation module, used to obtain the time cost and economic cost of completing each task based on the task requirements; based on the time cost and economic cost of all tasks, obtain the total time cost and total economic cost of completing the order; an optimization module, used to optimize the time cost and economic cost of each task and the total time cost and total economic cost of the order to perform resource allocation.
[0013] An electronic device comprises a memory and a processor, wherein the memory is used to store one or more computer instructions, wherein the one or more computer instructions, when executed by the processor, implement the manufacturing task allocation method for multimodal transport under multi-factor constraints described in any one of the above embodiments.
[0014] A computer-readable storage medium having a computer program stored therein, wherein the computer program, when executed by a processor, is used to implement the method for allocating manufacturing tasks for multimodal transport under multi-factor constraints as described in any one of the above embodiments.
[0015] The embodiment of the present invention provides a method and device for allocating manufacturing tasks for multimodal transport under multi-factor constraints. From the perspective of system engineering, it takes into account the service resources involved in the entire supply chain, performs a one-to-one combination optimization of these services and their corresponding tasks, achieves the purpose of comprehensive and coordinated optimization of resource allocation, reduces the phenomenon of idle resources or resource shortages, enables service resources to be reasonably allocated, and improves the efficiency of the overall process of manufacturing resource allocation. BRIEF DESCRIPTION OF THE DRAWINGS
[0016] Figure 1 The figure shows a flow chart of a method for allocating manufacturing tasks for multimodal transport under multi-factor constraints provided by an embodiment of the present invention.
[0017] Figure 2 It is a schematic diagram of a manufacturing task allocation method for multimodal transport under multi-factor constraints provided by an embodiment of the present invention.
[0018] Figure 3 It is a schematic structural diagram of a manufacturing task allocation device for multimodal transport under multi-factor constraints provided by one embodiment of the present invention. DETAILED DESCRIPTION
[0019] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0020] This embodiment provides a method for allocating manufacturing tasks for multimodal transport under multi-factor constraints, such as Figure 1 and Figure 2 The method for allocating manufacturing tasks for multimodal transport under the multi-factor constraints includes:
[0021] Step 01: Obtain order requirements and decompose the order requirements into multiple task requirements.
[0022] Optionally, the order is decomposed into five links of procurement, production and processing, warehousing, transshipment and settlement services to obtain task requirements, which include: procurement tasks, production and processing tasks, warehousing tasks, transshipment tasks and settlement tasks.
[0023] Step 02: Based on the task requirements, the time cost and economic cost of completing each task are obtained.
[0024] It is composed of the total time consumed and the total cost incurred by supplier services, production services, warehousing services and large or small ship services involved in the five links of procurement, production and processing, warehousing, transshipment and settlement services. Optionally, the time consumed by large or small ship services is the time the large or small ship is in port, which is composed of the sum of the difference between the actual departure time and the start time of the operation of the large or small ship at the port. The cost incurred by large or small ship services is the total cost of large or small ship services, which is composed of the sum of the product of the respective position price and the position quantity of the large or small ship. Financial services mainly consider two types of costs: one is the transaction cost of the selected financial institution, and the other is the impact of the exchange rate factor on the final cost at the time of settlement.
[0025] Optionally, the time cost includes at least one of: procurement time, production time, warehousing time, transit time, and financial service time.
[0026] Optionally, the economic cost includes at least one of: procurement cost, production cost, warehousing cost, transportation cost, and financial service cost.
[0027] The calculation process of the above time cost and economic cost will be explained below:
[0028] (1) Procurement tasks:
[0029]
[0030]
[0031] Formula (1) is the purchase time, Indicates that at the kth ij The purchase start time of the supplier, Indicates the kth ij The arrival time of the goods purchased from suppliers, is a decision variable, 1 means selecting the kth ij suppliers, 0 means no selection; Formula (2) is the procurement cost, Indicates the kth ij The unit material procurement cost of each supplier, Indicates that at the kth ij The material purchase quantity from the supplier.
[0032] (2) Production and processing tasks:
[0033]
[0034]
[0035] Formula (3) is the production time, Indicates that at the kth ij The waiting time required for production at each production base, Indicates the kth ij The service time required for production at each production base, is a decision variable, 1 means selecting the kth ij production bases, 0 means no selection; Formula (4) is the production cost, Indicates the kth ij The unit production cost of each production base, Indicates that at the kth ij Production quantity per production base.
[0036] (3) Warehousing tasks:
[0037]
[0038]
[0039]
[0040]
[0041] Formula (5) is the storage time, T SM (k ij ) indicates that the material is in the kth ij The storage time of a warehouse, T SP (k ij ) means the finished product is at the kth ij The storage time of a warehouse; Formula (6) is the material storage time, Indicates that at the kth ij The production start time of each production base, Indicates the kth ij The time for the goods to arrive from suppliers; Formula (7) is the storage time for finished products. Indicates the time when the large ship starts operating in the port. Indicates that at the kth ij The production end time of the production base; Formula (8) represents the storage cost, Indicates the material k ij The storage space required for a warehouse, Indicates that the finished product is at the kth ij The storage space required for a warehouse, Indicates the kth ij The storage cost of each warehouse unit material or finished product, is a decision variable, 1 means selecting the kth ij warehouses, 0 means no selection.
[0042] (4)Transfer mission:
[0043] Large ship service:
[0044]
[0045]
[0046]
[0047]
[0048] Formula (9) is the time the large ship is in port, Indicates the actual departure time of the ship at the port. Indicates the time when the large ship starts operating in the port. is a decision variable, 1 means selecting the kth ij The large ship service in the time period is 0, which means it is not selected. Formula (10) is the large ship service cost, C VT (k ij ) represents the transportation cost from warehouse or inland port to large ship port, C VB (k ij ) represents the booking cost of a large ship; Formula (11) is the transportation cost from a warehouse or inland port to a large ship port, c VT represents the unit distance transportation cost from the warehouse or inland port to the large ship port, d is a constant, representing the Euclidean distance between the warehouse and the port; Formula (12) represents the large ship booking cost, Indicates the kth ij The price of the large ship position in the time period, Indicates that at the kth ij The number of large vessel positions in a time period.
[0049] Boat service:
[0050]
[0051]
[0052]
[0053]
[0054] Formula (13) is the time the boat is in port, Indicates the actual departure time of the boat at the port, Indicates the time when the boat starts operating in the port. is a decision variable, 1 means selecting the kth ij The boat service in the time period is 0, which means it is not selected. Formula (14) is the boat service cost, C BT (k ij ) represents the transportation cost from the warehouse to the inland port, C BB (k ij) represents the booking cost of a small boat; Formula (15) is the transportation cost from the warehouse to the inland port, c BT represents the unit distance transportation cost from the warehouse to the inland port, d is a constant, representing the Euclidean distance between the warehouse and the port; Formula (16) represents the small boat booking cost, Indicates the kth ij The price of the small boat position in the time period, Indicates that at the kth ij The number of small boat positions during the time period.
[0055] (5) Financial tasks:
[0056]
[0057]
[0058] Formula (17) is the financial service time, T FI (k ij ) indicates the service hours of financial institutions, is a decision variable, 1 means selecting the kth ij The financial institution of the family, 0 means no choice; Formula (18) is the cost of financial services, C FI (k ij ) represents the service cost of financial institutions.
[0059] Step 03: Based on the time cost and the economic cost of all tasks, the total time cost and the total economic cost of completing the order are obtained.
[0060] The formula for obtaining the total time cost and total economic cost of completing an order based on the time cost and the economic cost of all tasks is:
[0061] minF=ω1T+ω2C (19)
[0062] T=T P +T M +T S +T V +T B +T F (20)
[0063] C=C P +C M +C S +C V +C B +C F (twenty one)
[0064] Among them, formula (19) is the objective function, T represents the total time, C represents the total cost, ω1 and ω2 represent the weights of time and cost respectively; formula (20) is the total time function, T P , T M , T S , T V , T B , T F They represent procurement time, production time, storage time, large ship transportation time, small ship transportation time, and financial service time respectively; Formula (21) is the total cost function, C P , C M , C S , C V , C B , C F They respectively represent procurement cost, production cost, warehousing cost, large ship transportation cost, small ship transportation cost, and financial service cost.
[0065] Step 04: Optimize the time cost and the economic cost of each task, and the total time cost and the total economic cost of the order, so that the objective function in Formula 19 obtains the minimum value of the weighted sum of time and cost to perform optimal resource allocation.
[0066] Optionally, a genetic algorithm is used to optimize the time cost and the economic cost of each task, and the total time cost and the total economic cost of an order, so as to obtain an optimal resource allocation method. A genetic algorithm is a method that simulates the biological evolution mechanism in nature to perform random global search and optimization on the solution of a problem. Each chromosome in a genetic algorithm corresponds to a solution. The fitness function is used to evaluate the adaptability of the solution to determine the pros and cons of the solution. A genetic algorithm is a process of seeking the optimal solution through continuous search and optimization.
[0067] In one embodiment of the present invention, based on the time cost and the economic cost of all tasks, the total time cost and the total economic cost of completing the order are obtained under the constraints of the collaborative relationship.
[0068] The synergistic relationship can be expressed as:
[0069] T≤T max (twenty two)
[0070] C≤C max (twenty three)
[0071] RS=0 (24)
[0072] TS≤g (25)
[0073]
[0074] Formula (22) is a time constraint, which means that the actual completion time of the manufacturing task cannot exceed the latest completion time; Formula (23) is a cost constraint, which means that the total cost cannot exceed the estimated maximum cost; Formula (24) is a geographical coordination constraint, which means that the production base and the warehouse belong to the same place; Formula (25) means that the meaningless time in the two processes from the arrival of purchased materials to the start of production and from the end of production to transportation to Brazil is less than a constraint value; Formula (26) means that each manufacturing task can only be completed by one manufacturing service.
[0075] Optionally, the collaborative relationship includes: at least one of a geographical collaborative relationship and a temporal collaborative relationship.
[0076] The calculation formula of the regional synergy relationship and the temporal synergy relationship based on the quantification of the synergy relationship is:
[0077] (1) Regional collaboration
[0078]
[0079]
[0080] Production capacity services and warehousing capacity services need to be selected in the same region.
[0081] (2) Time coordination
[0082]
[0083] The storage time of materials and finished products in the warehouse has a great impact on inventory costs. Reducing the retention time of raw materials and finished products in the warehouse can save costs to a great extent. This means that the time for purchasing materials, production time and transportation time need to maintain a high degree of coordination. The time difference between the time of purchase arrival and the time of starting production, and the time between the end of production and the start of transportation is meaningless time. The smaller the meaningless time, the lower the cost of occupying the warehouse.
[0084] This embodiment provides a manufacturing task allocation device 100 for multimodal transport under multi-factor constraints. Figure 3 As shown, the manufacturing task allocation device 100 for multimodal transport under multi-factor constraints includes an acquisition module 10, a calculation module 20 and an optimization module 30.
[0085] The acquisition module 10 is used to acquire order requirements and decompose the order requirements into multiple task requirements;
[0086] The calculation module 20 is used to obtain the time cost and economic cost of completing each task based on the task requirements; and obtain the total time cost and total economic cost of completing the order based on the time cost and economic cost of all tasks;
[0087] The optimization module 30 is used to optimize the time cost and the economic cost of each task, and the total time cost and the total economic cost of an order, so as to perform resource allocation.
[0088] After the acquisition module 10 acquires the order demand, it decomposes the order demand into multiple task demands. Optionally, the task demand includes: at least one of: procurement tasks, production and processing tasks, warehousing tasks, transshipment tasks and settlement tasks; then the calculation module 20 obtains the time cost and economic cost of completing each task based on the task demand, and obtains the total time cost and total economic cost of completing the order based on the time cost and the economic cost of all tasks; thereafter, the optimization module 30 optimizes the time cost and the economic cost of each task, and the total time cost and the total economic cost of the order to perform resource allocation, and optionally, uses a genetic algorithm to optimize the time cost and the economic cost of each task, and the total time cost and the total economic cost of the order.
[0089] In addition, the calculation module 20 obtains the total time cost and total economic cost of completing the order based on the time cost and the economic cost of all tasks under the constraint of the collaborative relationship. Optionally, the collaborative relationship includes: at least one of a geographical collaborative relationship and a temporal collaborative relationship.
[0090] In this embodiment, the time cost and the economic cost of all tasks, the total time cost and the total economic cost of completing an order, and the calculation of collaborative relationships are the same as those described in the above embodiments and will not be repeated here.
[0091] The present embodiment provides an electronic device. The present embodiment provides an electronic device. The electronic device may include a memory and a processor. A computer program is stored in the memory. When the computer program is executed by the processor, the method for allocating manufacturing tasks for multimodal transport under multi-factor constraints as described in the above embodiment is implemented. It can be understood that the electronic device may also include an input / output (I / O) interface and a communication component.
[0092] The processor is used to execute all or part of the steps in the method for allocating manufacturing tasks for multimodal transport under multi-factor constraints in the embodiment. The memory is used to store various types of data, which may include instructions of any application or method in the electronic device, as well as data related to the application.
[0093] The processor can be an application specific integrated circuit (ASIC), a digital signal processor (DSP), a programmable logic device (PLD), a field programmable gate array (FPGA), a controller, a microcontroller, a microprocessor or other electronic components to execute the manufacturing task allocation method for multimodal transport under the multi-factor constraints in the above-mentioned embodiment.
[0094] The memory can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic storage, flash memory, magnetic disk or optical disk.
[0095] This embodiment also provides a computer-readable storage medium. Each functional unit in each embodiment of the present invention may be integrated into a processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. If the function is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a computer-readable storage medium.
[0096] Based on such understanding, the technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention.
[0097] The aforementioned storage media include: flash memory, hard disk, multimedia card, card-type memory (for example, SD or DX memory, etc.), random access memory (RAM), static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, disk, optical disk, server, APP application mall, etc. Various media that can store program check codes, on which a computer program is stored, and when the computer program is executed by a processor, the following method steps can be implemented:
[0098] Step 01: Obtain order requirements and decompose the order requirements into multiple task requirements;
[0099] Step 02: Obtain the time cost and economic cost of completing each task based on the task requirements;
[0100] Step 03: Obtain the total time cost and total economic cost of completing the order based on the time cost and the economic cost of all tasks;
[0101] Step 04: Optimize the time cost and the economic cost of each task, and the total time cost and the total economic cost of the order to perform resource allocation.
[0102] The specific implementation methods and the effects produced can be referred to the above embodiments, and the present invention will not be described in detail here.
[0103] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention. Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working process of the above-described system, device and unit can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.
[0104] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms. The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the scheme of this embodiment.
[0105] The basic principles of the present application are described above in conjunction with specific embodiments. However, it should be noted that the advantages, strengths, effects, etc. mentioned in the present application are only examples and not limitations, and it cannot be considered that these advantages, strengths, effects, etc. are required by each embodiment of the present application. In addition, the specific details disclosed above are only for the purpose of illustration and ease of understanding, not for limitation, and the above details do not limit the present application to being implemented by adopting the above specific details.
[0106] The block diagrams of devices, apparatuses, equipment, and systems involved in this application are only illustrative examples and are not intended to require or imply that they must be connected, arranged, or configured in the manner shown in the block diagrams. As will be appreciated by those skilled in the art, these devices, apparatuses, equipment, and systems may be connected, arranged, or configured in any manner.
[0107] It should also be noted that in the apparatus, device and method of the present application, each component or each step can be decomposed and / or recombined. Such decomposition and / or recombination should be regarded as equivalent solutions of the present application.
[0108] The above description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present application. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects without departing from the scope of the present application. Therefore, the present application is not intended to be limited to the aspects shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.
[0109] In the description of the application, the meaning of "multiple" is at least two, for example, two, three, etc., unless otherwise clearly and specifically limited. In the embodiment of the present application, all directional indications (such as up, down, left, right, front, back, top, bottom ...) are only used to explain the relative position relationship, motion conditions, etc. between the components under a certain specific posture (as shown in the drawings). If the specific posture changes, the directional indication also changes accordingly. In addition, the terms "including" and "having" and any of their deformations are intended to cover non-exclusive inclusions. For example, the process, method, system, product or equipment comprising a series of steps or units are not limited to the steps or units listed, but optionally also include the steps or units not listed, or optionally also include other steps or units inherent to these processes, methods, products or equipment.
[0110] In addition, the reference to "embodiment" herein means that a particular feature, structure, or characteristic described in conjunction with the embodiment may be included in at least one embodiment of the present application. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.
[0111] The above is only a specific implementation of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims. The above is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention.
Claims
1. A manufacturing task allocation method for multimodal transport under multi-factor constraints, characterized in that: include: Obtaining order requirements, and decomposing the order requirements into multiple task requirements; Based on the task requirements, the time cost and economic cost of completing each task are obtained; Obtaining the total time cost and total economic cost of completing the order based on the time cost and the economic cost of all tasks; Optimize the time cost and the economic cost of each task, the total time cost and the total economic cost of the order, and obtain the minimum value of the weighted sum of time and cost to perform optimal resource allocation; the time cost includes: procurement time, production time, warehousing time, transportation time, and financial service time; the economic cost includes: procurement cost, production cost, warehousing cost, transportation cost, and financial service cost; The procurement time and the procurement cost are calculated by the following relationship: ; ; In the formula, For purchasing time, is a decision variable, 1 means choosing suppliers, 0 means no selection, Indicated in The purchase start time of the supplier, For the The arrival time of purchases from suppliers; For the purchase cost, For the The material procurement cost of suppliers, For the The material purchase quantity from suppliers; The production time and the production cost are calculated by the following relationship: ; ; In the formula, For production time, is a decision variable, 1 means choosing Production bases, 0 means no selection, Indicated in The waiting time required for production at each production base, For the The service time required for production at each production base; For production costs, For the The unit production cost of each production base, For the Production quantity per production base; The storage time and the storage cost are calculated by the following relationship: ; ; ; ; In the formula, For storage time, is a decision variable, 1 means choosing warehouses, 0 means no selection, Indicates that the material is in Storage time of warehouses, For the finished product Storage time in each warehouse; is the material storage time, For the The production start time of each production base, For the The arrival time of the purchased goods from the supplier, The storage time of finished products. The time when the large ship starts operating in the port. For the The production end time of each production base, For storage costs, For material The storage space required for a warehouse, For the finished product The storage space required for a warehouse, For the The storage cost of each warehouse unit of material or finished product; The transit time and the transit cost are calculated by the following relationship: ; ; ; ; In the formula, The time the ship is in port. is the actual departure time of the ship at the port, The time when the large ship starts operating in the port. is a decision variable, 1 means choosing The large ship service in the time period, 0 means not selected; Cost of serving large ships, The transportation cost from the warehouse or inland port to the large ship port, the cost of booking space for a large vessel; The transportation cost from the warehouse or inland port to the large ship port, is the unit distance transportation cost from the warehouse or inland port to the large ship port, d is a constant, which represents the Euclidean distance between the warehouse and the port; Indicates the cost of booking a large ship. For the The price of the large ship position in the time period, Indicated in The number of large vessel positions in the time period; ; ; ; ; In the formula, For the time the boat is in port, is the actual departure time of the boat at the port, The time when the boat starts to operate in the port. is a decision variable, 1 means choosing The boat service during the time period, 0 means not selected; Cost of servicing the boat, is the transportation cost from the warehouse to the inland port, the cost of booking a boat; is the transportation cost from the warehouse to the inland port, is the unit distance transportation cost from the warehouse to the inland port, d is a constant, representing the Euclidean distance between the warehouse and the port; represents the booking cost of a small boat, For the The price of the small boat position in the time period, Indicated in The number of small boat positions in the time period; Financial time and financial cost are calculated by the following relationship: ; ; In the formula, For financial services time, Service hours for financial institutions, is a decision variable, 1 means choosing The financial institution of the home, 0 means no selection; For financial service costs, Cost of servicing financial institutions; The total time cost and total economic cost of completing an order based on the time cost and the economic cost of all tasks are calculated by the following relationship: ; ; ; In the formula, T represents the total time, C represents the total cost, and are the weights of time and cost respectively; For purchasing time, For production time, For storage time, For the shipping time of large ships, For boat transit time, Time for financial services; For the purchase cost, For production costs, For storage costs, For the shipping cost, For boat transportation costs, The cost of financial services.
2. The manufacturing task allocation method for multimodal transport under multi-factor constraints according to claim 1 is characterized in that: The task requirements include: procurement tasks, production and processing tasks, warehousing tasks, transshipment tasks and settlement tasks.
3. The manufacturing task allocation method for multimodal transport under multi-factor constraints according to claim 1 is characterized in that: The step of obtaining the total time cost and the total economic cost of completing the order based on the time cost and the economic cost of all tasks comprises: Based on the time cost and the economic cost of all tasks, the total time cost and the total economic cost of completing the order are obtained under the constraints of the collaborative relationship.
4. The manufacturing task allocation method for multimodal transport under multi-factor constraints according to claim 3 is characterized in that: The collaborative relationship includes: at least one of a geographical collaborative relationship and a temporal collaborative relationship.
5. The manufacturing task allocation method for multimodal transport under multi-factor constraints according to claim 1 is characterized in that: The step of optimizing the time cost and the economic cost of each task and the total time cost and the total economic cost of an order comprises: A genetic algorithm is used to optimize the time cost and the economic cost of each task, and the total time cost and the total economic cost of an order.
6. A manufacturing task allocation device for multimodal transport under multi-factor constraints, characterized in that: include: An acquisition module, used to acquire order requirements and decompose the order requirements into multiple task requirements; A calculation module, used to obtain the time cost and economic cost of completing each task based on the task requirements; Obtaining the total time cost and total economic cost of completing the order based on the time cost and the economic cost of all tasks; An optimization module is used to optimize the time cost and the economic cost of each task, the total time cost and the total economic cost of an order, and obtain a minimum value of the weighted sum of time and cost to perform optimal resource allocation; the time cost includes: procurement time, production time, warehousing time, transit time, and financial service time; the economic cost includes: procurement cost, production cost, warehousing cost, transit cost, and financial service cost; The procurement time and the procurement cost are calculated by the following relationship: ; ; In the formula, For purchasing time, is a decision variable, 1 means choosing suppliers, 0 means no selection, Indicated in The purchase start time of the supplier, For the The arrival time of purchases from suppliers; For the purchase cost, For the The material procurement cost of suppliers, For the The material purchase quantity from suppliers; The production time and the production cost are calculated by the following relationship: ; ; In the formula, For production time, is a decision variable, 1 means choosing Production bases, 0 means no selection, Indicated in The waiting time required for production at each production base, For the The service time required for production at each production base; For production costs, For the The unit production cost of each production base, For the Production quantity per production base; The storage time and the storage cost are calculated by the following relationship: ; ; ; ; In the formula, For storage time, is a decision variable, 1 means choosing warehouses, 0 means no selection, Indicates that the material is in Storage time of warehouses, For the finished product Storage time in each warehouse; is the material storage time, For the The production start time of each production base, For the The arrival time of the goods purchased from suppliers, The storage time of finished products. The time when the large ship starts operating in the port. For the The production end time of each production base, For storage costs, For material The storage space required for a warehouse, For the finished product The storage space required for a warehouse, For the The storage cost of each warehouse unit of material or finished product; The transit time and the transit cost are calculated by the following relationship: ; ; ; ; In the formula, The time the ship is in port. is the actual departure time of the ship at the port, The time when the large ship starts operating in the port. is a decision variable, 1 means choosing The large ship service in the time period, 0 means not selected; Cost of serving large ships, The transportation cost from the warehouse or inland port to the large ship port, the cost of booking space for a large vessel; The transportation cost from the warehouse or inland port to the large ship port, is the unit distance transportation cost from the warehouse or inland port to the large ship port, d is a constant, which represents the Euclidean distance between the warehouse and the port; Indicates the cost of booking a large ship. For the The price of the large ship position in the time period, Indicated in The number of large vessel positions in the time period; ; ; ; ; In the formula, For the time the boat is in port, is the actual departure time of the boat at the port, The time when the boat starts to operate in the port. is a decision variable, 1 means choosing The boat service during the time period, 0 means not selected; Cost of servicing the boat, is the transportation cost from the warehouse to the inland port, the cost of booking a boat; is the transportation cost from the warehouse to the inland port, is the unit distance transportation cost from the warehouse to the inland port, d is a constant, representing the Euclidean distance between the warehouse and the port; represents the booking cost of a small boat, For the The price of the small boat position in the time period, Indicated in The number of small boat positions in the time period; Financial time and financial cost are calculated by the following relationship: ; ; In the formula, For financial services time, Service hours for financial institutions, is a decision variable, 1 means choosing The financial institution of the home, 0 means no selection; For financial service costs, Cost of servicing financial institutions; The total time cost and total economic cost of completing an order based on the time cost and the economic cost of all tasks are calculated by the following relationship: ; ; ; In the formula, T represents the total time, C represents the total cost, and are the weights of time and cost respectively; For purchasing time, For production time, For storage time, For the shipping time of large ships, For boat transit time, Time for financial services; For the purchase cost, For production costs, For storage costs, For the shipping cost, For boat transportation costs, The cost of financial services.
7. An electronic device, characterized in that: It includes a memory and a processor, wherein the memory is used to store one or more computer instructions, wherein when the one or more computer instructions are executed by the processor, the manufacturing task allocation method for multimodal transport under multi-factor constraints as described in any one of claims 1-5 is implemented.
8. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, which, when executed by a processor, is used to implement the method for allocating manufacturing tasks for multimodal transport under multi-factor constraints as described in any one of claims 1 to 5.
Citation Information
Patent Citations
Multi-layer integrated scheduling mechanism
CN110837918A