Dynamic programming approximation algorithms for the capacitated lot-sizing problem

This paper provides a new idea for approximating the inventory cost function to be used in a truncated dynamic program for solving the capacitated lot-sizing problem. The proposed method combines dynamic programming with regression, data fitting, and approximation techniques to estimate the inventor...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of global optimization Ročník 65; číslo 2; s. 231 - 259
Hlavní autori: Büyüktahtakın, İ. Esra, Liu, Ning
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.06.2016
Springer
Springer Nature B.V
Predmet:
Algorithms
Approximation
Computation
Computer Science
Costs
Dynamic programming
Dynamics
Integer programming
Inventories
Inventory control
Mathematical analysis
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Production capacity
Production planning
Real Functions
Stockpiling
Studies
Supply chain management
Approximate dynamic programming
Approximation algorithms
Production and inventory control
Data fitting
Mixed-integer programming
Capacitated lot-sizing
ISSN:0925-5001, 1573-2916
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper provides a new idea for approximating the inventory cost function to be used in a truncated dynamic program for solving the capacitated lot-sizing problem. The proposed method combines dynamic programming with regression, data fitting, and approximation techniques to estimate the inventory cost function at each stage of the dynamic program. The effectiveness of the proposed method is analyzed on various types of the capacitated lot-sizing problem instances with different cost and capacity characteristics. Computational results show that approximation approaches could significantly decrease the computational time required by the dynamic program and the integer program for solving different types of the capacitated lot-sizing problem instances. Furthermore, in most cases, the proposed approximate dynamic programming approaches can accurately capture the optimal solution of the problem with consistent computational performance over different instances.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-015-0349-5