Skip to Main content Skip to Navigation
Journal articles

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

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.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00860165
Contributor : David Lemoine <>
Submitted on : Tuesday, September 10, 2013 - 10:56:21 AM
Last modification on : Wednesday, July 21, 2021 - 7:36:02 AM

Identifiers

Citation

Laurent Deroussi, David Lemoine. Discrete Particle Swarm Optimization for the Multi-Level Lot-Sizing Problem. International Journal of Applied Metaheuristic Computing, IGI Global Publisher, 2011, 2 (1), pp.44-57. ⟨10.4018/jamc.2011010104⟩. ⟨hal-00860165⟩

Share

Metrics

Record views

480