A fast Langrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures

Title:

A fast Langrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures

Creator:

Haugen, Kjetil K., Lanquepin-Chesnais, Guillaume, and Olstad, Asmund

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:67f5e424-e8d3-4637-a1d9-3049a835df84
uuid:67f5e424-e8d3-4637-a1d9-3049a835df84

Subject:

heuristics, capacitated lot-sizing, and restricted cost structures

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

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.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

[329]-345

Source:

Kybernetika | 2012 Volume:48 | Number:2

Harvested from:

CDK

Metadata only:

false