Please use this identifier to cite or link to this item:
Title: General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain
Authors: Sifaleras, Angelo
Konstantaras, Ioannis
Type: Article
Subjects: FRASCATI::Natural sciences::Mathematics::Applied Mathematics
FRASCATI::Natural sciences::Computer and information sciences
Keywords: Variable Neighborhood Search
Mathematical Programming
Dynamic Lot Sizing
Issue Date: 2015
Publisher: Elsevier
Source: Electronic Notes in Discrete Mathematics
Volume: 47
First Page: 69
Last Page: 76
Abstract: The multi-product dynamic lot sizing problem with product returns and recovery is an important problem that appears in reverse logistics and is known to be NP-hard. In this paper we suggest a General Variable Neighborhood Search (GVNS) metaheuristic algorithm for solving this problem. It is the first time that such an approach is used for this problem in the literature. Furthermore, we present some encouraging computational results obtained on a new set of very large benchmark instances, compared with Gurobi optimizer.
ISSN: 15710653
Other Identifiers: 10.1016/j.endm.2014.11.010
Appears in Collections:Department of Applied Informatics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.