TY - JOUR
T1 - Assortment problems with cutting policies
AU - Borges, Pedro Castro
AU - Ferreira, José Soeiro
PY - 1996
Y1 - 1996
N2 - Assortment selection problems with cutting policies play an important role in several industries but, possibly due to their combinatorial characteristics, they did not receive as much attention as cutting stock problems did, though the two problems are closely related. In this paper we graph several examples of cost functions of one and two-dimensional problems which reveal that many local optima with cost close to optimum exist. Several implementations of known meta-heuristics are tested with a real problem. Two different neighbourhood structures are considered and the different performance of the implemented heuristics is briefly discussed.
AB - Assortment selection problems with cutting policies play an important role in several industries but, possibly due to their combinatorial characteristics, they did not receive as much attention as cutting stock problems did, though the two problems are closely related. In this paper we graph several examples of cost functions of one and two-dimensional problems which reveal that many local optima with cost close to optimum exist. Several implementations of known meta-heuristics are tested with a real problem. Two different neighbourhood structures are considered and the different performance of the implemented heuristics is briefly discussed.
KW - Assortment problem
KW - Cutting stack problem
KW - Metaheuristics
KW - Simulated annealing
KW - Tabu search
UR - http://www.scopus.com/inward/record.url?scp=3042911490&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:3042911490
SN - 0324-8569
VL - 25
SP - 74
EP - 95
JO - Control and Cybernetics
JF - Control and Cybernetics
IS - 1
ER -