Integer and combinatorial optimization
Integer and combinatorial optimization
Solving multi-item capacitated lot-sizing problems using variable redefinition
Operations Research
Capacitated lot sizing with setup times
Management Science
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case
Operations Research - Supplement
Improved algorithms for economic lot size problems
Operations Research
A Lagrange relaxation approach for very-large-scale capacitated lot-sizing
Management Science
CO89 Selected papers of the conference on Combinatorial Optimization
Polyhedra for lot-sizing with Wagner-Whitin costs
Mathematical Programming: Series A and B
A cutting plane approach to capacitated lot-sizing with start-up costs
Mathematical Programming: Series A and B
Cross-entropy and rare events for maximal cut and partition problems
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue: Rare event simulation
Facets and Reformulations for Solving Production Planning With Changeover Costs
Operations Research
IBM Journal of Research and Development
A cross entropy algorithm for the Knapsack problem with setups
Computers and Operations Research
Valid inequalities and separation for capacitated economic lot sizing
Operations Research Letters
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
Computers and Operations Research
A math-heuristic algorithm for the DNA sequencing problem
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Tuning metaheuristics: A data mining based approach for particle swarm optimization
Expert Systems with Applications: An International Journal
A math-heuristic for the multi-level capacitated lot sizing problem with carryover
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
MIP formulations and heuristics for two-level production-transportation problems
Computers and Operations Research
A MIP-based framework and its application on a lot sizing problem with setup carryover
Journal of Heuristics
A hybrid algorithm for the DNA sequencing problem
Discrete Applied Mathematics
A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.01 |
The aim of this article is to introduce a hybrid algorithm for the multi-item multi-period capacitated lot-sizing problem with setups. In this problem, demands over a finite planning horizon must be met, where several items compete for space with limited resources in each period, and a portion of these resources is used by setups. The proposed scheme considers a Lagrangean relaxation of the problem and applies a cross entropy-based metaheuristic to the uncapacitated version of the original problem. A thorough experimental plan has been designed and implemented to test the effectiveness and the robustness of the algorithm: first, drawing inspiration from the response surface methodology, we calibrate the algorithm by identifying the optimal parameters value for any given instance size. Next, we carry out experiments on large scale instances, collecting information about solution quality and computational time, and comparing these results with those offered by a global optimizer.