A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times

Publication: Research - peer-reviewJournal article – Annual report year: 2012

Standard

A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times. / Muller, Laurent Flindt; Spoorendonk, Simon; Pisinger, David.

In: European Journal of Operational Research, Vol. 218, No. 3, 2012, p. 614-623.

Publication: Research - peer-reviewJournal article – Annual report year: 2012

Harvard

APA

CBE

MLA

Vancouver

Author

Muller, Laurent Flindt; Spoorendonk, Simon; Pisinger, David / A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times.

In: European Journal of Operational Research, Vol. 218, No. 3, 2012, p. 614-623.

Publication: Research - peer-reviewJournal article – Annual report year: 2012

Bibtex

@article{7d0877b84aa74a77aff35d068b49b3fe,
title = "A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times",
keywords = "Heuristics, Large scale optimization, Production, Manufacturing",
publisher = "Elsevier BV North-Holland",
author = "Muller, {Laurent Flindt} and Simon Spoorendonk and David Pisinger",
year = "2012",
doi = "10.1016/j.ejor.2011.11.036",
volume = "218",
number = "3",
pages = "614--623",
journal = "European Journal of Operational Research",
issn = "0377-2217",

}

RIS

TY - JOUR

T1 - A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times

A1 - Muller,Laurent Flindt

A1 - Spoorendonk,Simon

A1 - Pisinger,David

AU - Muller,Laurent Flindt

AU - Spoorendonk,Simon

AU - Pisinger,David

PB - Elsevier BV North-Holland

PY - 2012

Y1 - 2012

N2 - This paper presents a hybrid of a general heuristic framework and a general purpose mixed-integer programming (MIP) solver. The framework is based on local search and an adaptive procedure which chooses between a set of large neighborhoods to be searched. A mixed integer programming solver and its built-in feasibility heuristics is used to search a neighborhood for improving solutions. The general reoptimization approach used for repairing solutions is specifically suited for combinatorial problems where it may be hard to otherwise design suitable repair neighborhoods. The hybrid heuristic framework is applied to the multi-item capacitated lot sizing problem with setup times, where experiments have been conducted on a series of instances from the literature and a newly generated extension of these. On average the presented heuristic outperforms the best heuristics from the literature, and the upper bounds found by the commercial MIP solver ILOG CPLEX using state-of-the-art MIP formulations. Furthermore, we improve the best known solutions on 60 out of 100 and improve the lower bound on all 100 instances from the literature

AB - This paper presents a hybrid of a general heuristic framework and a general purpose mixed-integer programming (MIP) solver. The framework is based on local search and an adaptive procedure which chooses between a set of large neighborhoods to be searched. A mixed integer programming solver and its built-in feasibility heuristics is used to search a neighborhood for improving solutions. The general reoptimization approach used for repairing solutions is specifically suited for combinatorial problems where it may be hard to otherwise design suitable repair neighborhoods. The hybrid heuristic framework is applied to the multi-item capacitated lot sizing problem with setup times, where experiments have been conducted on a series of instances from the literature and a newly generated extension of these. On average the presented heuristic outperforms the best heuristics from the literature, and the upper bounds found by the commercial MIP solver ILOG CPLEX using state-of-the-art MIP formulations. Furthermore, we improve the best known solutions on 60 out of 100 and improve the lower bound on all 100 instances from the literature

KW - Heuristics

KW - Large scale optimization

KW - Production

KW - Manufacturing

U2 - 10.1016/j.ejor.2011.11.036

DO - 10.1016/j.ejor.2011.11.036

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

VL - 218

SP - 614

EP - 623

ER -