CN104766171A - Assembly line dispatching method based on artificial bee colony algorithm - Google Patents
Assembly line dispatching method based on artificial bee colony algorithm Download PDFInfo
- Publication number
- CN104766171A CN104766171A CN201510174242.7A CN201510174242A CN104766171A CN 104766171 A CN104766171 A CN 104766171A CN 201510174242 A CN201510174242 A CN 201510174242A CN 104766171 A CN104766171 A CN 104766171A
- Authority
- CN
- China
- Prior art keywords
- workpiece
- algorithm
- bee colony
- solution
- artificial
- 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
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- General Factory Administration (AREA)
Abstract
The invention provides an assembly line dispatching method based on the artificial bee colony algorithm. A classical code based on a workpiece is adopted, mapping of a continuous domain and a discrete domain is achieved by means of the SPV rule, the NEH heuristic algorithm is used for initializing a solution, the quality of the solution is optimized, and when the solution is not optimized limit times, the hybrid idea is introduced to endow the solution with a value again. It is shown by a large quantity of simulation that the IABC algorithm is superior to the basic artificial bee colony algorithm and the particle swarm algorithm, and meanwhile the improved artificial bee colony algorithm is not prone to local optimum and has the better global search capability than the basic artificial bee colony algorithm.
Description
Technical field
The present invention relates to a kind of pipeline schedule method, particularly relate to
oneplant the pipeline schedule method based on bee colony artificial algorithm.
Background technology
Production scheduling refers under the prerequisite of given production task, determines rational production strategy, and the precedence relationship of arranged rational operation, predetermined deadline, the earliest begin time and resource capability etc. make the target preset optimum or close to optimum.In the production run of reality, need the production scheduling problems machine of thousands of often solved, the order that good reputation is thousands of, the distribution of resource will be subject to the impact of several factors.Impact scheduling because have: operation period of product, the phase of completing, job sequence, process equipment and raw material, machining path and productive capacity, cost restriction etc., these are all possible constraint condition.Wherein delivery date, productive capacity etc. are deterministic constraint condition, and raw material supply change, production task change etc. belong to the constraint condition of uncertainty.
Summary of the invention
The present invention mainly provides
oneplant the pipeline schedule method based on bee colony artificial algorithm, solve streamline rational management problem.
In order to realize object of the present invention, the invention provides a kind of pipeline schedule method based on bee colony artificial algorithm, it is characterized in that, the step of described algorithm is:
(1) utilize NEH method to generate the Machining Sequencing of a workpiece, regulation goal evaluation is carried out to it, and convert the position vector of body one by one to;
(2) in given space, generate the position vector of NS-1 individuality immediately, determine the Machining Sequencing of each processing work according to SPV rule, and carry out the evaluation of scheduling problem;
(3) enter and lead the honeybee stage: For i=1,2...NS repeats, and according to SPV rule, determines the manufacturing procedure that xi and vi is corresponding, and carry out the objective appraisal of dispatching, and retains to have evaluated;
(4) follow the honeybee stage: For i=1,2...NS repeats, and utilizes algorithm of tournament selection strategy to select food source for following honeybee i, after selecting food source, obtain its neighborhood solution vi, transform according to SPV rule and carry out regulation goal evaluation, by greedy selection strategy, the solution retained;
(5) investigate the honeybee stage: abandon the solution can not improved after linit time, produce a new explanation by chaos thought and replace it;
(6) record the last solution of Evaluation: Current, determine whether to meet loop termination unit condition, meet and just jump out and export best solution, otherwise return step (3).
Preferably, described SPV rule is found out by component positions minimum for the position vector of each individuality, and the component positions of its correspondence is placed on first of SPV value, secondly component positions little for value second is found out the second being placed on SPV value, then down sort successively according to this rule, finally just can construct a workpiece sequencing.
Preferably, the method for described NEH is:
(1) by order arrangement n the workpiece that the total elapsed time of workpiece on machine successively decreases;
(2) make k=2, get the first two Job Scheduling and try to achieve the sequence making the longest finishing time of these workpiece of processing minimum, and as current sequence;
(3) make k=k+l, a kth workpiece is inserted into all possible k of a current sequence position, try to achieve and make the minimum corresponding sequence of the longest finishing time of these workpiece of processing, and regard current sequence as;
(4): repeat (3), until all n workpiece all completes sequence.
Preferably, in the method step (2) of described NEH, after determining the clooating sequence of workpiece, then keep scheduled good workpiece order not change, and then next workpiece is inserted in existing scheduling.
Preferably, the solution that the method stating NEH obtains is the sequence of workpiece, and the artificial bee colony algorithm of continuous domain cannot process it, so the position vector that it must be converted in certain interval, could artificial bee colony algorithm be used further to be optimized it.
Preferably, this algorithm need suppose that the workpiece that total elapsed time is large on all machines workpiece is less than total elapsed time should obtain larger priority.
Beneficial effect: the invention provides
oneplant the pipeline schedule method based on bee colony artificial algorithm, adopt the classical coding based on workpiece, and utilize SPV rule to achieve the mapping of continuous domain and discrete domain, and utilize NEH heuritic approach to carry out the quality of initialization optimization understanding to solution, introduce mixed pure thought when separating and do not optimize for limit time for one and assignment is again carried out to it.Show that IABC algorithm is better than basic artificial bee colony algorithm by a large amount of emulation, particle cluster algorithm.Meanwhile, the artificial bee colony algorithm after improvement is not easily absorbed in local optimum, has better ability of searching optimum than basic artificial bee colony algorithm.
Accompanying drawing explanation
Fig. 1: algorithm flow chart of the present invention.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is described in further details.
The invention provides
oneplant the pipeline schedule method based on bee colony artificial algorithm, the steps include:
(1) utilize NEH method to generate the Machining Sequencing of a workpiece, regulation goal evaluation is carried out to it, and convert the position vector of body one by one to;
(2) in given space, generate the position vector of NS-1 individuality immediately, determine the Machining Sequencing of each processing work according to SPV rule, and carry out the evaluation of scheduling problem;
(3) enter and lead the honeybee stage: For i=1,2...NS repeats, and according to SPV rule, determines the manufacturing procedure that xi and vi is corresponding, and carry out the objective appraisal of dispatching, and retains to have evaluated;
(4) follow the honeybee stage: For i=1,2...NS repeats, and utilizes algorithm of tournament selection strategy to select food source for following honeybee i, after selecting food source, obtain its neighborhood solution vi, transform according to SPV rule and carry out regulation goal evaluation, by greedy selection strategy, the solution retained;
(5) investigate the honeybee stage: abandon the solution can not improved after linit time, produce a new explanation by chaos thought and replace it;
(6) record the last solution of Evaluation: Current, determine whether to meet loop termination unit condition, meet and just jump out and export best solution, otherwise return step (3).
Wherein, described SPV rule is found out by component positions minimum for the position vector of each individuality, and the component positions of its correspondence is placed on first of SPV value, secondly component positions little for value second is found out the second being placed on SPV value, then down sort successively according to this rule, finally just can construct a workpiece sequencing, the method for described NEH is:
(1) by order arrangement n the workpiece that the total elapsed time of workpiece on machine successively decreases;
(2) make k=2, get the first two Job Scheduling and try to achieve the sequence making the longest finishing time of these workpiece of processing minimum, and as current sequence;
(3) make k=k+l, a kth workpiece is inserted into all possible k of a current sequence position, try to achieve and make the minimum corresponding sequence of the longest finishing time of these workpiece of processing, and regard current sequence as;
(4): repeat (3), until all n workpiece all completes sequence.In the method step (2) of described NEH, after determining the clooating sequence of workpiece, scheduled good workpiece order is kept not change again, and then next workpiece is inserted in existing scheduling, the solution that the method stating NEH obtains is the sequence of workpiece, the artificial bee colony algorithm of continuous domain cannot process it, so the position vector that it must be converted in certain interval, could artificial bee colony algorithm be used further to be optimized it, this algorithm need suppose that the workpiece that total elapsed time is large on all machines workpiece is less than total elapsed time should obtain larger priority.
If consider the displacement fluvial incision of 6 workpiece, individual dimension is 6, supposes 1 ,=[1.2,0.8 ,-0.9,2.5 ,-1.2,0.3].Can find out that-1.2 is minimum in all values, the component positions of its correspondence is 5, so component positions 5 is placed on first of SPV value; Then second little be-0.9, the component positions of its correspondence is 3, so component positions 3 is placed on the second of SPV value, once down, just can obtain a Machining Sequencing; T=[5,3,6,2, Isosorbide-5-Nitrae].Individuality is converted into workpiece example as following table:
| Component positions | 1 | 2 | 3 | 4 | 5 | 6 |
| Location components value | 1.2 | 0.8 | -0.9 | 2.5 | -1.2 | 0.3 |
| SPV value | 5 | 3 | 6 | 2 | 1 | 4 |
The invention provides
oneplant the pipeline schedule method based on bee colony artificial algorithm, adopt the classical coding based on workpiece, and utilize SPV rule to achieve the mapping of continuous domain and discrete domain, and utilize NEH heuritic approach to carry out the quality of initialization optimization understanding to solution, introduce mixed pure thought when separating and do not optimize for limit time for one and assignment is again carried out to it.Show that IABC algorithm is better than basic artificial bee colony algorithm by a large amount of emulation, particle cluster algorithm.Meanwhile, the artificial bee colony algorithm after improvement is not easily absorbed in local optimum, has better ability of searching optimum than basic artificial bee colony algorithm.
As known by the technical knowledge, the present invention can be realized by other the embodiment not departing from its Spirit Essence or essential feature.Therefore, above-mentioned disclosed embodiment, with regard to each side, all just illustrates, is not only.Within the scope of the present invention all or be all included in the invention being equal to the change in scope of the present invention.
Claims (6)
1. based on a pipeline schedule method for bee colony artificial algorithm, it is characterized in that, the step of described algorithm is:
(1) utilize NEH method to generate the Machining Sequencing of a workpiece, regulation goal evaluation is carried out to it, and convert the position vector of body one by one to;
(2) in given space, generate the position vector of NS-1 individuality immediately, determine the Machining Sequencing of each processing work according to SPV rule, and carry out the evaluation of scheduling problem;
(3) enter and lead the honeybee stage: For i=1,2...NS repeats, and according to SPV rule, determines the manufacturing procedure that xi and vi is corresponding, and carry out the objective appraisal of dispatching, and retains to have evaluated;
(4) follow the honeybee stage: For i=1,2...NS repeats, and utilizes algorithm of tournament selection strategy to select food source for following honeybee i, after selecting food source, obtain its neighborhood solution vi, transform according to SPV rule and carry out regulation goal evaluation, by greedy selection strategy, the solution retained;
(5) investigate the honeybee stage: abandon the solution can not improved after linit time, produce a new explanation by chaos thought and replace it;
(6) record the last solution of Evaluation: Current, determine whether to meet loop termination unit condition, meet and just jump out and export best solution, otherwise return step (3).
2. the pipeline schedule method based on bee colony artificial algorithm according to claim 1, it is characterized in that, described SPV rule is found out by component positions minimum for the position vector of each individuality, and the component positions of its correspondence is placed on first of SPV value, secondly component positions little for value second is found out the second being placed on SPV value, then down sort successively according to this rule, finally just can construct a workpiece sequencing.
3. according to the pipeline schedule method based on bee colony artificial algorithm according to claim 1, it is characterized in that, the method for described NEH is:
(1) by order arrangement n the workpiece that the total elapsed time of workpiece on machine successively decreases;
(2) make k=2, get the first two Job Scheduling and try to achieve the sequence making the longest finishing time of these workpiece of processing minimum, and as current sequence;
(3) make k=k+l, a kth workpiece is inserted into all possible k of a current sequence position, try to achieve and make the minimum corresponding sequence of the longest finishing time of these workpiece of processing, and regard current sequence as;
(4): repeat (3), until all n workpiece all completes sequence.
4. follow according to the pipeline schedule method based on bee colony artificial algorithm according to claim 1, it is characterized in that, in the method step (2) of described NEH, after determining the clooating sequence of workpiece, keep scheduled good workpiece order not change again, and then next workpiece is inserted in existing scheduling.
5. the pipeline schedule method based on bee colony artificial algorithm according to claim 1, it is characterized in that, the solution that the method stating NEH obtains is the sequence of workpiece, the artificial bee colony algorithm of continuous domain cannot process it, so the position vector that it must be converted in certain interval, could artificial bee colony algorithm be used further to be optimized it.
6. the pipeline schedule method based on bee colony artificial algorithm according to claim 1, is characterized in that, this algorithm need suppose that the workpiece that total elapsed time is large on all machines workpiece is less than total elapsed time should obtain larger priority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510174242.7A CN104766171A (en) | 2015-04-14 | 2015-04-14 | Assembly line dispatching method based on artificial bee colony algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510174242.7A CN104766171A (en) | 2015-04-14 | 2015-04-14 | Assembly line dispatching method based on artificial bee colony algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104766171A true CN104766171A (en) | 2015-07-08 |
Family
ID=53647985
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510174242.7A Pending CN104766171A (en) | 2015-04-14 | 2015-04-14 | Assembly line dispatching method based on artificial bee colony algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104766171A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105528615A (en) * | 2015-11-30 | 2016-04-27 | 华南师范大学 | Path optimizing method for behavioral data |
| CN105785963A (en) * | 2016-05-18 | 2016-07-20 | 中南大学 | Steelmaking and continuous casting scheduling method based on artificial bee colony (ABC) |
| CN107437121A (en) * | 2016-05-25 | 2017-12-05 | 华中科技大学 | Handle the production process control method of either simplex part simultaneously suitable for more machines |
| CN107450498A (en) * | 2017-09-11 | 2017-12-08 | 合肥工业大学 | Based on the production scheduling method and system for improving artificial bee colony algorithm |
| US20190005435A1 (en) * | 2017-06-28 | 2019-01-03 | Hcl Technologies Limited | System and method for allocating human resources based on bio inspired models |
| CN113283572A (en) * | 2021-05-31 | 2021-08-20 | 中国人民解放军空军工程大学 | Blind source separation main lobe interference resisting method and device based on improved artificial bee colony |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002288624A (en) * | 2001-03-27 | 2002-10-04 | Mitsubishi Heavy Ind Ltd | Route optimization program, route-optimizing method and route-optimizing device |
-
2015
- 2015-04-14 CN CN201510174242.7A patent/CN104766171A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002288624A (en) * | 2001-03-27 | 2002-10-04 | Mitsubishi Heavy Ind Ltd | Route optimization program, route-optimizing method and route-optimizing device |
Non-Patent Citations (1)
| Title |
|---|
| 刘华: ""基于改进人工蜂群算法的流水线调度研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105528615A (en) * | 2015-11-30 | 2016-04-27 | 华南师范大学 | Path optimizing method for behavioral data |
| CN105528615B (en) * | 2015-11-30 | 2018-11-06 | 华南师范大学 | The optimum path search method of behavioral data |
| CN105785963A (en) * | 2016-05-18 | 2016-07-20 | 中南大学 | Steelmaking and continuous casting scheduling method based on artificial bee colony (ABC) |
| CN105785963B (en) * | 2016-05-18 | 2018-08-10 | 中南大学 | A kind of steel-making continuous casting dispatching method based on artificial bee colony algorithm |
| CN107437121A (en) * | 2016-05-25 | 2017-12-05 | 华中科技大学 | Handle the production process control method of either simplex part simultaneously suitable for more machines |
| CN107437121B (en) * | 2016-05-25 | 2020-07-10 | 华中科技大学 | Production process control method suitable for simultaneously processing single workpiece by multiple machines |
| US20190005435A1 (en) * | 2017-06-28 | 2019-01-03 | Hcl Technologies Limited | System and method for allocating human resources based on bio inspired models |
| CN107450498A (en) * | 2017-09-11 | 2017-12-08 | 合肥工业大学 | Based on the production scheduling method and system for improving artificial bee colony algorithm |
| CN107450498B (en) * | 2017-09-11 | 2018-08-28 | 合肥工业大学 | Based on the production scheduling method and system for improving artificial bee colony algorithm |
| CN113283572A (en) * | 2021-05-31 | 2021-08-20 | 中国人民解放军空军工程大学 | Blind source separation main lobe interference resisting method and device based on improved artificial bee colony |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104766171A (en) | Assembly line dispatching method based on artificial bee colony algorithm | |
| CN107168267B (en) | Based on the production scheduled production method and system for improving population and heuristic strategies | |
| CN101901425A (en) | Flexible job shop scheduling method based on multi-species coevolution | |
| CN102929263A (en) | Hybrid flow shop scheduling method | |
| CN104636871B (en) | A kind of control method of the single phase multi-product batch processing based on data | |
| CN103235743A (en) | Method for scheduling multi-target testing task based on decomposition and optimal solution following strategies | |
| CN104570997A (en) | Method for discharge and processing production scheduling integration optimization of metal structure components | |
| CN106611275A (en) | Production scheduling algorithm for solving job shop production problem | |
| Benjaoran et al. | Three-step solutions for cutting stock problem of construction steel bars | |
| CN110909787A (en) | Method and system for multi-objective batch scheduling optimization based on clustering evolutionary algorithm | |
| CN110471274A (en) | Based on the machine components process line dispatching method for improving unified particle swarm algorithm | |
| Grzechca | Assembly line balancing problem with reduced number of workstations | |
| CN104537425B (en) | A kind of Optimization Scheduling of the production assembling process of vehicle air conditioning outlet | |
| CN110458478A (en) | Job-shop scheduling method based on discrete invasive weed algorithm | |
| CN106487889B (en) | A kind of task towards cloud data center and data aggregate dispositions method | |
| CN102393687B (en) | Method for limiting distribution and scheduling for solving machine changing problem | |
| CN110482095B (en) | Goods picking and shelving method and device beneficial to reducing total sorting distance | |
| CN108537456B (en) | Comprehensive scheduling method of network flexible equipment | |
| CN102184486A (en) | Discrete manufacturing industry production capability balancing method | |
| CN108898319A (en) | A kind of Optimization Scheduling of spinning workshop middle ring ingot spinning process production process | |
| CN114089699A (en) | Method for solving hybrid flow shop scheduling based on cellular membrane calculation model | |
| Ramaraj et al. | A two-stage stochastic programming model for production planning in a kitting facility under demand and yield uncertainties | |
| Debnárová et al. | Group technology in context of the product classification | |
| CN103246240A (en) | Batch preparation continuous single-processing prediction control scheduling method | |
| CN113177667A (en) | Electrical equipment manufacturing resource optimal configuration method based on improved genetic algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150708 |
|
| RJ01 | Rejection of invention patent application after publication |