TY - JOUR
T1 - New Model and Heuristics for Safety Stock Placement in General Acyclic Supply Chain Networks
AU - Li, Haitao
AU - Jiang, Dali
N1 - We model the safety stock placement problem in general acyclic supply chain networks as a project scheduling problem, for which the constraint program...
PY - 2012/7
Y1 - 2012/7
N2 - We model the safety stock placement problem in general acyclic supply chain networks as a project scheduling problem, for which the constraint programming (CP) techniques are both effective and efficient in finding high quality solutions. We further integrate CP with a genetic algorithm (GA), which improves the CP solution quality significantly. The performance of our hybrid CP–GA algorithm is evaluated on randomly generated test instances. CP–GA is able to find optimal solutions to small problems in fractions of a second, and near optimal solutions of about 5% optimality gap to medium size problems in several minutes on average.
AB - We model the safety stock placement problem in general acyclic supply chain networks as a project scheduling problem, for which the constraint programming (CP) techniques are both effective and efficient in finding high quality solutions. We further integrate CP with a genetic algorithm (GA), which improves the CP solution quality significantly. The performance of our hybrid CP–GA algorithm is evaluated on randomly generated test instances. CP–GA is able to find optimal solutions to small problems in fractions of a second, and near optimal solutions of about 5% optimality gap to medium size problems in several minutes on average.
UR - https://www.sciencedirect.com/science/article/pii/S0305054811002255?via%3Dihub
U2 - 10.1016/j.cor.2011.08.001
DO - 10.1016/j.cor.2011.08.001
M3 - Article
VL - 39
JO - Computers & Operations Research
JF - Computers & Operations Research
ER -