In this study, the capacitated lot-sizing problem (CLSP) with back-ordering, setup carry-overs between periods, and non-identical parallel machines (CLSP-BOPM) is considered. The problem is one of the most general extensions of the well-known economic lot scheduling problems (ELSPs). Three matheuristics are designed and implemented starting from the ideas of variable neighborhood local search, local branching, and feasibility pump (FP), adapted and improved by considering the specific characteristics of the problem. Algorithms are tested on a set of medium to large problem instances. The FP algorithm outperforms all other algorithms and two different mixed-integer programming solvers as it requires a shorter computational time. To test the robustness of the algorithm, tests on three particular cases of the general problem, belonging to the family of discrete ELSPs, have been performed. Results from the proposed solver and a known specific state-of-the-art algorithm demonstrate substantial improvements.

Matheuristics for the lot sizing problem with back-ordering, setup carry-overs, and non-identical machines / Ghirardi, Marco; Amerio, Andrea. - In: COMPUTERS & INDUSTRIAL ENGINEERING. - ISSN 0360-8352. - 127:(2019), pp. 822-831. [10.1016/j.cie.2018.11.023]

Matheuristics for the lot sizing problem with back-ordering, setup carry-overs, and non-identical machines

Ghirardi, Marco;AMERIO, ANDREA
2019

Abstract

In this study, the capacitated lot-sizing problem (CLSP) with back-ordering, setup carry-overs between periods, and non-identical parallel machines (CLSP-BOPM) is considered. The problem is one of the most general extensions of the well-known economic lot scheduling problems (ELSPs). Three matheuristics are designed and implemented starting from the ideas of variable neighborhood local search, local branching, and feasibility pump (FP), adapted and improved by considering the specific characteristics of the problem. Algorithms are tested on a set of medium to large problem instances. The FP algorithm outperforms all other algorithms and two different mixed-integer programming solvers as it requires a shorter computational time. To test the robustness of the algorithm, tests on three particular cases of the general problem, belonging to the family of discrete ELSPs, have been performed. Results from the proposed solver and a known specific state-of-the-art algorithm demonstrate substantial improvements.
File in questo prodotto:
File Dimensione Formato  
Final_CAIE.pdf

embargo fino al 15/11/2021

Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: Creative commons
Dimensione 423.72 kB
Formato Adobe PDF
423.72 kB Adobe PDF Visualizza/Apri
1-s2.0-S0360835218305631-main.pdf

non disponibili

Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 1.8 MB
Formato Adobe PDF
1.8 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11583/2717647