Research on multi-objective hot milling planning based on HPCVRP

doi:10.16731/j.cnki.1671-3133.2017.04.020

Abstract

Abstract: Aiming at the high energy consumption caused by disregarding the change between the power consumption of slab,the hot milling planning was formulated as a hybrid multi-objective prize collecting vehicle routing problem(Hybrid Price Collect Vehicle Routing Problem,HPCVRP) model.The model considers minimum number of rolling plan,production process constrains,and energy consumption.Combine improved feasibility priority particle comparison criteria to select the best particle,and control the number of external files with update the global optimum algorithm by filter crowding distance and congestion vector mechanism for FMOPSO(Filter-MOPSO).The simulation results indicated that this algorithm could get good distributed Pareto optimal front.The proposed method has been applied in a hot mill line to verify its availability and feasibility by comparing the manual scheduling results,which provide decision support for hot milling planner in practical work assignments.

Key words: hot milling planning, filter, constrained optimization, MOPSO, Pareto optimization

CLC Number:

Wang Chen, Yang Yang, Zhou Xueliang, Wang Shenghuai. Research on multi-objective hot milling planning based on HPCVRP[J]. Modern Manufacturing Engineering, 2017, 439(4): 102-109.

References

[1] KOSIBA E D,WRIGHT J R,COBBS A E.Discrete event sequencing as a Traveling Salesman Problem[J].Computers in Industry,1992,19(3):317-327.
[2] 贾树晋,朱俊,杜斌,等.Pareto最大最小蚂蚁算法及其在热轧批量计划优化中的应用[J].控制理论与应用,2012,29(2).
[3] 张涛,王磊,张玥杰.PSO算法求解基于PCVRP的热轧批量计划问题[J].系统工程学报,2010,25(1):55-61.
[4] 潘瑞林,胡邦国,曹建华,等.考虑加热温度曲线的热轧批次计划[J].计算机集成制造系统,2014,20(11).
[5] LIU L,LIU C,LIU X,et al.Research and application of multiple constrained hot strip mills scheduling problem based on HPSA[J].International Journal of Advanced Manufacturing Technology,2015,81(9):1-13.
[6] 柏亮,李铁克,王柏琳,等.基于变邻域搜索的热轧圆钢批量调度多目标优化方法[J].北京科技大学学报,2015(1):111-117.
[7] FLETCHER R,LEYFFER S.Nonlinear programming without a penalty function[J].Mathematical Programming,2002,91(2):239-269.
[8] AUDET C,DENNIS J E.A Pattern Search Filter Method for Nonlinear Programming without Derivatives[J].Siam Journal on Optimization,2000,14(4):980-1010.
[9] DEB K.An efficient constraint handling method for genetic algorithms[J].Computer Methods in Applied Mechanics & Engineering,2000,186(2/3/4):311-338.
[10] WANG Y,CAI Z,ZHOU Y,et al.Constrained Optimization Evolutionary Algorithms[J].Journal of Software,2009,20(1).
[11] 方群,张则强,李明.面向多目标拆卸线平衡问题的一种改进粒子群优化算法[J].现代制造工程,2016(4):8-15.
[12] DEB K,PRATAP A,AGARWAL S,et al.A fast and elitist multi-objective genetic algorithm:NSGA-II[J].IEEE Transactions on Evolutionary Computation,2002,6(2):182-197.
[13] ZITZLER E,THIELE L,LAUMANNS M,et al.Performance assessment of multi-objective optimizers:an analysis and review[J].Evolutionary Computation IEEE Transactions on,2010,7(2):117-132.
[14] SCHOTTJ R.Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization [J].Cellular Immunology,1978,37(1):1-13.