Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem

Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem

0.00 Avg rating0 Votes
Article ID: iaor19961349
Country: Netherlands
Volume: 64
Issue: 1/2
Start Page Number: 91
End Page Number: 102
Publication Date: Nov 1995
Journal: Journal of Computational and Applied Mathematics
Authors: , ,
Keywords: printing
Abstract:

The present paper is concerned with the grouping of book covers on offset plates in order to minimize the total production cost. The mathematical formulation of the problem involves both binary and continuous variables. As exact methods are unable to provide solutions in reasonable time, a heuristic algorithm of the simulated annealing type is proposed. At each iteration, the values of the current solution binary variables are altered in order to yield a neighboring solution. To compute the corresponding values of the continuous variables and the value of the objective function, a linear programming routine is called at each iteration. This constitutes the main originality of the present approach and is in principle applicable in mixed integer programming problems. The procedure is tested on several examples.

Reviews

Required fields are marked *. Your email address will not be published.