CN116108550B - BIM-based dynamic optimization method and system for multi-mode intermodal - Google Patents
BIM-based dynamic optimization method and system for multi-mode intermodal Download PDFInfo
- Publication number
- CN116108550B CN116108550B CN202310392412.3A CN202310392412A CN116108550B CN 116108550 B CN116108550 B CN 116108550B CN 202310392412 A CN202310392412 A CN 202310392412A CN 116108550 B CN116108550 B CN 116108550B
- Authority
- CN
- China
- Prior art keywords
- freight
- park
- model
- mechanical equipment
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/13—Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Geometry (AREA)
- Human Resources & Organizations (AREA)
- Evolutionary Computation (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Mathematical Analysis (AREA)
- Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Artificial Intelligence (AREA)
- Biomedical Technology (AREA)
- Biophysics (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- Pure & Applied Mathematics (AREA)
- Software Systems (AREA)
- Computational Mathematics (AREA)
- Structural Engineering (AREA)
- Development Economics (AREA)
- Civil Engineering (AREA)
- Game Theory and Decision Science (AREA)
- Architecture (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a dynamic optimization method and a system for multi-mode intermodal based on BIM, wherein the method comprises the following steps: acquiring equipment information of freight mechanical equipment, and modeling the freight mechanical equipment through BIM to generate a freight mechanical equipment model; acquiring park information of a freight park, modeling the freight park through BIM, and generating a freight park model, wherein the material properties, physical characteristics and constraint conditions of the freight park model are set; BIM simulation of the whole process of arriving at the container and sending the container is carried out according to the freight mechanical equipment model and the freight park model, time T required by transportation of multi-mode intermodal is generated, the fatigue limit times of the freight mechanical equipment are obtained according to the material properties of the freight mechanical equipment model, and the maintenance time required by the freight mechanical equipment is calculated according to the fatigue limit times; according to the modeling of the freight mechanical equipment and the freight park model, the optimal transportation route in the freight park is calculated by combining with an ant colony algorithm, a new heuristic function is set, and the ant colony algorithm is adjusted.
Description
Technical Field
The invention belongs to the technical field of BIM-based multi-connected transportation simulation, and particularly relates to a BIM-based dynamic optimization method and system for multi-connected transportation.
Background
The multi-type intermodal transportation is late in starting in China, relates to the connection and integration of various transportation modes and the management coordination among multiple departments, and has the situations of opaque information resources, incomplete resource utilization, insufficient connection among all processes and no maximum transport capacity of the multi-type intermodal transportation. Most of the conventional management of multi-mode intermodal is still in a bar management mode, namely carriers with different transportation modes are only responsible for the management work of a certain section of transportation in the multi-mode intermodal process, so that the conventional multi-mode intermodal project generally lacks a regulation mode for the whole period of the project, and as the multi-mode intermodal generally relates to at least two transportation modes, once the multi-mode intermodal process flow planning is insufficient in the early stage of the project, and a great amount of manpower and material resources are consumed for regulating the scheme of the multi-mode intermodal after the project construction is completed. BIM (Building Information Modeling), by establishing a BIM model related to multi-mode intermodal, a manager can effectively observe detailed information parameters of each link, calculate problems existing in the items in advance through simulation, find an optimal solution and improve the working efficiency of multi-mode intermodal.
Disclosure of Invention
In order to solve the technical problems, the invention provides a dynamic optimization method of multi-mode intermodal based on BIM, which comprises the following steps:
acquiring equipment information of the freight mechanical equipment, modeling the freight mechanical equipment through BIM, and generating a freight mechanical equipment model, wherein the model precision of the freight mechanical equipment model is a component level, and setting material properties, physical characteristics and constraint conditions of the freight mechanical equipment model;
acquiring park information of a freight park, modeling the freight park through BIM, and generating a freight park model, wherein the material properties, physical characteristics and constraint conditions of the freight park model are set;
according to a freight mechanical equipment model and a freight park model, BIM simulation of the whole process of arriving at a container and sending the container is carried out, time T required by transportation of multi-type intermodal transportation is generated, the fatigue limit times of the freight mechanical equipment are obtained according to the material properties of the freight mechanical equipment model, and the maintenance time required by the freight mechanical equipment is calculated according to the fatigue limit times, wherein the time T comprises unloading time, loading time and transportation time;
according to the modeling of the freight mechanical equipment and the freight park model, the optimal transportation route in the freight park is calculated by combining an ant colony algorithm, wherein a new heuristic function is set, and the ant colony algorithm is adjusted.
Further, the physical features of the cargo machinery model include: the speed, acceleration, point location and working range of the freight machinery equipment, and the constraint conditions of the freight machinery equipment model comprise: limit movement mileage and maximum rotation angle of the freight mechanical equipment;
the physical features of the freight park model include: the area, elevation and location of the production house, and the constraints of the freight park model include site red lines and building height limits.
Further, calculating the maintenance time required for the freight machine includes:
wherein: t is the running time of the freight mechanical equipment, N is the fatigue limit times of the freight mechanical equipment under the material property,is a safety factor.
Further, setting a new heuristic function includes: road traffic indexAnd the road passing difficulty coefficientAnd calculating the equivalent length of the container transportation path +.>According to equivalent length->Setting a new heuristic function ++>。
t is the time for the ant to move from node i to node j,for the road visibility influence coefficient from node i to node j, +.>An influence coefficient between trucks transporting containers from node i to node j;
For the current speed of a truck transporting containers in a freight park +.>The speed of the truck transporting the container when unobstructed in the freight park;
Equivalent length ofThe smaller the ant colony algorithm, the higher the heuristic, so that the optimal transportation route is selected.
Further, setting a new heuristic function includes:
wherein, the liquid crystal display device comprises a liquid crystal display device,for heuristic function ++>Is a weight coefficient>Distance from current node to target node, road traffic index->The value range of (2) is [0,1 ]]Road traffic difficulty coefficient->The value range of (2) is [0,1 ]]。
The invention also provides a dynamic optimization system of the multi-mode intermodal based on BIM, which comprises the following steps:
the equipment information acquisition module is used for acquiring equipment information of the freight mechanical equipment, modeling the freight mechanical equipment through BIM, generating a freight mechanical equipment model, wherein the model precision of the freight mechanical equipment model is a component level, and setting material properties, physical characteristics and constraint conditions of the freight mechanical equipment model;
the system comprises a park information acquisition module, a freight park information generation module and a freight park information generation module, wherein the park information acquisition module is used for acquiring park information of a freight park, modeling the freight park through BIM and generating a freight park model, and setting material properties, physical characteristics and constraint conditions of the freight park model;
the simulation module is used for carrying out BIM simulation of the whole process of arriving at the container and sending the container according to the freight mechanical equipment model and the freight park model, generating time T required by transportation of multi-type intermodal transportation, acquiring the fatigue limit times of the freight mechanical equipment according to the material properties of the freight mechanical equipment model, and calculating maintenance time required by the freight mechanical equipment according to the fatigue limit times, wherein the time T comprises unloading time, loading time and transportation time;
and the optimal transportation route calculation module is used for calculating an optimal transportation route in the freight park according to the modeling of the freight mechanical equipment and the freight park model and combining with an ant colony algorithm, wherein a new heuristic function is set, and the ant colony algorithm is adjusted.
Further, the physical features of the cargo machinery model include: the speed, acceleration, point location and working range of the freight machinery equipment, and the constraint conditions of the freight machinery equipment model comprise: limit movement mileage and maximum rotation angle of the freight mechanical equipment;
the physical features of the freight park model include: the area, elevation and location of the production house, and the constraints of the freight park model include site red lines and building height limits.
Further, calculating the maintenance time required for the freight machine includes:
wherein: t is the running time of the freight mechanical equipment, N is the fatigue limit times of the freight mechanical equipment under the material property,is a safety factor.
Further, setting a new heuristic function includes: road traffic indexAnd the road passing difficulty coefficientAnd calculating the equivalent length of the container transportation path +.>According to equivalent length->Setting a new heuristic function ++>。
In general, the above technical solutions conceived by the present invention have the following beneficial effects compared with the prior art:
the BIM technology is integrated into the process flow design optimization, the park construction optimization and the operation maintenance optimization of the multi-mode intermodal transportation, the multi-mode intermodal transportation process route, the park construction scheme and the later operation maintenance can be optimized at the beginning of the design, meanwhile, the multi-mode intermodal transportation park transportation path can be optimized through the ant colony algorithm, the advantages of the multi-mode intermodal transportation in the cargo transportation can be fully exerted, and the rapid development of the multi-mode intermodal transportation industry in China can be assisted.
Drawings
FIG. 1 is a flow chart of the method of embodiment 1 of the present invention;
fig. 2 is a block diagram of a system of embodiment 2 of the present invention.
Detailed Description
In order to better understand the above technical solutions, the following detailed description will be given with reference to the accompanying drawings and specific embodiments.
The method provided by the invention can be implemented in a terminal environment, wherein the terminal can comprise one or more of the following components: processor, storage medium, and display screen. Wherein the storage medium has stored therein at least one instruction that is loaded and executed by the processor to implement the method described in the embodiments below.
The processor may include one or more processing cores. The processor connects various parts within the overall terminal using various interfaces and lines, performs various functions of the terminal and processes data by executing or executing instructions, programs, code sets, or instruction sets stored in the storage medium, and invoking data stored in the storage medium.
The storage medium may include a random access Memory (Random Access Memory, RAM) or a Read-Only Memory (ROM). The storage medium may be used to store instructions, programs, code sets, or instructions.
The display screen is used for displaying a user interface of each application program.
In addition, it will be appreciated by those skilled in the art that the structure of the terminal described above is not limiting and that the terminal may include more or fewer components, or may combine certain components, or a different arrangement of components. For example, the terminal further includes components such as a radio frequency circuit, an input unit, a sensor, an audio circuit, a power supply, and the like, which are not described herein.
Example 1
As shown in fig. 1, an embodiment of the present invention provides a dynamic optimization method for multi-modal intermodal based on BIM, including:
specifically, the physical characteristics of the cargo machinery model include: the speed, acceleration, point location and working range of the freight machinery equipment, and the constraint conditions of the freight machinery equipment model comprise: limit range and maximum rotation angle of the freight machine.
specifically, the physical characteristics of the freight park model include: the area, elevation and location of the production house, and the constraints of the freight park model include site red lines and building height limits.
specifically, calculating the maintenance time required for the freight machine includes:
wherein: t is the running time of the freight mechanical equipment, N is the fatigue limit times of the freight mechanical equipment under the material property,is a safety factor.
Thus, the maintenance time of a cargo facility such as a crane is:
thus, the maintenance time for the discharge device, such as a dump platform, is:
thus, the repair and maintenance time for the transport device, such as the header card, is:
-loading time; />-discharge time; />-transport time, by grasping the maintenance time of the equipment to invoke the transport engagement of the alternative equipment model in time, guaranteeing the continuity of transport.
And 104, calculating the optimal transportation route in the freight park according to the modeling of the freight mechanical equipment and the freight park model by combining an ant colony algorithm, wherein a new heuristic function is set, and the ant colony algorithm is adjusted.
Specifically, according to the ant colony algorithm, the probability that the ant moves from the point i to the point j according to the pseudo-random proportion rule is as follows:
wherein the method comprises the steps ofFor information heuristic factors, the larger the value, the larger the probability of ant selection; />The influence degree of the heuristic information on the ant path in the motion process of the ants is reflected as a desired heuristic factor; />Representing the expected degree of ants from i to j as a heuristic function; />Represents a set of nodes that can be reached directly from node i to node j, but not accessed by ants, < ->Representing the pheromone amount.
Specifically, setting a new heuristic function includes: road traffic indexAnd the road passing difficulty coefficientAnd calculating the equivalent length of the container transportation path +.>According to equivalent length->Setting a new heuristic function ++>。
t is the time for the ant to move from node i to node j,for the road visibility influence coefficient from node i to node j, +.>An influence coefficient between trucks transporting containers from node i to node j;
For the current speed of a truck transporting containers in a freight park +.>The speed of the truck transporting the container when unobstructed in the freight park;
Equivalent length ofThe smaller the ant colony algorithm, the higher the heuristic, so that the optimal transportation route is selected.
Specifically, setting a new heuristic function may also be:
wherein, the liquid crystal display device comprises a liquid crystal display device,for heuristic function ++>Is a weight coefficient>For the distance of the current node to the target node, road traffic index +.>The value range of (2) is [0,1 ]]Road traffic difficulty coefficient->The value range of (2) is [0,1 ]]。
Example 2
As shown in fig. 2, the embodiment of the present invention further provides a dynamic optimization system for multi-modal intermodal based on BIM, including:
the equipment information acquisition module is used for acquiring equipment information of the freight mechanical equipment, modeling the freight mechanical equipment through BIM, generating a freight mechanical equipment model, wherein the model precision of the freight mechanical equipment model is a component level, and setting material properties, physical characteristics and constraint conditions of the freight mechanical equipment model;
specifically, the physical characteristics of the cargo machinery model include: the speed, acceleration, point location and working range of the freight machinery equipment, and the constraint conditions of the freight machinery equipment model comprise: limit range and maximum rotation angle of the freight machine.
The system comprises a park information acquisition module, a freight park information generation module and a freight park information generation module, wherein the park information acquisition module is used for acquiring park information of a freight park, modeling the freight park through BIM and generating a freight park model, and setting material properties, physical characteristics and constraint conditions of the freight park model;
specifically, the physical characteristics of the freight park model include: the area, elevation and location of the production house, and the constraints of the freight park model include site red lines and building height limits.
The simulation module is used for carrying out BIM simulation of the whole process of arriving at the container and sending the container according to the freight mechanical equipment model and the freight park model, generating time T required by transportation of multi-type intermodal transportation, acquiring the fatigue limit times of the freight mechanical equipment according to the material properties of the freight mechanical equipment model, and calculating maintenance time required by the freight mechanical equipment according to the fatigue limit times, wherein the time T comprises unloading time, loading time and transportation time;
specifically, calculating the maintenance time required for the freight machine includes:
wherein: t is the running time of the freight mechanical equipment, N is the fatigue limit times of the freight mechanical equipment under the material property,is a safety factor.
Thus, the maintenance time of a cargo facility such as a crane is:
thus, the maintenance time for the discharge device, such as a dump platform, is:
thus, the repair and maintenance time for the transport device, such as the header card, is:
-loading time; />-discharge time; />-transport time, by grasping the maintenance time of the equipment to invoke the transport engagement of the alternative equipment model in time, guaranteeing the continuity of transport.
And the optimal transportation route calculation module is used for calculating an optimal transportation route in the freight park according to the modeling of the freight mechanical equipment and the freight park model and combining with an ant colony algorithm, wherein a new heuristic function is set, and the ant colony algorithm is adjusted.
Specifically, according to the ant colony algorithm, the probability that the ant moves from the point i to the point j according to the pseudo-random proportion rule is as follows:
wherein the method comprises the steps ofFor information heuristic factors, the larger the value, the larger the probability of ant selection; />The influence degree of the heuristic information on the ant path in the motion process of the ants is reflected as a desired heuristic factor; />Representing the expected degree of ants from i to j as a heuristic function; />Representing the set of nodes that can be reached directly from node i to node j, but not accessed by ants,representing the pheromone amount.
Specifically, setting a new heuristic function includes: road traffic indexAnd the road passing difficulty coefficientAnd calculating the equivalent length of the container transportation path +.>According to equivalent length->Setting a new heuristic function ++>。
t is the time for the ant to move from node i to node j,for the road visibility influence coefficient from node i to node j, +.>An influence coefficient between trucks transporting containers from node i to node j;
For the current speed of a truck transporting containers in a freight park +.>The speed of the truck transporting the container when unobstructed in the freight park;
Equivalent length ofThe smaller the ant colony algorithm, the higher the heuristic, so that the optimal transportation route is selected.
Specifically, setting a new heuristic function may also be:
wherein, the liquid crystal display device comprises a liquid crystal display device,for heuristic function ++>Is a weight coefficient>For the distance of the current node to the target node, road traffic index +.>The value range of (2) is [0,1 ]]Road traffic difficulty coefficient->The value range of (2) is [0,1 ]]。
Example 3
The embodiment of the invention also provides a storage medium which stores a plurality of instructions for realizing the BIM-based multi-mode intermodal dynamic optimization method.
Alternatively, in this embodiment, the storage medium may be located in any one of the computer terminals in the computer terminal group in the computer network, or in any one of the mobile terminals in the mobile terminal group.
Alternatively, in the present embodiment, the storage medium is configured to store program code for performing the steps of: step 101, acquiring equipment information of freight mechanical equipment, modeling the freight mechanical equipment through BIM, and generating a freight mechanical equipment model, wherein the model precision of the freight mechanical equipment model is a component level, and setting material properties, physical characteristics and constraint conditions of the freight mechanical equipment model;
specifically, the physical characteristics of the cargo machinery model include: the speed, acceleration, point location and working range of the freight machinery equipment, and the constraint conditions of the freight machinery equipment model comprise: limit range and maximum rotation angle of the freight machine.
specifically, the physical characteristics of the freight park model include: the area, elevation and location of the production house, and the constraints of the freight park model include site red lines and building height limits.
specifically, calculating the maintenance time required for the freight machine includes:
wherein: t is the running time of the freight mechanical equipment, N is the fatigue limit times of the freight mechanical equipment under the material property,is a safety factor.
Thus, the maintenance time of a cargo facility such as a crane is:
thus, the maintenance time for the discharge device, such as a dump platform, is:
thus, the repair and maintenance time for the transport device, such as the header card, is:
-loading time; />-discharge time; />-transport time, by grasping the maintenance time of the equipment to invoke the transport engagement of the alternative equipment model in time, guaranteeing the continuity of transport.
And 104, calculating the optimal transportation route in the freight park according to the modeling of the freight mechanical equipment and the freight park model by combining an ant colony algorithm, wherein a new heuristic function is set, and the ant colony algorithm is adjusted.
Specifically, according to the ant colony algorithm, the probability that the ant moves from the point i to the point j according to the pseudo-random proportion rule is as follows:
wherein the method comprises the steps ofFor information heuristic factors, the larger the value, the larger the probability of ant selection; />The influence degree of the heuristic information on the ant path in the motion process of the ants is reflected as a desired heuristic factor; />Representing the expected degree of ants from i to j as a heuristic function; />Represents a set of nodes that can be reached directly from node i to node j, but not accessed by ants, < ->Representing the pheromone amount.
Specifically, setting a new heuristic function includes: road traffic indexAnd the road passing difficulty coefficientAnd calculating the equivalent length of the container transportation path +.>According to equivalent length->Setting a new heuristic function ++>。
t is the time for the ant to move from node i to node j,for the road visibility influence coefficient from node i to node j, +.>An influence coefficient between trucks transporting containers from node i to node j;
For the current speed of a truck transporting containers in a freight park +.>The speed of the truck transporting the container when unobstructed in the freight park;
Equivalent length ofThe smaller the ant colony algorithm, the higher the heuristic, so that the optimal transportation route is selected.
Specifically, setting a new heuristic function may also be:
wherein, the liquid crystal display device comprises a liquid crystal display device,for heuristic function ++>Is a weight coefficient>For the distance of the current node to the target node, road traffic index +.>The value range of (2) is [0,1 ]]Road traffic difficulty coefficient->The value range of (2) is [0,1 ]]。
Example 4
The embodiment of the invention also provides electronic equipment, which comprises a processor and a storage medium connected with the processor, wherein the storage medium stores a plurality of instructions, and the instructions can be loaded and executed by the processor so that the processor can execute the BIM-based multi-mode intermodal dynamic optimization method.
Specifically, the electronic device of the present embodiment may be a computer terminal, and the computer terminal may include: one or more processors, and a storage medium.
The storage medium may be used to store a software program and a module, for example, a dynamic optimization method based on BIM multi-mode intermodal in the embodiment of the invention, and the processor executes various functional applications and data processing by running the software program and the module stored in the storage medium, namely, implements the dynamic optimization method based on BIM multi-mode intermodal. The storage medium may include a high-speed random access storage medium, and may also include a non-volatile storage medium, such as one or more magnetic storage systems, flash memory, or other non-volatile solid-state storage medium. In some examples, the storage medium may further include a storage medium remotely located with respect to the processor, and the remote storage medium may be connected to the terminal through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The processor may invoke the information stored in the storage medium and the application program via the transmission system to perform the following steps: step 101, acquiring equipment information of freight mechanical equipment, modeling the freight mechanical equipment through BIM, and generating a freight mechanical equipment model, wherein the model precision of the freight mechanical equipment model is a component level, and setting material properties, physical characteristics and constraint conditions of the freight mechanical equipment model;
specifically, the physical characteristics of the cargo machinery model include: the speed, acceleration, point location and working range of the freight machinery equipment, and the constraint conditions of the freight machinery equipment model comprise: limit range and maximum rotation angle of the freight machine.
specifically, the physical characteristics of the freight park model include: the area, elevation and location of the production house, and the constraints of the freight park model include site red lines and building height limits.
specifically, calculating the maintenance time required for the freight machine includes:
wherein: t is the running time of the freight mechanical equipment, N is the fatigue limit times of the freight mechanical equipment under the material property,is a safety factor.
Thus, the maintenance time of a cargo facility such as a crane is:
thus, the maintenance time for the discharge device, such as a dump platform, is:
thus, the repair and maintenance time for the transport device, such as the header card, is:
-loading time; />-discharge time; />-transport time, by grasping the maintenance time of the equipment to invoke the transport engagement of the alternative equipment model in time, guaranteeing the continuity of transport.
And 104, calculating the optimal transportation route in the freight park according to the modeling of the freight mechanical equipment and the freight park model by combining an ant colony algorithm, wherein a new heuristic function is set, and the ant colony algorithm is adjusted.
Specifically, according to the ant colony algorithm, the probability that the ant moves from the point i to the point j according to the pseudo-random proportion rule is as follows:
wherein the method comprises the steps ofFor information heuristic factors, the larger the value, the larger the probability of ant selection; />The influence degree of the heuristic information on the ant path in the motion process of the ants is reflected as a desired heuristic factor; />Representing the expected degree of ants from i to j as a heuristic function; />Represents a set of nodes that can be reached directly from node i to node j, but not accessed by ants, < ->Representing the pheromone amount.
Specifically, setting a new heuristic function includes: road traffic indexAnd the road passing difficulty coefficientAnd calculating the equivalent length of the container transportation path +.>According to equivalent length->Setting a new heuristic function ++>。
t is the time for the ant to move from node i to node j,for the road visibility influence coefficient from node i to node j, +.>An influence coefficient between trucks transporting containers from node i to node j;
For the current speed of a truck transporting containers in a freight park +.>The speed of the truck transporting the container when unobstructed in the freight park;
Equivalent length ofThe smaller the ant colony algorithm, the higher the heuristic, so that the optimal transportation route is selected.
Specifically, setting a new heuristic function may also be:
wherein, the liquid crystal display device comprises a liquid crystal display device,for heuristic function ++>Is a weight coefficient>For the distance of the current node to the target node, road traffic index +.>The value range of (2) is [0,1 ]]Road traffic difficulty coefficient->The value range of (2) is [0,1 ]]。
Example 5
The embodiment also provides an ant colony algorithm based on BIM, which realizes path optimization of the multi-mode intermodal transportation park, and comprises the following specific steps:
firstly, dividing a spatial structure of a park, and establishing a grid map composed of a node set N and a channel set A, wherein N represents a set of all nodes in the process of planning a multi-type intermodal route; channel set a is the geometric length of the path between the connecting nodes. Park space information is abstracted into a network model of M (N, A) composed of node geometry N and evacuation channel geometry A, wherein N= (N) 1 ,N 2 ,… ,N n ). White nodes are represented as normal nodes and black nodes are represented as obstacle nodes, such as a multi-modal arrangement point location in a campus, a non-destination job site, etc.
Each node information further comprises static information and dynamic information, wherein the static information is defined as coordinate information N (x, y) of a node in a two-dimensional space (taking a small left corner as an origin of coordinates) in a grid, the dynamic information is expressed as N (t, R), t is a time node, and R is the number of cards in the current node.
Channel set a= (a 11 ,A 12 ,```,A mn ) Wherein A is ij Representing a passable path from node i to node j, the static information of the path is defined as a (L ij ,G ij ),L ij Representing the geometric distance length of the channel, G ij Representing a traffic barrier coefficient on the channel during actual operation; the dynamic information of the channel is defined as a (t, R ij ,K ij ) Wherein R is ij Representing the influence coefficient K of the quantity of the transport vehicles on the channel at the moment t ij And representing the T moment and the road visibility influence coefficient.
In the ant colony algorithm, ants can select paths with stronger pheromones, but if all ants select paths with stronger pheromones, the algorithm falls into local optimum, the problem of local convergence can be prevented by adjusting the pheromones of the paths, and an ant colony algorithm pheromone updating formula is as follows:
wherein the method comprises the steps ofIs a pheromone volatile factor->For t time->Pheromone concentration of (2); />Representing the increment of pheromone on its channel; />An optimal evaluation value of the table path; due to->The value determines the searching capability and the convergence rate of the ant colony algorithm, so the patent adopts dynamic adjustment +.>Values to improve the pheromone update strategy are as follows:
after the optimal path is calculated, if the result has no obvious change after N iterations, the method reducesValues to increase the global search capability of the algorithm while setting +.>The minimum value range of the values is used for avoiding slow convergence speed caused by too low pheromone volatilization factors. The algorithm flow is as follows:
1) Initializing a grid environment of a park, establishing a map matrix, defining an initial node and an obstacle node, and initializing dynamic information and static information of the node and the channel;
2) Initializing variables such as the maximum iteration times of the algorithm, the number of vehicles, expected heuristic factors, pheromone volatilization factors, tabu tables and the like;
3) Calculating the equivalent length between nodes;
4) Judging the condition of the pre-selected node, judging whether the node is an obstacle or not, if not, carrying out the next step, if so, returning to the third step;
5) Searching the next node to be selected through a pseudo-random proportion rule, and putting in and updating a tabu table;
6) Judging whether the selected node is a destination, stopping if the selected node is found, and recording the route and the length selected in the iteration; if not, the flow goes to a third step;
7) The global pheromone is updated. Updating the concentration of the pheromone on each transportation path, and carrying out self-adaptive adjustment on the concentration of the pheromone in the algorithm;
8) Outputting the optimal path. Judging whether the maximum iteration times are met, and if the maximum iteration times are reached, outputting an optimal path planning chart; otherwise, the flow goes to the fourth step.
The foregoing embodiment numbers of the present invention are merely for the purpose of description, and do not represent the advantages or disadvantages of the embodiments.
In the foregoing embodiments of the present invention, the descriptions of the embodiments are emphasized, and for a portion of this disclosure that is not described in detail in this embodiment, reference is made to the related descriptions of other embodiments.
In the embodiments provided in the present invention, it should be understood that the disclosed technology may be implemented in other manners. The system embodiments described above are merely exemplary, and for example, the division of the units is merely a logic function division, and there may be another division manner in actual implementation, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some interfaces, units or modules, or may be in electrical or other forms.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied essentially or partly in the form of a software product or all or part of the technical solution, which is stored in a storage medium, and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a random access Memory (RAM, randomAccess Memory), a removable hard disk, a magnetic disk, or an optical disk, or the like, which can store program codes.
It is apparent that the above examples are given by way of illustration only and are not limiting of the embodiments. Other variations or modifications of the above teachings will be apparent to those of ordinary skill in the art. It is not necessary here nor is it exhaustive of all embodiments. While still being apparent from variations or modifications that may be made by those skilled in the art are within the scope of the invention.
Claims (5)
1. A method for dynamic optimization of multiple intermodal based on BIM, comprising:
acquiring equipment information of the freight mechanical equipment, modeling the freight mechanical equipment through BIM, and generating a freight mechanical equipment model, wherein the model precision of the freight mechanical equipment model is a component level, and setting material properties, physical characteristics and constraint conditions of the freight mechanical equipment model;
wherein the physical characteristics of the cargo machinery model include: the speed, acceleration, point location and working range of the freight machinery equipment, and the constraint conditions of the freight machinery equipment model comprise: limit movement mileage and maximum rotation angle of the freight mechanical equipment;
the physical features of the freight park model include: the area, elevation and position of the production house, and the constraint conditions of the freight park model comprise site red lines and building height limits;
acquiring park information of a freight park, modeling the freight park through BIM, and generating a freight park model, wherein the material properties, physical characteristics and constraint conditions of the freight park model are set;
according to a freight mechanical equipment model and a freight park model, BIM simulation of the whole process of arriving at a container and sending the container is carried out, time T required by transportation of multi-type intermodal transportation is generated, the fatigue limit times of the freight mechanical equipment are obtained according to the material properties of the freight mechanical equipment model, and the maintenance time required by the freight mechanical equipment is calculated according to the fatigue limit times, wherein the time T comprises unloading time, loading time and transportation time;
calculating an optimal transportation route in the freight park according to the modeling of the freight mechanical equipment and the freight park model and combining an ant colony algorithm, wherein a new heuristic function is set, the ant colony algorithm is adjusted,
wherein setting a new heuristic function comprises: road traffic indexAnd the traffic difficulty coefficient of the road->And calculating the equivalent length of the container transportation path +.>According to equivalent length->Setting a new heuristic function;
t is the time for the ant to move from node i to node j,for the road visibility influence coefficient from node i to node j, +.>An influence coefficient between trucks transporting containers from node i to node j;
For the current speed of a truck transporting containers in a freight park +.>The speed of the truck transporting the container when unobstructed in the freight park;
2. The method of dynamic optimization of BIM-based multi-modal intermodal as set forth in claim 1, wherein calculating the maintenance time required for the cargo machinery includes:
3. The method of dynamic optimization of BIM-based multi-modal intermodal as set forth in claim 1, wherein setting the new heuristic function includes:
wherein, the liquid crystal display device comprises a liquid crystal display device,for heuristic function ++>Is a weight coefficient>For the distance of the current node to the target node, road traffic index +.>The value range of (2) is [0,1 ]]Road traffic difficulty coefficient->The value range of (2) is [0,1 ]]。
4. A dynamic optimization system for BIM-based multi-modal intermodal, comprising:
the equipment information acquisition module is used for acquiring equipment information of the freight mechanical equipment, modeling the freight mechanical equipment through BIM, generating a freight mechanical equipment model, wherein the model precision of the freight mechanical equipment model is a component level, and setting material properties, physical characteristics and constraint conditions of the freight mechanical equipment model;
wherein the physical characteristics of the cargo machinery model include: the speed, acceleration, point location and working range of the freight machinery equipment, and the constraint conditions of the freight machinery equipment model comprise: limit movement mileage and maximum rotation angle of the freight mechanical equipment;
the physical features of the freight park model include: the area, elevation and position of the production house, and the constraint conditions of the freight park model comprise site red lines and building height limits;
the system comprises a park information acquisition module, a freight park information generation module and a freight park information generation module, wherein the park information acquisition module is used for acquiring park information of a freight park, modeling the freight park through BIM and generating a freight park model, and setting material properties, physical characteristics and constraint conditions of the freight park model;
the simulation module is used for carrying out BIM simulation of the whole process of arriving at the container and sending the container according to the freight mechanical equipment model and the freight park model, generating time T required by transportation of multi-type intermodal transportation, acquiring the fatigue limit times of the freight mechanical equipment according to the material properties of the freight mechanical equipment model, and calculating maintenance time required by the freight mechanical equipment according to the fatigue limit times, wherein the time T comprises unloading time, loading time and transportation time;
the optimal transportation route calculation module is used for calculating the optimal transportation route in the freight park according to the modeling of the freight mechanical equipment and the freight park model and combining with an ant colony algorithm, wherein a new heuristic function is set, the ant colony algorithm is adjusted,
wherein setting a new heuristic function comprises: road traffic indexAnd the traffic difficulty coefficient of the road->And calculating the equivalent length of the container transportation path +.>According to equivalent length->Setting a new heuristic function;
Setting a new heuristic function based on the equivalent length comprises:
t is the time for the ant to move from node i to node j,for the road visibility influence coefficient from node i to node j, +.>An influence coefficient between trucks transporting containers from node i to node j;
For the current speed of a truck transporting containers in a freight park +.>The speed of the truck transporting the container when unobstructed in the freight park;
5. The BIM-based dynamic optimization system of intermodal transportation of claim 4, wherein calculating the maintenance time required for the cargo machinery includes:
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310392412.3A CN116108550B (en) | 2023-04-13 | 2023-04-13 | BIM-based dynamic optimization method and system for multi-mode intermodal |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310392412.3A CN116108550B (en) | 2023-04-13 | 2023-04-13 | BIM-based dynamic optimization method and system for multi-mode intermodal |
Publications (2)
Publication Number | Publication Date |
---|---|
CN116108550A CN116108550A (en) | 2023-05-12 |
CN116108550B true CN116108550B (en) | 2023-06-27 |
Family
ID=86261977
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202310392412.3A Active CN116108550B (en) | 2023-04-13 | 2023-04-13 | BIM-based dynamic optimization method and system for multi-mode intermodal |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN116108550B (en) |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112633555A (en) * | 2020-11-30 | 2021-04-09 | 科技谷(厦门)信息技术有限公司 | Method and system for optimizing logistics transportation scheme |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR20040072250A (en) * | 2003-02-10 | 2004-08-18 | 삼성전자주식회사 | Material control system |
WO2014132802A1 (en) * | 2013-02-27 | 2014-09-04 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Method for providing route guide using building information modeling (bim) data, computer for providing route guide, and computer program therefor |
US9536192B2 (en) * | 2014-06-23 | 2017-01-03 | International Business Machines Corporation | Solving vehicle routing problems using evolutionary computing techniques |
US10502578B2 (en) * | 2017-06-14 | 2019-12-10 | The Chinese University Of Hong Kong | Methods and systems for efficient and timely transportation of heavy-duty trucks |
US11911911B2 (en) * | 2020-04-08 | 2024-02-27 | Smart Building Tech Co., Ltd. | Near-site robotic construction system and method for prefabrications of construction components |
US20210316459A1 (en) * | 2020-04-08 | 2021-10-14 | Smart Building Tech Co., Ltd. | Cloud based computer-implemented system and method for computer-assisted planning and simulation of robot motions in construction |
US20220156693A1 (en) * | 2020-11-17 | 2022-05-19 | Exel Inc. d/b/a DHL Supply Chain (USA) | Computerized system and method for developing optimized cargo transportation solutions |
CN113033885A (en) * | 2021-03-17 | 2021-06-25 | 长沙理工大学 | Multi-type intermodal transport path optimization method and system, storage medium and computer equipment |
CN113222520A (en) * | 2021-06-16 | 2021-08-06 | 江苏佳利达国际物流股份有限公司 | Ant colony algorithm-based goods optimized distribution method and system |
CN113393040B (en) * | 2021-06-18 | 2023-04-07 | 重庆邮电大学工业互联网研究院 | Industrial park logistics scheduling method and system based on game theory |
-
2023
- 2023-04-13 CN CN202310392412.3A patent/CN116108550B/en active Active
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112633555A (en) * | 2020-11-30 | 2021-04-09 | 科技谷(厦门)信息技术有限公司 | Method and system for optimizing logistics transportation scheme |
Also Published As
Publication number | Publication date |
---|---|
CN116108550A (en) | 2023-05-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107798423A (en) | Vehicle path planning Simulation Experimental Platform based on multi-intelligence algorithm | |
WO2023103243A1 (en) | Multi-way tree search-based multi-box type three-dimensional boxing optimization method and system | |
CN105373909A (en) | Logistics dispensing center addressing method based on simulation software | |
WO2023082728A1 (en) | Container loading task processing method and apparatus, and device | |
CN112785045A (en) | Stacking optimal configuration space method applying hybrid simulated annealing algorithm | |
CN116108550B (en) | BIM-based dynamic optimization method and system for multi-mode intermodal | |
CN111598324A (en) | Loading vehicle line optimization method, device, equipment and storage medium | |
CN116187611B (en) | Multi-agent path planning method and terminal | |
CN115705593A (en) | Logistics transportation method and device, computer equipment and storage medium | |
CN103167032B (en) | The indoor positioning background service system of map auxiliary | |
CN117113608A (en) | Cold-chain logistics network node layout method and equipment | |
CN110544019B (en) | Container cargo loading method and system for intelligent ship | |
CN112161630A (en) | AGV (automatic guided vehicle) online collision-free path planning method suitable for large-scale storage system | |
CN116681367A (en) | ULD intelligent board making method, system, equipment and medium | |
CN116151723A (en) | Multiple metering method and system for comprehensive grain reserve base | |
CN116523270A (en) | Logistics transportation task automatic scheduling method, equipment, server and medium | |
CN116481513A (en) | Map generation method and device and electronic equipment | |
CN113642156B (en) | Simulation modeling system of stacker vertical warehouse and application method thereof | |
CN111160831B (en) | Task generation method and device for intensive warehouse and electronic equipment | |
CN116167245B (en) | Multi-attribute transfer decision model-based multi-modal grain transportation method and system | |
CN110348791A (en) | A kind of dynamic crisscross inheritance algorithm applied to more AGV task schedules | |
Zhu et al. | Bi-level hybrid local search approach for three-dimensional loading problem with balancing constraints | |
CN115269763B (en) | Local point cloud map updating and maintaining method and device, mobile tool and storage medium | |
CN116451592B (en) | Extensible intelligent shelter layout optimization method | |
CN109146167B (en) | Method, device, system and storage medium for seeking shortest grain transportation path |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |