Discrete Particle Swarm Optimization for the Multi-Level Lot-Sizing Problem - Archive ouverte HAL
Article Dans Une Revue International Journal of Applied Metaheuristic Computing Année : 2011

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-00860165 , version 1 (10-09-2013)

Identifiants

Citer

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

Altmetric

Partager

More