CN109814509A - A kind of parallel disassembly line balance optimization method towards low-carbon high-efficiency - Google Patents
A kind of parallel disassembly line balance optimization method towards low-carbon high-efficiency Download PDFInfo
- Publication number
- CN109814509A CN109814509A CN201910094974.3A CN201910094974A CN109814509A CN 109814509 A CN109814509 A CN 109814509A CN 201910094974 A CN201910094974 A CN 201910094974A CN 109814509 A CN109814509 A CN 109814509A
- Authority
- CN
- China
- Prior art keywords
- disassembly
- sequence
- work station
- time
- matrix
- 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.)
- Granted
Links
Classifications
-
- 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
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of parallel disassembly line balance optimization method towards low-carbon high-efficiency, comprising: parallel disassembly model building, the Optimized model building of parallel disassembly line balance problem.Optimization aim of the invention is to reduce carbon emission and reduce the take-down time, belongs to multi-objective optimization question；A kind of parallel disassembly model is established on this basis, then comprehensively consider the physical constraint condition of disassembly equilibrium problem, establish the optimization method of the high-efficiency low-carbon of disassembly sequence, in result optimizing problem, multi-objective problem is converted into single-objective problem using the method for weighting, finally with genetic algorithm to disassembly line balance problem solve, from convergence graph it can be seen that, genetic algorithm has very strong convergence rate, which plays certain optimization function to the take-down time.
Description
Technical field
The invention belongs to flexible production line design and control technology fields, are related to a kind of parallel disassembly towards low-carbon high-efficiency
Line balance optimization method.
Background technique
With the process of world industry, while people's lives level and quality of life have obtained very big promotion,
Also life and industrial waste of the number with hundred million tons are produced.By the end of the year 2017, China's scrap iron and steel, waste electrical and electronic equipment, report
The other regenerated resources year recovery total of ten major class such as waste vapour vehicle is about 2.82 hundred million tons.In order to preferably recycle renewable money
Source, each state have all put into effect stringenter laws and regulations successively.
The overall process remanufactured includes the recycling of waste and old equipment, dismantling, classification, cleaning, identifies, remanufactures processing, assembly
It directly affects with programs, first step of the disassembly as Rebuilding engineering such as detections and remanufactures efficiency and old part reuse ratio.It tears open
Unloading operation can carry out on single dismantlement work platform, can also carry out on disassembly line, disassembly line is more suitable for large-scale production
The disassembly of product or large batch of small sized product.But due to its complexity features, dismantling line balance problem is anxious to be resolved ask
Topic.
In some cases, especially when dismantling large scaled complex product, parallel disassembly advantageously reduces the take-down time, mentions
High working efficiency and reduction non-cutting time etc., so disassembly line is more suitable for engineering practice parallel.Compared to serial disassembly, tear open parallel
Unloading line has the characteristics that disassembly length is uncertain, disassembly task is parallel, therefore parallel disassembly line balance problem (Parallel
Disassembly Line Balancing Problem, PDLBP) it is more increasingly complex than serially dismantling line balance problem.It is domestic
Outer research is concentrated mainly on parallel disassembly line sequence column planning problem, less to the research of PDLBP problem.Tian Yongting [7] etc. is mentioned
A kind of parallel disassembly sequence planning method of selectivity based on genetic algorithm out.Zhang Xiufen [8] etc. is parallel for complex product
Disassembly sequence planning problem proposes the parallel disassembly sequence planning method of complex product based on genetic algorithm.Hezer [9] etc.
It proposes and a kind of PDLBP is solved the problems, such as based on the grid model of shortest path.
Although having been achieved for comparable achievement for DLPB Study on Problems, the disassembly line balance of these achievement researchs is asked
Topic is main to be considered to minimize work station number, balanced each work station free time, removes that there may be the sides such as part of harm as early as possible
Face, and the carbon emission amount in disassembly process is considered less.When dismantling product, enterprise will should not only consider disassembly sequence,
It is also contemplated that how to select specific resources to improve removal efficiency and reduce carbon emission.
In view of the above-mentioned problems, the present invention studies the optimization problem of concurrent product disassembly process low-carbon high-efficiency.Firstly,
Between product parts the constraint relationship and connection relationship studied, on this basis, obtain concurrent product disassembly sequence rule
The general mathematical method for the problem of drawing；Then the physical constraint condition for comprehensively considering parallel disassembly equilibrium problem, establishes disassembly sequence
High-efficiency low-carbon optimization method；Finally, being optimized by genetic algorithm.
Summary of the invention
Technical problems based on background technology, the invention proposes a kind of, and the parallel disassembly line towards low-carbon high-efficiency is flat
Weigh optimization method.
The technical solution adopted by the present invention is that:
A kind of parallel disassembly line balance optimization method towards low-carbon high-efficiency, which comprises the following steps:
(1) parallel disassembly model building
(1.1) parallel disassembly model description
The constraint information of product described with disassembly mixing graph model, disassembly combination chart can be expressed as G=VF, VC, E,
DE }, wherein G indicates combination chart；Vertex VF={ VF1,VF2,L,VFnIt is product function part, wherein n is the number of functor；VC
For connector；E is expressed as nonoriented edge, indicates the constraint relationship for having contact between part；DE is directed edge, is indicated between part
Non-contact dominance relation；
Nonoriented edge E and directed edge DE can be indicated with connection matrix and precedence matrix in disassembly combination chart, the company of product
Meet matrix GcIt indicates, it may be assumed that
Wherein:Indicate the connection relationship between functor i and j, when having connection relationship between functor i and j,When connection relationship is not present in functor i and jSince connection relationship can not be formed between part i and j, therefore
Precedence matrix G between product function partpIt indicates, it may be assumed that
Wherein:Indicate functor j to the constraint relationship of i；Indicate that j-th of functor will be in i-th of functor
It disassembles before；IfIndicate i-th of functor not by the constraint of j-th of functor；
(1.2) degree of parallelism is dismantled
Parallel disassembly is intended to reduce the serial length of disassembly sequence by the parallelization for dismantling task to improve in the unit time
Removal efficiency；It is defined by disassembly degree of parallelism it is found that the theoretical maximum of removable unit quantity simultaneously is allowed to be known as dismantling parallel
Degree, is denoted as Dmax；
(1.3) parallel disassembly sequence planning
In parallel disassembly process, the disassembly step-length of each demounting procedure not necessarily achieves the numerical value of disassembly degree of parallelism, thus
The disassembly step-length between each step is set also to be not quite similar；In serial disassembly, it is assumed that the disassembly unit of product is n, due to disassembly
Degree is 1, and disassembly sequence can be expressed as the matrix S={ S of n × 11,S2L SiL Sn}；Similar, it is false in parallel disassembly
If it is n that it, which dismantles unit, disassembly step number is m, indicates step-length with ls, then parallel disassembly sequence can be indicated with matrix Q are as follows:
Removable unit representated by same row element belongs to same demounting procedure in matrix, is wherein arranged side by side between removable unit
Relationship, if removable unit number is less than disassembly degree of parallelism in this step, default element is set to 0 in colleague；It is not gone together in matrix
Between be different demounting procedures, and line number size is number of steps size；
It is convenient for genetic algorithm encoding in order to subsequent, disassembly sequence matrix is divided into removable unit sequence and disassembly step series two
Part is encoded with real number respectively；
(2) Optimized model of line balance problem is dismantled parallel
(2.1) basic constraint condition
In Process of Product Dismantlement for Product Remanufacture, in part disassembly sequence except by precedence matrix and connection matrix constraint, disassembly line is also
It will be by the constraint of disassembly line work station number, each work station space time, Danger Indexes, efficiency and low-carbon emission amount target；
The basic ideas of disassembly line balance optimization are exactly to find out all disassembly Route Sets for meeting precedence matrix and connection matrix constraint, so
It is evaluated afterwards according to goal constraint, to find best or preferable disassembly sequence；
(2.2) building of optimization object function
(2.2.1) dismantles line balance elementary object function
In tradition disassembly line balance problem, disassembly line layout requirements whole dismounting process has the work of the smallest disassembly line
Standing, number, the standby time of each work station is most short, the high part of disassembly danger level as early as possible:
1) minimum work station number and minimum work free time
The free time of work station was determined by the working time of each work station and the beat of work station, reasonable work
Work station free time is conducive to improve removal efficiency；The standby time of minimum work station number and reasonable work station can make to tear open
Unload efficiency reinforcement, can by the standby time of minimum work station and each work station it is most short integrate, objective function can be obtained
It is as follows:
In formula: CT is the maximum operating time of work station, STiFor the activity duration for distributing to workbench i；
2) disassembly sequence endangers index
There may be risk parts in disassembly process for some products, so to these risk zero in disassembly process
Part is removed；
In formula:Indicate the hazard index of components；The number that n representative products are zero, k indicate that components are torn open in product
Unload the position in sequence；nkIt is possible that there are three types of situations, when components harmfulness is higher, value 2；When components generally endanger
When property, value 1；When part degree of being safe from danger, value 0；
(2.2.2) efficient objective function
Efficient target is mainly reflected in that disassembly process total take-down time is most short, and total take-down time mainly includes when dismantling substantially
Between, orientation replacing construction and extracting tool conversion time, these timing definitions it is as follows:
1) the basic take-down time
Assuming that disassembly process PiTake-down time be BTi, needing to dismantle number of parts is n, then basic take-down time BDT table
Show as follows:
2) orientation replacing construction
Refer to that two neighboring disassembly part needs different disassembly directions, orientation replacing construction BCT table when orientation replacement
Show as follows:
In formula: BCTI be turn over 90 ° used in the time, BiBi+1Indicate the angle that former and later two stations are turned over；
3) extracting tool replacing construction
Extracting tool replacement refers to extracting tool different required for two neighboring disassembly part, extracting tool replacement
Time, TCT was expressed as follows:
In formula: TCTI is that extracting tool replaces primary the time it takes, TiIndicate i-th of part extracting tool, and
Meet:
In conclusion total take-down time T is as follows:
(2.2.3) low-carbon objective function
Total carbon emission amount is as follows in disassembly process:
Wherein GeFor the total carbon emission in disassembly process, γiFor energy carbon emission coefficient, EiTo disassemble type energy consumption, Gj
To dismantle each stage carbon emission amount；
(2.3) the process optimization based on genetic algorithm
(2.3.1) gene coding
Coding will solve the problems, such as first when being using genetic algorithm, and the key one solved the problems, such as with genetic algorithm
Step, the actual conditions of combination product disassembly, the coding mode of dyeing use the real coding encoded with part sequence number；
The conversion of (2.3.2) multiple objective function
Multiple target refers to two optimization aims of carbon emission and take-down time, and multi-objective problem is converted to list using the method for weighting
Target problem；In order to avoid carbon emission amount, make the dimension of station number, the standby time of each work station and detaching products time not
Together, need that it is normalized, first to single-goal function maximizing and minimum value, then by they switch to 0~1 it
Between number；Processing method is as follows:
Wherein: GeFor carbon emission amount；f1Make the standby time of station number, each work station；T is the take-down time；
According to the objective function after above-mentioned processing are as follows:
W in above formula1、w2、w3For weight coefficient, and meet w1+w2+w3=1, herein by analytic hierarchy process (AHP) coefficient w1、w2、w3
Respectively 0.56,0.19,0.25；
(2.3.3) crossover operation
Crossing operation refers to that the chromosome being mutually paired to two exchanges other parts gene in some way, to be formed
New individual；Two sequence string U are randomly choosed in population1And U2, and produce a random number r between section [0,1]k,
If rk≤Pc, then crossover operation is carried out, carries out crossover operation with single point crossing method, steps are as follows:
(a) take an equally distributed random number k as crosspoint in section；
(b) by the gene before crosspoint according in former generation U1Copy orderly in string is to offspring O1In；
(c) in offspring O1Gene behind crosspoint will be from another former generation U2Middle progress is scanned with this；Such as in this gene in father
In generation, then next gene is scanned；If it does not, this gene is stored in offspring O in sequence1In；
(2.3.4) mutation operation
Variation refer to by the genic value locus on certain locus in individual chromosome coded strings other etc.
Position gene replaces, to form new individual, the specific method is as follows:
(a) according to mutation probability PmSeveral chromosomes are selected in population at random；
(b) length of removable unit sequence is set as n, and a gene location i is randomly choosed among [1, n], judges i and i+
Whether the 1 corresponding process of two genes meets constraint matrix and contact matrix, if it is carries out；
(c) disassembly step series are regenerated according to new removable unit sequence, and forms new disassembly sequence.
The invention has the advantages that
Optimization aim of the invention is to reduce carbon emission and reduce the take-down time, belongs to multi-objective optimization question, in this base
A kind of parallel disassembly model is established on plinth, is then comprehensively considered the physical constraint condition of disassembly equilibrium problem, is established disassembly sequence
The optimization method of high-efficiency low-carbon multi-objective problem is converted into single-objective problem using the method for weighting in result optimizing problem,
Finally disassembly line balance problem is solved with genetic algorithm, from convergence graph as can be seen that genetic algorithm has very strong receipts
Speed is held back, which plays certain optimization function to the take-down time, to be efficiently that optimization aim is excellent to disassembly sequence progress
When change, completion disassembly all time is less but the carbon emission amount of generation is more, but is target to disassembly sequence using low-carbon
Result when optimizing is opposite to that, and same with efficient and two objective functions of low-carbon and parallel disassembly line target majorized function
When optimizing, be integrated into the result together, obtained with weight coefficient and be more in line with requirement of the invention.
Detailed description of the invention
Fig. 1 is the schematic diagram of parallel disassembly model.
Fig. 2 is removable unit sequence and the schematic diagram for dismantling step series.
Fig. 3 is efficiently to dismantle the algorithmic statement figure for target.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.
Embodiment.
A kind of parallel disassembly line balance optimization method towards low-carbon high-efficiency, which comprises the following steps:
(1) parallel disassembly model building
(1.1) parallel disassembly model description
The present invention describes the constraint information of product with disassembly mixing graph model, and disassembly combination chart can be expressed as G=
{ VF, VC, E, DE }, wherein G indicates combination chart；Vertex VF={ VF1,VF2,L,VFnIt is product function part, wherein n is functor
Number；VC is connector；E is expressed as nonoriented edge, indicates the constraint relationship for having contact between part；DE is directed edge, table
Show the non-contact dominance relation between part.Such as Fig. 1, as parallel disassembly model
Nonoriented edge E and directed edge DE can be indicated with matrix and orientation preferentially matrix is stably connected in disassembly combination chart,
The connection matrix G of product in the present inventioncIt indicates, it may be assumed that
Wherein:Indicate the connection relationship between functor i and j, when having connection relationship between functor i and j,When connection relationship is not present in functor i and jSince connection relationship can not be formed between part i and j, therefore
Precedence relation matrix G between product function partpIt indicates, it may be assumed that
Wherein:Indicate functor j to the constraint relationship of i；Indicate that j-th of functor will be in i-th of functor
It disassembles before；IfIndicate i-th of functor not by the constraint of j-th of functor.
(1.2) degree of parallelism is dismantled
Parallel disassembly is intended to reduce the serial length of disassembly sequence by the parallelization for dismantling task to improve in the unit time
Removal efficiency.It is defined by disassembly degree of parallelism it is found that the theoretical maximum of removable unit quantity simultaneously is allowed to be known as dismantling parallel
Degree, is denoted as Dmax。
(1.3) parallel disassembly sequence planning
In parallel disassembly process, the disassembly step-length of each demounting procedure not necessarily achieves the numerical value of disassembly degree of parallelism, thus
The disassembly step-length between each step is set also to be not quite similar.It is as shown in Figure 2 to encode process.
In serial disassembly, it is assumed that the disassembly unit of product is n, and since disassembly degree is 1, disassembly sequence can be expressed as
Matrix S={ the S of n × 11,S2L SiL Sn}.Similar, in parallel disassembly, it is assumed that it is n that it, which dismantles unit, and disassembly step number is
M indicates step-length with ls, then parallel disassembly sequence can be indicated with matrix Q are as follows:
Removable unit representated by same row element belongs to same demounting procedure in matrix, is wherein arranged side by side between removable unit
Relationship, if removable unit number is less than disassembly degree of parallelism in this step, default element is set to 0 in colleague；It is not gone together in matrix
Between be different demounting procedures, and line number size is number of steps size.
In order to it is subsequent be convenient for genetic algorithm encoding, such as Fig. 2, disassembly sequence matrix be divided into removable unit sequence and disassembly step-length
Sequence two parts, are encoded with real number respectively.
(2) Optimized model of line balance problem is dismantled parallel
(2.1) basic constraint condition
In Process of Product Dismantlement for Product Remanufacture, in part disassembly sequence except by precedence matrix and connection matrix constraint, disassembly line is also
It will be by the pact of the targets such as disassembly line work station number, each work station space time, Danger Indexes, efficiency and low-carbon emission amount
Beam.The basic ideas of disassembly line balance optimization are exactly to find out all disassembly routes for meeting precedence matrix and connection matrix constraint
Collection, is then evaluated according to goal constraint, to find best or preferable disassembly sequence.
(2.2) building of optimization object function
(2.2.1) dismantles line balance elementary object function
In tradition disassembly line balance problem, disassembly line layout requirements whole dismounting process has the work of the smallest disassembly line
Standing, number, the standby time of each work station is most short, high part of disassembly danger level etc. as early as possible:
1) minimum work station number and minimum work free time
The free time of work station was determined by the working time of each work station and the beat of work station, reasonable work
Work station free time is conducive to improve removal efficiency.The standby time of minimum work station number and reasonable work station can make to tear open
Efficiency reinforcement is unloaded, according to bibliography[10]Can by the standby time of minimum work station and each work station it is most short integrate,
It is as follows that objective function can be obtained:
In formula: CT is the maximum operating time of work station, STiFor the activity duration for distributing to workbench i；
2) disassembly sequence endangers index
There may be risk parts in disassembly process for some products, so to these risk zero in disassembly process
Part should be removed as early as possible, in order to avoid there is the case where endangering staff appearance, to reduce the interference of uncertain factor in disassembly line.
In formula:Indicate the hazard index of components；The number that n representative products are zero, k indicate that components are torn open in product
Unload the position in sequence.nkIt is possible that there are three types of situations, when components harmfulness is higher, value 2；When components generally endanger
When property, value 1；When part degree of being safe from danger, value 0.
(2.2.2) efficient objective function
It is most short that efficient target is mainly reflected in disassembly process total take-down time.Total take-down time mainly includes when dismantling substantially
Between, orientation replacing construction and extracting tool conversion time, these timing definitions it is as follows:
1) the basic take-down time
Assuming that disassembly process PiTake-down time be BTi, needing to dismantle number of parts is n, then basic take-down time (Basic
Time of disassembly, BDT) it is expressed as follows:
2) orientation replacing construction
Refer to that two neighboring disassembly part needs different disassembly directions when orientation replacement.Orientation replacing construction
(Bearing change time, BCT) is expressed as follows:
In formula: BCTI be turn over 90 ° used in the time, BiBi+1Indicate the angle that former and later two stations are turned over.
3) extracting tool replacing construction.
Extracting tool replacement refers to extracting tool different required for two neighboring disassembly part.Extracting tool replacement
Time, (Tool change time, TCT) was expressed as follows:
In formula: TCTI is that extracting tool replaces primary the time it takes, TiIndicate i-th of part extracting tool, and
Meet:
In conclusion total take-down time T is as follows:
(2.2.3) low-carbon objective function
During the whole dismounting of product, due to dismantling the diversity of mode and connecting mode, in energy consumption assessment
In model to every kind of disassembly process all set up accurate energy consumption model be it is unpractical, actually calculate carbon emission amount in often
The carbon emission amount of dismantling is assessed by empirical estimating and energy input conversion regime.Total carbon emission amount is such as in disassembly process
Under:
Wherein GeFor the total carbon emission in disassembly process, γiFor energy carbon emission coefficient, EiTo disassemble type energy consumption, Gj
To dismantle each stage carbon emission amount.
(2.3) the process optimization based on genetic algorithm
(2.3.1) gene coding
Coding will solve the problems, such as first when being using genetic algorithm, and the key one solved the problems, such as with genetic algorithm
Step, the actual conditions of combination product disassembly, the real coding encoded with part sequence number, it is convenient to omit the process of coding and decoding,
Therefore the coding mode dyed herein uses real coding.
The conversion of (2.3.2) multiple objective function
Present document relates to two optimization aims of carbon emission and take-down time, belong to multi-objective optimization question.Because multiple target is excellent
Each objective function of change problem mutually restricts, so being difficult to find the optimal solution of objective function.In result optimizing problem, commonly use
Method be that multi-objective problem is converted into single-objective problem using the method for weighting.
In order to avoid carbon emission amount, the standby time for making station number, each work station is different with the dimension of detaching products time,
It needs that it is normalized, first to single-goal function maximizing and minimum value, then they is switched between 0~1
Number.Processing method is as follows:
Wherein: GeFor carbon emission amount；f1Make the standby time of station number, each work station；T is the take-down time；
According to the objective function after above-mentioned processing are as follows:
W in above formula1、w2、w3For weight coefficient, and meet w1+w2+w3=1, herein by analytic hierarchy process (AHP) coefficient w1、w2、w3
Respectively 0.56,0.19,0.25.
(2.3.3) crossover operation
Crossing operation refers to that the chromosome being mutually paired to two exchanges other parts gene in some way, to be formed
New individual.Two sequence string U are randomly choosed in population1And U2, and produce a random number r between section [0,1]k,
If rk≤Pc, then crossover operation is carried out, carries out crossover operation with single point crossing method, steps are as follows:
(a) take an equally distributed random number k as crosspoint in section；
(b) by the gene before crosspoint according in former generation U1Copy orderly in string is to offspring O1In；
(c) in offspring O1Gene behind crosspoint will be from another former generation U2Middle progress is scanned with this.Such as in this gene in father
In generation, then next gene is scanned.If it does not, this gene is stored in offspring O in sequence1In.
(2.3.4) mutation operation
Variation refer to by the genic value locus on certain locus in individual chromosome coded strings other etc.
Position gene replaces, to form new individual, the specific method is as follows:
(a) according to mutation probability PmSeveral chromosomes are selected in population at random；
(b) length of removable unit sequence is set as n, and a gene location i is randomly choosed among [1, n], judges i and i+
Whether the 1 corresponding process of two genes meets constraint matrix and contact matrix, if it is carries out；
(c) disassembly step series are regenerated according to new removable unit sequence, and forms new disassembly sequence.
Instance analysis
It is analyzed with certain model engine stripping sequence, verifies the low-carbon high-efficiency multiple-objection optimization of the said goods disassembly sequence
The validity of model.
If disassembly model is expressed fully according to the part of product, illustraton of model overcomplicated is easily caused, gives disassembly sequence
The planning of column brings great difficulty, therefore simplifies herein to certain parts in automobile engine assembly: by belt, tooth form
They remove from illustraton of model, introduce sub-assemblies and groups of fastener as a part for band, bearing, key, pin, reduce
The number of parts of disassembly is participated in, planning efficiency is improved.Engine Parts title and disassembly element such as 1 institute of table after simplification
Show.
1 Engine Parts title of table and disassembly element
The detaching equipment for dismantling the automobile engine is as shown in table 2.
The extracting tool of 2 automobile engine of table
According to above to the G of combination chartc、GpIt describes and to automobile engine model structure analysis, product is in disassembly process
The middle conversion for needing tipper to carry out orientation, and oily pedestal and tipper are fixed, to obtain automobile engine model
Gc、Gp, as shown in Table 3, 4.
3 automobile engine of table is stably connected with matrix GC
The relational matrix Gp of 4 automobile engine of table
According to G described abovec、GpMatrix can separate single part from automobile engine, but must satisfy following
Two conditions: 1. not by the precedence constraint of other parts；2. only having contiguity constraint relationship with part a certain in assembly.
Disassembly sequence optimization based on genetic algorithm
Comprehensively consider the constraint relationship and disassembly technique requirement between Engine Parts, giving beat CT is 90s, is started
The turner power that machine dismantles line is 15KW, overturns 180 ° of used time 4s, overturns 90 ° of used time 2s.Worker replace extracting tool when
Between be definite value 4s, electric wrench power be 4KW.
When progress genetic algorithm is asked, algorithm parameter is provided that population scale is set as 50, the greatest iteration of algorithm
Number MAXGEN=150, generation gap GGAP=0.9.Use MATLAB software to optimize with low-carbon and efficiently for target, as a result with
It is individually as shown in table 5 to efficient and low-carbon optimum results correlation data.
5 optimum results of table
The algorithmic statement figure of route is dismantled by target of high-efficiency low-carbon and cashes shape by the optimal chromosome of mesh of high-efficiency low-carbon
Formula is respectively as shown in Fig. 3, table 6.It is as shown in table 7 that disassembly line placement scheme is converted to according to above-mentioned high-efficiency low-carbon disassembly sequence.
The 6 high-efficiency low-carbon chromosomal gene form of expression of table
Table 7 dismantles line and is laid out task allocation plan
The optimum results of the optimization aim different from three of the above can be seen that be efficiently optimization aim to disassembly sequence
When optimizing, complete to dismantle all times are less but the carbon emission amount that generates is more, but be target to tearing open using low-carbon
The result unloaded when sequence optimizes is opposite to that, but excellent with efficient and two objective functions of low-carbon and tradition disassembly line target
When changing function while optimizing, the result together, obtained is integrated into weight coefficient and is more in line with requirement of the invention.
The free time of task allocation plan fluctuates very little from table 7, can preferably control the process distribution of each work station.
The foregoing is only a preferred embodiment of the present invention, but scope of protection of the present invention is not limited thereto,
Anyone skilled in the art in the technical scope disclosed by the present invention, according to the technique and scheme of the present invention and its
Inventive concept is subject to equivalent substitution or change, should be covered by the protection scope of the present invention.
Claims (1)
1. a kind of parallel disassembly line balance optimization method towards low-carbon high-efficiency, which comprises the following steps:
(1) parallel disassembly model building
(1.1) parallel disassembly model description
The constraint information of product is described with disassembly mixing graph model, disassembly combination chart can be expressed as G={ VF, VC, E, DE },
Wherein G indicates combination chart；Vertex VF={ VF1,VF2,L,VFnIt is product function part, wherein n is the number of functor；VC is to connect
Fitting；E is expressed as nonoriented edge, indicates the constraint relationship for having contact between part；DE is directed edge, indicates non-between part
Contact dominance relation；
Nonoriented edge E and directed edge DE can be indicated with connection matrix and precedence matrix in disassembly combination chart, the connection square of product
Battle array uses GcIt indicates, it may be assumed that
Wherein:Indicate the connection relationship between functor i and j, when having connection relationship between functor i and j,When
When connection relationship is not present in functor i and jSince connection relationship can not be formed between part i and j, therefore
Precedence matrix G between product function partpIt indicates, it may be assumed that
Wherein:Indicate functor j to the constraint relationship of i；Indicate that j-th of functor will be before i-th of functor
Dismantling；IfIndicate i-th of functor not by the constraint of j-th of functor；
(1.2) degree of parallelism is dismantled
Parallel disassembly is intended to reduce the serial length of disassembly sequence by the parallelization for dismantling task to improve tearing open in the unit time
Unload efficiency；It is defined by disassembly degree of parallelism it is found that the theoretical maximum of removable unit quantity simultaneously is allowed to be known as dismantling degree of parallelism, note
For Dmax；
(1.3) parallel disassembly sequence planning
In parallel disassembly process, the disassembly step-length of each demounting procedure not necessarily achieves the numerical value of disassembly degree of parallelism, to make each
Disassembly step-length between a step is also not quite similar；In serial disassembly, it is assumed that the disassembly unit of product is n, since disassembly degree is
1, disassembly sequence can be expressed as the matrix S={ S of n × 11,S2L SiL Sn}；Similar, in parallel disassembly, it is assumed that its
Disassembly unit is n, and disassembly step number is m, indicates step-length with ls, then parallel disassembly sequence can be indicated with matrix Q are as follows:
Removable unit representated by same row element belongs to same demounting procedure in matrix, is wherein to close between removable unit side by side
System, if removable unit number is less than disassembly degree of parallelism in this step, default element is set to 0 in colleague；Between not going together in matrix
For different demounting procedures, and line number size is number of steps size；
It is convenient for genetic algorithm encoding in order to subsequent, disassembly sequence matrix is divided into removable unit sequence and disassembly step series two
Point, it is encoded respectively with real number；
(2) Optimized model of line balance problem is dismantled parallel
(2.1) basic constraint condition
In Process of Product Dismantlement for Product Remanufacture, in part disassembly sequence except by precedence matrix and connection matrix constraint, disassembly line will also be by
To the constraint of disassembly line work station number, each work station space time, Danger Indexes, efficiency and low-carbon emission amount target；Disassembly
The basic ideas of line balance optimization are exactly to find out all disassembly Route Sets for meeting precedence matrix and connection matrix constraint, then root
It is evaluated according to goal constraint, to find best or preferable disassembly sequence；
(2.2) building of optimization object function
(2.2.1) dismantles line balance elementary object function
In tradition disassembly line balance problem, disassembly line layout requirements whole dismounting process has the work station of the smallest disassembly line
The standby time of several, each work station is most short, dismantles the high part of danger level as early as possible:
1) minimum work station number and minimum work free time
The free time of work station was determined by the working time of each work station and the beat of work station, reasonable work station
Free time is conducive to improve removal efficiency；The standby time of minimum work station number and reasonable work station can be such that disassembly imitates
Rate reinforce, can by the standby time of minimum work station and each work station it is most short integrate, it is as follows that objective function can be obtained:
In formula: CT is the maximum operating time of work station, STiFor the activity duration for distributing to workbench i；
2) disassembly sequence endangers index
There may be risk parts in disassembly process for some products, thus in disassembly process to these risk parts into
Row is removed；
In formula:Indicate the hazard index of components；The number that n representative products are zero, k indicate components in detaching products sequence
Position in column；nkIt is possible that there are three types of situations, when components harmfulness is higher, value 2；When the general harmfulness of components
When, value 1；When part degree of being safe from danger, value 0；
(2.2.2) efficient objective function
It is most short that efficient target is mainly reflected in disassembly process total take-down time, total take-down time mainly include the basic take-down time,
Orientation replacing construction and extracting tool conversion time, these timing definitions are as follows:
1) the basic take-down time
Assuming that disassembly process PiTake-down time be BTi, needing to dismantle number of parts is n, then basic take-down time BDT is indicated such as
Under:
2) orientation replacing construction
Refer to that two neighboring disassembly part needs different disassembly directions when orientation replacement, orientation replacing construction BCT is indicated such as
Under:
In formula: BCTI be turn over 90 ° used in the time, BiBi+1Indicate the angle that former and later two stations are turned over；
3) extracting tool replacing construction
Extracting tool replacement refers to extracting tool different required for two neighboring disassembly part, extracting tool replacing construction
TCT is expressed as follows:
In formula: TCTI is that extracting tool replaces primary the time it takes, TiIt indicates i-th of part extracting tool, and meets:
In conclusion total take-down time T is as follows:
(2.2.3) low-carbon objective function
Total carbon emission amount is as follows in disassembly process:
Wherein GeFor the total carbon emission in disassembly process, γiFor energy carbon emission coefficient, EiTo disassemble type energy consumption, GjTo tear open
Unload each stage carbon emission amount；
(2.3) the process optimization based on genetic algorithm
(2.3.1) gene coding
Coding will solve the problems, such as first when being using genetic algorithm, and one step of key solved the problems, such as with genetic algorithm, knot
The actual conditions of detaching products are closed, the coding mode of dyeing uses the real coding encoded with part sequence number；
The conversion of (2.3.2) multiple objective function
Multiple target refers to two optimization aims of carbon emission and take-down time, and multi-objective problem is converted to single goal using the method for weighting
Problem；In order to avoid carbon emission amount, the standby time for making station number, each work station is different with the dimension of detaching products time, needs
It is normalized, first to single-goal function maximizing and minimum value, then they be switched between 0~1 number；
Processing method is as follows:
Wherein: GeFor carbon emission amount；f1Make the standby time of station number, each work station；T is the take-down time；
According to the objective function after above-mentioned processing are as follows:
W in above formula1、w2、w3For weight coefficient, and meet w1+w2+w3=1, herein by analytic hierarchy process (AHP) coefficient w1、w2、w3Respectively
It is 0.56,0.19,0.25；
(2.3.3) crossover operation
Crossing operation refers to that the chromosome being mutually paired to two exchanges other parts gene in some way, to be formed newly
Individual；Two sequence string U are randomly choosed in population1And U2, and produce a random number r between section [0,1]kIf
rk≤Pc, then crossover operation is carried out, carries out crossover operation with single point crossing method, steps are as follows:
(a) take an equally distributed random number k as crosspoint in section；
(b) by the gene before crosspoint according in former generation U1Copy orderly in string is to offspring O1In；
(c) in offspring O1Gene behind crosspoint will be from another former generation U2Middle progress is scanned with this；Such as in this gene in former generation
In, then next gene is scanned；If it does not, this gene is stored in offspring O in sequence1In；
(2.3.4) mutation operation
Variation refers to other equipotential bases of the genic value locus on certain locus in individual chromosome coded strings
Because replacing, to form new individual, the specific method is as follows:
(a) according to mutation probability PmSeveral chromosomes are selected in population at random；
(b) length of removable unit sequence is set as n, and a gene location i is randomly choosed among [1, n], judges i's and i+1
Whether the corresponding process of two genes meets constraint matrix and contact matrix, if it is carries out；
(c) disassembly step series are regenerated according to new removable unit sequence, and forms new disassembly sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910094974.3A CN109814509B (en) | 2019-01-31 | 2019-01-31 | Low-carbon efficient parallel disassembly line balance optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910094974.3A CN109814509B (en) | 2019-01-31 | 2019-01-31 | Low-carbon efficient parallel disassembly line balance optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109814509A true CN109814509A (en) | 2019-05-28 |
| CN109814509B CN109814509B (en) | 2021-01-26 |
Family
ID=66606076
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910094974.3A Active CN109814509B (en) | 2019-01-31 | 2019-01-31 | Low-carbon efficient parallel disassembly line balance optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109814509B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110598974A (en) * | 2019-07-30 | 2019-12-20 | 浙江大学 | Asynchronous parallel disassembly sequence planning method considering incomplete tool satisfaction |
| CN110826775A (en) * | 2019-10-23 | 2020-02-21 | 武汉理工大学 | Parallel disassembly sequence planning method and system for speed reducer |
| CN110900138A (en) * | 2019-11-27 | 2020-03-24 | 武汉理工大学 | Man-machine cooperation disassembly line balance optimization method based on safety guarantee strategy |
| CN111652392A (en) * | 2020-06-04 | 2020-09-11 | 合肥工业大学 | Waste mobile terminal-oriented low-carbon efficient disassembly line balance optimization method |
| CN114066247A (en) * | 2021-11-17 | 2022-02-18 | 西南交通大学 | Parallel disassembly line setting method for merging priority relation matrix |
| CN114815688A (en) * | 2022-04-07 | 2022-07-29 | 铭之城科技(苏州)有限公司 | Planning method for disassembly sequence of robot with uncertain interference |
| CN115048859A (en) * | 2022-05-25 | 2022-09-13 | 青岛科技大学 | Waste mobile phone target disassembly sequence optimization method based on reinforcement learning |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101706895A (en) * | 2009-12-10 | 2010-05-12 | 浙江大学 | Method for planning destination and cooperation disassembly of complex product supporting green design |
| CN104766128A (en) * | 2014-09-11 | 2015-07-08 | 上海大学 | Method for low-carbon design of products based on dynamic planning |
| CN105574339A (en) * | 2015-12-15 | 2016-05-11 | 合肥工业大学 | Method for calculating carbon emission in disassembly of decommissioned passenger cars |
| JP2017010544A (en) * | 2015-06-16 | 2017-01-12 | 富士通株式会社 | Multiple goal optimization method and device |
| CN106743324A (en) * | 2016-12-27 | 2017-05-31 | 格林美（武汉）城市矿产循环产业园开发有限公司 | Abandoned car disassembles the time of delivery control system of line |
| CN107808210A (en) * | 2017-09-13 | 2018-03-16 | 南京航空航天大学 | The dismantlement scheme of Complex Product dismounting regeneration and the Integrated Decision method of regeneration scheme |
| CN109002006A (en) * | 2018-09-13 | 2018-12-14 | 合肥工业大学 | Processing route optimization method based on the constraint of low-carbon low cost |
| CN109214576A (en) * | 2018-09-12 | 2019-01-15 | 合肥工业大学 | A kind of disassembly line balance optimization method towards low-carbon high-efficiency |
-
2019
- 2019-01-31 CN CN201910094974.3A patent/CN109814509B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101706895A (en) * | 2009-12-10 | 2010-05-12 | 浙江大学 | Method for planning destination and cooperation disassembly of complex product supporting green design |
| CN104766128A (en) * | 2014-09-11 | 2015-07-08 | 上海大学 | Method for low-carbon design of products based on dynamic planning |
| JP2017010544A (en) * | 2015-06-16 | 2017-01-12 | 富士通株式会社 | Multiple goal optimization method and device |
| CN105574339A (en) * | 2015-12-15 | 2016-05-11 | 合肥工业大学 | Method for calculating carbon emission in disassembly of decommissioned passenger cars |
| CN106743324A (en) * | 2016-12-27 | 2017-05-31 | 格林美（武汉）城市矿产循环产业园开发有限公司 | Abandoned car disassembles the time of delivery control system of line |
| CN107808210A (en) * | 2017-09-13 | 2018-03-16 | 南京航空航天大学 | The dismantlement scheme of Complex Product dismounting regeneration and the Integrated Decision method of regeneration scheme |
| CN109214576A (en) * | 2018-09-12 | 2019-01-15 | 合肥工业大学 | A kind of disassembly line balance optimization method towards low-carbon high-efficiency |
| CN109002006A (en) * | 2018-09-13 | 2018-12-14 | 合肥工业大学 | Processing route optimization method based on the constraint of low-carbon low cost |
Non-Patent Citations (1)
| Title |
|---|
| ZEQIANG ZHANG: "A Pareto improved artificial fish swarm algorithm for solving a multi-objective fuzzy disassembly line balancing problem", 《EXPERT SYSTEMS WITH APPLICATIONS》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110598974A (en) * | 2019-07-30 | 2019-12-20 | 浙江大学 | Asynchronous parallel disassembly sequence planning method considering incomplete tool satisfaction |
| CN110598974B (en) * | 2019-07-30 | 2022-03-01 | 浙江大学 | Asynchronous parallel disassembly sequence planning method considering incomplete tool satisfaction |
| CN110826775A (en) * | 2019-10-23 | 2020-02-21 | 武汉理工大学 | Parallel disassembly sequence planning method and system for speed reducer |
| CN110826775B (en) * | 2019-10-23 | 2023-04-18 | 武汉理工大学 | Parallel disassembly sequence planning method and system for speed reducer |
| CN110900138A (en) * | 2019-11-27 | 2020-03-24 | 武汉理工大学 | Man-machine cooperation disassembly line balance optimization method based on safety guarantee strategy |
| CN110900138B (en) * | 2019-11-27 | 2021-07-27 | 武汉理工大学 | Man-machine cooperation disassembly line balance optimization method based on safety guarantee strategy |
| CN111652392A (en) * | 2020-06-04 | 2020-09-11 | 合肥工业大学 | Waste mobile terminal-oriented low-carbon efficient disassembly line balance optimization method |
| CN111652392B (en) * | 2020-06-04 | 2023-10-20 | 合肥工业大学 | Low-carbon efficient disassembly line balance optimization method for waste mobile terminal |
| CN114066247A (en) * | 2021-11-17 | 2022-02-18 | 西南交通大学 | Parallel disassembly line setting method for merging priority relation matrix |
| CN114815688A (en) * | 2022-04-07 | 2022-07-29 | 铭之城科技(苏州)有限公司 | Planning method for disassembly sequence of robot with uncertain interference |
| CN114815688B (en) * | 2022-04-07 | 2024-07-26 | 铭之城科技(苏州)有限公司 | Planning method for disassembly sequence of robot with uncertain disturbance |
| CN115048859A (en) * | 2022-05-25 | 2022-09-13 | 青岛科技大学 | Waste mobile phone target disassembly sequence optimization method based on reinforcement learning |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109814509B (en) | 2021-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109814509A (en) | A kind of parallel disassembly line balance optimization method towards low-carbon high-efficiency | |
| Gao et al. | A survey on meta-heuristics for solving disassembly line balancing, planning and scheduling problems in remanufacturing | |
| CN107450498B (en) | Based on the production scheduling method and system for improving artificial bee colony algorithm | |
| CN109886458A (en) | A kind of parallel disassembly model construction method based on genetic algorithm | |
| Wang et al. | Partial disassembly line balancing for energy consumption and profit under uncertainty | |
| CN110580547B (en) | Method for arranging parallel incomplete disassembly lines for disassembling waste products | |
| Tsai et al. | Improved immune algorithm for global numerical optimization and job-shop scheduling problems | |
| CN107808210B (en) | Disassembling, regenerating and disassembling scheme and regenerating scheme integrated decision-making method for complex product | |
| CN109214576B (en) | Balance optimization method for low-carbon efficient disassembly line | |
| CN113962091B (en) | Balance design method for multi-person co-station incomplete disassembly line for processing mixed waste products | |
| CN110221585A (en) | A kind of energy-saving distribution control method considering plant maintenance for hybrid flowshop | |
| CN113191085A (en) | Setting method of incomplete disassembly line considering tool change energy consumption | |
| Gong et al. | A two-stage memetic algorithm for energy-efficient flexible job shop scheduling by means of decreasing the total number of machine restarts | |
| Zhu et al. | Dynamic distributed flexible job-shop scheduling problem considering operation inspection | |
| Yao et al. | A parametric life cycle modeling framework for identifying research development priorities of emerging technologies: a case study of additive manufacturing | |
| Liu et al. | Coke production scheduling problem: A parallel machine scheduling with batch preprocessings and location-dependent processing times | |
| Wu et al. | Techno-economic and environmental benefits-oriented human–robot collaborative disassembly line balancing optimization in remanufacturing | |
| Wang et al. | Optimization of disassembly line balancing using an improved multi‐objective Genetic Algorithm | |
| Tsai et al. | An improved genetic algorithm for job-shop scheduling problems using Taguchi-based crossover | |
| Shi et al. | Very large-scale neighborhood search for steel hot rolling scheduling problem with slab stack shuffling considerations | |
| Li et al. | A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machines | |
| CN114091321A (en) | Low-carbon optimal design method for transformer based on full life cycle | |
| CN116663806B (en) | Man-machine cooperation disassembly line setting method considering different operation scenes | |
| Qin et al. | Multi-objective Discrete Migrating Birds Optimizer Solving Multiple-product Partial U-shaped Disassembly Line Balancing Problem | |
| CN114648247A (en) | Remanufacturing decision-making method integrating process planning and scheduling |
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 |