论文信息 - A LOCAL SEARCH ALGORITHM FOR THE INVENTORY MATCHING PROBLEM IN A STEEL COMPANY

A LOCAL SEARCH ALGORITHM FOR THE INVENTORY MATCHING PROBLEM IN A STEEL COMPANY

Abstract The problem studied is the selection of slabs from a slab yard for the hot rolling program in a steel company, with the objective of minimizing and balancing the incurred workload on the slab yard. A local search algorithm in a constraint programming environment is developed. This local search has two iterative phases: descent into and escape from local optima. Computational experiments show savings of 40 percent and more compared to the currently used greedy search.

Birger Raa | Wim Van der Stricht

[1] Lixin Tang,et al. Modelling and a genetic algorithm solution for the slab stack shuffling problem when implementing steel rolling schedules , 2002 .

[2] Manoj Kumar Tiwari,et al. Modelling the slab stack shuffling problem in developing steel rolling schedules and its solution using improved Parallel Genetic Algorithms , 2004 .

[3] Jiyin Liu,et al. An effective heuristic algorithm to minimise stack shuffles in selecting steel slabs from the slab yard for heating and rolling , 2001, J. Oper. Res. Soc..