A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing

DOI10.1007/S10472-013-9339-9MaRDI QIDQ2248555zbMATH OpenOpenAlexFDO

Authors Marco Caserta, Stefan Voß

Publication date 26 June 2014

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-013-9339-9

zbMATH Keywords

lot sizingperishabilitycorridor methodDantzig-Wolfe algorithmmath-heuristic (matheuristic)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05) Production models (90B30)

Recommendations

• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing
• Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
• An improved heuristic for the capacitated lot-sizing problem

Cites work

• scientific article; zbMATH DE number 5017341 (Why is no real title available?)
• scientific article; zbMATH DE number 5152600 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• scientific article; zbMATH DE number 3067118 (Why is no real title available?)
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
• A cutting plane approach to capacitated lot-sizing with start-up costs
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
• Branch-and-price: Column generation for solving huge integer programs
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
• Decomposition Principle for Linear Programs
• Dynamic version of the economic lot size model
• Matheuristics
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Modeling industrial lot sizing problems: a review
• Perishable Inventory Theory: A Review
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• The Steiner tree problem with hop constraints
• bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems

Cited in

(8)

• A dynamic programming-based matheuristic for the dynamic berth allocation problem
• A matheuristic approach for solving the 2-connected dominating set problem
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• Parameter tuning for local-search-based matheuristic methods
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
• Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
• Integrating deterioration and lifetime constraints in production and supply chain planning: a survey
• Solving large-scale profit maximization capacitated lot-size problems by heuristic methods

Describes a project that uses

Uses Software

• bc-prod

This page was built for publication: A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248555)