CN114372610A - Method for acquiring traffic flow transportation path of strip mine - Google Patents

Method for acquiring traffic flow transportation path of strip mine Download PDF

Info

Publication number
CN114372610A
CN114372610A CN202111507010.0A CN202111507010A CN114372610A CN 114372610 A CN114372610 A CN 114372610A CN 202111507010 A CN202111507010 A CN 202111507010A CN 114372610 A CN114372610 A CN 114372610A
Authority
CN
China
Prior art keywords
point
loading
unloading
truck
load
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.)
Pending
Application number
CN202111507010.0A
Other languages
Chinese (zh)
Inventor
赵明
王忠鑫
胥孝川
王金金
郭强
曾祥玉
辛凤阳
田凤亮
周浩
苏振宁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ccteg Shenyang Engineering Co ltd
Original Assignee
Ccteg Shenyang Engineering Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Ccteg Shenyang Engineering Co ltd filed Critical Ccteg Shenyang Engineering Co ltd
Priority to CN202111507010.0A priority Critical patent/CN114372610A/en
Publication of CN114372610A publication Critical patent/CN114372610A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • 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
    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06313—Resource planning in a project environment
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Game Theory and Decision Science (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biodiversity & Conservation Biology (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Traffic Control Systems (AREA)

Abstract

A method for obtaining a traffic flow transportation path of an open pit mine belongs to the field of truck transportation of the open pit mine. The method comprises the steps of obtaining basic data, establishing a traffic flow planning model, and obtaining the path distribution with the maximum total loading and unloading amount of the trucks in the path situation of multiple transportation of all the outgoing trucks between loading and unloading points in the working time.

Description

Method for acquiring traffic flow transportation path of strip mine
Technical Field
The invention belongs to the field of truck transportation of strip mines, and particularly relates to a method for acquiring a traffic flow transportation path of a strip mine.
Background
The transportation of ore rocks is one of the most important links in the open-pit mining process, the transportation cost generally accounts for 50-60% of the total production cost of the open-pit mines, and the transportation cost of part of deep and large open-pit mines accounts for more than 60%. The mining and stripping amount of the domestic main open pit coal mine is about 80 percent of the engineering amount of the completion of the transportation by a truck. At present, planning optimization is not considered in the process of truck transportation of an open-pit mine, and an established traffic flow planning model takes the transportation amount as a decision variable or takes the transportation times of trucks between loading and unloading points as the decision variable.
Disclosure of Invention
In view of the deficiencies of the prior art, it is an object of the present invention to provide a method of obtaining a traffic transport path for an open pit mine.
The technical scheme adopted by the invention is as follows: a method for acquiring a traffic flow transportation path of a strip mine is technically characterized by comprising the following steps:
acquiring basic data including the number of trucks, the number of loading points, the number of unloading points, the maximum loading and unloading times and the average loading capacity of the loading points; the average loading and unloading time of the trucks, the road distance between loading and unloading points, the average driving speed of the trucks, the working time, the number of stacking equipment at the loading points, the minimum and maximum loading and unloading amount of the loading and unloading points, the length of the trucks, the road parking sight distance between the loading and unloading points and the loading and unloading capacity of the loading and unloading points;
according to the acquired basic data, a traffic flow planning model is established, whether the trucks operate at loading and unloading points is taken as a decision variable, and the path distribution with the maximum total loading and unloading amount of the trucks in the path situation of multiple transportation of all the outgoing trucks between the loading and unloading points within the working time is acquired;
and the truck is transported according to the path with the maximum truck loading and unloading total amount obtained by the traffic flow planning model.
In the above solution, the objective function of the traffic flow planning model is as follows:
Figure BDA0003403528450000011
in the formula, Qi,jAverage load at load point j, m, for truck number i3；Xi,j,k,lThe truck with the number i runs from a loading point j to an unloading point k for the first time, and the value of the truck is 0 or 1 as a decision variable; i is the number of trucks; j is the number of loading points; k is the number of unloading points; l represents the maximum number of loading and unloading times;
in the above scheme, constraining the objective function includes:
(1) heavy load restriction, which limits the same truck to be transported at most once from a loading point to an unloading point at the same time, and the formula is as follows:
Figure BDA0003403528450000021
(2) no-load restraint:
(2.1) limiting the same truck to carry out no-load transportation at most once from the unloading point to the loading point at the same time, wherein the formula is as follows:
Figure BDA0003403528450000022
in the formula, Xi,k,j,lThe truck with the number i runs from the unloading point k to the loading point j for the first time, and the value is 0 or 1;
(2.2) the constraint limits the maximum times of heavy-load transportation of the truck to the unloading point and then does not return to the loading point, and the formula is as follows:
Figure BDA0003403528450000023
(3) the unloading point is restricted, and the same heavy load transportation end point and the no-load transportation starting point of the same truck are limited to be the same point; in the same way, the no-load constraint 2.2 is that the maximum number of times of no-load transportation of the constrained truck is 0, the value range of L is from L-1, the number of constraint conditions is reduced, and the formula is as follows:
Figure BDA0003403528450000024
(4) and (4) load point constraint, wherein the constraint limits the starting point of the current heavy load transportation and the terminal point of the last no-load transportation of the same truck to be the same point.
Figure BDA0003403528450000025
(5) And (3) constraint of working time:
(5.1) limiting the loading and unloading times of the truck to be not more than the working time, wherein the formula is as follows:
Figure BDA0003403528450000026
in the formula, Ti,jAverage load time (including waiting time), min at load point j for truck number i; s1 j,kIs the distance, km, of the road from the loading point j to the unloading point k; vj,kThe average driving speed of the truck is km/h from a loading point j to an unloading point k; t isxAverage truck off-load time (including waiting time), min; s1 k,jIs the distance of the road from the unloading point k to the loading point j, km; vk,jThe average driving speed of the truck is km/h from an unloading point k to a loading point j; t is working time h;
(5.2) limiting the loading times of the loading point not to exceed the working time, wherein the formula is as follows:
Figure BDA0003403528450000027
in the formula, NjStacking the number of devices for the loading point j;
(6) and (3) load capacity constraint, limiting the load capacity range of the truck at a loading point, and adopting the formula:
Figure BDA0003403528450000031
in the formula (I), the compound is shown in the specification,
Figure BDA0003403528450000032
at loading point j minimum load, ten thousand m3；
Figure BDA0003403528450000033
Maximum load at load point j, ten thousand m3；
(7) The unloading capacity is restrained, the unloading capacity range of the truck at an unloading point is limited, and the formula is as follows:
Figure BDA0003403528450000034
in the formula, Qk 1For unloading Point k minimum unloading amount, ten thousand m3；
Figure BDA0003403528450000035
For the maximum unloading capacity of unloading point k, ten thousand m3；
(8) And (4) constraint of loading and unloading times:
(8.1) limiting the heavy-load transportation of the truck which is moved last time to inevitably move the heavy-load transportation, wherein the formula is as follows:
Figure BDA0003403528450000036
(8.2) limiting the no-load transportation of the truck during the last time; in the same way, the no-load constraint 2.2 is that the maximum number of times of no-load transportation of the constrained truck is 0, the value range of L is from L-1, the number of constraint conditions is reduced, and the formula is as follows:
Figure BDA0003403528450000037
(9) and (3) traffic flow density constraint:
(9.1) limiting the safety distance requirement of the heavy-duty truck, wherein the formula is as follows:
Figure BDA0003403528450000038
in the formula, SiThe truck length of number i, m; s2 j,kIs the road parking sight distance m from the loading point j to the unloading point k;
(9.2) limiting the safe distance requirement of the unloaded truck, wherein the formula is as follows:
Figure BDA0003403528450000039
in the formula, S2 k，jIs the road parking sight distance m from the unloading point k to the loading point j;
(10) capability constraint
(10.1) limiting the single loading quantity of the loading points, wherein the formula is as follows:
Figure BDA00034035284500000310
in the formula, QjStacking capacity for loading point j, m3；
(10.2) limiting the number of single unloads of the unloading point, and the formula is as follows:
Figure BDA0003403528450000041
in the formula, QkFor the unloading point k unloading capacity, m3。
The invention has the beneficial effects that: the method for obtaining the traffic flow transportation path of the open pit mine comprises the steps of obtaining basic data, establishing a traffic flow planning model to obtain the path distribution with the maximum total loading and unloading amount of trucks in the path situation that all the outgoing trucks are transported among loading and unloading points for multiple times in the working time, and ensuring the maximum total loading and unloading amount of the trucks by using whether the trucks are operated among the loading and unloading points as double decision variables.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
Fig. 1 is a flow chart of a method of obtaining a traffic flow transportation path for a surface mine in an embodiment of the present invention.
Detailed Description
The above objects, features and advantages of the present invention will become more apparent from the following detailed description of the present invention when taken in conjunction with the accompanying drawings 1.
The invention discloses a method for acquiring a traffic flow transportation path of a strip mine, which is used for acquiring an optimal scheme for transporting a certain strip mine and comprises the following specific steps of:
step 1: and acquiring basic data. The number of trucks was 20, the number of loading points was 2, the number of unloading points was 2, and the maximum number of loading and unloading was selected as 20. The models of the outgoing trucks are uniform. The load handling point related variables are shown in table 1.
TABLE 1 Loading Point dependent variables
Figure BDA0003403528450000042
Figure BDA0003403528450000051
The average speed of the loading and unloading point truck can be selected as shown in table 2.
TABLE 2 average driving speed of truck
Figure BDA0003403528450000052
The road stopping sight distance between loading and unloading points can be selected according to the table 3.
TABLE 3 driving visual range
Figure BDA0003403528450000053
The data from tables 2-3 were selected and the correlation variables between load and unload points are shown in Table 4.
TABLE 4 correlation variables between Loading and unloading points
Figure BDA0003403528450000054
Among other variables, the working time was 8 hours and the truck length was 10.3 m.
Step 2: and establishing a traffic flow planning model, and taking whether the truck runs at the loading and unloading points as a decision variable to obtain a path with the maximum loading and unloading total amount of the truck in paths of multiple transportation of all the outgoing trucks between the loading and unloading points within the working time.
(1) The solution value of the objective function is that the total loading and unloading amount of the truck is maximum, and the formula is as follows:
Figure BDA0003403528450000055
in the formula, Qi,jAverage load at load point j, m, for truck number i3；Xi,j,k,lThe truck with the number i runs from a loading point j to an unloading point k for the first time, and the value of the truck is 0 or 1 as a decision variable; i is the number of trucks; j is the number of loading points; k is the number of unloading points; l represents the maximum number of loads and unloads.
(2) Heavy load restriction, which limits the same truck to be transported at most once from a loading point to an unloading point at the same time, and the formula is as follows:
Figure BDA0003403528450000056
(3) no load restraint
(3.1) limiting the same truck to carry out no-load transportation at most once from the unloading point to the loading point at the same time, wherein the formula is as follows:
Figure BDA0003403528450000061
in the formula, Xi,k,j,lThe first time the truck with number i is moving from the unloading point k to the loading point j, the value is 0 or 1.
(3.2) limiting the maximum times of heavy-load transportation of the truck to the unloading point and then not returning to the loading point, wherein the formula is as follows:
Figure BDA0003403528450000062
(4) constraint of unloading point
The constraint limits the same truck to be the same point at the same time of heavy-load transportation terminal and the same point at the same empty-load transportation starting point. (3) The no-load constraint (3.2) is that the maximum number of times of no-load transportation of the constrained truck is 0, the value range of L is from L-1, the number of constraint conditions is reduced, and the formula is as follows:
Figure BDA0003403528450000063
(5) and (3) restraining a loading point, limiting the starting point of the current heavy load transportation of the same truck and the terminal point of the last no-load transportation to be the same point, wherein the formula is as follows:
Figure BDA0003403528450000064
(6) operating time constraints
(6.1) limiting the loading and unloading times of the truck to be not more than the working time, wherein the formula is as follows:
Figure BDA0003403528450000065
in the formula, Ti,jAverage load time (including waiting time), min at load point j for truck number i; s1 j,kIs the distance, km, of the road from the loading point j to the unloading point k; vj,kThe average driving speed of the truck is km/h from a loading point j to an unloading point k; t isxAverage truck off-load time (including waiting time), min; s1 k,jIs the distance of the road from the unloading point k to the loading point j, km; vk,jThe average driving speed of the truck is km/h from an unloading point k to a loading point j; t is working time h.
(6.2) limiting the loading times of the loading point not to exceed the working time, wherein the formula is as follows:
Figure BDA0003403528450000066
in the formula, NjThe number of devices is stacked for the loading point j.
(7) And (3) load capacity constraint, limiting the load capacity range of the truck at a loading point, and adopting the formula:
Figure BDA0003403528450000071
in the formula (I), the compound is shown in the specification,
Figure BDA0003403528450000072
at loading point j minimum load, ten thousand m3；
Figure BDA0003403528450000073
Maximum load at load point j, ten thousand m3。
(8) The unloading capacity is restrained, the unloading capacity range of the truck at an unloading point is limited, and the formula is as follows:
Figure BDA0003403528450000074
in the formula, Qk 1For unloading Point k minimum unloading amount, ten thousand m3；
Figure BDA0003403528450000075
For the maximum unloading capacity of unloading point k, ten thousand m3。
(9) Load and unload times constraint
(9.1) limiting the heavy-load transportation of the truck which is moved last time to inevitably move the heavy-load transportation, wherein the formula is as follows:
Figure BDA0003403528450000076
(9.2) limiting the idle transportation of the truck during the last time to be carried out. In the same way, (3) no-load constraint (3.2) the maximum number of times of no-load transportation of the constrained truck is 0, the value range of L is from L-1, the number of constraint conditions is reduced, and the formula is as follows:
Figure BDA0003403528450000077
(10) traffic density constraint
(10.1) limiting the safety distance requirement of the heavy-duty truck, wherein the formula is as follows:
Figure BDA0003403528450000078
in the formula, SiThe truck length of number i, m; s2 j,kIs the road stopping line of sight, m, from loading point j to unloading point k.
(10.2) limiting the safe distance requirement of the unloaded truck, wherein the formula is as follows:
Figure BDA0003403528450000079
in the formula, S2 k，jIs the road stopping line of sight, m, from unloading point k to loading point j.
(11) Capability constraint
(11.1) limiting the single-loading number of the loading points, wherein the formula is as follows:
Figure BDA00034035284500000710
in the formula, QjStacking capacity for loading point j, m3。
(11.2) limiting the number of single unloads of the unloading point, wherein the formula is as follows:
Figure BDA0003403528450000081
in the formula, QkFor the unloading point k unloading capacity, m3。
And step 3: and acquiring a transportation scheme of the truck by using the traffic flow planning model.
The traffic flow planning model in this embodiment is loaded and executed in the Lingo software through a plurality of instructions, and this embodiment only describes the solving process by taking this as an example, and is not limited to the Lingo software. The set section of the present embodiment compiles 4 basic sets including a set of trucks representing the number of trucks, the number of elements being 20; a set of loading points representing the number of loading points of the truck, element number 2; a set of unloading points representing the number of unloading points of the truck, element number 2; and a set representing the maximum number of truck loads and unloads, element number 20. Compiling derivative set representation variables such as average truck load, average load time, etc.; used to define the variable summation and value range.
The data segment assigns a truck number of 20, a loading point number of 2, an unloading point number of 2, and a maximum number of loading and unloading times of 20.
The target constraint segment defines whether the truck with the number i runs from the loading point j to the unloading point k for the first time and the truck with the number i runs from the unloading point k to the loading point j for the first time, and if the truck runs, a decision variable X is determinedi,j,k,lAnd Xi,k,j,lTaking the value 1, otherwise, X is out of operationi,j,k,lAnd Xi,k,j,The value is 0. The average load capacity of the truck is assigned a value of 29.6 and 27.4 respectively; the average loading time is assigned to the loading points by 3.5 and 4.5 respectively; the road distances from the loading point to the unloading point are directly assigned by 3.5, 3.3, 3.2 and 3.0; directly assigning 25, 24 and 24 to the average driving speed of the truck from the loading point to the unloading point; the road distances from the unloading point to the loading point are directly assigned by 3.5, 3.3, 3.2 and 3.0; the average truck speed from unloading point to loading point is assigned directly 25, 24 and 24. Average unload time 3.5, work time 8, stacker number 2, maximum load 1, minimum load 0.5 and 0.3, maximum unload 1, minimum unload 0.5, truck length 10.3, road-to-park visibility 40, load capacity 296 and 274, unload capacity 296 and 296 write directly constraints; an objective function is defined.
Running the model, the optimal solution of the model is 10950.6m3. The loading point 1 is transported to the unloading point 1 to unload 73 vehicles, the loading and unloading amount is 2160.8m3(ii) a 122 vehicles are unloaded from loading point 1 to unloading point 2 with loading and unloading amount of 3611.2m3. The loading point 2 is transported to the unloading point 1 to unload 122 vehicles, and the loading and unloading amount is 3342.8m3(ii) a The loading point 2 is transported to the unloading point 2 to unload 67 vehicles, and the loading and unloading amount is 1835.8m3。
Load point 1 loads 195 cars with a load capacity of 5772.0m3(ii) a Loading point 2 dress189 cars with a loading capacity of 5178.6m3(ii) a Unloading point 1 unloads 195 cars with an unloading amount of 5503.6m3(ii) a Unloading point 2 unloading 189 vehicles with an unloading amount of 5447.0m3(ii) a Totally loading and unloading 384 cars.
The loading and unloading amounts between the loading and unloading points are shown in Table 5.
TABLE 5 Loading and unloading amount between loading and unloading points
Figure BDA0003403528450000082
Figure BDA0003403528450000091
The truck loading/unloading amounts of the respective numbers are shown in table 6.
TABLE 6 truck loading and unloading
Figure BDA0003403528450000092
Taking the truck with the number 1 as an example, the specific route of the truck between loading and unloading points is indicated by a circle, as shown in table 7.
TABLE 7 truck Path Condition
Figure BDA0003403528450000093
Figure BDA0003403528450000101
The trucks are arranged in the strip mine to be transported according to the scheme, the planning method can be applied to the strip mine to guide the transportation of the vehicles, the total loading and unloading amount is maximized through the transportation scheme, and the transportation efficiency of the strip mine trucks is improved.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.

Claims (9)

1. A method of obtaining a vehicular traffic path for a surface mine, comprising the steps of:
acquiring basic data including the number of trucks, the number of loading points, the number of unloading points, the maximum loading and unloading times and the average loading capacity of the loading points; the average loading and unloading time of the trucks, the road distance between loading and unloading points, the average driving speed of the trucks, the working time, the number of stacking equipment at the loading points, the minimum and maximum loading and unloading amount of the loading and unloading points, the length of the trucks, the road parking sight distance between the loading and unloading points and the loading and unloading capacity of the loading and unloading points;
according to the acquired basic data, a traffic flow planning model is established, whether the trucks operate at loading and unloading points is taken as a decision variable, and the path distribution with the maximum total loading and unloading amount of the trucks in the path situation of multiple transportation of all the outgoing trucks between the loading and unloading points within the working time is acquired;
and the truck is transported according to the path distribution condition with the maximum truck loading and unloading total amount obtained by the traffic flow planning model.
2. The method of obtaining a traffic flow transportation path for an open pit mine of claim 1, wherein the traffic flow planning model has an objective function of:
Figure FDA0003403528440000011
in the formula, Qi,jAverage load at load point j, m, for truck number i3；Xi,j,k,lFor the first time that the truck with the number i runs from a loading point j to an unloading point k, a variable is decided, and the value is 0 or 1; i is the number of trucks; j is the number of loading points; k is the number of unloading points; l represents the maximum number of loads and unloads.
3. The method of deriving a traffic flow path for an open pit mine according to claim 2, wherein the traffic flow planning model has an objective function constrained by a heavy load constraint and an empty load constraint:
(1) heavy load restriction, which limits the same truck to be transported at most once from a loading point to an unloading point at the same time, and the formula is as follows:
Figure FDA0003403528440000012
(2) no-load restraint:
(2.1) limiting the same truck to carry out no-load transportation at most once from the unloading point to the loading point at the same time, wherein the formula is as follows:
Figure FDA0003403528440000013
in the formula, Xi,k,j,lThe truck with the number i runs from the unloading point k to the loading point j for the first time, and the value is 0 or 1;
(2.2) the constraint limits the maximum times of heavy-load transportation of the truck to the unloading point and then does not return to the loading point, and the formula is as follows:
Figure FDA0003403528440000014
4. the method of deriving a traffic flow delivery path for a surface mine of claim 2 wherein the traffic flow planning model has an objective function constrained by an unloading point constraint and a loading point constraint:
(3) the unloading point is restricted, and the same heavy load transportation end point and the no-load transportation starting point of the same truck are limited to be the same point; in the same way, the no-load constraint 2.2 is that the maximum number of times of no-load transportation of the constrained truck is 0, the value range of L is from L-1, the number of constraint conditions is reduced, and the formula is as follows:
Figure FDA0003403528440000021
(4) and (4) load point constraint, wherein the constraint limits the starting point of the current heavy load transportation and the terminal point of the last no-load transportation of the same truck to be the same point.
Figure FDA0003403528440000022
5. The method of deriving a traffic flow delivery path for an open pit mine of claim 2, wherein the traffic flow planning model has an objective function constrained by an on-time constraint:
(5) and (3) constraint of working time:
(5.1) limiting the loading and unloading times of the truck to be not more than the working time, wherein the formula is as follows:
Figure FDA0003403528440000023
in the formula, Ti,jAverage load time (including waiting time), min at load point j for truck number i; s1 j,kIs the distance, km, of the road from the loading point j to the unloading point k; vj,kThe average driving speed of the truck is km/h from a loading point j to an unloading point k; t isxAverage truck off-load time (including waiting time), min; s1 k,jIs the distance of the road from the unloading point k to the loading point j, km; vk,jThe average driving speed of the truck is km/h from an unloading point k to a loading point j; t is working time h;
(5.2) limiting the loading times of the loading point not to exceed the working time, wherein the formula is as follows:
Figure FDA0003403528440000024
in the formula, NjThe number of devices is stacked for the loading point j.
6. The method of claim 2, wherein the flow planning model has an objective function constrained by a load constraint and a load-unload constraint:
(6) and (3) load capacity constraint, limiting the load capacity range of the truck at a loading point, and adopting the formula:
Figure FDA0003403528440000025
in the formula (I), the compound is shown in the specification,
Figure FDA0003403528440000027
at loading point j minimum load, ten thousand m3；
Figure FDA0003403528440000026
Maximum load at load point j, ten thousand m3；
(7) The unloading capacity is restrained, the unloading capacity range of the truck at an unloading point is limited, and the formula is as follows:
Figure FDA0003403528440000031
in the formula (I), the compound is shown in the specification,
Figure FDA0003403528440000036
for unloading Point k minimum unloading amount, ten thousand m3；
Figure FDA0003403528440000037
For the maximum unloading capacity of unloading point k, ten thousand m3。
7. The method of deriving a traffic flow transportation path for an open pit mine of claim 2, wherein the traffic flow planning model has an objective function constrained by a number of trips constraint:
(8) and (4) constraint of loading and unloading times:
(8.1) limiting the heavy-load transportation of the truck which is moved last time to inevitably move the heavy-load transportation, wherein the formula is as follows:
Figure FDA0003403528440000032
(8.2) limiting the no-load transportation of the truck during the last time; in the same way, the no-load constraint 2.2 is that the maximum number of times of no-load transportation of the constrained truck is 0, the value range of L is from L-1, the number of constraint conditions is reduced, and the formula is as follows:
Figure FDA0003403528440000033
8. the method of deriving a traffic flow transportation path for an open pit mine of claim 2, wherein the traffic flow planning model has an objective function constrained by a traffic flow density constraint:
(9) and (3) traffic flow density constraint:
(9.1) limiting the safety distance requirement of the heavy-duty truck, wherein the formula is as follows:
Figure FDA0003403528440000034
in the formula, SiThe truck length of number i, m; s2 j,kIs the road parking sight distance m from the loading point j to the unloading point k;
(9.2) limiting the safe distance requirement of the unloaded truck, wherein the formula is as follows:
Figure FDA0003403528440000035
in the formula, S2 k，jIs the road stopping line of sight, m, from unloading point k to loading point j.
9. The method of deriving a traffic flow delivery path for an open pit mine of claim 2, wherein the traffic flow planning model has an objective function constrained by a capacity constraint:
(10) capability constraint
(10.1) limiting the single loading quantity of the loading points, wherein the formula is as follows:
Figure FDA0003403528440000041
in the formula, QjStacking capacity for loading point j, m3；
(10.2) limiting the number of single unloads of the unloading point, and the formula is as follows:
Figure FDA0003403528440000042
in the formula, QkFor the unloading point k unloading capacity, m3。
CN202111507010.0A 2021-12-10 2021-12-10 Method for acquiring traffic flow transportation path of strip mine Pending CN114372610A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111507010.0A CN114372610A (en) 2021-12-10 2021-12-10 Method for acquiring traffic flow transportation path of strip mine

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111507010.0A CN114372610A (en) 2021-12-10 2021-12-10 Method for acquiring traffic flow transportation path of strip mine

Publications (1)

Publication Number Publication Date
CN114372610A true CN114372610A (en) 2022-04-19

Family

ID=81140806

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111507010.0A Pending CN114372610A (en) 2021-12-10 2021-12-10 Method for acquiring traffic flow transportation path of strip mine

Country Status (1)

Country Link
CN (1) CN114372610A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115953089A (en) * 2022-12-26 2023-04-11 东南大学 Method for determining number of transport vehicles for guaranteeing balanced state of construction area

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115953089A (en) * 2022-12-26 2023-04-11 东南大学 Method for determining number of transport vehicles for guaranteeing balanced state of construction area
CN115953089B (en) * 2022-12-26 2023-12-29 东南大学 Method for determining number of transport trucks for guaranteeing balance state of construction area

Similar Documents

Publication Publication Date Title
Lee et al. Optimizing the yard layout in container terminals
CN111210069B (en) Goods space allocation and operation scheduling integrated optimization method for multi-layer shuttle system
CN114372610A (en) Method for acquiring traffic flow transportation path of strip mine
CN110599067A (en) Storage allocation method, storage medium and electronic equipment
Kim et al. New conceptual handling systems in container terminals
CN114662943A (en) Strip mine truck scheduling method based on multi-target genetic algorithm
CN110817220A (en) RGV avoiding method, RGV and RGV avoiding system
US10643159B2 (en) System and method for mining site production planning
CN114881564A (en) Multi-deep goods location allocation method and device, computer equipment and storage medium
Vuyeykova et al. Rationalization of road transport park for the carriage of mining rocks in the open mines
Zhong et al. Application of hybrid GA-PSO based on intelligent control fuzzy system in the integrated scheduling in automated container terminal
WO2021177135A1 (en) Automated warehouse system, and control method for automated warehouse system
Malli et al. Truck selection with the fuzzy-WSM method in transportation systems of open pit mines
CN116362494B (en) Intelligent private line logistics scheduling method and system
JP4410515B2 (en) Container yard cargo handling system
Cheng et al. Optimization for vehicle scheduling in iron and steel works based on semi-trailer swap transport
CN115994635A (en) Belt optimal discharging transportation path detection method, system and medium
US10995615B2 (en) Method for optimizing mining production
CN115629587A (en) Dispatching method and device for rail carrying trolley
CN113743797B (en) Pile-free sharing bicycle operation scheduling strategy optimization method and system based on big data
CN115640877A (en) Method, device, equipment and storage medium for planning traffic flow of surface mine
CN112193952B (en) Elevator resource scheduling method and device
Pirhonen Automated Shuttle Carrier® Concept: Comparison to Conventional RTG Crane and Yard Tractor Concept
CN107867528A (en) A kind of Automated tridimensional warehousing system
KR20070097267A (en) Container terminal system using high stacking system and control method that system

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