Geodesic
A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
Kybernetika, Tome 48 (2012) no. 2, pp. 329-345.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

In this paper, we demonstrate the computational consequences of making a simple assumption on production cost structures in capacitated lot-size problems. Our results indicate that our cost assumption of increased productivity over time has dramatic effects on the problem sizes which are solvable. Our experiments indicate that problems with more than 1000 products in more than 1000 time periods may be solved within reasonable time. The Lagrangian decomposition algorithm we use does of course not guarantee optimality, but our results indicate surprisingly narrow gaps for such large-scale cases - in most cases significantly outperforming CPLEX. We also demonstrate that general CLSP's can benefit greatly from applying our proposed heuristic.
Classification : 65K05, 68W99, 90B30
Keywords: heuristics; capacitated lot-sizing; restricted cost structures 
@article{KYB_2012__48_2_a11,
     author = {Haugen, Kjetil K. and Lanquepin-Chesnais, Guillaume and Olstad, Asmund},
     title = {A fast {Lagrangian} heuristic for large-scale capacitated lot-size problems with restricted cost structures},
     journal = {Kybernetika},
     pages = {329--345},
     publisher = {mathdoc},
     volume = {48},
     number = {2},
     year = {2012},
     mrnumber = {2954330},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_2012__48_2_a11/}
}
TY  - JOUR
AU  - Haugen, Kjetil K.
AU  - Lanquepin-Chesnais, Guillaume
AU  - Olstad, Asmund
TI  - A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
JO  - Kybernetika
PY  - 2012
SP  - 329
EP  - 345
VL  - 48
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/KYB_2012__48_2_a11/
LA  - en
ID  - KYB_2012__48_2_a11
ER  - 
%0 Journal Article
%A Haugen, Kjetil K.
%A Lanquepin-Chesnais, Guillaume
%A Olstad, Asmund
%T A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
%J Kybernetika
%D 2012
%P 329-345
%V 48
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/KYB_2012__48_2_a11/
%G en
%F KYB_2012__48_2_a11
Haugen, Kjetil K.; Lanquepin-Chesnais, Guillaume; Olstad, Asmund. A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures. Kybernetika, Tome 48 (2012) no. 2, pp. 329-345. http://geodesic.mathdoc.fr/item/KYB_2012__48_2_a11/