In this paper, we address to the multi-item capacitated lot-sizing problem with production time windows and setup times under the non-customer specific case. This problem is known to be NP-hard. Two cooperative approaches are proposed for solving this problem by combining mathematical programming and metaheuristics based on a decomposition scheme. The algorithms use simultaneously the mathematical programming and heuristic procedures such that the local Search algorithm and Variable Neighborhood descent algorithm. The computational experiments show the effectiveness of our proposed algorithms according to the approaches already presented in the literature.
Metaheuristics for the multi-item capacitated lot-sizing problem with time Windows and setup times
2011-05-01
1048012 byte
Conference paper
Electronic Resource
English
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Online Contents | 2005
|Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
British Library Online Contents | 2005
|A REVIEW OF MEMETIC ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
BASE | 2018
|Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows
BASE | 2021
|