IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v2y2011i1p44-57.html
   My bibliography  Save this article

Discrete Particle Swarm Optimization for the Multi-Level Lot-Sizing Problem

Author

Listed:
  • Laurent Deroussi

    (Blaise Pascal University, Clermont-Ferrand II, France)

  • David Lemoine

    (Ecole des Mines de Nantes, France)

Abstract

This paper presents a Discrete Particle Swarm Optimization (DPSO) approach for the Multi-Level Lot-Sizing Problem (MLLP), which is an uncapacitated lot sizing problem dedicated to materials requirements planning (MRP) systems. The proposed DPSO approach is based on cost modification and uses PSO in its original form with continuous velocity equations. Each particle of the swarm is represented by a matrix of logistic costs. A sequential approach heuristic, using Wagner-Whitin algorithm, is used to determine the associated production planning. The authors demonstrate that any solution of the MLLP can be reached by particles. The sequential heuristic is a subjective function from the particles space to the set of the production plans, which meet the customer’s demand. The authors test the DPSO Scheme on benchmarks found in literature, more specifically the unique DPSO that has been developed to solve the MLLP.

Suggested Citation

  • Laurent Deroussi & David Lemoine, 2011. "Discrete Particle Swarm Optimization for the Multi-Level Lot-Sizing Problem," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 2(1), pages 44-57, January.
  • Handle: RePEc:igg:jamc00:v:2:y:2011:i:1:p:44-57
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2011010104
    Download Restriction: no
    ---><---

    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:igg:jamc00:v:2:y:2011:i:1:p:44-57. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.