IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v58y2020i21p6689-6706.html
   My bibliography  Save this article

A population-based metaheuristic for the capacitated lot-sizing problem with unrelated parallel machines

Author

Listed:
  • Benjamin Vincent
  • Christophe Duhamel
  • Libo Ren
  • Nikolay Tchernev

Abstract

This paper deals with the capacitated lot-sizing problem with multiple items, setup time and unrelated parallel machines. The aim of the article is to propose an efficient population-based metaheuristic to tackle this problem. In the proposed approach, a dynamic constructive heuristic is proposed for generating a set of initial solutions. A path-relinking strategy between solutions in the current population is integrated in the diversification procedure, allowing us to explore the solution space further. The population is then intensified using a local search procedure which uses an operator based on machine capacity relaxation coupled with a repair procedure. The proposed approach is evaluated from the instances introduced in Toledo, F. M. B., and V. A. Armentano (2006.“A Lagrangian-Based Heuristic for the Capacitated Lot-Sizing Problem in Parallel Machines.” European Journal of Operational Research 175 (2): 1070–1083). The results of the experiment show that the proposed approach yields competitive results in terms of solution quality for most of the instances.

Suggested Citation

  • Benjamin Vincent & Christophe Duhamel & Libo Ren & Nikolay Tchernev, 2020. "A population-based metaheuristic for the capacitated lot-sizing problem with unrelated parallel machines," International Journal of Production Research, Taylor & Francis Journals, vol. 58(21), pages 6689-6706, November.
  • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:21:p:6689-6706
    DOI: 10.1080/00207543.2019.1685699
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1685699
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2019.1685699?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mahmood Vahdani & Zeinab Sazvar & Kannan Govindan, 2022. "An integrated economic disposal and lot-sizing problem for perishable inventories with batch production and corrupt stock-dependent holding cost," Annals of Operations Research, Springer, vol. 315(2), pages 2135-2167, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:58:y:2020:i:21:p:6689-6706. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.