Bag rationalisation for a food manufacturer
暂无分享,去创建一个
A food manufacturer has decided to rationalise the types of bags used to pack their products with a view to achieving economies of scale and improved efficiency. Under the new regime, the name and characteristics of the product are to be printed on the bag during packaging, with the bag colour as a secondary distinctive feature. There are several ways of describing the director's conflicting objectives of minimising both cost and customer colour conflicts. We model the problem in two ways: as a Zero-One Integer Programme, and as a variant of a classical Graph Colouring Problem. Problem-specific observations, and data pre-processing, enable us to decompose the originally intractable problem, and to solve it using commercial integer programming software. Our solution compares favourably with that from a heuristic for graph colouring and our recommended allocation of eight colours was accepted for implementation.
[1] A. Mehrotra,et al. A column generation approach for exact graph coloring , 1994 .
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[4] Alain Hertz,et al. Ants can colour graphs , 1997 .
[5] Michael Gering. The marginal cost of complexity , 1998 .