Guided variable neighborhood harmony search for integrated charge planning in primary steelmaking processes

Authors:
Min Huang;Hong-yu Dong;Xing-wei Wang;Bing-lin Zheng;W. H. Ip
Affiliations:
Northeastern University, Shenyang, China;Northeastern University, Shenyang, China;Northeastern University, Shenyang, China;Key Laboratory of Integrated Automation of Process Industry (Northeastern University), Ministry of Education, Shenyang, China;The Hong Kong Polytechnic University, Hung Hom, Hong Kong
Venue:
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Year:
2009

Citing 8
Cited 0

Minkowski's convex body theorem and integer programming

Mathematics of Operations Research
Discrete event sequencing as a Traveling Salesman Problem

Computers in Industry
Primary production scheduling at steelmaking industries

IBM Journal of Research and Development
Variable neighborhood search

Computers and Operations Research
Variable Neighborhood Decomposition Search

Journal of Heuristics
Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing

Operations Research
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems

Computers and Operations Research
Production design for plate products in the steel industry

IBM Journal of Research and Development - Business optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The planning for rectangular plate products (slabs) in an integrated steel plant is extremely hard and important. Due to the large scale and complex integrated operational constraints, the planning problem is quite difficult to achieve an optimal solution even a feasible solution. From the practical point of view, this paper discusses an integrated charge planning (ICP) problem, with flexible product specifications. The purpose is to improve the efficiency and feasibility of planning, the customer satisfaction levels and the production costs, considering the integrated operational constraints. An integer programming model is formulated, and the problem is NP-hard. A new heuristics based on a variable neighborhood search (VNS), named the guided VNS embedded in harmony search, is designed. The computational results demonstrate that the proposed model and algorithm are feasible and effective for ICP.