A math-heuristic for the multi-level capacitated lot sizing problem with carryover

Authors:
Marco Caserta;Adriana Ramirez;Stefan Voß
Affiliations:
Institute of Information Systems, University of Hamburg, Hamburg, Germany;Telecommunications and Systems Engineering Department, Universitat Autonoma de Barcelona, Bellaterra, Barcelona, Spain;Institute of Information Systems, University of Hamburg, Hamburg, Germany
Venue:
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Year:
2010

Citing 6
Cited 1

A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times

Management Science
The Capacitated Lot-Sizing Problem with Linked Lot Sizes

Management Science
A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times

Computers and Operations Research
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic

Computers and Operations Research
A Corridor Method-Based Algorithm for the Pre-marshalling Problem

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Applying the corridor method to a blocks relocation problem

OR Spectrum

A MIP-based framework and its application on a lot sizing problem with setup carryover

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a math-heuristic algorithm for the lot sizing problem with carryover. The proposed algorithm uses mathematical programming techniques in a metaheuristic fashion to iteratively solve smaller portions of the original problem. More specifically, we draw ideas from the corridor method to design and impose exogenous constraints on the original problem and, subsequently, we solve to optimality the constrained problem using a MIP solver. The algorithm iteratively builds new corridors around the best solution found within each corridor and, therefore, explores adjacent portions of the search space. In the attempt of fostering diversification while exploring the original search space, we generate a pool of incumbent solutions for the corridor method and, therefore, we reapply the corridor method using different starting points. The algorithm has been tested on instances of a standard benchmark library and the reported results show the robustness and effectiveness of the proposed scheme.