A heuristic for the Minimum Score Separation Problem, a combinatorial problem associated with the cutting stock problem
The Minimum Score Separation Problem (MSSP) is a combinatorial problem that was introduced in JORS 55 as an open problem in the paper industry arising in conjunction with the cutting stock problem. During the process of producing boxes, flat papers are prepared for folding by being scored with knives. The problem is to determine whether and how a given production pattern of boxes can be arranged such that a certain minimum distance between the knives can be kept. Introducing the concept of matching-based alternating Hamiltonian paths, this paper models the MSSP as the problem of finding an alternating Hamiltonian path on a graph that is the union of a matching and a type of graph known as a ‘threshold graph’. On this basis, we find a heuristic that can quickly recognize a large percentage of feasible and infeasible instances of the MSSP. Detailed computational experiments demonstrate the efficiency of our approach.
Keywordscutting stock problem bin packing heuristics networks and graphs Travelling Salesman Problem alternating Hamiltonian path threshold graph
- Chvátal V and Hammer PL (1973). Set Packing Problems and Threshold Graphs. CORR 73-21. University of Waterloo: Canada.Google Scholar
- Cook WJ, Cunningham WH, Pulleyblank WR and Schrijver A (1998). Combinatorial Optimization. Wiley: New York.Google Scholar
- Ecker K and Zaks S (1977). On a Graph Labelling Problem. Bericht 99. Gesellschaft für Mathematik und Datenverarbeitung mbH: Bonn.Google Scholar
- Golumbic MC (1980). Algorithmic Graph Theory and Perfect Graphs. Academic Press: New York.Google Scholar
- Mahadev NVR and Peled UN (1995). Threshold Graphs and Related Topics. Annals of Discrete Mathematics 56. Elsevier: Amsterdam.Google Scholar